Triple

T3410520
Position Surface form Disambiguated ID Type / Status
Subject Srinivasa Ramanujan E71880 entity
Predicate notableWork P4 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: [Srinivasa Ramanujan, notableWork, Rogers–Ramanujan identities]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Rogers–Ramanujan identities
Context triple: [Srinivasa Ramanujan, notableWork, 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. 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. Dyson’s transform in number theory
    Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
  • 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_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.
Created at: March 8, 2026, 3:15 p.m.