Lattices over Bass Rings and Graph Agglomerations
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 We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring R through the factorization theory of the corresponding monoid T ( R ). Results of Levy–Wiegand and Levy–Odenthal together with a study of the local case yield an explicit description of T ( R ). The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations—a natural class of monoids serving as combinatorial models for the factorization theory of T ( R ). As a consequence, the monoid T ( R ) is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of T ( R ) and characterize when T ( R ) is half-factorial. (Factoriality, that is, torsion-free Krull–Remak–Schmidt–Azumaya, is characterized by a theorem of Levy–Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest.
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.000 | 0.000 |
| 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