{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7JJNV5MXKHPWTVXISTZBUDLR42","short_pith_number":"pith:7JJNV5MX","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"},"canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","source":{"kind":"arxiv","id":"2605.14804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14804","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14804v1","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14804","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"7JJNV5MXKHPW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7JJNV5MXKHPWTVXI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7JJNV5MX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7JJNV5MXKHPWTVXISTZBUDLR42","target":"record","payload":{"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"},"canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","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"},"source_kind":"arxiv","source_id":"2605.14804","source_version":1,"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:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6k/ZjHc0v8lMNcmI1vjDO5MXktgbGJ16AqfXurFPrL5HTH1Q8E1R/qHhlS9hMu/NYVFQGzAYt0g5D4Wx+exBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:14:19.201868Z"},"content_sha256":"03e52937a60f9eb9fd19e8dbfe0f614ebb98b7a7b509d69ff49a2f5e17a71ef4","schema_version":"1.0","event_id":"sha256:03e52937a60f9eb9fd19e8dbfe0f614ebb98b7a7b509d69ff49a2f5e17a71ef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7JJNV5MXKHPWTVXISTZBUDLR42","target":"graph","payload":{"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"},"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:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2X2zC9eT5UzhG5h+gho6ixZi8p74zvISdrezyA+zhxsd4FlfQ/5jHh+WxbZc9Hz9vPqsCQz29CXfSftjjBwGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:14:19.202514Z"},"content_sha256":"57adc52e96c046ece784ac51c23c2a7f674eb05d2c19dad47f57decc72ca95ab","schema_version":"1.0","event_id":"sha256:57adc52e96c046ece784ac51c23c2a7f674eb05d2c19dad47f57decc72ca95ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/bundle.json","state_url":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JJNV5MXKHPWTVXISTZBUDLR42/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-05-30T04:14:19Z","links":{"resolver":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42","bundle":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/bundle.json","state":"https://pith.science/pith/7JJNV5MXKHPWTVXISTZBUDLR42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JJNV5MXKHPWTVXISTZBUDLR42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7JJNV5MXKHPWTVXISTZBUDLR42","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":"533276de5df1977c8586df417e9e5a2f60c1dae9e688839c9689e401067bc63d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T13:14:32Z","title_canon_sha256":"3dea4adc69bb4bc2670dd326cb448218123668fe6aab618f30880e88c1eca8c3"},"schema_version":"1.0","source":{"id":"2605.14804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14804","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14804v1","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14804","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"7JJNV5MXKHPW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7JJNV5MXKHPWTVXI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7JJNV5MX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:57adc52e96c046ece784ac51c23c2a7f674eb05d2c19dad47f57decc72ca95ab","target":"graph","created_at":"2026-05-17T23:38:58Z","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":"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","authors_text":"Andrea C. Burgess, David A. Pike, Shahriyar Pourakbar-Saffar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T13:14:32Z","title":"Uniquely 2-colourable 4-cycle decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14804","kind":"arxiv","version":1},"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:03e52937a60f9eb9fd19e8dbfe0f614ebb98b7a7b509d69ff49a2f5e17a71ef4","target":"record","created_at":"2026-05-17T23:38:58Z","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":"533276de5df1977c8586df417e9e5a2f60c1dae9e688839c9689e401067bc63d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T13:14:32Z","title_canon_sha256":"3dea4adc69bb4bc2670dd326cb448218123668fe6aab618f30880e88c1eca8c3"},"schema_version":"1.0","source":{"id":"2605.14804","kind":"arxiv","version":1}},"canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa52daf59751df69d6e894f21a0d71e69fe18065110be5eb01fef0d5b55e5fbc","first_computed_at":"2026-05-17T23:38:58.321237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:58.321237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rZLSRg/16imxrnU4bQPtXI4rCDjOarZ8HiyQeLoIunHdQ63xdsWmEMRLLA4mmmD7xZjZzviAX+AJ7b5JXuWDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:58.321998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03e52937a60f9eb9fd19e8dbfe0f614ebb98b7a7b509d69ff49a2f5e17a71ef4","sha256:57adc52e96c046ece784ac51c23c2a7f674eb05d2c19dad47f57decc72ca95ab"],"state_sha256":"7899aa518df52f17bb350796b77308caf274cb463ed621099306f16c98f9b029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fj9oRVfFsBVR6HZ8eNzpt28fTxZsQasWbH2bwVEHMossABAOVVelui3cn05qYcKKaL37wqiM9BY2w8s1rpg/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:14:19.205895Z","bundle_sha256":"22a8a122434b302c6508c11bb9c0c79faa033efa5cd9f59d017f21c0c6ef3725"}}