Triple
T5790585
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Peano existence theorem |
E128381
|
entity |
| Predicate | hasWeakerRegularityAssumptionThan |
P24324
|
FINISHED |
| Object | Picard–Lindelöf theorem |
E22820
|
NE FINISHED |
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: Picard–Lindelöf theorem | Statement: [Peano existence theorem, hasWeakerRegularityAssumptionThan, Picard–Lindelöf theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Picard–Lindelöf theorem Context triple: [Peano existence theorem, hasWeakerRegularityAssumptionThan, Picard–Lindelöf 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.
local existence and uniqueness theorem
chosen
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.
-
C.
Cauchy–Kovalevskaya theorem
The Cauchy–Kovalevskaya theorem is a fundamental result in partial differential equations that guarantees the existence and uniqueness of analytic solutions to certain initial value problems under appropriate analyticity conditions.
-
D.
Carathéodory existence theorem
The Carathéodory existence theorem is a result in the theory of ordinary differential equations that guarantees the existence (and sometimes uniqueness) of solutions under weaker regularity conditions on the right-hand side than those required by classical theorems like Picard–Lindelöf.
-
E.
Mittag-Leffler theorem
The Mittag-Leffler theorem is a fundamental result in complex analysis that characterizes meromorphic functions by allowing the construction of such functions with prescribed principal parts at given poles.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasWeakerRegularityAssumptionThan Context triple: [Peano existence theorem, hasWeakerRegularityAssumptionThan, Picard–Lindelöf theorem]
-
A.
weakerThan
chosen
Indicates that one entity has less strength, power, or effectiveness than another entity.
-
B.
strongerThan
Indicates that one entity possesses greater strength, power, or intensity than another.
-
C.
hasRegularity
Indicates that one entity exhibits a consistent, recurring pattern or uniform behavior with respect to another entity or over time.
-
D.
occursMoreStronglyFor
Indicates that a particular effect, condition, or phenomenon manifests with greater intensity, frequency, or impact for one entity or context compared to another.
-
E.
isStrongerThan
Indicates that one entity possesses greater physical power, force, or effectiveness than another entity.
- F. None of above.
Provenance (4 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_69c00845ca68819081a2ce3ecca577f7 |
completed | March 22, 2026, 3:18 p.m. |
| NER | Named-entity recognition | batch_69c02a5585788190821b8da40259e0e7 |
completed | March 22, 2026, 5:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c0b0d71b7881909108c7347ce91317 |
completed | March 23, 2026, 3:17 a.m. |
| PD | Predicate disambiguation | batch_69c021d2cd608190b98a7e3aa7001d27 |
completed | March 22, 2026, 5:07 p.m. |
Created at: March 22, 2026, 3:51 p.m.