{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K33KNQUN3LXI3CIR3MDUDV5XQC","short_pith_number":"pith:K33KNQUN","schema_version":"1.0","canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","source":{"kind":"arxiv","id":"1810.02009","version":3},"attestation_state":"computed","paper":{"title":"The Hamilton-Waterloo Problem with even cycle lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.C. Burgess, P. Danziger, T. Traetta","submitted_at":"2018-10-04T00:11:19Z","abstract_excerpt":"The Hamilton-Waterloo Problem HWP$(v;m,n;\\alpha,\\beta)$ asks for a 2-factorization of the complete graph $K_v$ or $K_v-I$, the complete graph with the edges of a 1-factor removed, into $\\alpha$ $C_m$-factors and $\\beta$ $C_n$-factors, where $3 \\leq m < n$. In the case that $m$ and $n$ are both even, the problem has been solved except possibly when $1 \\in \\{\\alpha,\\beta\\}$ or when $\\alpha$ and $\\beta$ are both odd, in which case necessarily $v \\equiv 2 \\pmod{4}$. In this paper, we develop a new construction that creates factorizations with larger cycles from existing factorizations under certai"},"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":"1810.02009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T00:11:19Z","cross_cats_sorted":[],"title_canon_sha256":"465fb802d6fca6b4f0e6c466dd7ad81b8ad53184172f99b61594f9d0afab164d","abstract_canon_sha256":"f80ce1f4f7398e71e38ae3eb73ce377af33b9ec089c8cf70605266863571228e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.040963Z","signature_b64":"CmQlPYaXyBTCKPkzFUxYU/HCBFVUb3LrBwiKv/ltnNNyy2AIKdmxANhKl4blAMWfW/ZGJ5WQN8/ggn7r1JM6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","last_reissued_at":"2026-05-17T23:52:52.040238Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.040238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hamilton-Waterloo Problem with even cycle lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.C. Burgess, P. Danziger, T. Traetta","submitted_at":"2018-10-04T00:11:19Z","abstract_excerpt":"The Hamilton-Waterloo Problem HWP$(v;m,n;\\alpha,\\beta)$ asks for a 2-factorization of the complete graph $K_v$ or $K_v-I$, the complete graph with the edges of a 1-factor removed, into $\\alpha$ $C_m$-factors and $\\beta$ $C_n$-factors, where $3 \\leq m < n$. In the case that $m$ and $n$ are both even, the problem has been solved except possibly when $1 \\in \\{\\alpha,\\beta\\}$ or when $\\alpha$ and $\\beta$ are both odd, in which case necessarily $v \\equiv 2 \\pmod{4}$. In this paper, we develop a new construction that creates factorizations with larger cycles from existing factorizations under certai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02009","kind":"arxiv","version":3},"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":"1810.02009","created_at":"2026-05-17T23:52:52.040373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02009v3","created_at":"2026-05-17T23:52:52.040373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02009","created_at":"2026-05-17T23:52:52.040373+00:00"},{"alias_kind":"pith_short_12","alias_value":"K33KNQUN3LXI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K33KNQUN3LXI3CIR","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K33KNQUN","created_at":"2026-05-18T12:32:33.847187+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/K33KNQUN3LXI3CIR3MDUDV5XQC","json":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC.json","graph_json":"https://pith.science/api/pith-number/K33KNQUN3LXI3CIR3MDUDV5XQC/graph.json","events_json":"https://pith.science/api/pith-number/K33KNQUN3LXI3CIR3MDUDV5XQC/events.json","paper":"https://pith.science/paper/K33KNQUN"},"agent_actions":{"view_html":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC","download_json":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC.json","view_paper":"https://pith.science/paper/K33KNQUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02009&json=true","fetch_graph":"https://pith.science/api/pith-number/K33KNQUN3LXI3CIR3MDUDV5XQC/graph.json","fetch_events":"https://pith.science/api/pith-number/K33KNQUN3LXI3CIR3MDUDV5XQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/action/storage_attestation","attest_author":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/action/author_attestation","sign_citation":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/action/citation_signature","submit_replication":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/action/replication_record"}},"created_at":"2026-05-17T23:52:52.040373+00:00","updated_at":"2026-05-17T23:52:52.040373+00:00"}