Triple

T7535388
Position Surface form Disambiguated ID Type / Status
Subject Edmonds E178135 entity
Predicate hasNotableBearer P458 FINISHED
Object Jack Edmonds
Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
E670991 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: Jack Edmonds | Statement: [Edmonds, hasNotableBearer, Jack Edmonds]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Jack Edmonds
Context triple: [Edmonds, hasNotableBearer, Jack Edmonds]
  • A. Robert W Floyd
    Robert W. Floyd was an influential American computer scientist and Turing Award laureate known for his pioneering work in algorithms, formal verification, and programming language semantics.
  • B. John Kruskal
    John Kruskal was an American mathematician and computer scientist best known for Kruskal's algorithm in graph theory and for foundational work in combinatorics and statistics.
  • C. John E. Hopcroft
    John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
  • D. David S. Johnson
    David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
  • E. F. M. Fulkerson
    F. M. Fulkerson is a central figure in William Dean Howells’s novel "A Hazard of New Fortunes," known as the energetic, entrepreneurial promoter who helps launch the magazine around which much of the story revolves.
  • 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: Jack Edmonds
Triple: [Edmonds, hasNotableBearer, Jack Edmonds]
Generated description
Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Jack Edmonds
Target entity description: Jack Edmonds is a pioneering Canadian mathematician and computer scientist renowned for his foundational work in combinatorial optimization and polyhedral theory, including the development of efficient algorithms for matching and matroid intersection.
  • A. Robert W Floyd
    Robert W. Floyd was an influential American computer scientist and Turing Award laureate known for his pioneering work in algorithms, formal verification, and programming language semantics.
  • B. John Kruskal
    John Kruskal was an American mathematician and computer scientist best known for Kruskal's algorithm in graph theory and for foundational work in combinatorics and statistics.
  • C. John E. Hopcroft
    John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
  • D. David S. Johnson
    David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
  • E. F. M. Fulkerson
    F. M. Fulkerson is a central figure in William Dean Howells’s novel "A Hazard of New Fortunes," known as the energetic, entrepreneurial promoter who helps launch the magazine around which much of the story revolves.
  • 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_69c69f2acdbc8190b5a8320168c1d0ba completed March 27, 2026, 3:15 p.m.
NER Named-entity recognition batch_69c6f84c13208190971096a0b81b0ff2 completed March 27, 2026, 9:36 p.m.
NED1 Entity disambiguation (via context triple) batch_69c84f0c02148190bb5f63cf9891ec0c completed March 28, 2026, 9:58 p.m.
NEDg Description generation batch_69c84f9ce82081908813a1185b9b3570 completed March 28, 2026, 10:01 p.m.
NED2 Entity disambiguation (via description) batch_69c8500e64788190b196988290aea7d7 completed March 28, 2026, 10:02 p.m.
Created at: March 27, 2026, 3:47 p.m.