{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SSRQSVVX5KURBWZVBC2QAS33A2","short_pith_number":"pith:SSRQSVVX","canonical_record":{"source":{"id":"1208.3167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-08-15T18:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"974891c5cc5e312fe642d254b3c33fb7e25fc888b00ae2df7fb2d67aacdcea7c","abstract_canon_sha256":"90549d8bbe61a6990cc6af94917d6445f376e1eb6826870263237e79b25f6c00"},"schema_version":"1.0"},"canonical_sha256":"94a30956b7eaa910db3508b5004b7b068245eaa7c828482bd55fc2d1d5b0bcae","source":{"kind":"arxiv","id":"1208.3167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3167","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3167v1","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3167","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"SSRQSVVX5KUR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SSRQSVVX5KURBWZV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SSRQSVVX","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SSRQSVVX5KURBWZVBC2QAS33A2","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-08-15T18:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"974891c5cc5e312fe642d254b3c33fb7e25fc888b00ae2df7fb2d67aacdcea7c","abstract_canon_sha256":"90549d8bbe61a6990cc6af94917d6445f376e1eb6826870263237e79b25f6c00"},"schema_version":"1.0"},"canonical_sha256":"94a30956b7eaa910db3508b5004b7b068245eaa7c828482bd55fc2d1d5b0bcae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.163117Z","signature_b64":"NdgBLXwnLsdOGZTdj/Pn5l+TLSz/B2asLjLqJ28lvmc0MpGGDUJYiCAC2BrpmnWvCMEZBfvdqs0lCvB2dJPZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a30956b7eaa910db3508b5004b7b068245eaa7c828482bd55fc2d1d5b0bcae","last_reissued_at":"2026-05-18T02:47:51.162440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.162440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3167","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVE/TM2LKNkGm/P4zQ8T8VfpsMJSV5RWmkgDZZJLxmDmvYlfvvfaFHIdNmwb4HPL9fYsUMMJijpgw7yh0gyMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:39:46.131940Z"},"content_sha256":"eda1967fb24a1055b7c8b2cfdb4c1a8c23126dedca610bfa0989061b5cadf48a","schema_version":"1.0","event_id":"sha256:eda1967fb24a1055b7c8b2cfdb4c1a8c23126dedca610bfa0989061b5cadf48a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SSRQSVVX5KURBWZVBC2QAS33A2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximal Denumerant of a Numerical Semigroup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"James Hamblin, Lance Bryant","submitted_at":"2012-08-15T18:05:14Z","abstract_excerpt":"Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such factorizations of n. We provide an algorithm for computing the maximum number of maximal factorizations possible for an element in S, which is called the maximal denumerant of S. We also consider various cases that have connections to the Cohen-Macualay and Gorenstein properties of associated graded rings for which this algorithm simplifies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3167","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8dYSxeaNTyl9aINhxG+lIcJLvc91KQnNpFZnucOnJgKsEcIh281lSZ8vhQlCju2a1B54h/D0/f3tJzfv38RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:39:46.132651Z"},"content_sha256":"bd2e104c84bb02ae463c5d73962e3d169dcceb83cdd9e34cee8f05be77103721","schema_version":"1.0","event_id":"sha256:bd2e104c84bb02ae463c5d73962e3d169dcceb83cdd9e34cee8f05be77103721"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSRQSVVX5KURBWZVBC2QAS33A2/bundle.json","state_url":"https://pith.science/pith/SSRQSVVX5KURBWZVBC2QAS33A2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSRQSVVX5KURBWZVBC2QAS33A2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T02:39:46Z","links":{"resolver":"https://pith.science/pith/SSRQSVVX5KURBWZVBC2QAS33A2","bundle":"https://pith.science/pith/SSRQSVVX5KURBWZVBC2QAS33A2/bundle.json","state":"https://pith.science/pith/SSRQSVVX5KURBWZVBC2QAS33A2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSRQSVVX5KURBWZVBC2QAS33A2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SSRQSVVX5KURBWZVBC2QAS33A2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"90549d8bbe61a6990cc6af94917d6445f376e1eb6826870263237e79b25f6c00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-08-15T18:05:14Z","title_canon_sha256":"974891c5cc5e312fe642d254b3c33fb7e25fc888b00ae2df7fb2d67aacdcea7c"},"schema_version":"1.0","source":{"id":"1208.3167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3167","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3167v1","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3167","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"SSRQSVVX5KUR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SSRQSVVX5KURBWZV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SSRQSVVX","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:bd2e104c84bb02ae463c5d73962e3d169dcceb83cdd9e34cee8f05be77103721","target":"graph","created_at":"2026-05-18T02:47:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such factorizations of n. We provide an algorithm for computing the maximum number of maximal factorizations possible for an element in S, which is called the maximal denumerant of S. We also consider various cases that have connections to the Cohen-Macualay and Gorenstein properties of associated graded rings for which this algorithm simplifies.","authors_text":"James Hamblin, Lance Bryant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-08-15T18:05:14Z","title":"The Maximal Denumerant of a Numerical Semigroup"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3167","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eda1967fb24a1055b7c8b2cfdb4c1a8c23126dedca610bfa0989061b5cadf48a","target":"record","created_at":"2026-05-18T02:47:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"90549d8bbe61a6990cc6af94917d6445f376e1eb6826870263237e79b25f6c00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-08-15T18:05:14Z","title_canon_sha256":"974891c5cc5e312fe642d254b3c33fb7e25fc888b00ae2df7fb2d67aacdcea7c"},"schema_version":"1.0","source":{"id":"1208.3167","kind":"arxiv","version":1}},"canonical_sha256":"94a30956b7eaa910db3508b5004b7b068245eaa7c828482bd55fc2d1d5b0bcae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94a30956b7eaa910db3508b5004b7b068245eaa7c828482bd55fc2d1d5b0bcae","first_computed_at":"2026-05-18T02:47:51.162440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:51.162440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdgBLXwnLsdOGZTdj/Pn5l+TLSz/B2asLjLqJ28lvmc0MpGGDUJYiCAC2BrpmnWvCMEZBfvdqs0lCvB2dJPZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:51.163117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda1967fb24a1055b7c8b2cfdb4c1a8c23126dedca610bfa0989061b5cadf48a","sha256:bd2e104c84bb02ae463c5d73962e3d169dcceb83cdd9e34cee8f05be77103721"],"state_sha256":"8f85895f0842fcc9d364f1fef7ecce6e5ca08f59700111fe8cc6ae2e131acf94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Req+nIp9ovS3ih7TsHoAXfsKKV2Ky1zbZoV8WvxB+cmsgbfNMbD5gWdZIRjgulYFD9FayrL+co8Vu9eMnklfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:39:46.135765Z","bundle_sha256":"b52fc9dba77dc703ebdca7abe9e7619b26451240769f0aa79f162f4528e5b27a"}}