Triple

T2815395
Position Surface form Disambiguated ID Type / Status
Subject Euler’s totient function φ(n) E54269 entity
Predicate roleIn P161 FINISHED
Object 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.
E300757 NE FINISHED

How this triple was built (4 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’s theorem | Statement: [Euler’s totient function φ(n), roleIn, Euler’s theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Euler’s theorem
Context triple: [Euler’s totient function φ(n), roleIn, Euler’s theorem]
  • A. 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.
  • B. de Bruijn–van Aardenne–Ehrenfest theorem
    The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
  • C. Euler’s formula for complex exponentials
    Euler’s formula for complex exponentials is the fundamental identity \(e^{i\theta} = \cos\theta + i\sin\theta\), which links complex exponentials with trigonometric functions and underpins much of complex analysis and engineering mathematics.
  • D. Euler product formula for the Riemann zeta function
    The Euler product formula for the Riemann zeta function is a fundamental identity in analytic number theory that expresses the zeta function as an infinite product over all prime numbers, revealing a deep connection between primes and the distribution of integers.
  • E. Euler–Maclaurin summation formula
    The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
  • 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’s theorem
Triple: [Euler’s totient function φ(n), roleIn, Euler’s theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Euler’s theorem
Target entity description: 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.
  • A. 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.
  • B. de Bruijn–van Aardenne–Ehrenfest theorem
    The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
  • C. Euler’s formula for complex exponentials
    Euler’s formula for complex exponentials is the fundamental identity \(e^{i\theta} = \cos\theta + i\sin\theta\), which links complex exponentials with trigonometric functions and underpins much of complex analysis and engineering mathematics.
  • D. Euler product formula for the Riemann zeta function
    The Euler product formula for the Riemann zeta function is a fundamental identity in analytic number theory that expresses the zeta function as an infinite product over all prime numbers, revealing a deep connection between primes and the distribution of integers.
  • E. Euler–Maclaurin summation formula
    The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
  • F. None of above. chosen

Provenance (5 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_69ab49de0af08190b3da69683be1e728 completed March 6, 2026, 9:40 p.m.
NER Named-entity recognition batch_69abde4d29488190a32461906dd9ea7e completed March 7, 2026, 8:14 a.m.
NED1 Entity disambiguation (via context triple) batch_69afce9f964081909e422aaf1f026dbb completed March 10, 2026, 7:56 a.m.
NEDg Description generation batch_69afcf12e3a0819098f28d31434a0c5f completed March 10, 2026, 7:58 a.m.
NED2 Entity disambiguation (via description) batch_69afcf9c2d308190b111aa8038c9227a completed March 10, 2026, 8 a.m.
Created at: March 6, 2026, 9:59 p.m.