Triple

T5425469
Position Surface form Disambiguated ID Type / Status
Subject Sperner's lemma E121351 entity
Predicate hasGeneralization P2372 FINISHED
Object polytopal Sperner lemma
The polytopal Sperner lemma is a generalization of Sperner’s lemma that guarantees the existence of fully labeled cells in labeled triangulations (or subdivisions) of higher-dimensional polytopes.
E121351 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: polytopal Sperner lemma | Statement: [Sperner's lemma, hasGeneralization, polytopal Sperner lemma]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: polytopal Sperner lemma
Context triple: [Sperner's lemma, hasGeneralization, polytopal Sperner lemma]
  • 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. 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.
  • C. Knaster–Kuratowski–Mazurkiewicz lemma
    The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
  • D. Polytopes
    Polytopes are large-scale multimedia architectural and musical installations created by Iannis Xenakis that combine sound, light, and spatial design into immersive, mathematically structured environments.
  • E. Sperner family
    A Sperner family is a collection of subsets of a finite set in which no subset is contained within another, central in extremal set theory and combinatorics.
  • 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: polytopal Sperner lemma
Triple: [Sperner's lemma, hasGeneralization, polytopal Sperner lemma]
Generated description
The polytopal Sperner lemma is a generalization of Sperner’s lemma that guarantees the existence of fully labeled cells in labeled triangulations (or subdivisions) of higher-dimensional polytopes.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: polytopal Sperner lemma
Target entity description: The polytopal Sperner lemma is a generalization of Sperner’s lemma that guarantees the existence of fully labeled cells in labeled triangulations (or subdivisions) of higher-dimensional polytopes.
  • A. Sperner's lemma chosen
    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. 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.
  • C. Knaster–Kuratowski–Mazurkiewicz lemma
    The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
  • D. Polytopes
    Polytopes are large-scale multimedia architectural and musical installations created by Iannis Xenakis that combine sound, light, and spatial design into immersive, mathematically structured environments.
  • E. Sperner family
    A Sperner family is a collection of subsets of a finite set in which no subset is contained within another, central in extremal set theory and combinatorics.
  • F. None of above.

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_69bd463b58d88190b258261573de9e91 completed March 20, 2026, 1:06 p.m.
NER Named-entity recognition batch_69bd881598448190a9bb456dee36004b completed March 20, 2026, 5:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69bf4125e490819088f70090cf8d81fa completed March 22, 2026, 1:08 a.m.
NEDg Description generation batch_69bf453d171081909a0d2b2ac7db13a4 completed March 22, 2026, 1:26 a.m.
NED2 Entity disambiguation (via description) batch_69bf45c75e2c8190a1508e8e90253f88 completed March 22, 2026, 1:28 a.m.
Created at: March 20, 2026, 2:06 p.m.