{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QY6D46LUXEPDT62KTMAFNF2RPI","short_pith_number":"pith:QY6D46LU","schema_version":"1.0","canonical_sha256":"863c3e7974b91e39fb4a9b005697517a0c895f6387cf29f6cd073e70a95252e2","source":{"kind":"arxiv","id":"1204.3709","version":4},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.3709","created_at":"2026-05-18T00:15:59.819944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3709v4","created_at":"2026-05-18T00:15:59.819944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3709","created_at":"2026-05-18T00:15:59.819944+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY6D46LUXEPD","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY6D46LUXEPDT62K","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY6D46LU","created_at":"2026-05-18T12:27:20.899486+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/QY6D46LUXEPDT62KTMAFNF2RPI","json":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI.json","graph_json":"https://pith.science/api/pith-number/QY6D46LUXEPDT62KTMAFNF2RPI/graph.json","events_json":"https://pith.science/api/pith-number/QY6D46LUXEPDT62KTMAFNF2RPI/events.json","paper":"https://pith.science/paper/QY6D46LU"},"agent_actions":{"view_html":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI","download_json":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI.json","view_paper":"https://pith.science/paper/QY6D46LU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3709&json=true","fetch_graph":"https://pith.science/api/pith-number/QY6D46LUXEPDT62KTMAFNF2RPI/graph.json","fetch_events":"https://pith.science/api/pith-number/QY6D46LUXEPDT62KTMAFNF2RPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/action/storage_attestation","attest_author":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/action/author_attestation","sign_citation":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/action/citation_signature","submit_replication":"https://pith.science/pith/QY6D46LUXEPDT62KTMAFNF2RPI/action/replication_record"}},"created_at":"2026-05-18T00:15:59.819944+00:00","updated_at":"2026-05-18T00:15:59.819944+00:00"}