Triple

T4437391
Position Surface form Disambiguated ID Type / Status
Subject Rogers–Ramanujan-type identities E95684 entity
Predicate generalizes P2372 FINISHED
Object Rogers–Ramanujan identities E95684 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: Rogers–Ramanujan identities | Statement: [Rogers–Ramanujan-type identities, generalizes, Rogers–Ramanujan identities]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Rogers–Ramanujan identities
Context triple: [Rogers–Ramanujan-type identities, generalizes, Rogers–Ramanujan identities]
  • A. Rogers–Ramanujan-type identities chosen
    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.
  • B. 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.
  • C. 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.
  • D. 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.
  • 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.
  • 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_69b3453ea2b48190a26f154b3b8fece5 completed March 12, 2026, 10:59 p.m.
NER Named-entity recognition batch_69b3558b1d4481909060ede5e0ded4bc completed March 13, 2026, 12:08 a.m.
NED1 Entity disambiguation (via context triple) batch_69b6137960908190814cbdf0b4e56542 completed March 15, 2026, 2:03 a.m.
Created at: March 12, 2026, 11:31 p.m.