Triple

T2426178
Position Surface form Disambiguated ID Type / Status
Subject John H. Conway E53530 entity
Predicate hasConcept P531 FINISHED
Object 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.
E266110 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
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).
Input
Phrase: Conway's 99-graph problem | Statement: [John H. Conway, hasConcept, Conway's 99-graph problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Conway's 99-graph problem
Context triple: [John H. Conway, hasConcept, Conway's 99-graph problem]
  • A. Conway’s Game of Sprouts
    Conway’s Game of Sprouts is a pencil-and-paper topological game in which players alternately connect dots with lines under simple rules, leading to rich combinatorial and mathematical analysis.
  • B. Euler’s polyhedron formula
    Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
  • C. Conway–Norton collaboration
    The Conway–Norton collaboration was a joint mathematical effort, led by John Conway and Simon Norton, that played a key role in developing the theory of monstrous moonshine and the construction of the Monster group.
  • D. A Combinatorial Problem
    "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
  • E. Hilbert’s twenty-third problem
    Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
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]"
Input
Entity: Conway's 99-graph problem
Triple: [John H. Conway, hasConcept, Conway's 99-graph problem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Conway's 99-graph problem
Target entity description: 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.
  • A. Conway’s Game of Sprouts
    Conway’s Game of Sprouts is a pencil-and-paper topological game in which players alternately connect dots with lines under simple rules, leading to rich combinatorial and mathematical analysis.
  • B. Euler’s polyhedron formula
    Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
  • C. Conway–Norton collaboration
    The Conway–Norton collaboration was a joint mathematical effort, led by John Conway and Simon Norton, that played a key role in developing the theory of monstrous moonshine and the construction of the Monster group.
  • D. A Combinatorial Problem
    "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
  • E. Hilbert’s twenty-third problem
    Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69ab495c44d48190b7235b23719bc3f6 completed March 6, 2026, 9:38 p.m.
NER Named-entity recognition batch_69abc99b95548190b77d36de9adfe3bb completed March 7, 2026, 6:45 a.m.
NED1 Entity disambiguation (via context triple) batch_69aebf637be4819096874a24e87f84ab completed March 9, 2026, 12:38 p.m.
NEDg Description generation batch_69aec7698e9881909c75137cb5cf2a0c completed March 9, 2026, 1:13 p.m.
NED2 Entity disambiguation (via description) batch_69aec87df0648190b8099b4eaa3d9b22 completed March 9, 2026, 1:17 p.m.
Created at: March 6, 2026, 9:42 p.m.