{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P6F73SPYD4BWARWJSMYF37M5RT","short_pith_number":"pith:P6F73SPY","canonical_record":{"source":{"id":"1708.00552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T23:52:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a840b246f54cc6400598ac4812c14864b2e8518cc24ba8f56a6589d02d364399","abstract_canon_sha256":"8bf394d458f67a9a896eb25ca76bac5a7089eda25e98ad35aeafc9535760bd81"},"schema_version":"1.0"},"canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","source":{"kind":"arxiv","id":"1708.00552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00552","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00552v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00552","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"P6F73SPYD4BW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P6F73SPYD4BWARWJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P6F73SPY","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P6F73SPYD4BWARWJSMYF37M5RT","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T23:52:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a840b246f54cc6400598ac4812c14864b2e8518cc24ba8f56a6589d02d364399","abstract_canon_sha256":"8bf394d458f67a9a896eb25ca76bac5a7089eda25e98ad35aeafc9535760bd81"},"schema_version":"1.0"},"canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.440434Z","signature_b64":"pUCD4jrTVMylGVog7H9ikaa8EtAGSE7IaBQot9XNLQd2uzMz1hnQN+rHf9vpadebHvCS4ZpdXmUIHOpKn0JrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","last_reissued_at":"2026-05-18T00:38:45.439791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.439791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00552","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCjWFNg6KOyXDWi/ESlhv6lYQJd6DybL4hFu7P/VIDyJAEaEOvg5E8onzpZthXTnNH+B4YrDzmBMI+rSPCqmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:49:07.737581Z"},"content_sha256":"ff271e494a8910e364c872bce14a60db92fdbd990e3d9a6e7c517d7db15ffb51","schema_version":"1.0","event_id":"sha256:ff271e494a8910e364c872bce14a60db92fdbd990e3d9a6e7c517d7db15ffb51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P6F73SPYD4BWARWJSMYF37M5RT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Sum Labeling of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jakub Pek\\'arek, Jana Novotn\\'a, Martin T\\\"opfer, Mat\\v{e}j Kone\\v{c}n\\'y, Stanislav Ku\\v{c}era, \\v{S}t\\v{e}p\\'an \\v{S}imsa","submitted_at":"2017-08-01T23:52:46Z","abstract_excerpt":"A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\\ell: V(G) \\rightarrow \\mathbb{N}$ such that for every $u,v\\in V(G)$ it holds that $uv\\in E(G)$ if and only if there exists a vertex $w\\in V(G)$ such that $\\ell(u)+\\ell(v) = \\ell(w)$. We say that sum labeling $\\ell$ is minimal if there is a vertex $u\\in V(G)$ such that $\\ell(u)=1$. In this paper, we show that if we relax the conditions (either allow non-injective labelings or consider graphs with loops) then there are sum graphs without a minimal labeling, which partially answers the ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00552","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UlB7/QpvUk6OiMmfohBzWme/em70GBwT+Cqv4l94gTRaVVxrqDmIaAkQFXAtcS6A3Ibr97qwGPgl0W/llpPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:49:07.737973Z"},"content_sha256":"abfcc8039d0198542f580941fb17b5e2643dfe8694e92f65156c25519847a385","schema_version":"1.0","event_id":"sha256:abfcc8039d0198542f580941fb17b5e2643dfe8694e92f65156c25519847a385"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/bundle.json","state_url":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6F73SPYD4BWARWJSMYF37M5RT/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-05T18:49:07Z","links":{"resolver":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT","bundle":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/bundle.json","state":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6F73SPYD4BWARWJSMYF37M5RT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P6F73SPYD4BWARWJSMYF37M5RT","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":"8bf394d458f67a9a896eb25ca76bac5a7089eda25e98ad35aeafc9535760bd81","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T23:52:46Z","title_canon_sha256":"a840b246f54cc6400598ac4812c14864b2e8518cc24ba8f56a6589d02d364399"},"schema_version":"1.0","source":{"id":"1708.00552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00552","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00552v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00552","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"P6F73SPYD4BW","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P6F73SPYD4BWARWJ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P6F73SPY","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:abfcc8039d0198542f580941fb17b5e2643dfe8694e92f65156c25519847a385","target":"graph","created_at":"2026-05-18T00:38:45Z","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":"A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\\ell: V(G) \\rightarrow \\mathbb{N}$ such that for every $u,v\\in V(G)$ it holds that $uv\\in E(G)$ if and only if there exists a vertex $w\\in V(G)$ such that $\\ell(u)+\\ell(v) = \\ell(w)$. We say that sum labeling $\\ell$ is minimal if there is a vertex $u\\in V(G)$ such that $\\ell(u)=1$. In this paper, we show that if we relax the conditions (either allow non-injective labelings or consider graphs with loops) then there are sum graphs without a minimal labeling, which partially answers the ques","authors_text":"Jakub Pek\\'arek, Jana Novotn\\'a, Martin T\\\"opfer, Mat\\v{e}j Kone\\v{c}n\\'y, Stanislav Ku\\v{c}era, \\v{S}t\\v{e}p\\'an \\v{S}imsa","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T23:52:46Z","title":"Minimal Sum Labeling of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00552","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:ff271e494a8910e364c872bce14a60db92fdbd990e3d9a6e7c517d7db15ffb51","target":"record","created_at":"2026-05-18T00:38:45Z","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":"8bf394d458f67a9a896eb25ca76bac5a7089eda25e98ad35aeafc9535760bd81","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T23:52:46Z","title_canon_sha256":"a840b246f54cc6400598ac4812c14864b2e8518cc24ba8f56a6589d02d364399"},"schema_version":"1.0","source":{"id":"1708.00552","kind":"arxiv","version":1}},"canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","first_computed_at":"2026-05-18T00:38:45.439791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:45.439791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pUCD4jrTVMylGVog7H9ikaa8EtAGSE7IaBQot9XNLQd2uzMz1hnQN+rHf9vpadebHvCS4ZpdXmUIHOpKn0JrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:45.440434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff271e494a8910e364c872bce14a60db92fdbd990e3d9a6e7c517d7db15ffb51","sha256:abfcc8039d0198542f580941fb17b5e2643dfe8694e92f65156c25519847a385"],"state_sha256":"37c1fe96de73a8a2b1ada489504e4a03db8a5bea4da4e0b2d0ab9135d0ad24d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4C4nn7Lx8Yl6VGtHMDNGUj9I88J/EXOzCrAs1IuCirpFsK1viEoqOsJqeW5Tui8LjFOeVQmUN+SRiMaRcDvjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:49:07.740662Z","bundle_sha256":"ba56c5db3ab793ca31faa12e0295f753e7b24ed5cdfacde8668bfb8569cb8d44"}}