{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7A2Z7LKTYYI3SU2VGNTZITVTVH","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":"ab826825853d9315f34b8603b2b97dfa6dc70318bb35880b33c508c6fe626149","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-26T15:47:57Z","title_canon_sha256":"b7b267e50d1a19defbbab791b6539200904a56ad09de2ca3e4a4c83c02e12fda"},"schema_version":"1.0","source":{"id":"1712.09291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09291","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09291v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09291","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"7A2Z7LKTYYI3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7A2Z7LKTYYI3SU2V","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7A2Z7LKT","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c4b7d0dd56f907c4854b2d97b6172755b8d52916457c71acc71514a61dc49bbe","target":"graph","created_at":"2026-05-18T00:27:14Z","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"},"paper":{"abstract_excerpt":"The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\\left\\lfloor\\frac{v-1}{2}\\right\\rfloor$. If $F_{1}$ consists of $m$-cycles and $F_{2}$ consists of $n$ cycles, then we call such a decomposition a $(m,n)-$HWP$(v;r,s)$. The goal is to find a decomposition for every possible pair $(r,s)$. In this paper, we show that for odd $x$ and $y$, there is a $(2^kx,y)-$HWP$(vm;r,s)$ if $\\gcd(x,y)\\geq 3$, $m\\geq 3$, and both $x$ and $y$ divide $v$, except possibly when $1\\in\\{r,s\\}$.","authors_text":"Adri\\'an Pastine, Melissa Keranen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-26T15:47:57Z","title":"On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09291","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:eee4f65da072a7f7120636b8bafd6b638c939a1410c0da71d1780cd1887f355b","target":"record","created_at":"2026-05-18T00:27:14Z","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":"ab826825853d9315f34b8603b2b97dfa6dc70318bb35880b33c508c6fe626149","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-26T15:47:57Z","title_canon_sha256":"b7b267e50d1a19defbbab791b6539200904a56ad09de2ca3e4a4c83c02e12fda"},"schema_version":"1.0","source":{"id":"1712.09291","kind":"arxiv","version":1}},"canonical_sha256":"f8359fad53c611b953553367944eb3a9f7a3127a2d99af2c38813dcb8ba068ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8359fad53c611b953553367944eb3a9f7a3127a2d99af2c38813dcb8ba068ad","first_computed_at":"2026-05-18T00:27:14.015854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:14.015854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKcos9K0HWOjh/mitPeVgpUGbw+7wMrUTli+QUFsedw/XGO4U8Jg+2KGgSjc11F0ofrRabZ5kROs+rdE4+5bCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:14.016279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eee4f65da072a7f7120636b8bafd6b638c939a1410c0da71d1780cd1887f355b","sha256:c4b7d0dd56f907c4854b2d97b6172755b8d52916457c71acc71514a61dc49bbe"],"state_sha256":"e53ee73526fe6661741fb463a438d90920578f27e0a713ba6782a443afa4218c"}