Triple
T14334784
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramanujan’s lost notebook |
E355440
|
entity |
| Predicate | hasPublication |
P80
|
FINISHED |
| Object | Ramanujan’s Lost Notebook, Part I |
E355440
|
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: Ramanujan’s Lost Notebook, Part I | Statement: [Ramanujan’s lost notebook, hasPublication, Ramanujan’s Lost Notebook, Part I]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ramanujan’s Lost Notebook, Part I Context triple: [Ramanujan’s lost notebook, hasPublication, Ramanujan’s Lost Notebook, Part I]
-
A.
Ramanujan’s lost notebook
chosen
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.
-
B.
Ramanujan’s last letter to G. H. Hardy
Ramanujan’s last letter to G. H. Hardy is a famous 1920 correspondence in which the mathematician Srinivasa Ramanujan outlined his mysterious mock theta functions, profoundly influencing later developments in number theory and modular forms.
-
C.
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.
-
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.
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.
- 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_69d8278fa2108190bc0d0e7939c1eb03 |
completed | April 9, 2026, 10:26 p.m. |
| NER | Named-entity recognition | batch_69de8c20d2148190bb534bef338e871d |
completed | April 14, 2026, 6:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fd5bbb672c8190b25f7046500c56e2 |
completed | May 8, 2026, 3:42 a.m. |
Created at: April 10, 2026, 1:13 a.m.