Triple
T7853056
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Peter Whittle |
E182102
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Optimization over Time
"Optimization over Time" is a seminal work by Peter Whittle that develops mathematical methods for making optimal sequential decisions in dynamic and stochastic systems.
|
E695664
|
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: Optimization over Time | Statement: [Peter Whittle, notableWork, Optimization over Time]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Optimization over Time Context triple: [Peter Whittle, notableWork, Optimization over Time]
-
A.
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.
-
B.
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.
-
C.
Pontryagin maximum principle
The Pontryagin maximum principle is a fundamental result in optimal control theory that provides necessary conditions for an optimal control process by characterizing optimal trajectories via a Hamiltonian maximization condition.
-
D.
Mathematical Theory of Optimal Processes
Mathematical Theory of Optimal Processes is a foundational work in control theory that systematically develops the mathematical principles of optimal control, including what is now known as Pontryagin’s maximum principle.
-
E.
Introduction to Stochastic Control Theory
Introduction to Stochastic Control Theory is a foundational textbook that systematically develops the theory and methods for controlling dynamical systems under uncertainty using probabilistic and stochastic-process tools.
- 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: Optimization over Time Triple: [Peter Whittle, notableWork, Optimization over Time]
Generated description
"Optimization over Time" is a seminal work by Peter Whittle that develops mathematical methods for making optimal sequential decisions in dynamic and stochastic systems.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Optimization over Time Target entity description: "Optimization over Time" is a seminal work by Peter Whittle that develops mathematical methods for making optimal sequential decisions in dynamic and stochastic systems.
-
A.
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.
-
B.
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.
-
C.
Pontryagin maximum principle
The Pontryagin maximum principle is a fundamental result in optimal control theory that provides necessary conditions for an optimal control process by characterizing optimal trajectories via a Hamiltonian maximization condition.
-
D.
Mathematical Theory of Optimal Processes
Mathematical Theory of Optimal Processes is a foundational work in control theory that systematically develops the mathematical principles of optimal control, including what is now known as Pontryagin’s maximum principle.
-
E.
Introduction to Stochastic Control Theory
Introduction to Stochastic Control Theory is a foundational textbook that systematically develops the theory and methods for controlling dynamical systems under uncertainty using probabilistic and stochastic-process tools.
- 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_69ca82869ee08190b8f9040dbc2c0467 |
completed | March 30, 2026, 2:02 p.m. |
| NER | Named-entity recognition | batch_69cb18ed56d481909266d862e0ae152d |
completed | March 31, 2026, 12:44 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cb5b161a4881909641f3a29c1650b4 |
completed | March 31, 2026, 5:26 a.m. |
| NEDg | Description generation | batch_69cb5f1c9ef08190b1b79482f39966c7 |
completed | March 31, 2026, 5:43 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69cb767b198481909cfc1f7a44e6f0d8 |
completed | March 31, 2026, 7:23 a.m. |
Created at: March 30, 2026, 4:51 p.m.