{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZHWOUIKE2R5BWVQ6MRKV5LUHBI","short_pith_number":"pith:ZHWOUIKE","schema_version":"1.0","canonical_sha256":"c9ecea2144d47a1b561e64555eae870a08fe29b8cf840396ae85b97c296168c9","source":{"kind":"arxiv","id":"1405.6987","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6987","created_at":"2026-05-18T00:36:10.276398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6987v4","created_at":"2026-05-18T00:36:10.276398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6987","created_at":"2026-05-18T00:36:10.276398+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHWOUIKE2R5B","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHWOUIKE2R5BWVQ6","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHWOUIKE","created_at":"2026-05-18T12:28:59.999130+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/ZHWOUIKE2R5BWVQ6MRKV5LUHBI","json":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI.json","graph_json":"https://pith.science/api/pith-number/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/graph.json","events_json":"https://pith.science/api/pith-number/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/events.json","paper":"https://pith.science/paper/ZHWOUIKE"},"agent_actions":{"view_html":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI","download_json":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI.json","view_paper":"https://pith.science/paper/ZHWOUIKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6987&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/action/storage_attestation","attest_author":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/action/author_attestation","sign_citation":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/action/citation_signature","submit_replication":"https://pith.science/pith/ZHWOUIKE2R5BWVQ6MRKV5LUHBI/action/replication_record"}},"created_at":"2026-05-18T00:36:10.276398+00:00","updated_at":"2026-05-18T00:36:10.276398+00:00"}