{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:43UC4QSHLXHQWXV6H3IHZ3YHET","short_pith_number":"pith:43UC4QSH","schema_version":"1.0","canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","source":{"kind":"arxiv","id":"1711.01361","version":3},"attestation_state":"computed","paper":{"title":"An Optimal Distributed $(\\Delta+1)$-Coloring Algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-11-03T23:46:52Z","abstract_excerpt":"Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for $(\\Delta+1)$-list coloring in the randomized ${\\sf LOCAL}$ model running in $O(\\mathsf{Det}_{\\scriptscriptstyle d}(\\text{poly} \\log n))$ time, where $\\mathsf{Det}_{\\scriptscriptstyle d}(n')$ is the deterministic complexity of $(\\text{deg}+1)$-list coloring on $n'$-vertex graphs. (In this problem, each $v$ has a palette of size $\\text{deg}(v)+1$.) This improves upon a previous randomized algorithm of Harris, Schneider, and Su [STOC'16, JACM'18] with com"},"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":"1711.01361","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-03T23:46:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a72bc5d7eec4abf22841aef40185fa9add51081e18b6fd574cce5554d305fd62","abstract_canon_sha256":"3420caa78f5b587c2aa1cafbeebe67552b36fadd4d3bb4d1871e245e2b041c50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:34.352309Z","signature_b64":"WeCn5jJAN3t7rH5gG3pdylla9lC5NFehJdnhkH8AjDXjCqHUkE3lsZ3AN8s6tGbJvrN1yJUyEFN+XWPMtEGICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e82e42475dcf0b5ebe3ed07cef0724cb0318db96d49108352d4e6401964b52","last_reissued_at":"2026-05-17T23:51:34.351537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:34.351537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Distributed $(\\Delta+1)$-Coloring Algorithm?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-11-03T23:46:52Z","abstract_excerpt":"Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for $(\\Delta+1)$-list coloring in the randomized ${\\sf LOCAL}$ model running in $O(\\mathsf{Det}_{\\scriptscriptstyle d}(\\text{poly} \\log n))$ time, where $\\mathsf{Det}_{\\scriptscriptstyle d}(n')$ is the deterministic complexity of $(\\text{deg}+1)$-list coloring on $n'$-vertex graphs. (In this problem, each $v$ has a palette of size $\\text{deg}(v)+1$.) This improves upon a previous randomized algorithm of Harris, Schneider, and Su [STOC'16, JACM'18] with com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01361","kind":"arxiv","version":3},"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":"1711.01361","created_at":"2026-05-17T23:51:34.351675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01361v3","created_at":"2026-05-17T23:51:34.351675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01361","created_at":"2026-05-17T23:51:34.351675+00:00"},{"alias_kind":"pith_short_12","alias_value":"43UC4QSHLXHQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"43UC4QSHLXHQWXV6","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"43UC4QSH","created_at":"2026-05-18T12:30:58.224056+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/43UC4QSHLXHQWXV6H3IHZ3YHET","json":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET.json","graph_json":"https://pith.science/api/pith-number/43UC4QSHLXHQWXV6H3IHZ3YHET/graph.json","events_json":"https://pith.science/api/pith-number/43UC4QSHLXHQWXV6H3IHZ3YHET/events.json","paper":"https://pith.science/paper/43UC4QSH"},"agent_actions":{"view_html":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET","download_json":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET.json","view_paper":"https://pith.science/paper/43UC4QSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01361&json=true","fetch_graph":"https://pith.science/api/pith-number/43UC4QSHLXHQWXV6H3IHZ3YHET/graph.json","fetch_events":"https://pith.science/api/pith-number/43UC4QSHLXHQWXV6H3IHZ3YHET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/action/storage_attestation","attest_author":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/action/author_attestation","sign_citation":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/action/citation_signature","submit_replication":"https://pith.science/pith/43UC4QSHLXHQWXV6H3IHZ3YHET/action/replication_record"}},"created_at":"2026-05-17T23:51:34.351675+00:00","updated_at":"2026-05-17T23:51:34.351675+00:00"}