{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K33KNQUN3LXI3CIR3MDUDV5XQC","short_pith_number":"pith:K33KNQUN","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"},"canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","source":{"kind":"arxiv","id":"1810.02009","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02009","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02009v3","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02009","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"K33KNQUN3LXI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K33KNQUN3LXI3CIR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K33KNQUN","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K33KNQUN3LXI3CIR3MDUDV5XQC","target":"record","payload":{"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"},"canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","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"},"source_kind":"arxiv","source_id":"1810.02009","source_version":3,"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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOg/nWcEANOC/PhMaV6Mbth+0M0BrriPvgHTkDk3nli5C3/O+DW26Ssd3Kbp/PMjcMl2x/64MV6wnW5cKnmUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:32:24.246425Z"},"content_sha256":"860975b7c2a3499e01fa573e85225ac5d3c1ed3c864982793dad2bf4fce8fde7","schema_version":"1.0","event_id":"sha256:860975b7c2a3499e01fa573e85225ac5d3c1ed3c864982793dad2bf4fce8fde7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K33KNQUN3LXI3CIR3MDUDV5XQC","target":"graph","payload":{"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"},"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-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCcKm+STA5CmuxQpmvi17zbOEbz3M6Z3HTNdyf2NDWoiK3WweO4WdPvxh4dYG+qNlotItMh5SD1FNFNYjcGKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:32:24.246782Z"},"content_sha256":"eafd283ca7d031f8649efc1506657b724c98f6c9433dcd5cf3fcfa3de5588060","schema_version":"1.0","event_id":"sha256:eafd283ca7d031f8649efc1506657b724c98f6c9433dcd5cf3fcfa3de5588060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/bundle.json","state_url":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/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-06-23T10:32:24Z","links":{"resolver":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC","bundle":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/bundle.json","state":"https://pith.science/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K33KNQUN3LXI3CIR3MDUDV5XQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K33KNQUN3LXI3CIR3MDUDV5XQC","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":"f80ce1f4f7398e71e38ae3eb73ce377af33b9ec089c8cf70605266863571228e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T00:11:19Z","title_canon_sha256":"465fb802d6fca6b4f0e6c466dd7ad81b8ad53184172f99b61594f9d0afab164d"},"schema_version":"1.0","source":{"id":"1810.02009","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02009","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02009v3","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02009","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"K33KNQUN3LXI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K33KNQUN3LXI3CIR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K33KNQUN","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:eafd283ca7d031f8649efc1506657b724c98f6c9433dcd5cf3fcfa3de5588060","target":"graph","created_at":"2026-05-17T23:52:52Z","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 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","authors_text":"A.C. Burgess, P. Danziger, T. Traetta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T00:11:19Z","title":"The Hamilton-Waterloo Problem with even cycle lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02009","kind":"arxiv","version":3},"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:860975b7c2a3499e01fa573e85225ac5d3c1ed3c864982793dad2bf4fce8fde7","target":"record","created_at":"2026-05-17T23:52:52Z","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":"f80ce1f4f7398e71e38ae3eb73ce377af33b9ec089c8cf70605266863571228e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T00:11:19Z","title_canon_sha256":"465fb802d6fca6b4f0e6c466dd7ad81b8ad53184172f99b61594f9d0afab164d"},"schema_version":"1.0","source":{"id":"1810.02009","kind":"arxiv","version":3}},"canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56f6a6c28ddaee8d8911db0741d7b780bc050de53686a7422c070d34302fed8f","first_computed_at":"2026-05-17T23:52:52.040238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:52.040238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmQlPYaXyBTCKPkzFUxYU/HCBFVUb3LrBwiKv/ltnNNyy2AIKdmxANhKl4blAMWfW/ZGJ5WQN8/ggn7r1JM6CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:52.040963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02009","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:860975b7c2a3499e01fa573e85225ac5d3c1ed3c864982793dad2bf4fce8fde7","sha256:eafd283ca7d031f8649efc1506657b724c98f6c9433dcd5cf3fcfa3de5588060"],"state_sha256":"ac24d301b39d6da2d8df42aacc8b03ed2e7de661b4dd9594920aad62b9d78a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3BQWs9SGUqPj0BqnYvP5YX/wR1p6fd7q81hCa3V9Ak18y0cjsxPdR+J9QxRVIr0haKn2m2dUG680ovwkZ7zDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:32:24.248974Z","bundle_sha256":"79676709008875a74b48d4aac392b57b68d3025910c374eefed9da060fee7447"}}