Triple
T11365714
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gerhard Frey |
E269198
|
entity |
| Predicate | contributedTo |
P37
|
FINISHED |
| Object |
modularity conjecture
The modularity conjecture is a central statement in number theory asserting that every elliptic curve over the rational numbers corresponds to a modular form, a result whose proof underpins the modern proof of Fermat’s Last Theorem.
|
E921625
|
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: modularity conjecture | Statement: [Gerhard Frey, contributedTo, modularity conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: modularity conjecture Context triple: [Gerhard Frey, contributedTo, modularity conjecture]
-
A.
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.
-
B.
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.
-
C.
Monstrous Moonshine conjecture
The Monstrous Moonshine conjecture is a famous result in mathematics that reveals a deep and unexpected connection between the Monster finite simple group and modular functions in number theory.
-
D.
Fontaine–Mazur conjecture
The Fontaine–Mazur conjecture is a central open problem in number theory that predicts which p-adic Galois representations of number fields arise from geometry or from automorphic forms.
-
E.
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.
- 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: modularity conjecture Triple: [Gerhard Frey, contributedTo, modularity conjecture]
Generated description
The modularity conjecture is a central statement in number theory asserting that every elliptic curve over the rational numbers corresponds to a modular form, a result whose proof underpins the modern proof of Fermat’s Last Theorem.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: modularity conjecture Target entity description: The modularity conjecture is a central statement in number theory asserting that every elliptic curve over the rational numbers corresponds to a modular form, a result whose proof underpins the modern proof of Fermat’s Last Theorem.
-
A.
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.
-
B.
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.
-
C.
Monstrous Moonshine conjecture
The Monstrous Moonshine conjecture is a famous result in mathematics that reveals a deep and unexpected connection between the Monster finite simple group and modular functions in number theory.
-
D.
Fontaine–Mazur conjecture
The Fontaine–Mazur conjecture is a central open problem in number theory that predicts which p-adic Galois representations of number fields arise from geometry or from automorphic forms.
-
E.
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.
- 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_69d6aacca1048190b39dbbc2174616fa |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7ea88558c8190aa18881af51a7b96 |
completed | April 9, 2026, 6:06 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e55667d4908190b6290135eba41e54 |
completed | April 19, 2026, 10:25 p.m. |
| NEDg | Description generation | batch_69e562c6e7c8819098d22a6e0daa4a51 |
completed | April 19, 2026, 11:18 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e56a472f0c819086c1cccaa5ca0ae7 |
completed | April 19, 2026, 11:50 p.m. |
Created at: April 8, 2026, 9:33 p.m.