Triple

T940260
Position Surface form Disambiguated ID Type / Status
Subject Karl Weierstrass E20288 entity
Predicate notableFor P22 FINISHED
Object Weierstrass factorization theorem
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.
E110607 NE FINISHED

How this triple was built (4 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: [Karl Weierstrass, notableFor, Weierstrass factorization theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Weierstrass factorization theorem
Context triple: [Karl Weierstrass, notableFor, Weierstrass factorization theorem]
  • A. Euler product formula for the Riemann zeta function
    The Euler product formula for the Riemann zeta function is a fundamental identity in analytic number theory that expresses the zeta function as an infinite product over all prime numbers, revealing a deep connection between primes and the distribution of integers.
  • B. Riemann mapping theorem
    The Riemann mapping theorem is a fundamental result in complex analysis stating that any non-empty simply connected open subset of the complex plane (other than the whole plane) can be conformally mapped onto the open unit disk.
  • C. Riemann zeta function
    The Riemann zeta function is a complex-valued function central to analytic number theory, whose properties—especially the distribution of its zeros—are deeply connected to the distribution of prime numbers.
  • D. Riemann–Roch theorem
    The Riemann–Roch theorem is a fundamental result in algebraic geometry and complex analysis that relates the dimension of spaces of meromorphic sections of a line bundle on a curve to topological data such as genus and degree.
  • E. Über die Darstellbarkeit einer Funktion durch eine trigonometrische Reihe
    Über die Darstellbarkeit einer Funktion durch eine trigonometrische Reihe is Bernhard Riemann’s seminal 1854 paper that laid foundational ideas for Fourier series and modern real analysis, including the concept now known as the Riemann integral.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Weierstrass factorization theorem
Triple: [Karl Weierstrass, notableFor, Weierstrass factorization theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Weierstrass factorization theorem
Target entity description: 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.
  • A. Euler product formula for the Riemann zeta function
    The Euler product formula for the Riemann zeta function is a fundamental identity in analytic number theory that expresses the zeta function as an infinite product over all prime numbers, revealing a deep connection between primes and the distribution of integers.
  • B. Riemann mapping theorem
    The Riemann mapping theorem is a fundamental result in complex analysis stating that any non-empty simply connected open subset of the complex plane (other than the whole plane) can be conformally mapped onto the open unit disk.
  • C. Riemann zeta function
    The Riemann zeta function is a complex-valued function central to analytic number theory, whose properties—especially the distribution of its zeros—are deeply connected to the distribution of prime numbers.
  • D. Riemann–Roch theorem
    The Riemann–Roch theorem is a fundamental result in algebraic geometry and complex analysis that relates the dimension of spaces of meromorphic sections of a line bundle on a curve to topological data such as genus and degree.
  • E. Über die Darstellbarkeit einer Funktion durch eine trigonometrische Reihe
    Über die Darstellbarkeit einer Funktion durch eine trigonometrische Reihe is Bernhard Riemann’s seminal 1854 paper that laid foundational ideas for Fourier series and modern real analysis, including the concept now known as the Riemann integral.
  • 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_69a493b0270c81909e6c9ce310f6aa55 completed March 1, 2026, 7:29 p.m.
NER Named-entity recognition batch_69a4b38b7da08190ac0853655dab678a completed March 1, 2026, 9:45 p.m.
NED1 Entity disambiguation (via context triple) batch_69a826e30c448190acc1457a63d27a4a completed March 4, 2026, 12:34 p.m.
NEDg Description generation batch_69a8343e16908190af102cfce025c31f completed March 4, 2026, 1:31 p.m.
NED2 Entity disambiguation (via description) batch_69a834f3a9288190a8cd28165379cec6 completed March 4, 2026, 1:34 p.m.
Created at: March 1, 2026, 7:40 p.m.