{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CNEDDBU32ZQMWHDU34FMZW2TH3","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":"1b9fb551b76185e8f609fabf8654467a1e00e0c8c7f84609de8749b47cfa80a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T15:39:54Z","title_canon_sha256":"ea432805629b867010715c1e2d2461d98ecd2dd3ed0c4dd983862d67966e11b3"},"schema_version":"1.0","source":{"id":"2606.11005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11005","created_at":"2026-06-10T01:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11005v1","created_at":"2026-06-10T01:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11005","created_at":"2026-06-10T01:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"CNEDDBU32ZQM","created_at":"2026-06-10T01:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"CNEDDBU32ZQMWHDU","created_at":"2026-06-10T01:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"CNEDDBU3","created_at":"2026-06-10T01:11:03Z"}],"graph_snapshots":[{"event_id":"sha256:b0d35194f45caaa582c55d01a9eb06aacb4ab83ec7b7a07fa6cfdbe9d0413ecf","target":"graph","created_at":"2026-06-10T01:11:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.11005/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a finite abelian group of order $n$, and let $\\mathsf M(G,m)$ denote the set of zero-sum sequences over $G$ of length $m$. We introduce the zero-sum polytope $\\mathcal P_G$, a rational polytope of dimension $n-1$, whose lattice points encode zero-sum sequences: \\[\n  |\\mathsf M(G,m)|=|m\\mathcal P_G\\cap \\mathbb Z^n|. \\] This naturally realizes the enumeration of zero-sum sequences as a problem in rational Ehrhart theory, which leads to a combinatorial reciprocity theorem identifying the negative evaluations of the corresponding counting quasipolynomial with zero-sum sequences of full ","authors_text":"Dongchun Han, Hanbin Zhang, Shiwen Zhang, Xuan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T15:39:54Z","title":"On zero-sum polytopes: reciprocity, rigidity, and cyclic sieving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11005","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:6324aecaef00cc3fb41068c8e95a28728d8709479f791b656ba9074a0820d090","target":"record","created_at":"2026-06-10T01:11:03Z","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":"1b9fb551b76185e8f609fabf8654467a1e00e0c8c7f84609de8749b47cfa80a6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T15:39:54Z","title_canon_sha256":"ea432805629b867010715c1e2d2461d98ecd2dd3ed0c4dd983862d67966e11b3"},"schema_version":"1.0","source":{"id":"2606.11005","kind":"arxiv","version":1}},"canonical_sha256":"134831869bd660cb1c74df0accdb533ef66395b001fd1b860e59dd91e3704014","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"134831869bd660cb1c74df0accdb533ef66395b001fd1b860e59dd91e3704014","first_computed_at":"2026-06-10T01:11:03.209591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:11:03.209591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hPauhj3TFNEt/oz7vE/Sb1caL3+MzagBnYKOfh6ZW7DLl3l3q8TBLznNPIPUJW12OnLImrozE5AU8OTPGa+LBw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:11:03.210444Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6324aecaef00cc3fb41068c8e95a28728d8709479f791b656ba9074a0820d090","sha256:b0d35194f45caaa582c55d01a9eb06aacb4ab83ec7b7a07fa6cfdbe9d0413ecf"],"state_sha256":"dcbce80e0367bc60c1cfa12eb382012e5632f55415cb05cb3659bf06c5388790"}