Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Paley graph of order 7 | Statement: [Fano plane, hasPointGraph, Paley graph of order 7]

Target entity: Paley graph of order 7
Context triple: [Fano plane, hasPointGraph, Paley graph of order 7]

• A. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• B. Fano plane
  The Fano plane is the smallest finite projective plane, consisting of seven points and seven lines with rich symmetrical and combinatorial properties.
• C. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• D. Szekeres configuration
  The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
• E. Szekeres snark
  The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Paley graph of order 7
Triple: [Fano plane, hasPointGraph, Paley graph of order 7]

The Paley graph of order 7 is a 7-vertex self-complementary, strongly regular graph that can be realized as the point graph of the Fano plane, with edges joining pairs of points whose difference is a quadratic residue modulo 7.

Target entity: Paley graph of order 7
Target entity description: The Paley graph of order 7 is a 7-vertex self-complementary, strongly regular graph that can be realized as the point graph of the Fano plane, with edges joining pairs of points whose difference is a quadratic residue modulo 7.

• A. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• B. Fano plane chosen
  The Fano plane is the smallest finite projective plane, consisting of seven points and seven lines with rich symmetrical and combinatorial properties.
• C. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• D. Szekeres configuration
  The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
• E. Szekeres snark
  The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
• F. None of above.

Target predicate: hasPointGraph
Context triple: [Fano plane, hasPointGraph, Paley graph of order 7]

• A. hasNumberOfPoints
  Indicates that an entity is associated with a specific count of points it possesses or comprises.
• B. hasKPoint
  Indicates that an entity possesses or is associated with a specific K-point, typically a designated point in reciprocal or parameter space.
• C. hasChart
  Indicates that one entity is associated with, represented by, or documented through a chart belonging to or describing it.
• D. hasCharting
  Indicates that one entity provides or supports charting or graphical data visualization capabilities for another entity.
• E. hasHelpPoint
  Indicates that one entity provides or contains a designated help or assistance point for another entity.
• F. None of above. chosen