Triple

T9838850
Position Surface form Disambiguated ID Type / Status
Subject de Bruijn–Erdős theorem E239169 entity
Predicate usedIn P98 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: [de Bruijn–Erdős theorem, usedIn, Ramsey theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Ramsey theory
Context triple: [de Bruijn–Erdős theorem, usedIn, 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. Erdős on Graphs: His Legacy
    Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
  • 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_69ca84e314108190978324a4bdb959f8 completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb34921b881909836ba0f5b42a27b completed April 2, 2026, 12:07 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1d5d145ac8190ad10a4328216ef54 completed April 5, 2026, 3:24 a.m.
Created at: March 30, 2026, 8:33 p.m.