Triple

T22423116
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Kac theorem E554297 entity
Predicate relatedConcept P37 FINISHED
Object Hardy–Ramanujan 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: Hardy–Ramanujan theorem | Statement: [Erdős–Kac theorem, relatedConcept, Hardy–Ramanujan theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hardy–Ramanujan theorem
Context triple: [Erdős–Kac theorem, relatedConcept, Hardy–Ramanujan theorem]
  • A. Hardy–Ramanujan asymptotic formula chosen
    The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
  • B. Erdős–Kac theorem
    The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
  • C. Erdős–Wintner theorem
    The Erdős–Wintner theorem is a fundamental result in probabilistic number theory that characterizes when an additive arithmetic function has a limiting distribution.
  • D. Ramanujan’s sum
    Ramanujan’s sum is a number-theoretic function introduced by Srinivasa Ramanujan, expressing certain periodic arithmetic functions as finite trigonometric sums over primitive roots of unity.
  • E. Dirichlet's theorem on arithmetic progressions
    Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
  • 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_69e11e4f2d0c819091aa3558ea2ee630 completed April 16, 2026, 5:37 p.m.
NER Named-entity recognition batch_69f15a2af620819083338127e78137dc completed April 29, 2026, 1:08 a.m.
Created at: April 16, 2026, 8:47 p.m.