Triple
T7997802
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Noether’s AF+BG theorem |
E186169
|
entity |
| Predicate | involves |
P1256
|
FINISHED |
| Object |
Bézout’s theorem
Bézout’s theorem is a fundamental result in algebraic geometry stating that, over an algebraically closed field, the number of intersection points of two projective plane curves (counted with multiplicity) equals the product of their degrees.
|
E705365
|
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: Bézout’s theorem | Statement: [Noether’s AF+BG theorem, involves, Bézout’s theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bézout’s theorem Context triple: [Noether’s AF+BG theorem, involves, Bézout’s theorem]
-
A.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
B.
Plücker formulas
Plücker formulas are classical algebraic geometry relations that connect the degree and singularities of plane algebraic curves with the invariants of their dual curves.
-
C.
Bombieri–Pila determinant method
The Bombieri–Pila determinant method is a technique in analytic and Diophantine geometry used to obtain upper bounds on the number of rational or integral points of bounded height lying on algebraic curves or more general sets.
-
D.
Chevalley’s theorem in algebraic geometry
Chevalley’s theorem in algebraic geometry is a fundamental result stating that the image of a morphism of finite type between schemes (or varieties) is a constructible set, playing a key role in understanding how geometric properties behave under mappings.
-
E.
Chevalley–Warning theorem
The Chevalley–Warning theorem is a result in number theory and algebraic geometry that gives conditions under which systems of polynomial equations over finite fields must have nontrivial solutions.
- 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: Bézout’s theorem Triple: [Noether’s AF+BG theorem, involves, Bézout’s theorem]
Generated description
Bézout’s theorem is a fundamental result in algebraic geometry stating that, over an algebraically closed field, the number of intersection points of two projective plane curves (counted with multiplicity) equals the product of their degrees.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bézout’s theorem Target entity description: Bézout’s theorem is a fundamental result in algebraic geometry stating that, over an algebraically closed field, the number of intersection points of two projective plane curves (counted with multiplicity) equals the product of their degrees.
-
A.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
B.
Plücker formulas
Plücker formulas are classical algebraic geometry relations that connect the degree and singularities of plane algebraic curves with the invariants of their dual curves.
-
C.
Bombieri–Pila determinant method
The Bombieri–Pila determinant method is a technique in analytic and Diophantine geometry used to obtain upper bounds on the number of rational or integral points of bounded height lying on algebraic curves or more general sets.
-
D.
Chevalley’s theorem in algebraic geometry
Chevalley’s theorem in algebraic geometry is a fundamental result stating that the image of a morphism of finite type between schemes (or varieties) is a constructible set, playing a key role in understanding how geometric properties behave under mappings.
-
E.
Chevalley–Warning theorem
The Chevalley–Warning theorem is a result in number theory and algebraic geometry that gives conditions under which systems of polynomial equations over finite fields must have nontrivial solutions.
- 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_69ca829c6c308190ab05b43d234c52b2 |
completed | March 30, 2026, 2:03 p.m. |
| NER | Named-entity recognition | batch_69cb3c98e39081908904d36a31bd6768 |
completed | March 31, 2026, 3:16 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cbe10d5eb081909f257390094de442 |
completed | March 31, 2026, 2:58 p.m. |
| NEDg | Description generation | batch_69cc46c221848190848c7e017e532a16 |
completed | March 31, 2026, 10:12 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69cc480d2f40819085046a1d0c9d05e0 |
completed | March 31, 2026, 10:17 p.m. |
Created at: March 30, 2026, 5:17 p.m.