Triple
T6801167
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Poincaré recurrence theorem |
E156189
|
entity |
| Predicate | statement |
P4223
|
FINISHED |
| Object | In a measure-preserving dynamical system with finite total measure, almost every point of a measurable set returns arbitrarily close to its initial position infinitely often. |
E156189
|
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: In a measure-preserving dynamical system with finite total measure, almost every point of a measurable set returns arbitrarily close to its initial position infinitely often. | Statement: [Poincaré recurrence theorem, statement, In a measure-preserving dynamical system with finite total measure, almost every point of a measurable set returns arbitrarily close to its initial position infinitely often.]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: In a measure-preserving dynamical system with finite total measure, almost every point of a measurable set returns arbitrarily close to its initial position infinitely often. Context triple: [Poincaré recurrence theorem, statement, In a measure-preserving dynamical system with finite total measure, almost every point of a measurable set returns arbitrarily close to its initial position infinitely often.]
-
A.
Poincaré recurrence theorem
chosen
The Poincaré recurrence theorem is a fundamental result in dynamical systems and ergodic theory stating that certain systems will, after a sufficiently long but finite time, return arbitrarily close to their initial state.
-
B.
ergodic theorem
The ergodic theorem is a fundamental result in dynamical systems and probability theory that links long-term time averages of a system’s evolution to ensemble or space averages, underpinning the statistical behavior of many physical and stochastic processes.
-
C.
Kakutani equivalence in ergodic theory
Kakutani equivalence in ergodic theory is a notion of equivalence between measure-preserving dynamical systems based on the isomorphism of their induced transformations on subsets of positive measure.
-
D.
Kakutani’s random ergodic theorem
Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
-
E.
Poincaré map
The Poincaré map is a mathematical tool in dynamical systems theory that reduces continuous-time dynamics to a discrete map by tracking intersections of trajectories with a lower-dimensional surface.
- 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_69c68826e6a48190a3d220b541e639de |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d2e595188190a0bb4b595df3adb2 |
completed | March 27, 2026, 6:56 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c71a9b0cc48190819380aeaf0228e7 |
completed | March 28, 2026, 12:02 a.m. |
Created at: March 27, 2026, 2:16 p.m.