Triple

T11242718
Position Surface form Disambiguated ID Type / Status
Subject Conway's 99-graph problem E266110 entity
Predicate relatedTo P37 FINISHED
Object Ramsey theory E381617 NE FINISHED

How this triple was built (2 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: Ramsey theory | Statement: [Conway's 99-graph problem, relatedTo, Ramsey theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Ramsey theory
Context triple: [Conway's 99-graph problem, relatedTo, Ramsey theory]
  • A. Ramsey theory chosen
    Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
  • B. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • C. Erdős–Ko–Rado theorem
    The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
  • D. Erdős–Stone theorem
    The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
  • E. Pósa’s theorem in graph theory
    Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69d6aac656d48190b275efaa7d6074ee completed April 8, 2026, 7:21 p.m.
NER Named-entity recognition batch_69d7e91b0b808190bc38008bb344d180 completed April 9, 2026, 5:59 p.m.
NED1 Entity disambiguation (via context triple) batch_69e4ad849f70819098a7056fbc4831ff completed April 19, 2026, 10:25 a.m.
Created at: April 8, 2026, 9:30 p.m.