Triple

T4410548
Position Surface form Disambiguated ID Type / Status
Subject Ramanujan partition congruences E94841 entity
Predicate generalizedBy P2372 FINISHED
Object Ono’s partition congruences
Ono’s partition congruences are modern number-theoretic results that extend Ramanujan’s classical congruences by proving the existence of infinitely many congruence relations for the partition function modulo various primes.
E438308 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: Ono’s partition congruences | Statement: [Ramanujan partition congruences, generalizedBy, Ono’s partition congruences]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Ono’s partition congruences
Context triple: [Ramanujan partition congruences, generalizedBy, Ono’s partition congruences]
  • A. Ramanujan partition congruences
    Ramanujan partition congruences are remarkable number-theoretic results discovered by Srinivasa Ramanujan that describe surprising modular patterns in the partition function, such as specific arithmetic progressions where the number of integer partitions of an integer is divisible by a given prime.
  • B. Rogers–Ramanujan-type identities
    Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
  • C. 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.
  • D. Jacobi’s four-square theorem
    Jacobi’s four-square theorem is a fundamental result in number theory that gives a precise formula for the number of ways an integer can be expressed as a sum of four squares.
  • E. Ramanujan’s lost notebook
    Ramanujan’s lost notebook is a posthumously discovered collection of Srinivasa Ramanujan’s final mathematical formulas and insights, many of which were decades ahead of their time in number theory and q-series.
  • 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: Ono’s partition congruences
Triple: [Ramanujan partition congruences, generalizedBy, Ono’s partition congruences]
Generated description
Ono’s partition congruences are modern number-theoretic results that extend Ramanujan’s classical congruences by proving the existence of infinitely many congruence relations for the partition function modulo various primes.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Ono’s partition congruences
Target entity description: Ono’s partition congruences are modern number-theoretic results that extend Ramanujan’s classical congruences by proving the existence of infinitely many congruence relations for the partition function modulo various primes.
  • A. Ramanujan partition congruences
    Ramanujan partition congruences are remarkable number-theoretic results discovered by Srinivasa Ramanujan that describe surprising modular patterns in the partition function, such as specific arithmetic progressions where the number of integer partitions of an integer is divisible by a given prime.
  • B. Rogers–Ramanujan-type identities
    Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
  • C. 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.
  • D. Jacobi’s four-square theorem
    Jacobi’s four-square theorem is a fundamental result in number theory that gives a precise formula for the number of ways an integer can be expressed as a sum of four squares.
  • E. Ramanujan’s lost notebook
    Ramanujan’s lost notebook is a posthumously discovered collection of Srinivasa Ramanujan’s final mathematical formulas and insights, many of which were decades ahead of their time in number theory and q-series.
  • 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_69b34539638c8190abfea3eb29425210 completed March 12, 2026, 10:59 p.m.
NER Named-entity recognition batch_69b354e4c58c8190b4190aad3095a1dd completed March 13, 2026, 12:05 a.m.
NED1 Entity disambiguation (via context triple) batch_69b5f60ea0808190a59418f7911d123d completed March 14, 2026, 11:58 p.m.
NEDg Description generation batch_69b5f9e8c7d08190b8a61ba1c4bf559a completed March 15, 2026, 12:14 a.m.
NED2 Entity disambiguation (via description) batch_69b5fa6495f881909a08b0e5b8b7decf completed March 15, 2026, 12:16 a.m.
Created at: March 12, 2026, 11:29 p.m.