Triple

T17372241
Position Surface form Disambiguated ID Type / Status
Subject Peter König E422345 entity
Predicate notableFor P22 FINISHED
Object König's theorem — NE NERFINISHED

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: König's theorem | Statement: [Peter König, notableFor, König's theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: König's theorem
Context triple: [Peter König, notableFor, König's theorem]
  • A. 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.
  • B. König's theorem in graph theory chosen
    König's theorem in graph theory is a fundamental result in bipartite graphs stating that the size of a maximum matching equals the size of a minimum vertex cover.
  • C. 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.
  • D. König's lemma
    König's lemma is a fundamental result in graph theory and logic stating that every finitely branching infinite tree has an infinite path.
  • E. 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.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69d889d6535c81908be333c01deaec4e completed April 10, 2026, 5:25 a.m.
NER Named-entity recognition batch_69e43a69d93c81908ce2d909857a3a11 completed April 19, 2026, 2:14 a.m.
Created at: April 10, 2026, 5:44 a.m.