Triple

T27176301
Position Surface form Disambiguated ID Type / Status
Subject Lévy–Prokhorov metric E683051 entity
Predicate relatedTo P37 FINISHED
Object Skorokhod representation theorem
The Skorokhod representation theorem is a fundamental result in probability theory that allows one to realize weak convergence of probability measures as almost sure convergence of suitably constructed random variables on a common probability space.
E1761192 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: Skorokhod representation theorem | Statement: [Lévy–Prokhorov metric, relatedTo, Skorokhod representation 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: Skorokhod representation theorem
Triple: [Lévy–Prokhorov metric, relatedTo, Skorokhod representation theorem]
Generated description
The Skorokhod representation theorem is a fundamental result in probability theory that allows one to realize weak convergence of probability measures as almost sure convergence of suitably constructed random variables on a common probability space.

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_69eefad086808190ab89816c0c300476 completed April 27, 2026, 5:57 a.m.
NER Named-entity recognition batch_69f6257a5ae881908db3032511378836 completed May 2, 2026, 4:25 p.m.
NED1 Entity disambiguation (via context triple) batch_6a12538af05481908b8108b8b171beb5 completed May 24, 2026, 1:25 a.m.
NEDg Description generation batch_6a12546f814881908c806a1805b7473d completed May 24, 2026, 1:29 a.m.
NED2 Entity disambiguation (via description) batch_6a12552837d88190a12496ca49423f0f completed May 24, 2026, 1:32 a.m.
Created at: April 27, 2026, 9:26 a.m.