Triple

T7420184
Position Surface form Disambiguated ID Type / Status
Subject Legendre symbol E171225 entity
Predicate computableBy P89 FINISHED
Object Euler criterion
Euler criterion is a number-theoretic result that characterizes quadratic residues modulo an odd prime using exponentiation, providing a practical way to evaluate the Legendre symbol.
E662761 NE FINISHED

How this triple was built (5 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: Euler criterion | Statement: [Legendre symbol, computableBy, Euler criterion]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Euler criterion
Context triple: [Legendre symbol, computableBy, Euler criterion]
  • A. Legendre symbol
    The Legendre symbol is a number-theoretic function that indicates whether an integer is a quadratic residue modulo an odd prime, taking values 1, −1, or 0 accordingly.
  • B. Euler’s theorem
    Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
  • C. Wilson's theorem
    Wilson's theorem is a result in number theory stating that a positive integer n > 1 is prime if and only if the factorial of (n − 1) is congruent to −1 modulo n.
  • D. quadratic reciprocity law
    The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
  • E. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Euler criterion
Triple: [Legendre symbol, computableBy, Euler criterion]
Generated description
Euler criterion is a number-theoretic result that characterizes quadratic residues modulo an odd prime using exponentiation, providing a practical way to evaluate the Legendre symbol.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Euler criterion
Target entity description: Euler criterion is a number-theoretic result that characterizes quadratic residues modulo an odd prime using exponentiation, providing a practical way to evaluate the Legendre symbol.
  • A. Legendre symbol
    The Legendre symbol is a number-theoretic function that indicates whether an integer is a quadratic residue modulo an odd prime, taking values 1, −1, or 0 accordingly.
  • B. Euler’s theorem
    Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
  • C. Wilson's theorem
    Wilson's theorem is a result in number theory stating that a positive integer n > 1 is prime if and only if the factorial of (n − 1) is congruent to −1 modulo n.
  • D. quadratic reciprocity law
    The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
  • E. 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.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: computableBy
Context triple: [Legendre symbol, computableBy, Euler criterion]
  • A. computationalClass
    Indicates that two entities share the same computational complexity class or that one entity is categorized within a specified computational complexity class.
  • B. usesComputationMethod chosen
    Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
  • C. isUsedToCompute
    Indicates that one entity serves as an input, basis, or resource for performing a calculation or deriving a result about another entity.
  • D. turingComplete
    Indicates that a system or language is capable of performing any computation that a universal Turing machine can, given enough time and memory.
  • E. computes
    Indicates that one entity performs a calculation or processing operation to produce a result from given data or inputs.
  • F. None of above.

Provenance (6 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_69c68a625d048190af70eb8b63bec5a0 completed March 27, 2026, 1:47 p.m.
NER Named-entity recognition batch_69c6f2ea61248190886e8e55b42ba5f1 completed March 27, 2026, 9:13 p.m.
NED1 Entity disambiguation (via context triple) batch_69c81ef7fc808190a564ab4d9d97ab37 completed March 28, 2026, 6:33 p.m.
NEDg Description generation batch_69c81f9b565881909bebcc3112037f52 completed March 28, 2026, 6:36 p.m.
NED2 Entity disambiguation (via description) batch_69c8207912f4819086e99ed441bee805 completed March 28, 2026, 6:39 p.m.
PD Predicate disambiguation batch_69c6f0345040819094c5756dfa487faf completed March 27, 2026, 9:01 p.m.
Created at: March 27, 2026, 3:11 p.m.