Triple
T16571012
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bronisław Knaster |
E402583
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Knaster continuum
The Knaster continuum is a classic example in topology of a hereditarily indecomposable continuum, illustrating subtle and counterintuitive properties of connected compact metric spaces.
|
E1221298
|
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 continuum | Statement: [Bronisław Knaster, notableWork, Knaster continuum]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Knaster continuum Context triple: [Bronisław Knaster, notableWork, Knaster continuum]
-
A.
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.
-
B.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Sierpiński set
The Sierpiński set is a subset of the real numbers with the property that it intersects every uncountable closed subset of the reals in only countably many points, illustrating extreme pathological behavior in set theory and real analysis.
-
D.
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.
-
E.
Hausdorff paradox
The Hausdorff paradox is a result in set-theoretic geometry showing that, using the axiom of choice, a sphere can be decomposed into finitely many disjoint pieces that can be reassembled into a set not congruent to the original, illustrating the existence of non-measurable sets and paving the way for the Banach–Tarski paradox.
- 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 continuum Triple: [Bronisław Knaster, notableWork, Knaster continuum]
Generated description
The Knaster continuum is a classic example in topology of a hereditarily indecomposable continuum, illustrating subtle and counterintuitive properties of connected compact metric spaces.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Knaster continuum Target entity description: The Knaster continuum is a classic example in topology of a hereditarily indecomposable continuum, illustrating subtle and counterintuitive properties of connected compact metric spaces.
-
A.
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.
-
B.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Sierpiński set
The Sierpiński set is a subset of the real numbers with the property that it intersects every uncountable closed subset of the reals in only countably many points, illustrating extreme pathological behavior in set theory and real analysis.
-
D.
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.
-
E.
Hausdorff paradox
The Hausdorff paradox is a result in set-theoretic geometry showing that, using the axiom of choice, a sphere can be decomposed into finitely many disjoint pieces that can be reassembled into a set not congruent to the original, illustrating the existence of non-measurable sets and paving the way for the Banach–Tarski paradox.
- 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_6a006ee8812c81908ef74636bf39d44a |
completed | May 10, 2026, 11:41 a.m. |
| NEDg | Description generation | batch_6a0070024cb4819092ee0ce1320f0905 |
completed | May 10, 2026, 11:46 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a00707959a081909fc04947624abbe5 |
completed | May 10, 2026, 11:48 a.m. |
Created at: April 10, 2026, 5:16 a.m.