Triple
T1489737
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gauss’s lemma (number theory) |
E29548
|
entity |
| Predicate | implies |
P1661
|
FINISHED |
| Object | Legendre symbol takes values ±1 for a coprime to p |
E29548
|
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: Legendre symbol takes values ±1 for a coprime to p | Statement: [Gauss’s lemma (number theory), implies, Legendre symbol takes values ±1 for a coprime to p]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Legendre symbol takes values ±1 for a coprime to p Context triple: [Gauss’s lemma (number theory), implies, Legendre symbol takes values ±1 for a coprime to p]
-
A.
Gauss’s lemma in number theory
chosen
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.
-
B.
Fermat's little theorem
Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
-
C.
Fermat's theorem on sums of two squares
Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
-
D.
Gaussian periods
Gaussian periods are special algebraic sums of roots of unity that play a key role in number theory, particularly in constructing regular polygons like the 17-gon with straightedge and compass and in understanding cyclotomic fields.
-
E.
Euler’s totient function φ(n)
Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and 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_69a498da82e08190ba833330d05f380f |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c6c233ec819087e1233af02aabfc |
completed | March 1, 2026, 11:07 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad1ca98e64819097916eb7717e6364 |
completed | March 8, 2026, 6:52 a.m. |
Created at: March 1, 2026, 8:12 p.m.