Triple
T22666439
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Poisson bracket |
E559803
|
entity |
| Predicate | appearsIn |
P795
|
FINISHED |
| Object | Liouville theorem |
—
|
NE NERFINISHED |
How this triple was built (3 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: Liouville theorem | Statement: [Poisson bracket, appearsIn, Liouville theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Liouville theorem Context triple: [Poisson bracket, appearsIn, Liouville theorem]
-
A.
Liouville's theorem
Liouville's theorem is a fundamental result in complex analysis stating that any bounded entire function must be constant.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
D.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
E.
Casorati–Weierstrass theorem
The Casorati–Weierstrass theorem is a fundamental result in complex analysis stating that near an essential singularity, a complex function attains values arbitrarily close to every complex number.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Liouville theorem Target entity description: Liouville's theorem is a fundamental result in Hamiltonian mechanics stating that the phase-space volume occupied by an ensemble of systems is conserved over time under Hamiltonian evolution.
-
A.
Liouville's theorem
Liouville's theorem is a fundamental result in complex analysis stating that any bounded entire function must be constant.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
D.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
E.
Casorati–Weierstrass theorem
The Casorati–Weierstrass theorem is a fundamental result in complex analysis stating that near an essential singularity, a complex function attains values arbitrarily close to every complex number.
- F. None of above. chosen
Provenance (2 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_69e2454a158c819093b8e35f5045efb6 |
completed | April 17, 2026, 2:35 p.m. |
| NER | Named-entity recognition | batch_69f1781c2c808190baf6964ca1eced6f |
completed | April 29, 2026, 3:16 a.m. |
Created at: April 17, 2026, 3:09 p.m.