{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P6F73SPYD4BWARWJSMYF37M5RT","short_pith_number":"pith:P6F73SPY","schema_version":"1.0","canonical_sha256":"7f8bfdc9f81f036046c993305dfd9d8cda6cb5d3e839c14d0f7d2cefb804ff42","source":{"kind":"arxiv","id":"1708.00552","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.00552","created_at":"2026-05-18T00:38:45.439888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00552v1","created_at":"2026-05-18T00:38:45.439888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00552","created_at":"2026-05-18T00:38:45.439888+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6F73SPYD4BW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6F73SPYD4BWARWJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6F73SPY","created_at":"2026-05-18T12:31:37.085036+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/P6F73SPYD4BWARWJSMYF37M5RT","json":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT.json","graph_json":"https://pith.science/api/pith-number/P6F73SPYD4BWARWJSMYF37M5RT/graph.json","events_json":"https://pith.science/api/pith-number/P6F73SPYD4BWARWJSMYF37M5RT/events.json","paper":"https://pith.science/paper/P6F73SPY"},"agent_actions":{"view_html":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT","download_json":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT.json","view_paper":"https://pith.science/paper/P6F73SPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00552&json=true","fetch_graph":"https://pith.science/api/pith-number/P6F73SPYD4BWARWJSMYF37M5RT/graph.json","fetch_events":"https://pith.science/api/pith-number/P6F73SPYD4BWARWJSMYF37M5RT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/action/storage_attestation","attest_author":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/action/author_attestation","sign_citation":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/action/citation_signature","submit_replication":"https://pith.science/pith/P6F73SPYD4BWARWJSMYF37M5RT/action/replication_record"}},"created_at":"2026-05-18T00:38:45.439888+00:00","updated_at":"2026-05-18T00:38:45.439888+00:00"}