Triple

T739697
Position Surface form Disambiguated ID Type / Status
Subject von Neumann paradox in set theory E15214 entity
Predicate isAbstractVersionOf P19458 FINISHED
Object Banach–Tarski-type decompositions E15214 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: Banach–Tarski-type decompositions | Statement: [von Neumann paradox in set theory, isAbstractVersionOf, Banach–Tarski-type decompositions]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Banach–Tarski-type decompositions
Context triple: [von Neumann paradox in set theory, isAbstractVersionOf, Banach–Tarski-type decompositions]
  • A. 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.
  • B. Israel–Carter–Robinson uniqueness theorems
    The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
  • C. von Neumann paradox in set theory chosen
    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. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • E. Euler’s polyhedron formula
    Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
  • 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: isAbstractVersionOf
Context triple: [von Neumann paradox in set theory, isAbstractVersionOf, Banach–Tarski-type decompositions]
  • A. isVersionOf
    Indicates that one entity is a particular version, edition, or variant derived from another entity.
  • 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. isBasedOn
    Indicates that one entity is derived from, inspired by, or developed using the content, structure, or principles of another entity.
  • D. wasSupersededBy
    Indicates that one entity has been replaced or made obsolete by another entity that takes over its role or function.
  • E. inheritedFrom
    Indicates that one entity has received or derived something (such as traits, rights, or property) from another entity, typically a predecessor or ancestor.
  • 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_69a49358aa308190adbc9b5a0a2adcf9 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_69a65e3df8e48190905f89acbf7f3667 completed March 3, 2026, 4:06 a.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.