Triple
T5425385
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gerd Faltings |
E121349
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Faltings' theorem
Faltings' theorem is a landmark result in arithmetic geometry that proves every algebraic curve of genus greater than one over a number field has only finitely many rational points.
|
E518465
|
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: Faltings' theorem | Statement: [Gerd Faltings, knownFor, Faltings' theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Faltings' theorem Context triple: [Gerd Faltings, knownFor, Faltings' theorem]
-
A.
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.
-
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.
Hasse bound for elliptic curves
The Hasse bound for elliptic curves is a fundamental result in number theory that gives tight limits on how far the number of points on an elliptic curve over a finite field can deviate from the size of the field plus one.
-
D.
Hermite–Minkowski theorem
The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
-
E.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
- 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: Faltings' theorem Triple: [Gerd Faltings, knownFor, Faltings' theorem]
Generated description
Faltings' theorem is a landmark result in arithmetic geometry that proves every algebraic curve of genus greater than one over a number field has only finitely many rational points.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Faltings' theorem Target entity description: Faltings' theorem is a landmark result in arithmetic geometry that proves every algebraic curve of genus greater than one over a number field has only finitely many rational points.
-
A.
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.
-
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.
Hasse bound for elliptic curves
The Hasse bound for elliptic curves is a fundamental result in number theory that gives tight limits on how far the number of points on an elliptic curve over a finite field can deviate from the size of the field plus one.
-
D.
Hermite–Minkowski theorem
The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
-
E.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
- 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_69bd463b58d88190b258261573de9e91 |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd881598448190a9bb456dee36004b |
completed | March 20, 2026, 5:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf3abfc7e88190b8f0a31b61c33973 |
completed | March 22, 2026, 12:41 a.m. |
| NEDg | Description generation | batch_69bf3b592a08819090e2873bcf4e797f |
completed | March 22, 2026, 12:44 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69bf3c0b9e5481909101eccbd55f24b2 |
completed | March 22, 2026, 12:47 a.m. |
Created at: March 20, 2026, 2:06 p.m.