Triple

T3410517
Position Surface form Disambiguated ID Type / Status
Subject Srinivasa Ramanujan E71880 entity
Predicate notableWork P4 FINISHED
Object Ramanujan prime
A Ramanujan prime is a type of prime number that provides a bound guaranteeing the existence of a certain number of primes in intervals of the form (x/2, x], named after the mathematician Srinivasa Ramanujan.
E355434 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: Ramanujan prime | Statement: [Srinivasa Ramanujan, notableWork, Ramanujan prime]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Ramanujan prime
Context triple: [Srinivasa Ramanujan, notableWork, Ramanujan prime]
  • A. prime number theorem
    The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
  • B. Hardy–Ramanujan asymptotic formula
    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.
  • C. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
    Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
  • D. Fermat number
    A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
  • E. Prime
    Prime is one of the traditional canonical hours in the Christian liturgy of the hours, historically recited in the early morning.
  • 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: Ramanujan prime
Triple: [Srinivasa Ramanujan, notableWork, Ramanujan prime]
Generated description
A Ramanujan prime is a type of prime number that provides a bound guaranteeing the existence of a certain number of primes in intervals of the form (x/2, x], named after the mathematician Srinivasa Ramanujan.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Ramanujan prime
Target entity description: A Ramanujan prime is a type of prime number that provides a bound guaranteeing the existence of a certain number of primes in intervals of the form (x/2, x], named after the mathematician Srinivasa Ramanujan.
  • A. prime number theorem
    The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
  • B. Hardy–Ramanujan asymptotic formula
    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.
  • C. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
    Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
  • D. Fermat number
    A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
  • E. Prime
    Prime is one of the traditional canonical hours in the Christian liturgy of the hours, historically recited in the early morning.
  • 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_69ad85ac312481909e7027ced1456a9f completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb9094b2881909262e58a470ed9d0 completed March 8, 2026, 5:59 p.m.
NED1 Entity disambiguation (via context triple) batch_69b34bdd99248190823875cae2531609 completed March 12, 2026, 11:27 p.m.
NEDg Description generation batch_69b34e4972008190af3b84f26b4a3629 completed March 12, 2026, 11:37 p.m.
NED2 Entity disambiguation (via description) batch_69b34fc6c3f88190ba1a08243232df05 completed March 12, 2026, 11:44 p.m.
Created at: March 8, 2026, 3:15 p.m.