Triple
T16824721
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karol Borsuk |
E408987
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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.
|
E1235032
|
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’s conjecture in geometry | Statement: [Karol Borsuk, knownFor, Borsuk’s conjecture in geometry]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borsuk’s conjecture in geometry Context triple: [Karol Borsuk, knownFor, Borsuk’s conjecture in geometry]
-
A.
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.
-
B.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
C.
Mazur’s theorem on convex sets
Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
-
D.
Minkowski’s theorem on convex sets
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
-
E.
Hilbert's third problem
Hilbert's third problem is one of David Hilbert’s famous list of 23 problems, asking whether every polyhedron of a given volume is equidecomposable with any other of the same volume, a question that led to the development of the Dehn invariant and the discovery of counterexamples.
- 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’s conjecture in geometry Triple: [Karol Borsuk, knownFor, Borsuk’s conjecture in geometry]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Borsuk’s conjecture in geometry Target entity description: 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.
-
A.
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.
-
B.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
C.
Mazur’s theorem on convex sets
Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
-
D.
Minkowski’s theorem on convex sets
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
-
E.
Hilbert's third problem
Hilbert's third problem is one of David Hilbert’s famous list of 23 problems, asking whether every polyhedron of a given volume is equidecomposable with any other of the same volume, a question that led to the development of the Dehn invariant and the discovery of counterexamples.
- 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_6a00b29c170c81908fcc88c31e266ffb |
completed | May 10, 2026, 4:30 p.m. |
| NEDg | Description generation | batch_6a00b3cb7a2c8190a90ed07bc06dfc1b |
completed | May 10, 2026, 4:35 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a00b466ecd08190b7b5ee54476631ab |
completed | May 10, 2026, 4:37 p.m. |
Created at: April 10, 2026, 5:23 a.m.