Triple

T718426
Position Surface form Disambiguated ID Type / Status
Subject Stanislaw Ulam E14360 entity
Predicate notableWork P4 FINISHED
Object Ulam problem in set theory
The Ulam problem in set theory is a well-known question posed by Stanislaw Ulam concerning the structure and properties of measurable sets and functions, particularly in relation to homomorphisms and measure-theoretic regularity.
E85414 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: Ulam problem in set theory | Statement: [Stanislaw Ulam, notableWork, Ulam problem in set theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Ulam problem in set theory
Context triple: [Stanislaw Ulam, notableWork, Ulam problem in set theory]
  • A. 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.
  • B. Cantor’s theorem
    Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
  • C. 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.
  • D. Surreal numbers
    Surreal numbers are a class of numbers introduced by John H. Conway that form an extensive ordered field encompassing the real numbers, infinite quantities, and infinitesimals within a unified framework.
  • E. Remarks on the Foundations of Mathematics
    Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
  • 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: Ulam problem in set theory
Triple: [Stanislaw Ulam, notableWork, Ulam problem in set theory]
Generated description
The Ulam problem in set theory is a well-known question posed by Stanislaw Ulam concerning the structure and properties of measurable sets and functions, particularly in relation to homomorphisms and measure-theoretic regularity.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Ulam problem in set theory
Target entity description: The Ulam problem in set theory is a well-known question posed by Stanislaw Ulam concerning the structure and properties of measurable sets and functions, particularly in relation to homomorphisms and measure-theoretic regularity.
  • A. 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.
  • B. Cantor’s theorem
    Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
  • C. 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.
  • D. Surreal numbers
    Surreal numbers are a class of numbers introduced by John H. Conway that form an extensive ordered field encompassing the real numbers, infinite quantities, and infinitesimals within a unified framework.
  • E. Remarks on the Foundations of Mathematics
    Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
  • 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_69a4934a36e081909e7abef98b898a4e completed March 1, 2026, 7:28 p.m.
NER Named-entity recognition batch_69a4a58d4c3c8190ad4527d14bca5e6e completed March 1, 2026, 8:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69a5dcb77bc481909d79542001fafbd2 completed March 2, 2026, 6:53 p.m.
NEDg Description generation batch_69a5de57bbec81908a5d1202299194f4 completed March 2, 2026, 7 p.m.
NED2 Entity disambiguation (via description) batch_69a60952c6388190a23a178d695eec6e completed March 2, 2026, 10:04 p.m.
Created at: March 1, 2026, 7:37 p.m.