Triple

T15741739
Position Surface form Disambiguated ID Type / Status
Subject Ramsey theory E381617 entity
Predicate basedOn P98 FINISHED
Object pigeonhole principle E466246 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: pigeonhole principle | Statement: [Ramsey theory, basedOn, pigeonhole principle]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: pigeonhole principle
Context triple: [Ramsey theory, basedOn, pigeonhole principle]
  • A. Dirichlet principle chosen
    The Dirichlet principle is a foundational concept in potential theory and the calculus of variations that asserts certain boundary value problems can be solved by finding a function minimizing an associated energy integral.
  • B. Erdős–Szekeres theorem
    The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
  • C. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • D. Bertrand's postulate
    Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.
  • E. Erdős–Ko–Rado theorem
    The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
  • 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_69d86d9cdb648190bf3171be0bd7d872 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e04fd97d6c8190b2fa6ca422bfe512 completed April 16, 2026, 2:56 a.m.
NED1 Entity disambiguation (via context triple) batch_69ff83056aa0819098b757ed125e61fe completed May 9, 2026, 6:55 p.m.
Created at: April 10, 2026, 4:46 a.m.