Triple

T15990325
Position Surface form Disambiguated ID Type / Status
Subject Kazimierz Kuratowski E387805 entity
Predicate hasTheoremNamedAfter P29208 FINISHED
Object Kuratowski’s closure-complement problem
Kuratowski’s closure-complement problem is a classic result in topology that determines the maximum number of distinct sets obtainable from a subset of a topological space by repeatedly applying closure and complement operations.
E1187540 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: Kuratowski’s closure-complement problem | Statement: [Kazimierz Kuratowski, hasTheoremNamedAfter, Kuratowski’s closure-complement problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Kuratowski’s closure-complement problem
Context triple: [Kazimierz Kuratowski, hasTheoremNamedAfter, Kuratowski’s closure-complement problem]
  • A. Mazurkiewicz–Sierpiński theorem
    The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
  • B. Freudenthal compactification
    The Freudenthal compactification is a topological construction that extends a non-compact, locally compact space by adding a boundary of “ends” to obtain a compact space that more finely captures its asymptotic structure than the one-point (Alexandrov) compactification.
  • C. Tychonoff theorem for products of compact spaces
    The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
  • D. Mazurkiewicz–Sierpiński paradox
    The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
  • E. Alexandrov–Hausdorff theorem
    The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
  • 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: Kuratowski’s closure-complement problem
Triple: [Kazimierz Kuratowski, hasTheoremNamedAfter, Kuratowski’s closure-complement problem]
Generated description
Kuratowski’s closure-complement problem is a classic result in topology that determines the maximum number of distinct sets obtainable from a subset of a topological space by repeatedly applying closure and complement operations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Kuratowski’s closure-complement problem
Target entity description: Kuratowski’s closure-complement problem is a classic result in topology that determines the maximum number of distinct sets obtainable from a subset of a topological space by repeatedly applying closure and complement operations.
  • A. Mazurkiewicz–Sierpiński theorem
    The Mazurkiewicz–Sierpiński theorem is a result in topology and measure theory that characterizes certain properties of measurable sets and mappings, particularly concerning continuous images of sets in Euclidean spaces.
  • B. Freudenthal compactification
    The Freudenthal compactification is a topological construction that extends a non-compact, locally compact space by adding a boundary of “ends” to obtain a compact space that more finely captures its asymptotic structure than the one-point (Alexandrov) compactification.
  • C. Tychonoff theorem for products of compact spaces
    The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
  • D. Mazurkiewicz–Sierpiński paradox
    The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
  • E. Alexandrov–Hausdorff theorem
    The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
  • 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_69d86daa562c81908aacc179c0fe8fb5 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e157835cac81909e979f9be281f328 completed April 16, 2026, 9:41 p.m.
NED1 Entity disambiguation (via context triple) batch_69ffc3d2369081909efa2d4addf0cf2d completed May 9, 2026, 11:31 p.m.
NEDg Description generation batch_69ffc45e6ff48190bb7b82adb4161ad0 completed May 9, 2026, 11:33 p.m.
NED2 Entity disambiguation (via description) batch_69ffc4cea4108190927b107fc24df597 completed May 9, 2026, 11:35 p.m.
Created at: April 10, 2026, 4:54 a.m.