Triple

T7553044
Position Surface form Disambiguated ID Type / Status
Subject Bartel Leendert van der Waerden E178583 entity
Predicate notableFor P22 FINISHED
Object van der Waerden theorem in combinatorics E381617 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: van der Waerden theorem in combinatorics | Statement: [Bartel Leendert van der Waerden, notableFor, van der Waerden theorem in combinatorics]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: van der Waerden theorem in combinatorics
Context triple: [Bartel Leendert van der Waerden, notableFor, van der Waerden theorem in combinatorics]
  • A. Ramsey theory chosen
    Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
  • B. Green–Tao theorem
    The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
  • C. 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.
  • D. Erdős discrepancy problem
    The Erdős discrepancy problem is a famous question in combinatorial number theory that asks whether every infinite ±1 sequence has arbitrarily large discrepancy along some homogeneous arithmetic progression.
  • E. Combinatorial Nullstellensatz
    Combinatorial Nullstellensatz is a powerful algebraic tool in combinatorics that uses polynomial methods over fields to derive results about combinatorial structures, such as existence and counting theorems.
  • 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_69c69f2da22c8190a50942ac20af70e8 completed March 27, 2026, 3:15 p.m.
NER Named-entity recognition batch_69c6f8b8165481908285fc9697fe4c99 completed March 27, 2026, 9:38 p.m.
NED1 Entity disambiguation (via context triple) batch_69c84f33c968819089fd0a2b07b076a3 completed March 28, 2026, 9:59 p.m.
Created at: March 27, 2026, 3:49 p.m.