Triple
T21494252
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Chinese remainder theorem |
E530312
|
entity |
| Predicate | hasGeneralization |
P2372
|
FINISHED |
| Object | Chinese remainder theorem for rings |
E530312
|
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: Chinese remainder theorem for rings | Statement: [Chinese remainder theorem, hasGeneralization, Chinese remainder theorem for rings]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Chinese remainder theorem for rings Context triple: [Chinese remainder theorem, hasGeneralization, Chinese remainder theorem for rings]
-
A.
Chinese remainder theorem
chosen
The Chinese remainder theorem is a fundamental result in number theory that provides conditions and a method for solving systems of simultaneous congruences with pairwise coprime moduli.
-
B.
Gauss’s lemma in number theory
Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
-
C.
Gaussian rationals ℚ(i)
Gaussian rationals ℚ(i) are the field of complex numbers whose real and imaginary parts are rational, formed by adjoining the imaginary unit i to the rational numbers.
-
D.
Kummer's theorem (number theory)
Kummer's theorem (number theory) is a result that characterizes the highest power of a prime dividing a binomial coefficient by counting the carries that occur when adding the binomial parameters in base that prime.
-
E.
A Course in Number Theory and Cryptography
A Course in Number Theory and Cryptography is a widely used textbook that introduces fundamental concepts of number theory with a strong emphasis on their applications to modern cryptography.
- 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_69e0c45bd15481909fba5910765cdda2 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69e9ea567244819091863350fedae3ae |
completed | April 23, 2026, 9:45 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a09e1398efc8190a6465defb1715c2b |
completed | May 17, 2026, 3:39 p.m. |
Created at: April 16, 2026, 6:23 p.m.