Triple

T4539860
Position Surface form Disambiguated ID Type / Status
Subject Stephen P. Boyd E107500 entity
Predicate notableWork P4 FINISHED
Object Convex Optimization
Convex Optimization is a widely used graduate-level textbook that systematically develops the theory, algorithms, and applications of convex optimization problems in engineering, statistics, and applied mathematics.
E451067 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: Convex Optimization | Statement: [Stephen P. Boyd, notableWork, Convex Optimization]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Convex Optimization
Context triple: [Stephen P. Boyd, notableWork, Convex Optimization]
  • A. Nonlinear programming
    Nonlinear programming is a branch of mathematical optimization focused on finding optimal solutions to problems where the objective function or constraints are nonlinear.
  • B. Karush–Kuhn–Tucker conditions
    The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
  • C. CVX
    CVX is the stock ticker symbol for Chevron Corporation, a major American multinational energy and oil company.
  • D. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • E. Optimal Transport: Old and New
    "Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
  • 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: Convex Optimization
Triple: [Stephen P. Boyd, notableWork, Convex Optimization]
Generated description
Convex Optimization is a widely used graduate-level textbook that systematically develops the theory, algorithms, and applications of convex optimization problems in engineering, statistics, and applied mathematics.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Convex Optimization
Target entity description: Convex Optimization is a widely used graduate-level textbook that systematically develops the theory, algorithms, and applications of convex optimization problems in engineering, statistics, and applied mathematics.
  • A. Nonlinear programming
    Nonlinear programming is a branch of mathematical optimization focused on finding optimal solutions to problems where the objective function or constraints are nonlinear.
  • B. Karush–Kuhn–Tucker conditions
    The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
  • C. CVX
    CVX is the stock ticker symbol for Chevron Corporation, a major American multinational energy and oil company.
  • D. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • E. Optimal Transport: Old and New
    "Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
  • 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_69bd43f922788190b7edfa294e39b178 completed March 20, 2026, 12:56 p.m.
NER Named-entity recognition batch_69bd57bb5c0c819092ebb2dd3310f5f8 completed March 20, 2026, 2:20 p.m.
NED1 Entity disambiguation (via context triple) batch_69bdacfff41481908a5c97ab4fcb9259 completed March 20, 2026, 8:24 p.m.
NEDg Description generation batch_69bdb32911cc8190a8624d54dad6355e completed March 20, 2026, 8:50 p.m.
NED2 Entity disambiguation (via description) batch_69bdb3a0bf908190b9a029f47e6be941 completed March 20, 2026, 8:52 p.m.
Created at: March 20, 2026, 1:04 p.m.