Triple
T36461818
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Blackwell |
E898305
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Blackwell approachability theorem
The Blackwell approachability theorem is a fundamental result in game theory and online learning that characterizes when a player can guarantee that the long-run average of vector-valued payoffs approaches a given target set, regardless of the opponent’s actions.
|
E2185009
|
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: Blackwell approachability theorem | Statement: [David Blackwell, notableWork, Blackwell approachability theorem]
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: Blackwell approachability theorem Triple: [David Blackwell, notableWork, Blackwell approachability theorem]
Generated description
The Blackwell approachability theorem is a fundamental result in game theory and online learning that characterizes when a player can guarantee that the long-run average of vector-valued payoffs approaches a given target set, regardless of the opponent’s actions.
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_69f76e57f08481908593bd0bc34581c8 |
completed | May 3, 2026, 3:48 p.m. |
| NER | Named-entity recognition | batch_69f7bdb217f881909c680c1b08cb0cdc |
completed | May 3, 2026, 9:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a39cfce81d88190be24cb811cb72fed |
completed | June 23, 2026, 12:14 a.m. |
| NEDg | Description generation | batch_6a39d0cabd3081909c94a8950b2bf3b6 |
completed | June 23, 2026, 12:18 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a39d166c18c819083279da244d4d483 |
completed | June 23, 2026, 12:20 a.m. |
Created at: May 3, 2026, 4:10 p.m.