Triple

T10944639
Position Surface form Disambiguated ID Type / Status
Subject Lajos Pósa E258562 entity
Predicate isPartOf P10 FINISHED
Object Hungarian school of combinatorics
The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
E895559 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: Hungarian school of combinatorics | Statement: [Lajos Pósa, isPartOf, Hungarian school of combinatorics]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hungarian school of combinatorics
Context triple: [Lajos Pósa, isPartOf, Hungarian school of combinatorics]
  • A. Institute of Combinatorics and its Applications
    The Institute of Combinatorics and its Applications is an international scholarly organization devoted to advancing research, collaboration, and recognition in the field of combinatorics.
  • B. Erdős on Graphs: His Legacy
    Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
  • 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. Alfréd Rényi
    Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
  • E. Pál Turán
    Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
  • 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: Hungarian school of combinatorics
Triple: [Lajos Pósa, isPartOf, Hungarian school of combinatorics]
Generated description
The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hungarian school of combinatorics
Target entity description: The Hungarian school of combinatorics is a highly influential tradition in discrete mathematics centered in Hungary, renowned for its deep results, problem-solving culture, and leading figures such as Paul Erdős and his collaborators.
  • A. Institute of Combinatorics and its Applications
    The Institute of Combinatorics and its Applications is an international scholarly organization devoted to advancing research, collaboration, and recognition in the field of combinatorics.
  • B. Erdős on Graphs: His Legacy
    Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
  • 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. Alfréd Rényi
    Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
  • E. Pál Turán
    Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
  • 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_69d6aa8769b4819082bfe5e61b9017f0 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d770c4d59481908a5900fc8cf9ecc3 completed April 9, 2026, 9:26 a.m.
NED1 Entity disambiguation (via context triple) batch_69e23c2dea008190af68336a096b7f7c completed April 17, 2026, 1:57 p.m.
NEDg Description generation batch_69e24542b4f081909c97621f04da8ecc completed April 17, 2026, 2:35 p.m.
NED2 Entity disambiguation (via description) batch_69e248f7f96481909fa6e6cd07891566 completed April 17, 2026, 2:51 p.m.
Created at: April 8, 2026, 9:23 p.m.