{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QY6D46LUXEPDT62KTMAFNF2RPI","short_pith_number":"pith:QY6D46LU","canonical_record":{"source":{"id":"1204.3709","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T06:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"d06c79d9d11bbf49a62cab3f3412a8c48759ac86f88afd9e77b12e8d7598be2c","abstract_canon_sha256":"e375f2bce3701f06debc7c0a3e036acd8d733fcd8dd6c79a7df569dabcd8593c"},"schema_version":"1.0"},"canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","source":{"kind":"arxiv","id":"1204.3709","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3709","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3709v4","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3709","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"QY6D46LUXEPD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QY6D46LUXEPDT62K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QY6D46LU","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QY6D46LUXEPDT62KTMAFNF2RPI","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3709","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T06:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"d06c79d9d11bbf49a62cab3f3412a8c48759ac86f88afd9e77b12e8d7598be2c","abstract_canon_sha256":"e375f2bce3701f06debc7c0a3e036acd8d733fcd8dd6c79a7df569dabcd8593c"},"schema_version":"1.0"},"canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:59.821805Z","signature_b64":"AtvW6Fn4NqAFzB8qym3Gy2fSoYRVou7Vmr/NhsxaRgLKXw86EodjQJLFAKRuuNY/+SYLlkq6UDSB6tZaW0sDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","last_reissued_at":"2026-05-18T00:15:59.819865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:59.819865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3709","source_version":4,"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-18T00:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTxYC5U4viNpdt/Na1ZLjYFkUpkU5Q0PsCJGWYxzLtVYbnjya4KSGEXRewZaqTttIP66P8ggICS+ZNZ1yEdvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:08:55.127366Z"},"content_sha256":"96fcffbc8c73d866b85d43079cd025b03778dd7690694640ccf0e8570c33e8a0","schema_version":"1.0","event_id":"sha256:96fcffbc8c73d866b85d43079cd025b03778dd7690694640ccf0e8570c33e8a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QY6D46LUXEPDT62KTMAFNF2RPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompositions of complete graphs into cycles of arbitrary lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Darryn Bryant, William Pettersson","submitted_at":"2012-04-17T06:29:37Z","abstract_excerpt":"We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_1,\\ldots,m_t$ if and only if $n$ is odd, $3\\leq m_i\\leq n$ for $i=1,\\ldots,t$, and $m_1+\\cdots+m_t=\\binom n2$. We also show that the complete graph on $n$ vertices can be decomposed into a perfect matching and $t$ cycles of specified lengths $m_1,\\ldots,m_t$ if and only if $n$ is even, $3\\leq m_i\\leq n$ for $i=1,\\ldots,t$, and $m_1+\\ldots+m_t=\\binom n2-\\frac n2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3709","kind":"arxiv","version":4},"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-18T00:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fS0cZlAJ4z4wEbU7O0unjaM5WYCDjLbgMYr88RYuSCN1NmPLjwtWT8boolkfWYiLt1Rmhu3Y/HGfJzPuSF8jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:08:55.127719Z"},"content_sha256":"e1901818eef2d9084a21c73bc7524ba1d22111ce5d0ce55dfe82a86ec3de256d","schema_version":"1.0","event_id":"sha256:e1901818eef2d9084a21c73bc7524ba1d22111ce5d0ce55dfe82a86ec3de256d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/bundle.json","state_url":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY6D46LUXEPDT62KTMAFNF2RPI/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-24T16:08:55Z","links":{"resolver":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI","bundle":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/bundle.json","state":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY6D46LUXEPDT62KTMAFNF2RPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QY6D46LUXEPDT62KTMAFNF2RPI","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":"e375f2bce3701f06debc7c0a3e036acd8d733fcd8dd6c79a7df569dabcd8593c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T06:29:37Z","title_canon_sha256":"d06c79d9d11bbf49a62cab3f3412a8c48759ac86f88afd9e77b12e8d7598be2c"},"schema_version":"1.0","source":{"id":"1204.3709","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3709","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3709v4","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3709","created_at":"2026-05-18T00:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"QY6D46LUXEPD","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QY6D46LUXEPDT62K","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QY6D46LU","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:e1901818eef2d9084a21c73bc7524ba1d22111ce5d0ce55dfe82a86ec3de256d","target":"graph","created_at":"2026-05-18T00:15:59Z","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":"We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_1,\\ldots,m_t$ if and only if $n$ is odd, $3\\leq m_i\\leq n$ for $i=1,\\ldots,t$, and $m_1+\\cdots+m_t=\\binom n2$. We also show that the complete graph on $n$ vertices can be decomposed into a perfect matching and $t$ cycles of specified lengths $m_1,\\ldots,m_t$ if and only if $n$ is even, $3\\leq m_i\\leq n$ for $i=1,\\ldots,t$, and $m_1+\\ldots+m_t=\\binom n2-\\frac n2$.","authors_text":"Daniel Horsley, Darryn Bryant, William Pettersson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T06:29:37Z","title":"Decompositions of complete graphs into cycles of arbitrary lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3709","kind":"arxiv","version":4},"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:96fcffbc8c73d866b85d43079cd025b03778dd7690694640ccf0e8570c33e8a0","target":"record","created_at":"2026-05-18T00:15:59Z","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":"e375f2bce3701f06debc7c0a3e036acd8d733fcd8dd6c79a7df569dabcd8593c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T06:29:37Z","title_canon_sha256":"d06c79d9d11bbf49a62cab3f3412a8c48759ac86f88afd9e77b12e8d7598be2c"},"schema_version":"1.0","source":{"id":"1204.3709","kind":"arxiv","version":4}},"canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","first_computed_at":"2026-05-18T00:15:59.819865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:59.819865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AtvW6Fn4NqAFzB8qym3Gy2fSoYRVou7Vmr/NhsxaRgLKXw86EodjQJLFAKRuuNY/+SYLlkq6UDSB6tZaW0sDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:59.821805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3709","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96fcffbc8c73d866b85d43079cd025b03778dd7690694640ccf0e8570c33e8a0","sha256:e1901818eef2d9084a21c73bc7524ba1d22111ce5d0ce55dfe82a86ec3de256d"],"state_sha256":"acee5ff8156074ec775f3737323dbd188321b99c9fdcf646681f29b982ecc5b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdUCShdQBjKNisi4uHWFyC8cUyGLcL+3QHdrSBHeFhmnbC+4ivmyS84qtsVtYCa5TJ0AApE/TiE98r5cR0fGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:08:55.129647Z","bundle_sha256":"531263cc1ac020e00995c04f4e20425a8aca252ec84b502b9f4618c27c8394c1"}}