{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UNLN4MLFJOBCDAIXCVHLFXHISL","short_pith_number":"pith:UNLN4MLF","canonical_record":{"source":{"id":"1102.5518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-27T16:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"1582eff9933ef06dd81fff26c5396cc241749797bc526dadefa38396ebc0776f","abstract_canon_sha256":"77e0b7a7e09e17b1efdbbd0cf9ec3fe52593350fa0eb04fbfaec65241f408c90"},"schema_version":"1.0"},"canonical_sha256":"a356de31654b82218117154eb2dce892ced6e1ff4d16e725e2e6a22add1b05da","source":{"kind":"arxiv","id":"1102.5518","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5518","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5518v2","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5518","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"UNLN4MLFJOBC","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UNLN4MLFJOBCDAIX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UNLN4MLF","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UNLN4MLFJOBCDAIXCVHLFXHISL","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-27T16:10:38Z","cross_cats_sorted":[],"title_canon_sha256":"1582eff9933ef06dd81fff26c5396cc241749797bc526dadefa38396ebc0776f","abstract_canon_sha256":"77e0b7a7e09e17b1efdbbd0cf9ec3fe52593350fa0eb04fbfaec65241f408c90"},"schema_version":"1.0"},"canonical_sha256":"a356de31654b82218117154eb2dce892ced6e1ff4d16e725e2e6a22add1b05da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.367624Z","signature_b64":"Y9hqzR78k/9XKWTqE/B8juf1bmCiVg3lx4qWbK+nI6pxM1p6jf2RHGLfoVMxpuyeCIMuU7+mGH6pjjZ0VxzTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a356de31654b82218117154eb2dce892ced6e1ff4d16e725e2e6a22add1b05da","last_reissued_at":"2026-05-18T02:47:51.367103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.367103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5518","source_version":2,"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":"Fvelj+3ZppqdT1mEFXRQDzee2bPXllusiMVqpaCNNERsfO72F3dxVdw/p4aJYgyWc8GCsViGVfP8x2zI3HLIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:54:29.014824Z"},"content_sha256":"9c8c80db6494c97a88ccc0c11d6c5b9f89e853590be787bd38a42ce245eefcb9","schema_version":"1.0","event_id":"sha256:9c8c80db6494c97a88ccc0c11d6c5b9f89e853590be787bd38a42ce245eefcb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UNLN4MLFJOBCDAIXCVHLFXHISL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Denumerant of a Numerical Semigroup With Embedding Dimension Less Than Four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"James Hamblin, Lance Bryant, Lenny Jones","submitted_at":"2011-02-27T16:10:38Z","abstract_excerpt":"Given a numerical semigroup $S = < a_1, a_2,..., a_t>$ and $s\\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\\ge0$. Such a factorization is {\\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such factorizations of $s$. We show that the number of maximal factorizations, varying over the elements in $S$, is always bounded. Thus, we define $\\dx(S)$ to be the maximum number of maximal factorizations of elements in $S$. We study maximal factorizations in depth when $S$ has embedding dimension less than four, and establish formulas for $\\dx(S)$ in this ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5518","kind":"arxiv","version":2},"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":"4KKEOoFl0yeV8vWvHPD85flvd4oIh85Z0KSVEsoaQ2larmgVZNlPuc1K3BscCbECChkkiF44lZ4L8LvpcMHVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:54:29.015563Z"},"content_sha256":"20b3cbdb3e69dfa571e17c83c7df7812a52ac772605f57fcfe9c76f3c2bb0352","schema_version":"1.0","event_id":"sha256:20b3cbdb3e69dfa571e17c83c7df7812a52ac772605f57fcfe9c76f3c2bb0352"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/bundle.json","state_url":"https://pith.science/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/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-05-31T09:54:29Z","links":{"resolver":"https://pith.science/pith/UNLN4MLFJOBCDAIXCVHLFXHISL","bundle":"https://pith.science/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/bundle.json","state":"https://pith.science/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNLN4MLFJOBCDAIXCVHLFXHISL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UNLN4MLFJOBCDAIXCVHLFXHISL","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":"77e0b7a7e09e17b1efdbbd0cf9ec3fe52593350fa0eb04fbfaec65241f408c90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-27T16:10:38Z","title_canon_sha256":"1582eff9933ef06dd81fff26c5396cc241749797bc526dadefa38396ebc0776f"},"schema_version":"1.0","source":{"id":"1102.5518","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5518","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5518v2","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5518","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"UNLN4MLFJOBC","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UNLN4MLFJOBCDAIX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UNLN4MLF","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:20b3cbdb3e69dfa571e17c83c7df7812a52ac772605f57fcfe9c76f3c2bb0352","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_1, a_2,..., a_t>$ and $s\\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\\ge0$. Such a factorization is {\\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such factorizations of $s$. We show that the number of maximal factorizations, varying over the elements in $S$, is always bounded. Thus, we define $\\dx(S)$ to be the maximum number of maximal factorizations of elements in $S$. We study maximal factorizations in depth when $S$ has embedding dimension less than four, and establish formulas for $\\dx(S)$ in this ca","authors_text":"James Hamblin, Lance Bryant, Lenny Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-27T16:10:38Z","title":"Maximal Denumerant of a Numerical Semigroup With Embedding Dimension Less Than Four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5518","kind":"arxiv","version":2},"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:9c8c80db6494c97a88ccc0c11d6c5b9f89e853590be787bd38a42ce245eefcb9","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":"77e0b7a7e09e17b1efdbbd0cf9ec3fe52593350fa0eb04fbfaec65241f408c90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-02-27T16:10:38Z","title_canon_sha256":"1582eff9933ef06dd81fff26c5396cc241749797bc526dadefa38396ebc0776f"},"schema_version":"1.0","source":{"id":"1102.5518","kind":"arxiv","version":2}},"canonical_sha256":"a356de31654b82218117154eb2dce892ced6e1ff4d16e725e2e6a22add1b05da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a356de31654b82218117154eb2dce892ced6e1ff4d16e725e2e6a22add1b05da","first_computed_at":"2026-05-18T02:47:51.367103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:51.367103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y9hqzR78k/9XKWTqE/B8juf1bmCiVg3lx4qWbK+nI6pxM1p6jf2RHGLfoVMxpuyeCIMuU7+mGH6pjjZ0VxzTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:51.367624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5518","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c8c80db6494c97a88ccc0c11d6c5b9f89e853590be787bd38a42ce245eefcb9","sha256:20b3cbdb3e69dfa571e17c83c7df7812a52ac772605f57fcfe9c76f3c2bb0352"],"state_sha256":"2f1199bf6eb364de27d850c96e1c89a3052741e8547ebb2b185ff96247b40ca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUW5CttewBxXwH5hPH8XG+CHJCd+ajhrzuFIeiNoiT2cRvS0JC1HcONhYXHN1vF9dCjzPsKck+OFezuJKP0ZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:54:29.019431Z","bundle_sha256":"ff3a7eb263286df8036a83f6d0c3a5a3da27dc1b503487c04d80b3de8cd0d881"}}