Triple

T18479359
Position Surface form Disambiguated ID Type / Status
Subject Borel summation E451516 entity
Predicate hasVariant P455 FINISHED
Object Borel–Leroy summation — NE NERFINISHED

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: Borel–Leroy summation | Statement: [Borel summation, hasVariant, Borel–Leroy summation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Borel–Leroy summation
Context triple: [Borel summation, hasVariant, Borel–Leroy summation]
  • A. Borel summation chosen
    Borel summation is a mathematical technique that assigns finite values to certain divergent series by transforming and analytically continuing their associated power series.
  • B. Cesàro summation
    Cesàro summation is a method of assigning finite values to certain divergent series by averaging their partial sums.
  • C. Abel summation
    Abel summation is a method in mathematical analysis for assigning values to certain divergent series by considering the limit of their power series as the variable approaches 1 from below.
  • D. Euler–Maclaurin summation formula
    The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
  • E. Malgrange preparation theorem
    The Malgrange preparation theorem is a fundamental result in analysis and singularity theory that generalizes the Weierstrass preparation theorem to smooth functions, providing a local factorization of such functions near singular points.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69d8d38465a0819099b9b42d2a662ac1 completed April 10, 2026, 10:40 a.m.
NER Named-entity recognition batch_69e53065e8388190bb216dae89f8cf75 completed April 19, 2026, 7:43 p.m.
Created at: April 10, 2026, 11:35 a.m.