Triple
T17341219
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Banach–Mazur theorem |
E421069
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Stone representation theorems |
E924199
|
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: Stone representation theorems | Statement: [Banach–Mazur theorem, relatedTo, Stone representation theorems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stone representation theorems Context triple: [Banach–Mazur theorem, relatedTo, Stone representation theorems]
-
A.
Stone representation theorem
chosen
The Stone representation theorem is a fundamental result in mathematical logic and topology that represents every Boolean algebra as an algebra of clopen sets in a totally disconnected compact Hausdorff (Stone) space.
-
B.
Birkhoff’s representation theorem for finite distributive lattices
Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
-
C.
Khinchin's representation theorem
Khinchin's representation theorem is a result in probability theory that characterizes stationary stochastic processes by representing them in terms of simpler, more fundamental random components.
-
D.
Relation Algebras
Relation Algebras is a mathematical monograph that develops the theory of relation algebras as an abstract algebraic framework for studying relations and their logical properties.
-
E.
Cardinal Invariants on Boolean Algebras
"Cardinal Invariants on Boolean Algebras" is a research monograph by set theorist J. Donald Monk that systematically studies cardinal characteristics associated with Boolean algebras and their connections to set theory and logic.
- 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_69d889d3adc881909319f1edb8d2a956 |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e43a15f6488190ad7d489e7391ab12 |
completed | April 19, 2026, 2:12 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a018c588a7081909ab108cb4adfedfe |
completed | May 11, 2026, 7:59 a.m. |
Created at: April 10, 2026, 5:44 a.m.