Triple
T1358648
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Henri Poincaré |
E29046
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Poincaré–Bendixson theorem
The Poincaré–Bendixson theorem is a fundamental result in the qualitative theory of dynamical systems that characterizes the possible long-term behaviors of trajectories in two-dimensional continuous flows, ruling out chaotic dynamics in the plane.
|
E156190
|
NE FINISHED |
How this triple was built (4 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: Poincaré–Bendixson theorem | Statement: [Henri Poincaré, notableWork, Poincaré–Bendixson theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Poincaré–Bendixson theorem Context triple: [Henri Poincaré, notableWork, Poincaré–Bendixson theorem]
-
A.
Peano existence theorem
The Peano existence theorem is a fundamental result in the theory of ordinary differential equations that guarantees the existence (but not necessarily uniqueness) of solutions under mild continuity conditions on the right-hand side.
-
B.
Brouwer fixed-point theorem
The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
-
C.
local existence and uniqueness theorem
The local existence and uniqueness theorem is a fundamental result in differential equations that guarantees, under suitable conditions, a single solution passing through a given initial point, valid in some neighborhood of that point.
-
D.
Kakutani fixed-point theorem
The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
-
E.
Schauder fixed-point theorem
The Schauder fixed-point theorem is a fundamental result in functional analysis that guarantees the existence of fixed points for continuous compact mappings on convex closed subsets of Banach spaces, generalizing the Brouwer fixed-point theorem to infinite-dimensional settings.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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: Poincaré–Bendixson theorem Triple: [Henri Poincaré, notableWork, Poincaré–Bendixson theorem]
Generated description
The Poincaré–Bendixson theorem is a fundamental result in the qualitative theory of dynamical systems that characterizes the possible long-term behaviors of trajectories in two-dimensional continuous flows, ruling out chaotic dynamics in the plane.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Poincaré–Bendixson theorem Target entity description: The Poincaré–Bendixson theorem is a fundamental result in the qualitative theory of dynamical systems that characterizes the possible long-term behaviors of trajectories in two-dimensional continuous flows, ruling out chaotic dynamics in the plane.
-
A.
Peano existence theorem
The Peano existence theorem is a fundamental result in the theory of ordinary differential equations that guarantees the existence (but not necessarily uniqueness) of solutions under mild continuity conditions on the right-hand side.
-
B.
Brouwer fixed-point theorem
The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
-
C.
local existence and uniqueness theorem
The local existence and uniqueness theorem is a fundamental result in differential equations that guarantees, under suitable conditions, a single solution passing through a given initial point, valid in some neighborhood of that point.
-
D.
Kakutani fixed-point theorem
The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
-
E.
Schauder fixed-point theorem
The Schauder fixed-point theorem is a fundamental result in functional analysis that guarantees the existence of fixed points for continuous compact mappings on convex closed subsets of Banach spaces, generalizing the Brouwer fixed-point theorem to infinite-dimensional settings.
- F. None of above. chosen
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_69a498d77abc8190913bf57e5f51d2c4 |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c28f5b988190b0be4504eabb919d |
completed | March 1, 2026, 10:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acce701a84819094815ab6e8383b76 |
completed | March 8, 2026, 1:18 a.m. |
| NEDg | Description generation | batch_69accf15d910819098e9a4b24247881b |
completed | March 8, 2026, 1:21 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69accff8af488190a7580cf7c02ceed9 |
completed | March 8, 2026, 1:25 a.m. |
Created at: March 1, 2026, 7:56 p.m.