Triple
T9297117
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Castelnuovo–Mumford regularity |
E223664
|
entity |
| Predicate | studiedIn |
P770
|
FINISHED |
| Object |
Eisenbud’s Commutative Algebra
Eisenbud’s *Commutative Algebra* is a widely used graduate-level textbook that develops modern commutative algebra with strong connections to algebraic geometry, featuring topics such as free resolutions, syzygies, and Castelnuovo–Mumford regularity.
|
E790524
|
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: Eisenbud’s Commutative Algebra | Statement: [Castelnuovo–Mumford regularity, studiedIn, Eisenbud’s Commutative Algebra]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Eisenbud’s Commutative Algebra Context triple: [Castelnuovo–Mumford regularity, studiedIn, Eisenbud’s Commutative Algebra]
-
A.
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.
-
B.
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.
-
C.
Auslander–Buchsbaum formula
The Auslander–Buchsbaum formula is a fundamental result in commutative algebra that relates the projective dimension of a finitely generated module over a Noetherian local ring to the depth of the module and the depth of the ring.
-
D.
Lasker–Noether theorem on primary decomposition
The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
-
E.
Krull–Gabriel dimension
Krull–Gabriel dimension is a refinement of Krull dimension used in the representation theory of rings and abelian categories to measure the complexity of their subobject lattices and module categories.
- 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: Eisenbud’s Commutative Algebra Triple: [Castelnuovo–Mumford regularity, studiedIn, Eisenbud’s Commutative Algebra]
Generated description
Eisenbud’s *Commutative Algebra* is a widely used graduate-level textbook that develops modern commutative algebra with strong connections to algebraic geometry, featuring topics such as free resolutions, syzygies, and Castelnuovo–Mumford regularity.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Eisenbud’s Commutative Algebra Target entity description: Eisenbud’s *Commutative Algebra* is a widely used graduate-level textbook that develops modern commutative algebra with strong connections to algebraic geometry, featuring topics such as free resolutions, syzygies, and Castelnuovo–Mumford regularity.
-
A.
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.
-
B.
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.
-
C.
Auslander–Buchsbaum formula
The Auslander–Buchsbaum formula is a fundamental result in commutative algebra that relates the projective dimension of a finitely generated module over a Noetherian local ring to the depth of the module and the depth of the ring.
-
D.
Lasker–Noether theorem on primary decomposition
The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
-
E.
Krull–Gabriel dimension
Krull–Gabriel dimension is a refinement of Krull dimension used in the representation theory of rings and abelian categories to measure the complexity of their subobject lattices and module categories.
- 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_69ca8423edb08190bc0c91287a484768 |
completed | March 30, 2026, 2:09 p.m. |
| NER | Named-entity recognition | batch_69cd089e3ae88190aa4181cdd85a67b8 |
completed | April 1, 2026, 11:59 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d0b251c4148190a94fafdc23a601d6 |
completed | April 4, 2026, 6:40 a.m. |
| NEDg | Description generation | batch_69d0b65ea4548190b445563ac695b008 |
completed | April 4, 2026, 6:57 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d0b6f504a48190878db828312e8a97 |
completed | April 4, 2026, 7 a.m. |
Created at: March 30, 2026, 7:36 p.m.