{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6H7AMJEMZQGAVSWCLBRMQRBJTE","short_pith_number":"pith:6H7AMJEM","schema_version":"1.0","canonical_sha256":"f1fe06248ccc0c0acac25862c84429990eaf64e9f78846907dbfe36f39b8fe37","source":{"kind":"arxiv","id":"1603.03908","version":1},"attestation_state":"computed","paper":{"title":"Decomposing $K_{u+w}-K_u$ into cycles of various lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Rosalind A. Hoyte","submitted_at":"2016-03-12T13:11:11Z","abstract_excerpt":"We prove that the complete graph with a hole $K_{u+w}-K_u$ can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, each cycle has length at most $\\min(u,w)$, and the longest cycle is at most three times as long as the second longest. This generalises existing results on decomposing the complete graph with a hole into cycles of uniform length, and complements work on decomposing complete graphs, complete multigraphs, and complete multipartite graphs into cycles of arbitrary specified lengths."},"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":"1603.03908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-12T13:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"5e2a581de239dee65f0d3852daa55402577c14c98fc706d4492c7ba1a33dd2f3","abstract_canon_sha256":"1b8e5b3792200ee3312558da52c8847966cbd94f6ff448b211e51935c195e683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.080486Z","signature_b64":"WIYRymuBMLfHNnmGu3d4iy8SqBQD7rAp4xBn1XYccWB+2eDv+G93PHX+4CTFgFB1W29l9Rvv0vQhQGvTymzGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1fe06248ccc0c0acac25862c84429990eaf64e9f78846907dbfe36f39b8fe37","last_reissued_at":"2026-05-18T01:19:10.079832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.079832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing $K_{u+w}-K_u$ into cycles of various lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Rosalind A. Hoyte","submitted_at":"2016-03-12T13:11:11Z","abstract_excerpt":"We prove that the complete graph with a hole $K_{u+w}-K_u$ can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, each cycle has length at most $\\min(u,w)$, and the longest cycle is at most three times as long as the second longest. This generalises existing results on decomposing the complete graph with a hole into cycles of uniform length, and complements work on decomposing complete graphs, complete multigraphs, and complete multipartite graphs into cycles of arbitrary specified lengths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03908","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":"1603.03908","created_at":"2026-05-18T01:19:10.079924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03908v1","created_at":"2026-05-18T01:19:10.079924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03908","created_at":"2026-05-18T01:19:10.079924+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H7AMJEMZQGA","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H7AMJEMZQGAVSWC","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H7AMJEM","created_at":"2026-05-18T12:30:01.593930+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/6H7AMJEMZQGAVSWCLBRMQRBJTE","json":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE.json","graph_json":"https://pith.science/api/pith-number/6H7AMJEMZQGAVSWCLBRMQRBJTE/graph.json","events_json":"https://pith.science/api/pith-number/6H7AMJEMZQGAVSWCLBRMQRBJTE/events.json","paper":"https://pith.science/paper/6H7AMJEM"},"agent_actions":{"view_html":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE","download_json":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE.json","view_paper":"https://pith.science/paper/6H7AMJEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03908&json=true","fetch_graph":"https://pith.science/api/pith-number/6H7AMJEMZQGAVSWCLBRMQRBJTE/graph.json","fetch_events":"https://pith.science/api/pith-number/6H7AMJEMZQGAVSWCLBRMQRBJTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE/action/storage_attestation","attest_author":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE/action/author_attestation","sign_citation":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE/action/citation_signature","submit_replication":"https://pith.science/pith/6H7AMJEMZQGAVSWCLBRMQRBJTE/action/replication_record"}},"created_at":"2026-05-18T01:19:10.079924+00:00","updated_at":"2026-05-18T01:19:10.079924+00:00"}