Triple

T16571018
Position Surface form Disambiguated ID Type / Status
Subject Bronisław Knaster E402583 entity
Predicate notableWork P4 FINISHED
Object Knaster–Ulam theorem
The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
E1222807 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: Knaster–Ulam theorem | Statement: [Bronisław Knaster, notableWork, Knaster–Ulam theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Knaster–Ulam theorem
Context triple: [Bronisław Knaster, notableWork, Knaster–Ulam theorem]
  • A. 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.
  • B. Mazurkiewicz–Sierpiński theorem
    The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
  • C. 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.
  • D. 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.
  • E. Knaster–Reichbach covering
    The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
  • 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: Knaster–Ulam theorem
Triple: [Bronisław Knaster, notableWork, Knaster–Ulam theorem]
Generated description
The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Knaster–Ulam theorem
Target entity description: The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
  • A. 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.
  • B. Mazurkiewicz–Sierpiński theorem
    The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
  • C. 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.
  • D. 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.
  • E. Knaster–Reichbach covering
    The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
  • 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_69d8838648088190acf97ef11fc3f61b completed April 10, 2026, 4:58 a.m.
NER Named-entity recognition batch_69e35958d49c8190b995188240fb355b completed April 18, 2026, 10:13 a.m.
NED1 Entity disambiguation (via context triple) batch_6a00759424348190889dacbbc7435238 completed May 10, 2026, 12:09 p.m.
NEDg Description generation batch_6a00783334a08190ae76fd7e114a9dd6 completed May 10, 2026, 12:21 p.m.
NED2 Entity disambiguation (via description) batch_6a0078562e788190b80a4ee27788ff69 completed May 10, 2026, 12:21 p.m.
Created at: April 10, 2026, 5:16 a.m.