{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O2IYKTADTMIDABC2QDTSDY66ER","short_pith_number":"pith:O2IYKTAD","schema_version":"1.0","canonical_sha256":"7691854c039b1030045a80e721e3de247d35a9b490f323d4e6d2539e071c9532","source":{"kind":"arxiv","id":"1101.4112","version":1},"attestation_state":"computed","paper":{"title":"Integer Programming and m-irreducibility of numerical semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.OC","authors_text":"Justo Puerto, V\\'ictor Blanco","submitted_at":"2011-01-21T11:30:44Z","abstract_excerpt":"This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series of several discrete optimization problems. First, we prove that finding a minimal m-irreducible decomposition is equivalent to solve a multiobjective linear integer problem. Then, we restate that problem as the problem of finding all the optimal solutions of a finite number of single objective integer linear problems plus a set covering problem. Finally, we p"},"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":"1101.4112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-21T11:30:44Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"504f4aa90a8f4f4ea15f240caa486361538742f99cb25895ed434ff30181259e","abstract_canon_sha256":"600a8588b32ac137179e8dcf9609f9a8f361af1614a06f0b33d25f1c8e3791c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.679546Z","signature_b64":"HTIwjcQqrqr8yXwHTWmN4TiVyeA1mpBFqUIoYpPNFqBvnhhIsSZbFpD8xATkp7+bOJ/+M8fJhartJvBwRUmkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7691854c039b1030045a80e721e3de247d35a9b490f323d4e6d2539e071c9532","last_reissued_at":"2026-05-18T04:31:12.679054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.679054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer Programming and m-irreducibility of numerical semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.OC","authors_text":"Justo Puerto, V\\'ictor Blanco","submitted_at":"2011-01-21T11:30:44Z","abstract_excerpt":"This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series of several discrete optimization problems. First, we prove that finding a minimal m-irreducible decomposition is equivalent to solve a multiobjective linear integer problem. Then, we restate that problem as the problem of finding all the optimal solutions of a finite number of single objective integer linear problems plus a set covering problem. Finally, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4112","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":"1101.4112","created_at":"2026-05-18T04:31:12.679127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4112v1","created_at":"2026-05-18T04:31:12.679127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4112","created_at":"2026-05-18T04:31:12.679127+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2IYKTADTMID","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2IYKTADTMIDABC2","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2IYKTAD","created_at":"2026-05-18T12:26:37.096874+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/O2IYKTADTMIDABC2QDTSDY66ER","json":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER.json","graph_json":"https://pith.science/api/pith-number/O2IYKTADTMIDABC2QDTSDY66ER/graph.json","events_json":"https://pith.science/api/pith-number/O2IYKTADTMIDABC2QDTSDY66ER/events.json","paper":"https://pith.science/paper/O2IYKTAD"},"agent_actions":{"view_html":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER","download_json":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER.json","view_paper":"https://pith.science/paper/O2IYKTAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4112&json=true","fetch_graph":"https://pith.science/api/pith-number/O2IYKTADTMIDABC2QDTSDY66ER/graph.json","fetch_events":"https://pith.science/api/pith-number/O2IYKTADTMIDABC2QDTSDY66ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER/action/storage_attestation","attest_author":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER/action/author_attestation","sign_citation":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER/action/citation_signature","submit_replication":"https://pith.science/pith/O2IYKTADTMIDABC2QDTSDY66ER/action/replication_record"}},"created_at":"2026-05-18T04:31:12.679127+00:00","updated_at":"2026-05-18T04:31:12.679127+00:00"}