{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Q54UAMKLEYQPVGLVSWSODCOBUX","short_pith_number":"pith:Q54UAMKL","schema_version":"1.0","canonical_sha256":"877940314b2620fa997595a4e189c1a5fd38494f521a8b3fc97d48957cf9dac0","source":{"kind":"arxiv","id":"1801.07638","version":1},"attestation_state":"computed","paper":{"title":"On the Hamilton-Waterloo Problem with cycle lengths of distinct parities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Burgess, Peter Danziger, Tommaso Traetta","submitted_at":"2018-01-23T16:22:56Z","abstract_excerpt":"Let $K_v^*$ denote the complete graph $K_v$ if $v$ is odd and $K_v-I$, the complete graph with the edges of a 1-factor removed, if $v$ is even. Given non-negative integers $v, M, N, \\alpha, \\beta$, the Hamilton-Waterloo problem asks for a $2$-factorization of $K^*_v$ into $\\alpha$ $C_M$-factors and $\\beta$ $C_N$-factors. Clearly, $M,N\\geq 3$, $M\\mid v$, $N\\mid v$ and $\\alpha+\\beta = \\lfloor\\frac{v-1}{2}\\rfloor$ are necessary conditions.\n  Very little is known on the case where $M$ and $N$ have different parities. In this paper, we make some progress on this case by showing, among other things,"},"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":"1801.07638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T16:22:56Z","cross_cats_sorted":[],"title_canon_sha256":"ac208fde87d3131bf10119f7ba32c9fa591b28356308299c05c1d7a181a780ea","abstract_canon_sha256":"93d894a0d175500f4f63cdb24e727ed348671bd52928fd54a83f5c244c243748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.368735Z","signature_b64":"ljU7FsxkeeBVG4Qyr2tAHdCwSyzcV1TljC5DRkZTfBa+L49xPUsFFY5zJBwXgU38nosqTAW5HsHISoWuMa6CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"877940314b2620fa997595a4e189c1a5fd38494f521a8b3fc97d48957cf9dac0","last_reissued_at":"2026-05-18T00:25:12.368228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.368228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hamilton-Waterloo Problem with cycle lengths of distinct parities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Burgess, Peter Danziger, Tommaso Traetta","submitted_at":"2018-01-23T16:22:56Z","abstract_excerpt":"Let $K_v^*$ denote the complete graph $K_v$ if $v$ is odd and $K_v-I$, the complete graph with the edges of a 1-factor removed, if $v$ is even. Given non-negative integers $v, M, N, \\alpha, \\beta$, the Hamilton-Waterloo problem asks for a $2$-factorization of $K^*_v$ into $\\alpha$ $C_M$-factors and $\\beta$ $C_N$-factors. Clearly, $M,N\\geq 3$, $M\\mid v$, $N\\mid v$ and $\\alpha+\\beta = \\lfloor\\frac{v-1}{2}\\rfloor$ are necessary conditions.\n  Very little is known on the case where $M$ and $N$ have different parities. In this paper, we make some progress on this case by showing, among other things,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07638","kind":"arxiv","version":1},"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":"1801.07638","created_at":"2026-05-18T00:25:12.368305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07638v1","created_at":"2026-05-18T00:25:12.368305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07638","created_at":"2026-05-18T00:25:12.368305+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q54UAMKLEYQP","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q54UAMKLEYQPVGLV","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q54UAMKL","created_at":"2026-05-18T12:32:46.962924+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/Q54UAMKLEYQPVGLVSWSODCOBUX","json":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX.json","graph_json":"https://pith.science/api/pith-number/Q54UAMKLEYQPVGLVSWSODCOBUX/graph.json","events_json":"https://pith.science/api/pith-number/Q54UAMKLEYQPVGLVSWSODCOBUX/events.json","paper":"https://pith.science/paper/Q54UAMKL"},"agent_actions":{"view_html":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX","download_json":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX.json","view_paper":"https://pith.science/paper/Q54UAMKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07638&json=true","fetch_graph":"https://pith.science/api/pith-number/Q54UAMKLEYQPVGLVSWSODCOBUX/graph.json","fetch_events":"https://pith.science/api/pith-number/Q54UAMKLEYQPVGLVSWSODCOBUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX/action/storage_attestation","attest_author":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX/action/author_attestation","sign_citation":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX/action/citation_signature","submit_replication":"https://pith.science/pith/Q54UAMKLEYQPVGLVSWSODCOBUX/action/replication_record"}},"created_at":"2026-05-18T00:25:12.368305+00:00","updated_at":"2026-05-18T00:25:12.368305+00:00"}