Triple

T20627096
Position Surface form Disambiguated ID Type / Status
Subject Helly’s theorem E506847 entity
Predicate hasVariant P455 FINISHED
Object Doignon’s theorem 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: Doignon’s theorem | Statement: [Helly’s theorem, hasVariant, Doignon’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Doignon’s theorem
Context triple: [Helly’s theorem, hasVariant, Doignon’s theorem]
  • A. Helly’s theorem
    Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
  • B. Radon’s theorem
    Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
  • C. Low’s theorem
    Low’s theorem is a result in quantum electrodynamics that constrains the behavior of scattering amplitudes involving the emission of low-energy (soft) photons.
  • D. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • E. 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.
  • 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: Doignon’s theorem
Target entity description: Doignon’s theorem is a discrete analogue of Helly’s theorem that characterizes when a family of convex sets in Euclidean space has an integer point in common based on the intersections of small subfamilies.
  • A. Helly’s theorem
    Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
  • B. Radon’s theorem
    Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
  • C. Low’s theorem
    Low’s theorem is a result in quantum electrodynamics that constrains the behavior of scattering amplitudes involving the emission of low-energy (soft) photons.
  • D. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • E. 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.
  • 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_69e0b4bd4a0081908d4e97a590a33fb2 completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6abe576c081909231dc0d7304b9a9 completed April 20, 2026, 10:42 p.m.
Created at: April 16, 2026, 11:42 a.m.