Triple

T2169629
Position Surface form Disambiguated ID Type / Status
Subject N. G. de Bruijn E46991 entity
Predicate notableWork P4 FINISHED
Object de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
E239169 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: de Bruijn–Erdős theorem | Statement: [N. G. de Bruijn, notableWork, de Bruijn–Erdős theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: de Bruijn–Erdős theorem
Context triple: [N. G. de Bruijn, notableWork, de Bruijn–Erdős theorem]
  • A. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • B. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. Alexandrov–Hausdorff theorem
    The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
  • E. Deuring–Heilbronn phenomenon
    The Deuring–Heilbronn phenomenon is a result in analytic number theory describing how the presence of an exceptional (Siegel) zero of a Dirichlet L-function forces other zeros away from the real axis, sharpening zero-free regions and affecting the distribution of primes in arithmetic progressions.
  • 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: de Bruijn–Erdős theorem
Triple: [N. G. de Bruijn, notableWork, de Bruijn–Erdős theorem]
Generated description
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: de Bruijn–Erdős theorem
Target entity description: The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
  • A. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • B. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • C. Tucker’s lemma
    Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
  • D. Alexandrov–Hausdorff theorem
    The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
  • E. Deuring–Heilbronn phenomenon
    The Deuring–Heilbronn phenomenon is a result in analytic number theory describing how the presence of an exceptional (Siegel) zero of a Dirichlet L-function forces other zeros away from the real axis, sharpening zero-free regions and affecting the distribution of primes in arithmetic progressions.
  • 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_69a88a184cbc8190877791f6552c2484 completed March 4, 2026, 7:38 p.m.
NER Named-entity recognition batch_69abbeaeb58881908ad34f7b253bac2a completed March 7, 2026, 5:59 a.m.
NED1 Entity disambiguation (via context triple) batch_69ae58f511a08190880fbde8900d59df completed March 9, 2026, 5:21 a.m.
NEDg Description generation batch_69ae59a9b010819081491e988184b386 completed March 9, 2026, 5:24 a.m.
NED2 Entity disambiguation (via description) batch_69ae5a12f11c81908cc345905f0a485e completed March 9, 2026, 5:26 a.m.
Created at: March 4, 2026, 7:45 p.m.