Triple

T10550215
Position Surface form Disambiguated ID Type / Status
Subject Robert Langlands E248927 entity
Predicate knownFor P22 FINISHED
Object reciprocity conjecture
The reciprocity conjecture is a far-reaching set of ideas in number theory and representation theory that generalizes classical reciprocity laws by relating Galois groups to automorphic forms within the Langlands program.
E870216 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: reciprocity conjecture | Statement: [Robert Langlands, knownFor, reciprocity conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: reciprocity conjecture
Context triple: [Robert Langlands, knownFor, reciprocity conjecture]
  • A. Tate Conjecture
    The Tate Conjecture is a major open problem in arithmetic geometry that predicts a deep connection between algebraic cycles on varieties over finite fields and their Galois-invariant étale cohomology classes.
  • B. Birch and Swinnerton-Dyer Conjecture
    The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
  • C. Ramanujan–Petersson conjecture
    The Ramanujan–Petersson conjecture is a fundamental statement in number theory and the theory of modular forms that predicts strong bounds on the Fourier coefficients of modular cusp forms, with deep connections to automorphic forms and the Langlands program.
  • 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. Taniyama–Shimura–Weil conjecture
    The Taniyama–Shimura–Weil conjecture, now the modularity theorem, asserts that every elliptic curve over the rational numbers is modular and played a central role in the proof of Fermat’s Last Theorem.
  • 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: reciprocity conjecture
Triple: [Robert Langlands, knownFor, reciprocity conjecture]
Generated description
The reciprocity conjecture is a far-reaching set of ideas in number theory and representation theory that generalizes classical reciprocity laws by relating Galois groups to automorphic forms within the Langlands program.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: reciprocity conjecture
Target entity description: The reciprocity conjecture is a far-reaching set of ideas in number theory and representation theory that generalizes classical reciprocity laws by relating Galois groups to automorphic forms within the Langlands program.
  • A. Tate Conjecture
    The Tate Conjecture is a major open problem in arithmetic geometry that predicts a deep connection between algebraic cycles on varieties over finite fields and their Galois-invariant étale cohomology classes.
  • B. Birch and Swinnerton-Dyer Conjecture
    The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
  • C. Ramanujan–Petersson conjecture
    The Ramanujan–Petersson conjecture is a fundamental statement in number theory and the theory of modular forms that predicts strong bounds on the Fourier coefficients of modular cusp forms, with deep connections to automorphic forms and the Langlands program.
  • 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. Taniyama–Shimura–Weil conjecture
    The Taniyama–Shimura–Weil conjecture, now the modularity theorem, asserts that every elliptic curve over the rational numbers is modular and played a central role in the proof of Fermat’s Last Theorem.
  • 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_69d381c733c08190ab1dd6239f5f34ae completed April 6, 2026, 9:49 a.m.
NER Named-entity recognition batch_69d526d3e45c819099b360f9cfd3dd50 completed April 7, 2026, 3:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69d934639b3481908204db41101132c3 completed April 10, 2026, 5:33 p.m.
NEDg Description generation batch_69d938c8b25c8190bb048053d8668e5c completed April 10, 2026, 5:52 p.m.
NED2 Entity disambiguation (via description) batch_69d939b1844881908c8fbcb9488863f6 completed April 10, 2026, 5:56 p.m.
Created at: April 6, 2026, 12:34 p.m.