{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7FVVBOOVIG52SZNKKI6ID4ROX5","short_pith_number":"pith:7FVVBOOV","schema_version":"1.0","canonical_sha256":"f96b50b9d541bba965aa523c81f22ebf4cdb07f3c0f3649c950498fc834630b1","source":{"kind":"arxiv","id":"2507.12748","version":2},"attestation_state":"computed","paper":{"title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abigail Nix, Bryce Frederickson, Steffen Borgwardt, Youngho Yoo, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2025-07-17T03:05:23Z","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"},"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":"2507.12748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T03:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"0ee153fd5250d83af96e0ea6617de82a0f9acf06a297e719adba58e0e0faf114","abstract_canon_sha256":"166e5afde1a751f76884802a864c787d82184925b64520eb4e1fe156c6fff616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:51.651281Z","signature_b64":"uGOE/BedHvM7+gBfhQVK0WCab8A8QNqsS25Zma17ew6T/KLjdojS3r74lqh7rR++eO8TSNO8Wd3QqtbrzWG1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96b50b9d541bba965aa523c81f22ebf4cdb07f3c0f3649c950498fc834630b1","last_reissued_at":"2026-07-05T11:44:51.650807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:51.650807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Decomposition Bounds for Partition Polytopes and Odd-Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abigail Nix, Bryce Frederickson, Steffen Borgwardt, Youngho Yoo, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2025-07-17T03:05:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12748","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.12748/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.12748","created_at":"2026-07-05T11:44:51.650872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12748v2","created_at":"2026-07-05T11:44:51.650872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12748","created_at":"2026-07-05T11:44:51.650872+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FVVBOOVIG52","created_at":"2026-07-05T11:44:51.650872+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FVVBOOVIG52SZNK","created_at":"2026-07-05T11:44:51.650872+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FVVBOOV","created_at":"2026-07-05T11:44:51.650872+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/7FVVBOOVIG52SZNKKI6ID4ROX5","json":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5.json","graph_json":"https://pith.science/api/pith-number/7FVVBOOVIG52SZNKKI6ID4ROX5/graph.json","events_json":"https://pith.science/api/pith-number/7FVVBOOVIG52SZNKKI6ID4ROX5/events.json","paper":"https://pith.science/paper/7FVVBOOV"},"agent_actions":{"view_html":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5","download_json":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5.json","view_paper":"https://pith.science/paper/7FVVBOOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12748&json=true","fetch_graph":"https://pith.science/api/pith-number/7FVVBOOVIG52SZNKKI6ID4ROX5/graph.json","fetch_events":"https://pith.science/api/pith-number/7FVVBOOVIG52SZNKKI6ID4ROX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5/action/storage_attestation","attest_author":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5/action/author_attestation","sign_citation":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5/action/citation_signature","submit_replication":"https://pith.science/pith/7FVVBOOVIG52SZNKKI6ID4ROX5/action/replication_record"}},"created_at":"2026-07-05T11:44:51.650872+00:00","updated_at":"2026-07-05T11:44:51.650872+00:00"}