Triple
T37307803
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Yao’s minimax principle |
E926123
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Las Vegas algorithms
Las Vegas algorithms are randomized algorithms that always produce correct results but whose running time is a random variable, typically analyzed using tools like Yao’s minimax principle.
|
E2222819
|
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: Las Vegas algorithms | Statement: [Yao’s minimax principle, relatedTo, Las Vegas algorithms]
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: Las Vegas algorithms Triple: [Yao’s minimax principle, relatedTo, Las Vegas algorithms]
Generated description
Las Vegas algorithms are randomized algorithms that always produce correct results but whose running time is a random variable, typically analyzed using tools like Yao’s minimax principle.
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_69f76eb1bc508190924e9fa5d8acdeb3 |
completed | May 3, 2026, 3:50 p.m. |
| NER | Named-entity recognition | batch_69fb5b1684108190ba891b55b63a650c |
completed | May 6, 2026, 3:15 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a4063912ebc819081618a3395e5c6df |
completed | June 27, 2026, 11:58 p.m. |
| NEDg | Description generation | batch_6a406469e0788190a5e71d8ba58ff191 |
completed | June 28, 2026, 12:01 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a4065e5a1908190a03d248535ba7a3a |
completed | June 28, 2026, 12:08 a.m. |
Created at: May 3, 2026, 4:16 p.m.