{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PHLCAMGTJ2QOQZPKWKVWE7N437","short_pith_number":"pith:PHLCAMGT","schema_version":"1.0","canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","source":{"kind":"arxiv","id":"1605.01781","version":1},"attestation_state":"computed","paper":{"title":"A Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Melissa Keranen","submitted_at":"2016-05-05T22:29:13Z","abstract_excerpt":"The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_2$ (and one copy of a 1-factor if $n$ is even). In this paper we generalize the problem to complete equipartite graphs $K_{(n:m)}$ and show that $K_{(xyzw:m)}$ can be decomposed into $s$ copies of a 2-factor consisting of cycles of length $xzm$; and $r$ copies of a 2-factor consisting of cycles of length $yzm$, whenever $m$ is odd, $s,r\\neq 1$, $\\gcd(x,z)=\\gcd(y,z)=1$ and $xyz\\neq 0 \\pmod 4$. We also give some more g"},"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":"1605.01781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T22:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"e1c068b12c49c776effe6c82626d58510c4ce4251c0a9d0b1ddf0e3eb852b6c5","abstract_canon_sha256":"0381753e768e2980e7651dcd06ac3877bf6c88060af1439399fe703d77cf8a3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.506344Z","signature_b64":"7E9+s3EgNKr6/RU3Qy1v3MkhDyClRvRQCe2dowwkjZU5LZdWgP7xm69OiA+OrjC/eaFMzF6XWpAN/Uyek11uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","last_reissued_at":"2026-05-18T01:15:31.505642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.505642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adri\\'an Pastine, Melissa Keranen","submitted_at":"2016-05-05T22:29:13Z","abstract_excerpt":"The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_2$ (and one copy of a 1-factor if $n$ is even). In this paper we generalize the problem to complete equipartite graphs $K_{(n:m)}$ and show that $K_{(xyzw:m)}$ can be decomposed into $s$ copies of a 2-factor consisting of cycles of length $xzm$; and $r$ copies of a 2-factor consisting of cycles of length $yzm$, whenever $m$ is odd, $s,r\\neq 1$, $\\gcd(x,z)=\\gcd(y,z)=1$ and $xyz\\neq 0 \\pmod 4$. We also give some more g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01781","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":"1605.01781","created_at":"2026-05-18T01:15:31.505722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01781v1","created_at":"2026-05-18T01:15:31.505722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01781","created_at":"2026-05-18T01:15:31.505722+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHLCAMGTJ2QO","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHLCAMGTJ2QOQZPK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHLCAMGT","created_at":"2026-05-18T12:30:39.010887+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/PHLCAMGTJ2QOQZPKWKVWE7N437","json":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437.json","graph_json":"https://pith.science/api/pith-number/PHLCAMGTJ2QOQZPKWKVWE7N437/graph.json","events_json":"https://pith.science/api/pith-number/PHLCAMGTJ2QOQZPKWKVWE7N437/events.json","paper":"https://pith.science/paper/PHLCAMGT"},"agent_actions":{"view_html":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437","download_json":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437.json","view_paper":"https://pith.science/paper/PHLCAMGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01781&json=true","fetch_graph":"https://pith.science/api/pith-number/PHLCAMGTJ2QOQZPKWKVWE7N437/graph.json","fetch_events":"https://pith.science/api/pith-number/PHLCAMGTJ2QOQZPKWKVWE7N437/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/action/storage_attestation","attest_author":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/action/author_attestation","sign_citation":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/action/citation_signature","submit_replication":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/action/replication_record"}},"created_at":"2026-05-18T01:15:31.505722+00:00","updated_at":"2026-05-18T01:15:31.505722+00:00"}