Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen–Macaulay subscheme of can be G‐linked to a complete intersection. Migliore and Nagel showed that if such a scheme is generically Gorenstein (e.g., reduced), then, after re‐embedding so that it is viewed as a subscheme of , indeed it can be G‐linked to a complete intersection. Motivated by this result, we consider techniques for constructing G‐links on a scheme from G‐links on a closely related reduced scheme. Polarization is a tool for producing a squarefree monomial ideal from an arbitrary monomial ideal. Basic double G‐links on squarefree monomial ideals can be induced from vertex decompositions of their Stanley–Reisner complexes. Given a monomial ideal and a vertex decomposition of the Stanley–Reisner complex of its polarization , we give conditions that allow for the lifting of an associated basic double G‐link of to a basic double G‐link of itself. We use the relationship we develop in the process to show that the Stanley–Reisner complexes of polarizations of stable Cohen– Macaulay monomial ideals are vertex decomposable. We then introduce and study polarization of a Gröbner basis of an arbitrary homogeneous ideal and give a relationship between geometric vertex decomposition of a polarization and elementary G‐biliaison that is analogous to our result on vertex decomposition and basic double G‐linkage.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it