Triple

T22904022
Position Surface form Disambiguated ID Type / Status
Subject Narendra Karmarkar E568397 entity
Predicate notableWork P4 FINISHED
Object Karmarkar's algorithm for linear programming — 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: Karmarkar's algorithm for linear programming | Statement: [Narendra Karmarkar, notableWork, Karmarkar's algorithm for linear programming]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Karmarkar's algorithm for linear programming
Context triple: [Narendra Karmarkar, notableWork, Karmarkar's algorithm for linear programming]
  • A. Karmarkar's algorithm chosen
    Karmarkar's algorithm is a groundbreaking interior-point method for solving linear programming problems in polynomial time, which significantly advanced the field of optimization.
  • B. Gomory cuts in integer programming
    Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization problems.
  • C. Gale’s theorem on linear inequalities
    Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
  • D. INFORMS Optimization Society Khachiyan Prize
    The INFORMS Optimization Society Khachiyan Prize is a prestigious award recognizing outstanding lifetime contributions to the field of optimization.
  • E. Papadimitriou–Yannakakis theorem
    The Papadimitriou–Yannakakis theorem is a fundamental result in computational complexity theory that characterizes the complexity of certain optimization and approximation problems, particularly in relation to classes like NP and the theory of approximation algorithms.
  • 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_69e2458cd9e48190943ad2e34485d939 completed April 17, 2026, 2:37 p.m.
NER Named-entity recognition batch_69f1801895f48190bb8d49a41feac7ef completed April 29, 2026, 3:50 a.m.
Created at: April 17, 2026, 3:41 p.m.