{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PHLCAMGTJ2QOQZPKWKVWE7N437","short_pith_number":"pith:PHLCAMGT","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"},"canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","source":{"kind":"arxiv","id":"1605.01781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01781","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01781v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01781","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"PHLCAMGTJ2QO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHLCAMGTJ2QOQZPK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHLCAMGT","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PHLCAMGTJ2QOQZPKWKVWE7N437","target":"record","payload":{"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"},"canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","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"},"source_kind":"arxiv","source_id":"1605.01781","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1xM4uksN5if1K+qA6vXqMjkxNyW3qNvYvgWdyR7s/CAfr7j5aE8/gaPbvtsthKrOq1KLRPbDXwLRBw6LeDqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:56.676363Z"},"content_sha256":"6f64bdbc9b6c4699c5c99ab205c0481e35c35b2c0d3eda4412c6c9499da60c87","schema_version":"1.0","event_id":"sha256:6f64bdbc9b6c4699c5c99ab205c0481e35c35b2c0d3eda4412c6c9499da60c87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PHLCAMGTJ2QOQZPKWKVWE7N437","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSAKl27+Y9+QMBSvjR7WT+KmKFxU4LP3jqfGMqZt5rwfIxxNdJiRANZDKp15OnB2yffE5WpiVuYwSmDqSfDaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:56.676723Z"},"content_sha256":"eb5ef4377ee9925bf6507aebbc5340d85ce00caf3e339af0281250f3ac3c9a8b","schema_version":"1.0","event_id":"sha256:eb5ef4377ee9925bf6507aebbc5340d85ce00caf3e339af0281250f3ac3c9a8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/bundle.json","state_url":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:28:56Z","links":{"resolver":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437","bundle":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/bundle.json","state":"https://pith.science/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHLCAMGTJ2QOQZPKWKVWE7N437/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PHLCAMGTJ2QOQZPKWKVWE7N437","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":"0381753e768e2980e7651dcd06ac3877bf6c88060af1439399fe703d77cf8a3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T22:29:13Z","title_canon_sha256":"e1c068b12c49c776effe6c82626d58510c4ce4251c0a9d0b1ddf0e3eb852b6c5"},"schema_version":"1.0","source":{"id":"1605.01781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01781","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01781v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01781","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"PHLCAMGTJ2QO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PHLCAMGTJ2QOQZPK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PHLCAMGT","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:eb5ef4377ee9925bf6507aebbc5340d85ce00caf3e339af0281250f3ac3c9a8b","target":"graph","created_at":"2026-05-18T01:15:31Z","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 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","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":"2016-05-05T22:29:13Z","title":"A Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01781","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:6f64bdbc9b6c4699c5c99ab205c0481e35c35b2c0d3eda4412c6c9499da60c87","target":"record","created_at":"2026-05-18T01:15:31Z","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":"0381753e768e2980e7651dcd06ac3877bf6c88060af1439399fe703d77cf8a3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T22:29:13Z","title_canon_sha256":"e1c068b12c49c776effe6c82626d58510c4ce4251c0a9d0b1ddf0e3eb852b6c5"},"schema_version":"1.0","source":{"id":"1605.01781","kind":"arxiv","version":1}},"canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79d62030d34ea0e865eab2ab627dbcdfc0da19e9589146fb9b3657bd6454c5ed","first_computed_at":"2026-05-18T01:15:31.505642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:31.505642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7E9+s3EgNKr6/RU3Qy1v3MkhDyClRvRQCe2dowwkjZU5LZdWgP7xm69OiA+OrjC/eaFMzF6XWpAN/Uyek11uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:31.506344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f64bdbc9b6c4699c5c99ab205c0481e35c35b2c0d3eda4412c6c9499da60c87","sha256:eb5ef4377ee9925bf6507aebbc5340d85ce00caf3e339af0281250f3ac3c9a8b"],"state_sha256":"9be45e5b6787b2a6d61488c63f889cfd5872dde069d21d1dd692e7a603bcefbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fxC+iRWp/HJZkCwIDpcJCZujzam/Rv7FwJ204qHwqp+tOf9ZMPa+T1OiE4QCsh8q5ZpiUxstXA/I07wnxa/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:28:56.679235Z","bundle_sha256":"958ea00564486c3844f877cce2191ae6be8cf85a563e72b2fedde194b3ad07fc"}}