{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7JJNV5MXKHPWTVXISTZBUDLR42","short_pith_number":"pith:7JJNV5MX","schema_version":"1.0","canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","source":{"kind":"arxiv","id":"2605.14804","version":1},"attestation_state":"computed","paper":{"title":"Uniquely 2-colourable 4-cycle decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea C. Burgess, David A. Pike, Shahriyar Pourakbar-Saffar","submitted_at":"2026-05-14T13:14:32Z","abstract_excerpt":"A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is monochromatic. A $k$-colourable cycle system is uniquely $k$-colourable if its colouring is unique up to the permutation of colour classes. In this paper, we construct uniquely $2$-colourable $4$-cycle systems of order $n$ for all admissible $n\\geq 49$, and also uniquely $2$-colourable $4$-cycle decompositions of $K_n - I$, for all admissible $n \\geq 50$. These construc"},"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":"2605.14804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T13:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"3dea4adc69bb4bc2670dd326cb448218123668fe6aab618f30880e88c1eca8c3","abstract_canon_sha256":"533276de5df1977c8586df417e9e5a2f60c1dae9e688839c9689e401067bc63d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:58.321998Z","signature_b64":"5rZLSRg/16imxrnU4bQPtXI4rCDjOarZ8HiyQeLoIunHdQ63xdsWmEMRLLA4mmmD7xZjZzviAX+AJ7b5JXuWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","last_reissued_at":"2026-05-17T23:38:58.321237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:58.321237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniquely 2-colourable 4-cycle decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea C. Burgess, David A. Pike, Shahriyar Pourakbar-Saffar","submitted_at":"2026-05-14T13:14:32Z","abstract_excerpt":"A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a fixed length. A cycle system is said to be $k$-colourable if we can assign $k$ colours to its vertices so that no cycle is monochromatic. A $k$-colourable cycle system is uniquely $k$-colourable if its colouring is unique up to the permutation of colour classes. In this paper, we construct uniquely $2$-colourable $4$-cycle systems of order $n$ for all admissible $n\\geq 49$, and also uniquely $2$-colourable $4$-cycle decompositions of $K_n - I$, for all admissible $n \\geq 50$. These construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14804","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":"2605.14804","created_at":"2026-05-17T23:38:58.321346+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14804v1","created_at":"2026-05-17T23:38:58.321346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14804","created_at":"2026-05-17T23:38:58.321346+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JJNV5MXKHPW","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JJNV5MXKHPWTVXI","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JJNV5MX","created_at":"2026-05-18T12:33:37.589309+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/7JJNV5MXKHPWTVXISTZBUDLR42","json":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42.json","graph_json":"https://pith.science/api/pith-number/7JJNV5MXKHPWTVXISTZBUDLR42/graph.json","events_json":"https://pith.science/api/pith-number/7JJNV5MXKHPWTVXISTZBUDLR42/events.json","paper":"https://pith.science/paper/7JJNV5MX"},"agent_actions":{"view_html":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42","download_json":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42.json","view_paper":"https://pith.science/paper/7JJNV5MX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14804&json=true","fetch_graph":"https://pith.science/api/pith-number/7JJNV5MXKHPWTVXISTZBUDLR42/graph.json","fetch_events":"https://pith.science/api/pith-number/7JJNV5MXKHPWTVXISTZBUDLR42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/action/storage_attestation","attest_author":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/action/author_attestation","sign_citation":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/action/citation_signature","submit_replication":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/action/replication_record"}},"created_at":"2026-05-17T23:38:58.321346+00:00","updated_at":"2026-05-17T23:38:58.321346+00:00"}