Triple

T17752600
Position Surface form Disambiguated ID Type / Status
Subject Gleason’s theorem E443148 entity
Predicate strengthenedBy P3261 FINISHED
Object Busch’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: Busch’s theorem | Statement: [Gleason’s theorem, strengthenedBy, Busch’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Busch’s theorem
Context triple: [Gleason’s theorem, strengthenedBy, Busch’s theorem]
  • A. Bose–Nair theorem
    The Bose–Nair theorem is a result in combinatorial design theory that provides conditions for the existence and construction of certain balanced incomplete block designs, contributing to the foundations of modern combinatorics and coding theory.
  • B. Kesten’s theorem
    Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
  • C. Busemann–Feller theorem
    The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
  • D. König's theorem
    König's theorem is a fundamental result in graph theory that relates the size of a maximum matching to the size of a minimum vertex cover in bipartite graphs.
  • E. Bernstein theorem
    Bernstein theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
  • 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: Busch’s theorem
Target entity description: Busch’s theorem is a result in quantum foundations that generalizes and strengthens Gleason’s theorem by extending its characterization of quantum probability measures to more general measurement frameworks such as POVMs.
  • A. Bose–Nair theorem
    The Bose–Nair theorem is a result in combinatorial design theory that provides conditions for the existence and construction of certain balanced incomplete block designs, contributing to the foundations of modern combinatorics and coding theory.
  • B. Kesten’s theorem
    Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
  • C. Busemann–Feller theorem
    The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
  • D. König's theorem
    König's theorem is a fundamental result in graph theory that relates the size of a maximum matching to the size of a minimum vertex cover in bipartite graphs.
  • E. Bernstein theorem
    Bernstein theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
  • 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_69d8b9edf16c8190a59ebd245d378f4f completed April 10, 2026, 8:50 a.m.
NER Named-entity recognition batch_69e4841c0540819093a32d759775c61f completed April 19, 2026, 7:28 a.m.
Created at: April 10, 2026, 10:10 a.m.