{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DVLILGC5M6FNDCM4ATVMZKQ5CX","short_pith_number":"pith:DVLILGC5","schema_version":"1.0","canonical_sha256":"1d5685985d678ad1899c04eaccaa1d15e28e10d7f15ef56bc14c846e36db128e","source":{"kind":"arxiv","id":"1701.08555","version":1},"attestation_state":"computed","paper":{"title":"Minimal presentations of shifted numerical monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Brian Wissman, Christopher O'Neill, Felix Gotti, Jesse Horton, Mesa Williams, Rebecca Conaway, Roberto Pelayo","submitted_at":"2017-01-30T11:38:18Z","abstract_excerpt":"A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of \"shifted\" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal relations among the generators of $M_n$ when $n$ is sufficiently large, culminating in a description that is periodic in the shift parameter $n$. We explore several applications to computation, combinatorial commutative algebra, and factorization theory."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.08555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-01-30T11:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"796da64ff63d413609d2f94bedfb99cc4196152ab6f2afd20d1bed59c9726983","abstract_canon_sha256":"17ee6763aa7a92a178f33139f5b34484091c2fbd9fea396758a0e879a60b0aba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:16.271903Z","signature_b64":"EgR/FaTZQ6g5N7ceW2WYHFuboF7P+dK1rCM7ILEOGuJS68fhdf8V4ALwHh2e4bvOcIamYMNTaCoA2IJSC1vPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d5685985d678ad1899c04eaccaa1d15e28e10d7f15ef56bc14c846e36db128e","last_reissued_at":"2026-05-18T00:08:16.271441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:16.271441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal presentations of shifted numerical monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Brian Wissman, Christopher O'Neill, Felix Gotti, Jesse Horton, Mesa Williams, Rebecca Conaway, Roberto Pelayo","submitted_at":"2017-01-30T11:38:18Z","abstract_excerpt":"A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of \"shifted\" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal relations among the generators of $M_n$ when $n$ is sufficiently large, culminating in a description that is periodic in the shift parameter $n$. We explore several applications to computation, combinatorial commutative algebra, and factorization theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08555","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.08555","created_at":"2026-05-18T00:08:16.271511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08555v1","created_at":"2026-05-18T00:08:16.271511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08555","created_at":"2026-05-18T00:08:16.271511+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVLILGC5M6FN","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVLILGC5M6FNDCM4","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVLILGC5","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX","json":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX.json","graph_json":"https://pith.science/api/pith-number/DVLILGC5M6FNDCM4ATVMZKQ5CX/graph.json","events_json":"https://pith.science/api/pith-number/DVLILGC5M6FNDCM4ATVMZKQ5CX/events.json","paper":"https://pith.science/paper/DVLILGC5"},"agent_actions":{"view_html":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX","download_json":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX.json","view_paper":"https://pith.science/paper/DVLILGC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08555&json=true","fetch_graph":"https://pith.science/api/pith-number/DVLILGC5M6FNDCM4ATVMZKQ5CX/graph.json","fetch_events":"https://pith.science/api/pith-number/DVLILGC5M6FNDCM4ATVMZKQ5CX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX/action/storage_attestation","attest_author":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX/action/author_attestation","sign_citation":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX/action/citation_signature","submit_replication":"https://pith.science/pith/DVLILGC5M6FNDCM4ATVMZKQ5CX/action/replication_record"}},"created_at":"2026-05-18T00:08:16.271511+00:00","updated_at":"2026-05-18T00:08:16.271511+00:00"}