Triple
T5973646
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Siméon Denis Poisson |
E132932
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Poisson process |
E559807
|
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: Poisson process | Statement: [Siméon Denis Poisson, notableConcept, Poisson process]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Poisson process Context triple: [Siméon Denis Poisson, notableConcept, Poisson process]
-
A.
Poisson process
chosen
The Poisson process is a fundamental stochastic process in probability theory that models random events occurring independently over time or space at a constant average rate.
-
B.
Poisson
Poisson is a French surname most famously associated with Siméon Denis Poisson, a prominent 19th-century mathematician and physicist known for major contributions to probability theory and mathematical physics.
-
C.
Stochastic Processes
"Stochastic Processes" is a foundational textbook by Emanuel Parzen that rigorously introduces the theory and applications of random processes in probability and statistics.
-
D.
Markov processes
Markov processes are stochastic processes in which the future evolution depends only on the present state and not on the past history.
-
E.
Khinchin–Pollaczek formula
The Khinchin–Pollaczek formula is a result in probability theory and queueing theory that provides an explicit expression for the stationary waiting-time distribution in certain single-server queues.
- 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_69c0086deab081908550159ca23eec9b |
completed | March 22, 2026, 3:19 p.m. |
| NER | Named-entity recognition | batch_69c04a01dd4081909097342afff31f9b |
completed | March 22, 2026, 7:58 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c108422220819092ac63e5ebb264b4 |
completed | March 23, 2026, 9:30 a.m. |
Created at: March 22, 2026, 4:03 p.m.