Triple
T738052
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | von Neumann universe |
E14977
|
entity |
| Predicate | isTransitiveClass |
P19437
|
FINISHED |
| Object | von Neumann universe |
E14977
|
NE FINISHED |
How this triple was built (3 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: von Neumann universe | Statement: [von Neumann universe, isTransitiveClass, von Neumann universe]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: von Neumann universe Context triple: [von Neumann universe, isTransitiveClass, von Neumann universe]
-
A.
von Neumann universe
chosen
The von Neumann universe is a cumulative, well-founded hierarchy of sets used as a standard model of the set-theoretic universe in axiomatic set theory.
-
B.
von Neumann–Bernays–Gödel set theory
Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
-
C.
von Neumann paradox in set theory
The von Neumann paradox in set theory is a foundational result showing that, under certain group-theoretic conditions, a set can be decomposed and reassembled into paradoxical subsets of equal “size,” illustrating the counterintuitive consequences of the axiom of choice.
-
D.
Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
-
E.
Zermelo set theory
Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: isTransitiveClass Context triple: [von Neumann universe, isTransitiveClass, von Neumann universe]
-
A.
subclassOf
Indicates that one class is a more specific type of another class, inheriting its characteristics as a subset of it.
-
B.
isBaseFor
Indicates that one entity serves as the foundational support, starting point, or underlying basis upon which another entity is built, developed, or depends.
-
C.
isComposite
Indicates that an entity is made up of multiple components or parts combined into a single whole.
-
D.
isGradeOf
Indicates that one entity is the grade or evaluation assigned to another entity, such as a student, assignment, or performance.
-
E.
hasHigherClass
Indicates that one entity belongs to a higher rank, level, or category in a hierarchy than another entity.
- 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_69a4934d9930819099eed80096b0597d |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a4a64adf2c81908e48090be35dd9d9 |
completed | March 1, 2026, 8:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a76d742ef08190bb9405a1cde84eb1 |
completed | March 3, 2026, 11:23 p.m. |
| PD | Predicate disambiguation | batch_69a4a4fc734c81908fbd36386d5746d6 |
completed | March 1, 2026, 8:43 p.m. |
| PDg | Predicate description generation | batch_69a4a64957ec81909fe2e2dbffd80ed3 |
completed | March 1, 2026, 8:49 p.m. |
Created at: March 1, 2026, 7:37 p.m.