Triple
T1413890
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John Schulman |
E31866
|
entity |
| Predicate | authorOf |
P4244
|
FINISHED |
| Object | “High-Dimensional Continuous Control Using Generalized Advantage Estimation” |
E163182
|
NE FINISHED |
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: “High-Dimensional Continuous Control Using Generalized Advantage Estimation” | Statement: [John Schulman, authorOf, “High-Dimensional Continuous Control Using Generalized Advantage Estimation”]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “High-Dimensional Continuous Control Using Generalized Advantage Estimation” Context triple: [John Schulman, authorOf, “High-Dimensional Continuous Control Using Generalized Advantage Estimation”]
-
A.
Generalized Advantage Estimation
chosen
Generalized Advantage Estimation is a reinforcement learning technique that reduces variance and improves sample efficiency in policy gradient methods by cleverly estimating the advantage function over multiple time scales.
-
B.
Proximal Policy Optimization
Proximal Policy Optimization is a popular reinforcement learning algorithm that improves policy gradient methods by using clipped objective functions to achieve stable and efficient training.
-
C.
DDPG
DDPG (Deep Deterministic Policy Gradient) is a model-free, off-policy deep reinforcement learning algorithm designed for continuous action spaces, combining ideas from DQN and actor-critic methods.
-
D.
Stable Baselines
Stable Baselines is a popular Python library that provides reliable, well-tested implementations of reinforcement learning algorithms built on top of OpenAI Baselines.
-
E.
OpenAI Baselines
OpenAI Baselines is a collection of high-quality reference implementations of reinforcement learning algorithms released by OpenAI for research and benchmarking.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69a49919a994819086528951bc224775 |
completed | March 1, 2026, 7:52 p.m. |
| NER | Named-entity recognition | batch_69a4c3e476f08190aed1576805c62462 |
completed | March 1, 2026, 10:55 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad0e67dbf88190a2a15baca5b9e79d |
completed | March 8, 2026, 5:51 a.m. |
Created at: March 1, 2026, 7:59 p.m.