Triple

T1057164
Position Surface form Disambiguated ID Type / Status
Subject local existence and uniqueness theorem E22820 entity
Predicate strongerThan P24323 FINISHED
Object Peano existence theorem in terms of uniqueness E128381 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: Peano existence theorem in terms of uniqueness | Statement: [local existence and uniqueness theorem, strongerThan, Peano existence theorem in terms of uniqueness]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Peano existence theorem in terms of uniqueness
Context triple: [local existence and uniqueness theorem, strongerThan, Peano existence theorem in terms of uniqueness]
  • A. Peano existence theorem chosen
    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
    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. Banach fixed-point theorem
    The Banach fixed-point theorem is a fundamental result in metric space theory that guarantees the existence and uniqueness of a fixed point for any contraction mapping and provides a method for finding it via iterative approximation.
  • D. 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.
  • E. Lax equivalence theorem
    The Lax equivalence theorem is a fundamental result in numerical analysis stating that for a well-posed linear initial value problem, consistency and stability of a finite difference scheme together imply its convergence.
  • 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: strongerThan
Context triple: [local existence and uniqueness theorem, strongerThan, Peano existence theorem in terms of uniqueness]
  • A. isStrongerThan
    Indicates that one entity possesses greater physical power, force, or effectiveness than another entity.
  • B. strengthensFrom
    Indicates that one entity becomes stronger, more effective, or more intense as a result of influence, support, or input from another entity.
  • C. largerThan
    Indicates that one entity has a greater size, extent, or magnitude than another entity.
  • D. strengthens
    Indicates that one entity increases the power, effectiveness, or resilience of another.
  • E. isHigherThan
    Indicates that one entity has a greater value, level, or position than another entity.
  • 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_69a493dada0481909c43649f9843ea91 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4ba6e35ac8190802341c31bda0e3b completed March 1, 2026, 10:15 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac5999d30881909bc9e2d8528b1b56 completed March 7, 2026, 5 p.m.
PD Predicate disambiguation batch_69a4b7340a048190807363f19d17a58f completed March 1, 2026, 10:01 p.m.
PDg Predicate description generation batch_69a4ba6d44c08190bf0ab28661ed8ca0 completed March 1, 2026, 10:15 p.m.
Created at: March 1, 2026, 7:42 p.m.