{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7FVVBOOVIG52SZNKKI6ID4ROX5","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":"166e5afde1a751f76884802a864c787d82184925b64520eb4e1fe156c6fff616","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T03:05:23Z","title_canon_sha256":"0ee153fd5250d83af96e0ea6617de82a0f9acf06a297e719adba58e0e0faf114"},"schema_version":"1.0","source":{"id":"2507.12748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12748","created_at":"2026-07-05T11:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12748v2","created_at":"2026-07-05T11:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12748","created_at":"2026-07-05T11:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"7FVVBOOVIG52","created_at":"2026-07-05T11:44:51Z"},{"alias_kind":"pith_short_16","alias_value":"7FVVBOOVIG52SZNK","created_at":"2026-07-05T11:44:51Z"},{"alias_kind":"pith_short_8","alias_value":"7FVVBOOV","created_at":"2026-07-05T11:44:51Z"}],"graph_snapshots":[{"event_id":"sha256:682054449536869b32ed078a757ad0536ecc9fdac0b27c85b12fcc66ab51f2e0","target":"graph","created_at":"2026-07-05T11:44: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.12748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\\dots,k_n$ can be encoded as the vertices of the partition polytope $\\mathrm{PP}(k_1,\\dots,k_n)$. We prove that, if $K = \\max\\{k_1,\\dots,k_n\\}$, then the combinatorial diameter of $\\mathrm{PP}(k_1,\\dots,k_n)$ is at most $\\lceil 3K/2\\rceil$. This improves the previously known upper bound of $2K$.\n  A cycle (or path) odd-cover of a graph $G$ is a set of cycles (or paths) with symmetric difference $G$. We prove that every Eulerian graph $G$ with maximum degree $\\Delta$ admits a cycle odd-cover and a path odd-cover, e","authors_text":"Abigail Nix, Bryce Frederickson, Steffen Borgwardt, Youngho Yoo, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T03:05:23Z","title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12748","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:daf6e8411c2799b41655dca5cc89c23dad91ca6506bb2d02cb023eaf83d9e6cb","target":"record","created_at":"2026-07-05T11:44: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":"166e5afde1a751f76884802a864c787d82184925b64520eb4e1fe156c6fff616","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T03:05:23Z","title_canon_sha256":"0ee153fd5250d83af96e0ea6617de82a0f9acf06a297e719adba58e0e0faf114"},"schema_version":"1.0","source":{"id":"2507.12748","kind":"arxiv","version":2}},"canonical_sha256":"f96b50b9d541bba965aa523c81f22ebf4cdb07f3c0f3649c950498fc834630b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f96b50b9d541bba965aa523c81f22ebf4cdb07f3c0f3649c950498fc834630b1","first_computed_at":"2026-07-05T11:44:51.650807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:51.650807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGOE/BedHvM7+gBfhQVK0WCab8A8QNqsS25Zma17ew6T/KLjdojS3r74lqh7rR++eO8TSNO8Wd3QqtbrzWG1AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:51.651281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.12748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:daf6e8411c2799b41655dca5cc89c23dad91ca6506bb2d02cb023eaf83d9e6cb","sha256:682054449536869b32ed078a757ad0536ecc9fdac0b27c85b12fcc66ab51f2e0"],"state_sha256":"469da86e229d1a3fd5fd9c1039ddb75808068a7af2c51396700b955233d4eebf"}