Triple

T1994337
Position Surface form Disambiguated ID Type / Status
Subject Hilbert’s syzygy theorem E43323 entity
Predicate relatedTo P37 FINISHED
Object Castelnuovo–Mumford regularity
Castelnuovo–Mumford regularity is an invariant in commutative algebra and algebraic geometry that measures the complexity of the minimal graded free resolution of a module or sheaf, often used to control vanishing of cohomology and bounds on generators.
E223664 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: Castelnuovo–Mumford regularity | Statement: [Hilbert’s syzygy theorem, relatedTo, Castelnuovo–Mumford regularity]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Castelnuovo–Mumford regularity
Context triple: [Hilbert’s syzygy theorem, relatedTo, Castelnuovo–Mumford regularity]
  • A. Hilbert’s syzygy theorem
    Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
  • B. 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.
  • C. Hilbert’s fourteenth problem
    Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
  • D. Deuring reduction theorem
    The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
  • E. Hilbert basis theorem
    The Hilbert basis theorem is a fundamental result in commutative algebra stating that if a ring is Noetherian then any polynomial ring over it is also Noetherian, ensuring that ideals in such rings are finitely generated.
  • 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: Castelnuovo–Mumford regularity
Triple: [Hilbert’s syzygy theorem, relatedTo, Castelnuovo–Mumford regularity]
Generated description
Castelnuovo–Mumford regularity is an invariant in commutative algebra and algebraic geometry that measures the complexity of the minimal graded free resolution of a module or sheaf, often used to control vanishing of cohomology and bounds on generators.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Castelnuovo–Mumford regularity
Target entity description: Castelnuovo–Mumford regularity is an invariant in commutative algebra and algebraic geometry that measures the complexity of the minimal graded free resolution of a module or sheaf, often used to control vanishing of cohomology and bounds on generators.
  • A. Hilbert’s syzygy theorem
    Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
  • B. 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.
  • C. Hilbert’s fourteenth problem
    Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
  • D. Deuring reduction theorem
    The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
  • E. Hilbert basis theorem
    The Hilbert basis theorem is a fundamental result in commutative algebra stating that if a ring is Noetherian then any polynomial ring over it is also Noetherian, ensuring that ideals in such rings are finitely generated.
  • 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_69a88714cf2c819081644be450b8356e completed March 4, 2026, 7:25 p.m.
NER Named-entity recognition batch_69abb8640f30819080322bddb85881f1 completed March 7, 2026, 5:32 a.m.
NED1 Entity disambiguation (via context triple) batch_69ae033c6cf88190acf6418f0d784914 completed March 8, 2026, 11:16 p.m.
NEDg Description generation batch_69ae03c4faac8190a13aa0882eda3629 completed March 8, 2026, 11:18 p.m.
NED2 Entity disambiguation (via description) batch_69ae0445a9608190918a7bd45b9bf999 completed March 8, 2026, 11:20 p.m.
Created at: March 4, 2026, 7:37 p.m.