{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MHWXC5WN2SMOVWHFBVJK2DSSYV","short_pith_number":"pith:MHWXC5WN","schema_version":"1.0","canonical_sha256":"61ed7176cdd498ead8e50d52ad0e52c569fec5b6b19bc13d12477591c91eb05c","source":{"kind":"arxiv","id":"1610.04407","version":1},"attestation_state":"computed","paper":{"title":"A zero-sum problem on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Wei{\\ss}auer","submitted_at":"2016-10-14T11:13:27Z","abstract_excerpt":"Call a graph $G$ zero-forcing for a finite abelian group $\\mathcal{G}$ if for every $\\ell : V(G) \\to \\mathcal{G}$ there is a connected $A \\subseteq V(G)$ with $\\sum_{a \\in A} \\ell(a) = 0$. The problem we pose here is to characterise the class of zero-forcing graphs. It is shown that a connected graph is zero-forcing for the cyclic group of prime order $p$ if and only if it has at least $p$ vertices. When $|\\mathcal{G}|$ is not prime, however, being zero-forcing is intimately linked to the structure of the graph. We obtain partial solutions for the general case, discuss computational issues and"},"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":"1610.04407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-14T11:13:27Z","cross_cats_sorted":[],"title_canon_sha256":"602162285bfba53772e3b9db6156966e282b8d6b9ad3925cee7677428251a41a","abstract_canon_sha256":"8afa7d41a2b3a42ba7fef42f5e86313421729d374e9fcb016c0c9d64ad37fd34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:15.314979Z","signature_b64":"AOHy3Q2DP+Vdv4OdsbKG1decFSDCOw42oZouYb0kh5Msi7e4sea0XRe+Y381f4CWdVcqbrKhbV+LlwOvuDJQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61ed7176cdd498ead8e50d52ad0e52c569fec5b6b19bc13d12477591c91eb05c","last_reissued_at":"2026-05-18T01:02:15.314297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:15.314297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A zero-sum problem on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Wei{\\ss}auer","submitted_at":"2016-10-14T11:13:27Z","abstract_excerpt":"Call a graph $G$ zero-forcing for a finite abelian group $\\mathcal{G}$ if for every $\\ell : V(G) \\to \\mathcal{G}$ there is a connected $A \\subseteq V(G)$ with $\\sum_{a \\in A} \\ell(a) = 0$. The problem we pose here is to characterise the class of zero-forcing graphs. It is shown that a connected graph is zero-forcing for the cyclic group of prime order $p$ if and only if it has at least $p$ vertices. When $|\\mathcal{G}|$ is not prime, however, being zero-forcing is intimately linked to the structure of the graph. We obtain partial solutions for the general case, discuss computational issues and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04407","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":"1610.04407","created_at":"2026-05-18T01:02:15.314390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04407v1","created_at":"2026-05-18T01:02:15.314390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04407","created_at":"2026-05-18T01:02:15.314390+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHWXC5WN2SMO","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHWXC5WN2SMOVWHF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHWXC5WN","created_at":"2026-05-18T12:30:32.724797+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/MHWXC5WN2SMOVWHFBVJK2DSSYV","json":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV.json","graph_json":"https://pith.science/api/pith-number/MHWXC5WN2SMOVWHFBVJK2DSSYV/graph.json","events_json":"https://pith.science/api/pith-number/MHWXC5WN2SMOVWHFBVJK2DSSYV/events.json","paper":"https://pith.science/paper/MHWXC5WN"},"agent_actions":{"view_html":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV","download_json":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV.json","view_paper":"https://pith.science/paper/MHWXC5WN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04407&json=true","fetch_graph":"https://pith.science/api/pith-number/MHWXC5WN2SMOVWHFBVJK2DSSYV/graph.json","fetch_events":"https://pith.science/api/pith-number/MHWXC5WN2SMOVWHFBVJK2DSSYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV/action/storage_attestation","attest_author":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV/action/author_attestation","sign_citation":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV/action/citation_signature","submit_replication":"https://pith.science/pith/MHWXC5WN2SMOVWHFBVJK2DSSYV/action/replication_record"}},"created_at":"2026-05-18T01:02:15.314390+00:00","updated_at":"2026-05-18T01:02:15.314390+00:00"}