Triple

T4962225
Position Surface form Disambiguated ID Type / Status
Subject Kurt Hensel E111434 entity
Predicate hasEponym P12247 FINISHED
Object Hensel’s lemma
Hensel’s lemma is a fundamental result in number theory and p-adic analysis that allows one to lift solutions of polynomial congruences modulo a prime power to higher powers, analogous to Newton’s method in the p-adic setting.
E483408 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: Hensel’s lemma | Statement: [Kurt Hensel, hasEponym, Hensel’s lemma]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hensel’s lemma
Context triple: [Kurt Hensel, hasEponym, Hensel’s lemma]
  • A. Hasse–Arf theorem
    The Hasse–Arf theorem is a fundamental result in algebraic number theory that precisely characterizes the jumps in the ramification filtration of abelian extensions of local fields, showing they occur at integer values.
  • B. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • C. Hilbert’s irreducibility theorem
    Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
  • D. 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.
  • E. 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.
  • 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: Hensel’s lemma
Triple: [Kurt Hensel, hasEponym, Hensel’s lemma]
Generated description
Hensel’s lemma is a fundamental result in number theory and p-adic analysis that allows one to lift solutions of polynomial congruences modulo a prime power to higher powers, analogous to Newton’s method in the p-adic setting.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hensel’s lemma
Target entity description: Hensel’s lemma is a fundamental result in number theory and p-adic analysis that allows one to lift solutions of polynomial congruences modulo a prime power to higher powers, analogous to Newton’s method in the p-adic setting.
  • A. Hasse–Arf theorem
    The Hasse–Arf theorem is a fundamental result in algebraic number theory that precisely characterizes the jumps in the ramification filtration of abelian extensions of local fields, showing they occur at integer values.
  • B. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • C. Hilbert’s irreducibility theorem
    Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
  • D. 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.
  • E. 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.
  • 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_69bd4419393c819086319a6fe4bf8542 completed March 20, 2026, 12:56 p.m.
NER Named-entity recognition batch_69bd71f3e6148190b99f35734220ffc3 completed March 20, 2026, 4:12 p.m.
NED1 Entity disambiguation (via context triple) batch_69be81ea8cc08190af40098ca99364f1 completed March 21, 2026, 11:32 a.m.
NEDg Description generation batch_69be82dcc280819098eac824370b1af0 completed March 21, 2026, 11:37 a.m.
NED2 Entity disambiguation (via description) batch_69be8349507481908643591de7f03f42 completed March 21, 2026, 11:38 a.m.
Created at: March 20, 2026, 1:32 p.m.