Triple
T5790600
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Peano existence theorem |
E128381
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Lipschitz condition |
E22820
|
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: Lipschitz condition | Statement: [Peano existence theorem, relatedConcept, Lipschitz condition]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lipschitz condition Context triple: [Peano existence theorem, relatedConcept, Lipschitz condition]
-
A.
Kolmogorov continuity theorem
The Kolmogorov continuity theorem is a fundamental result in probability theory that provides conditions under which a stochastic process admits a modification with continuous (or Hölder-continuous) sample paths.
-
B.
Dirichlet conditions
Dirichlet conditions are a set of sufficient criteria on a function—such as piecewise continuity and having a finite number of extrema and discontinuities on an interval—that guarantee the convergence of its Fourier series representation.
-
C.
Courant–Friedrichs–Lewy condition
The Courant–Friedrichs–Lewy condition is a fundamental stability criterion in numerical analysis that restricts the time step size in discretized partial differential equations to ensure convergence of the computed solution.
-
D.
Karush–Kuhn–Tucker conditions
The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
-
E.
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.
- 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_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_69c09820f5c08190811e848eb44ce5b9 |
completed | March 23, 2026, 1:32 a.m. |
Created at: March 22, 2026, 3:51 p.m.