Triple

T19231202
Position Surface form Disambiguated ID Type / Status
Subject Mittag-Leffler theorem E480874 entity
Predicate relatedTo P37 FINISHED
Object Weierstrass factorization theorem 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: Weierstrass factorization theorem | Statement: [Mittag-Leffler theorem, relatedTo, Weierstrass factorization theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Weierstrass factorization theorem
Context triple: [Mittag-Leffler theorem, relatedTo, Weierstrass factorization theorem]
  • A. Weierstrass factorization theorem chosen
    The Weierstrass factorization theorem is a fundamental result in complex analysis that expresses any entire function as an infinite product determined by its zeros, generalizing the factorization of polynomials.
  • B. Weierstrass preparation theorem
    The Weierstrass preparation theorem is a fundamental result in complex analysis and analytic geometry that locally expresses analytic functions near a zero as a product of a polynomial and a unit, enabling a power-series analogue of factorization.
  • C. Casorati–Weierstrass theorem
    The Casorati–Weierstrass theorem is a fundamental result in complex analysis stating that near an essential singularity, a complex function attains values arbitrarily close to every complex number.
  • D. 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.
  • E. Runge approximation theorem
    The Runge approximation theorem is a fundamental result in complex analysis stating that holomorphic functions on certain domains can be uniformly approximated by rational functions with poles outside those domains.
  • 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_69d8e8ccb8f48190ad420098e74fb1db completed April 10, 2026, 12:10 p.m.
NER Named-entity recognition batch_69e5fa9ce5e081909df994841ce476d5 completed April 20, 2026, 10:06 a.m.
Created at: April 10, 2026, 1:25 p.m.