Triple

T6117023
Position Surface form Disambiguated ID Type / Status
Subject G. H. Hardy E136383 entity
Predicate notableFor P22 FINISHED
Object Hardy–Ramanujan theorem E123877 NE FINISHED

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: [G. H. Hardy, notableFor, Hardy–Ramanujan theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hardy–Ramanujan theorem
Context triple: [G. H. Hardy, notableFor, 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. 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.
  • D. 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.
  • E. Waring's problem
    Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69c0089f851c81909e5e189a617dcff6 completed March 22, 2026, 3:19 p.m.
NER Named-entity recognition batch_69c05beb4cfc8190ab67a5338ec59cea completed March 22, 2026, 9:15 p.m.
NED1 Entity disambiguation (via context triple) batch_69c1359ed8608190a99c9e5b0f384c63 completed March 23, 2026, 12:44 p.m.
Created at: March 22, 2026, 4:14 p.m.