{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZHWOUIKE2R5BWVQ6MRKV5LUHBI","short_pith_number":"pith:ZHWOUIKE","canonical_record":{"source":{"id":"1405.6987","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-27T17:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"e3c2e2aee52d814d7f885396b787697efca41abe5626f2a5507886cfdb2efa7d","abstract_canon_sha256":"27b7953963c8a17ffd49938e77ab15857f24eb7a28399291512991fb39e9b617"},"schema_version":"1.0"},"canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","source":{"kind":"arxiv","id":"1405.6987","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6987","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6987v4","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6987","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZHWOUIKE2R5B","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHWOUIKE2R5BWVQ6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHWOUIKE","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZHWOUIKE2R5BWVQ6MRKV5LUHBI","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6987","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-27T17:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"e3c2e2aee52d814d7f885396b787697efca41abe5626f2a5507886cfdb2efa7d","abstract_canon_sha256":"27b7953963c8a17ffd49938e77ab15857f24eb7a28399291512991fb39e9b617"},"schema_version":"1.0"},"canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:10.276903Z","signature_b64":"+Tcnl4USw6QRUVkgI1VovA+xiZnOke5nIg+0Aca4p8rZPXWAt/dVlobEvCm+ZWKNZcmSdDT24TZyw7OOIxi/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","last_reissued_at":"2026-05-18T00:36:10.276298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:10.276298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6987","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:36:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vU6IOPmHZ9uQ9LoqidZqyn8DAF7EwT5hoJU92D/naKpyOkBQcr8QJDfrR0Bbe8gI1YuDs4IFlupcpUcrLG63Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:35:09.539378Z"},"content_sha256":"0f17e52a31b53ee2d18b97e83205e920b777224cb49267865f530e968e18fa20","schema_version":"1.0","event_id":"sha256:0f17e52a31b53ee2d18b97e83205e920b777224cb49267865f530e968e18fa20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZHWOUIKE2R5BWVQ6MRKV5LUHBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast, Responsive Decentralised Graph Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessandro Checco, Douglas J. Leith","submitted_at":"2014-05-27T17:46:16Z","abstract_excerpt":"We solve, in a fully decentralised way (\\ie with no message passing), the classic problem of colouring a graph. We propose a novel algorithm that is automatically responsive to topology changes, and we prove that it converges quickly to a proper colouring in $O(N\\log{N})$ time with high probability for generic graphs (and in $O(\\log{N})$ time if $\\Delta=O(1)$) when the number of available colours is greater than $\\Delta$, the maximum degree of the graph.\n  We believe the proof techniques used in this work are of independent interest and provide new insight into the properties required to ensur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6987","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:36:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNaoVnFbegN9uhRSpaIla4rtoEjwZRCCdqbZhfVhxUYNH5WssRP7Vk99OMTFvZMd6Cq30gPmqnM5+M7Htv6VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:35:09.539726Z"},"content_sha256":"090c7d1df05354e1006f3b832eeadd916b8546443bc9923ffdb0ae799891f2c6","schema_version":"1.0","event_id":"sha256:090c7d1df05354e1006f3b832eeadd916b8546443bc9923ffdb0ae799891f2c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/bundle.json","state_url":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/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-01T13:35:09Z","links":{"resolver":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI","bundle":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/bundle.json","state":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZHWOUIKE2R5BWVQ6MRKV5LUHBI","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":"27b7953963c8a17ffd49938e77ab15857f24eb7a28399291512991fb39e9b617","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-27T17:46:16Z","title_canon_sha256":"e3c2e2aee52d814d7f885396b787697efca41abe5626f2a5507886cfdb2efa7d"},"schema_version":"1.0","source":{"id":"1405.6987","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6987","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6987v4","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6987","created_at":"2026-05-18T00:36:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZHWOUIKE2R5B","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHWOUIKE2R5BWVQ6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHWOUIKE","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:090c7d1df05354e1006f3b832eeadd916b8546443bc9923ffdb0ae799891f2c6","target":"graph","created_at":"2026-05-18T00:36:10Z","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 solve, in a fully decentralised way (\\ie with no message passing), the classic problem of colouring a graph. We propose a novel algorithm that is automatically responsive to topology changes, and we prove that it converges quickly to a proper colouring in $O(N\\log{N})$ time with high probability for generic graphs (and in $O(\\log{N})$ time if $\\Delta=O(1)$) when the number of available colours is greater than $\\Delta$, the maximum degree of the graph.\n  We believe the proof techniques used in this work are of independent interest and provide new insight into the properties required to ensur","authors_text":"Alessandro Checco, Douglas J. Leith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-27T17:46:16Z","title":"Fast, Responsive Decentralised Graph Colouring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6987","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:0f17e52a31b53ee2d18b97e83205e920b777224cb49267865f530e968e18fa20","target":"record","created_at":"2026-05-18T00:36:10Z","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":"27b7953963c8a17ffd49938e77ab15857f24eb7a28399291512991fb39e9b617","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-27T17:46:16Z","title_canon_sha256":"e3c2e2aee52d814d7f885396b787697efca41abe5626f2a5507886cfdb2efa7d"},"schema_version":"1.0","source":{"id":"1405.6987","kind":"arxiv","version":4}},"canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","first_computed_at":"2026-05-18T00:36:10.276298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:10.276298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Tcnl4USw6QRUVkgI1VovA+xiZnOke5nIg+0Aca4p8rZPXWAt/dVlobEvCm+ZWKNZcmSdDT24TZyw7OOIxi/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:10.276903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6987","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f17e52a31b53ee2d18b97e83205e920b777224cb49267865f530e968e18fa20","sha256:090c7d1df05354e1006f3b832eeadd916b8546443bc9923ffdb0ae799891f2c6"],"state_sha256":"cb2325cc5fbc1b546e0d1aa92556b20b13201d7ab1e7ab64cf29d608d72f6813"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bzNLhYUxmVXywphLISLGFLDI3YbRz+rZ0iWylyqejWhLBeA/TcTip4HLt92VV3e9VlF0FTsPtLHAAY7GLmLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:35:09.541648Z","bundle_sha256":"e324201a5c4bbb31ba0408eabc17c81ecb989b92598ed1fc898f6dfafb934535"}}