Triple
T17661069
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bailey chains |
E440252
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Rogers–Ramanujan-type identities |
—
|
NE NERFINISHED |
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-type identities | Statement: [Bailey chains, relatedTo, Rogers–Ramanujan-type identities]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rogers–Ramanujan-type identities Context triple: [Bailey chains, relatedTo, Rogers–Ramanujan-type 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.
Euler pentagonal number theorem
The Euler pentagonal number theorem is a fundamental result in number theory and combinatorics that gives a remarkable infinite product expansion for the generating function of partition numbers, involving exponents given by generalized pentagonal numbers.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8b9e87e18819087104a44dc4dc5b1 |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e46ea67f8081909da164ca21a98675 |
completed | April 19, 2026, 5:56 a.m. |
Created at: April 10, 2026, 9:43 a.m.