{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HM3HUUT4BBAABM447IBE52OXOR","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":"ecc25c74fde42df6a46f89702b2b8c4be747d15366d44b4d623a1cd54dd93e95","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-09T15:42:06Z","title_canon_sha256":"3ba7aa6900125c0bc9565dd7357e44450f99a237fbed4e9f3776334e37952b4c"},"schema_version":"1.0","source":{"id":"2011.04511","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04511","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04511v2","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04511","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"HM3HUUT4BBAA","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_16","alias_value":"HM3HUUT4BBAABM44","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_8","alias_value":"HM3HUUT4","created_at":"2026-07-05T03:11:26Z"}],"graph_snapshots":[{"event_id":"sha256:1d290ed8cc8c84e40732ee3bb595a8208996a2d4daeada2cbe048394a13facaf","target":"graph","created_at":"2026-07-05T03:11:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.04511/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a simple deterministic distributed algorithm that computes a $(\\Delta+1)$-vertex coloring in $O(\\log^2 \\Delta \\cdot \\log n)$ rounds. The algorithm can be implemented with $O(\\log n)$-bit messages. The algorithm can also be extended to the more general $(degree+1)$-list coloring problem.\n  Obtaining a polylogarithmic-time deterministic algorithm for $(\\Delta+1)$-vertex coloring had remained a central open question in the area of distributed graph algorithms since the 1980s, until a recent network decomposition algorithm of Rozho\\v{n} and Ghaffari [STOC'20]. The current state of the a","authors_text":"Fabian Kuhn, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-09T15:42:06Z","title":"Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04511","kind":"arxiv","version":2},"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:91702d7195e6c3ea98b47a9f6dd1782451c52d80afacd65ebc5d0f469b346228","target":"record","created_at":"2026-07-05T03:11:26Z","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":"ecc25c74fde42df6a46f89702b2b8c4be747d15366d44b4d623a1cd54dd93e95","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-09T15:42:06Z","title_canon_sha256":"3ba7aa6900125c0bc9565dd7357e44450f99a237fbed4e9f3776334e37952b4c"},"schema_version":"1.0","source":{"id":"2011.04511","kind":"arxiv","version":2}},"canonical_sha256":"3b367a527c084000b39cfa024ee9d7744aa106ca7756a5cc1a0d6feffa6f3e45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b367a527c084000b39cfa024ee9d7744aa106ca7756a5cc1a0d6feffa6f3e45","first_computed_at":"2026-07-05T03:11:26.779306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:26.779306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rCW8ZoD0Jl3rL6H5/Bb6UhcktYrwogDGOSXrRF/Ksqq22nHlDI+i1qcKY6KXjj1R+Xdcfc2fcDOmqdQ/Rfs7Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:26.779739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04511","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91702d7195e6c3ea98b47a9f6dd1782451c52d80afacd65ebc5d0f469b346228","sha256:1d290ed8cc8c84e40732ee3bb595a8208996a2d4daeada2cbe048394a13facaf"],"state_sha256":"26b17c6945ea0749a870849f112b1fc9396bdb08ad7530ba8281db888408e35c"}