Triple

T17372159
Position Surface form Disambiguated ID Type / Status
Subject Julius König E422342 entity
Predicate notableWork P4 FINISHED
Object 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.
E1265392 NE FINISHED

How this triple was built (4 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 lemma | Statement: [Julius König, notableWork, König's lemma]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: König's lemma
Context triple: [Julius König, notableWork, König's lemma]
  • A. Kruskal's tree theorem
    Kruskal's tree theorem is a fundamental result in combinatorics and mathematical logic stating that finite trees are well-quasi-ordered under homeomorphic embedding, with deep implications in proof theory and computer science.
  • B. Ky Fan’s lemma
    Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
  • C. Bailey lemma
    The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
  • D. Robbins lemma
    Robbins lemma is a result in probability theory that provides a bound on the expected maximum of partial sums of independent random variables, named after mathematician Herbert Robbins.
  • E. Knaster–Kuratowski–Mazurkiewicz lemma
    The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: König's lemma
Triple: [Julius König, notableWork, König's lemma]
Generated description
König's lemma is a fundamental result in graph theory and logic stating that every finitely branching infinite tree has an infinite path.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: König's lemma
Target entity description: König's lemma is a fundamental result in graph theory and logic stating that every finitely branching infinite tree has an infinite path.
  • A. Kruskal's tree theorem
    Kruskal's tree theorem is a fundamental result in combinatorics and mathematical logic stating that finite trees are well-quasi-ordered under homeomorphic embedding, with deep implications in proof theory and computer science.
  • B. Ky Fan’s lemma
    Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
  • C. Bailey lemma
    The Bailey lemma is a key result in the theory of basic hypergeometric series that provides a systematic method for generating Rogers–Ramanujan-type identities and other q-series relations.
  • D. Robbins lemma
    Robbins lemma is a result in probability theory that provides a bound on the expected maximum of partial sums of independent random variables, named after mathematician Herbert Robbins.
  • E. Knaster–Kuratowski–Mazurkiewicz lemma
    The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
  • F. None of above. chosen

Provenance (5 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.
NED1 Entity disambiguation (via context triple) batch_6a019568a27c8190af1bbe6db75f3e6f completed May 11, 2026, 8:38 a.m.
NEDg Description generation batch_6a019b7b645c819087040b18ee447321 completed May 11, 2026, 9:03 a.m.
NED2 Entity disambiguation (via description) batch_6a019c8392d8819098317ff88a5c6e06 completed May 11, 2026, 9:08 a.m.
Created at: April 10, 2026, 5:44 a.m.