Triple
T8733360
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hasse principle |
E207311
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object |
Brauer–Manin obstruction
The Brauer–Manin obstruction is an arithmetic-geometric mechanism using the Brauer group and adelic points to explain failures of the Hasse principle and weak approximation for rational points on varieties.
|
E753151
|
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: Brauer–Manin obstruction | Statement: [Hasse principle, relatedConcept, Brauer–Manin obstruction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Brauer–Manin obstruction Context triple: [Hasse principle, relatedConcept, Brauer–Manin obstruction]
-
A.
Hasse principle
The Hasse principle is a concept in number theory stating that a Diophantine equation has a rational solution if and only if it has solutions in all completions of the rationals, such as the real numbers and p-adic numbers.
-
B.
Standard Conjectures on Algebraic Cycles
The Standard Conjectures on Algebraic Cycles are a set of deep, still unproven hypotheses in algebraic geometry that aim to provide a foundational theory of algebraic cycles and their cohomological properties, underpinning much of the modern theory of motives.
-
C.
Bombieri–Lang conjecture
The Bombieri–Lang conjecture is a major unsolved conjecture in number theory and arithmetic geometry predicting that varieties of general type over number fields have only finitely many rational points.
-
D.
Hodge–Riemann bilinear relations
The Hodge–Riemann bilinear relations are fundamental positivity and orthogonality conditions on the intersection form in Hodge theory that underpin results such as the hard Lefschetz theorem and the Hodge index theorem.
-
E.
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.
- 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: Brauer–Manin obstruction Triple: [Hasse principle, relatedConcept, Brauer–Manin obstruction]
Generated description
The Brauer–Manin obstruction is an arithmetic-geometric mechanism using the Brauer group and adelic points to explain failures of the Hasse principle and weak approximation for rational points on varieties.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Brauer–Manin obstruction Target entity description: The Brauer–Manin obstruction is an arithmetic-geometric mechanism using the Brauer group and adelic points to explain failures of the Hasse principle and weak approximation for rational points on varieties.
-
A.
Hasse principle
The Hasse principle is a concept in number theory stating that a Diophantine equation has a rational solution if and only if it has solutions in all completions of the rationals, such as the real numbers and p-adic numbers.
-
B.
Standard Conjectures on Algebraic Cycles
The Standard Conjectures on Algebraic Cycles are a set of deep, still unproven hypotheses in algebraic geometry that aim to provide a foundational theory of algebraic cycles and their cohomological properties, underpinning much of the modern theory of motives.
-
C.
Bombieri–Lang conjecture
The Bombieri–Lang conjecture is a major unsolved conjecture in number theory and arithmetic geometry predicting that varieties of general type over number fields have only finitely many rational points.
-
D.
Hodge–Riemann bilinear relations
The Hodge–Riemann bilinear relations are fundamental positivity and orthogonality conditions on the intersection form in Hodge theory that underpin results such as the hard Lefschetz theorem and the Hodge index theorem.
-
E.
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.
- 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_69ca8358e4008190898471a59b96c301 |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cc5d2a26988190acfda17f232e610a |
completed | March 31, 2026, 11:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cf292d71ec819082095cb7b8b2d39c |
completed | April 3, 2026, 2:42 a.m. |
| NEDg | Description generation | batch_69cf2bd4f50c8190bad328e82d299ae0 |
completed | April 3, 2026, 2:54 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69cf2cbf60808190a006ee4fb26cde41 |
completed | April 3, 2026, 2:58 a.m. |
Created at: March 30, 2026, 6:37 p.m.