Triple

T16249774
Position Surface form Disambiguated ID Type / Status
Subject Steinhaus theorem E394469 entity
Predicate hasGeneralization P2372 FINISHED
Object Steinhaus–Weil theorem E394469 NE FINISHED

How this triple was built (2 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: Steinhaus–Weil theorem | Statement: [Steinhaus theorem, hasGeneralization, Steinhaus–Weil theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Steinhaus–Weil theorem
Context triple: [Steinhaus theorem, hasGeneralization, Steinhaus–Weil theorem]
  • A. Steinhaus theorem chosen
    The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
  • B. Szemerédi's theorem
    Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
  • C. Hales–Jewett theorem
    The Hales–Jewett theorem is a fundamental result in Ramsey theory that guarantees the existence of large monochromatic combinatorial lines in high-dimensional grids under any finite coloring.
  • D. Jarník–Besicovitch theorem
    The Jarník–Besicovitch theorem is a fundamental result in metric number theory that determines the Hausdorff dimension of sets of real numbers that are very well approximable by rationals.
  • E. Minkowski’s theorem on convex sets
    Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69d87f2171208190951025e526947816 completed April 10, 2026, 4:40 a.m.
NER Named-entity recognition batch_69e2459606f88190a53905186f7f73be completed April 17, 2026, 2:37 p.m.
NED1 Entity disambiguation (via context triple) batch_6a000ee568a48190835ce76f84461044 completed May 10, 2026, 4:51 a.m.
Created at: April 10, 2026, 5:04 a.m.