Triple
T4410541
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramanujan partition congruences |
E94841
|
entity |
| Predicate | property |
P5774
|
FINISHED |
| Object | show that certain partition numbers are always divisible by a given prime |
—
|
LITERAL FINISHED |
How this triple was built (1 step)
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: show that certain partition numbers are always divisible by a given prime | Statement: [Ramanujan partition congruences, property, show that certain partition numbers are always divisible by a given prime]
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_69b34539638c8190abfea3eb29425210 |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b354e4c58c8190b4190aad3095a1dd |
completed | March 13, 2026, 12:05 a.m. |
Created at: March 12, 2026, 11:29 p.m.