Triple
T16824720
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karol Borsuk |
E408987
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Borsuk–Ulam theorem
The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to Euclidean n-space maps some pair of antipodal points to the same point.
|
E1237377
|
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: Borsuk–Ulam theorem | Statement: [Karol Borsuk, knownFor, Borsuk–Ulam theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borsuk–Ulam theorem Context triple: [Karol Borsuk, knownFor, Borsuk–Ulam theorem]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
Borsuk’s conjecture in geometry
Borsuk’s conjecture in geometry is a famous (now disproven in higher dimensions) problem in metric geometry that proposed any bounded set in n-dimensional Euclidean space can be partitioned into n+1 subsets of smaller diameter.
- 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: Borsuk–Ulam theorem Triple: [Karol Borsuk, knownFor, Borsuk–Ulam theorem]
Generated description
The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to Euclidean n-space maps some pair of antipodal points to the same point.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Borsuk–Ulam theorem Target entity description: The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to Euclidean n-space maps some pair of antipodal points to the same point.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
Borsuk’s conjecture in geometry
Borsuk’s conjecture in geometry is a famous (now disproven in higher dimensions) problem in metric geometry that proposed any bounded set in n-dimensional Euclidean space can be partitioned into n+1 subsets of smaller diameter.
- 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_69d88394566c8190b3dcbdc72935f7fa |
completed | April 10, 2026, 4:59 a.m. |
| NER | Named-entity recognition | batch_69e3b310ffec81908087e5aaacc4a7c2 |
completed | April 18, 2026, 4:36 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a00bb11f8708190ae762a28710e4246 |
completed | May 10, 2026, 5:06 p.m. |
| NEDg | Description generation | batch_6a00bc4cdf8481909ad45b9c66234c9b |
completed | May 10, 2026, 5:11 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a00bcfcb434819092b85ce1debb9be8 |
completed | May 10, 2026, 5:14 p.m. |
Created at: April 10, 2026, 5:23 a.m.