Triple

T16249808
Position Surface form Disambiguated ID Type / Status
Subject Steinhaus chessboard theorem E394470 entity
Predicate relatedTo P37 FINISHED
Object Borsuk–Ulam theorem E83404 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: Borsuk–Ulam theorem | Statement: [Steinhaus chessboard theorem, relatedTo, Borsuk–Ulam theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Borsuk–Ulam theorem
Context triple: [Steinhaus chessboard theorem, relatedTo, Borsuk–Ulam theorem]
  • A. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • B. 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.
  • 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. Tucker’s lemma chosen
    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.
  • E. Banach–Tarski paradox
    The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
  • 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_69d87f2171208190951025e526947816 completed April 10, 2026, 4:40 a.m.
NER Named-entity recognition batch_69e2459606f88190a53905186f7f73be completed April 17, 2026, 2:37 p.m.
NED1 Entity disambiguation (via context triple) batch_6a000ee568a48190835ce76f84461044 completed May 10, 2026, 4:51 a.m.
Created at: April 10, 2026, 5:04 a.m.