Triple

T17872424
Position Surface form Disambiguated ID Type / Status
Subject Hugh Woodin E446866 entity
Predicate notableConcept P201 FINISHED
Object Woodin cardinal NE NERFINISHED

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: Woodin cardinal | Statement: [Hugh Woodin, notableConcept, Woodin cardinal]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Woodin cardinal
Context triple: [Hugh Woodin, notableConcept, Woodin cardinal]
  • A. Feferman–Schütte ordinal
    The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
  • B. Bachmann–Howard ordinal
    The Bachmann–Howard ordinal is a large countable ordinal that serves as a key benchmark in proof theory, marking the strength of powerful formal systems extending predicative arithmetic.
  • C. Vaught conjecture
    The Vaught conjecture is an open problem in mathematical logic and model theory that predicts a precise restriction on the possible numbers of countable models of a complete first-order theory.
  • D. Kripke–Platek set theory
    Kripke–Platek set theory is a weaker, predicative subsystem of Zermelo–Fraenkel set theory focused on sets that are explicitly constructible and often used in the study of admissible sets and recursion theory.
  • E. continuum hypothesis
    The continuum hypothesis is a central conjecture in set theory proposing a specific relationship between the sizes of the set of real numbers and the set of natural numbers, famously shown to be independent of the standard axioms of mathematics.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Woodin cardinal
Target entity description: A Woodin cardinal is a large cardinal in set theory with strong consistency and determinacy properties, central to modern research on the foundations of mathematics and descriptive set theory.
  • A. Feferman–Schütte ordinal
    The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
  • B. Bachmann–Howard ordinal
    The Bachmann–Howard ordinal is a large countable ordinal that serves as a key benchmark in proof theory, marking the strength of powerful formal systems extending predicative arithmetic.
  • C. Vaught conjecture
    The Vaught conjecture is an open problem in mathematical logic and model theory that predicts a precise restriction on the possible numbers of countable models of a complete first-order theory.
  • D. Kripke–Platek set theory
    Kripke–Platek set theory is a weaker, predicative subsystem of Zermelo–Fraenkel set theory focused on sets that are explicitly constructible and often used in the study of admissible sets and recursion theory.
  • E. continuum hypothesis
    The continuum hypothesis is a central conjecture in set theory proposing a specific relationship between the sizes of the set of real numbers and the set of natural numbers, famously shown to be independent of the standard axioms of mathematics.
  • F. None of above. chosen

Provenance (2 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_69d8b9f4c22c819093c2680434472894 completed April 10, 2026, 8:51 a.m.
NER Named-entity recognition batch_69e49aa3cd248190a13a8209ba44fd3b completed April 19, 2026, 9:04 a.m.
Created at: April 10, 2026, 10:18 a.m.