{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MBRE5CABD7OHVLCAGJ3XKBZVFZ","short_pith_number":"pith:MBRE5CAB","schema_version":"1.0","canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","source":{"kind":"arxiv","id":"1907.03797","version":1},"attestation_state":"computed","paper":{"title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn","submitted_at":"2019-07-08T18:22:43Z","abstract_excerpt":"We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\\Delta+1)$-coloring of an $n$-node graph with maximum degree $\\Delta$ in $2^{O(\\sqrt{\\log\\Delta})}\\cdot\\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $\\Delta$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O(\\sqrt{\\log a})}\\cdot\\log^2 n$. Further, for graphs with bounded neighborhood independence, we show th"},"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":"1907.03797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T18:22:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7f711199968b4fef207871f992d77d850a35e0e8f433fe6046f8ad08fd197671","abstract_canon_sha256":"2579dcfb6a28e150d6e4bf67c757047cc00585b524e3c7254f6607ea9e687a38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.828760Z","signature_b64":"LfPSiMVutwzjKa+rwfRb3YQSD8tn2hH2gsjKmwrevps9KSE7d/EEoVyQa5Fyt2DhxC+xHRk8vvUbo5XgMmvWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60624e88011fdc7aac4032777507352e73bc7ee437307ab891c542d51f70b552","last_reissued_at":"2026-05-17T23:41:06.828052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.828052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Deterministic Distributed Coloring Through Recursive List Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn","submitted_at":"2019-07-08T18:22:43Z","abstract_excerpt":"We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\\Delta+1)$-coloring of an $n$-node graph with maximum degree $\\Delta$ in $2^{O(\\sqrt{\\log\\Delta})}\\cdot\\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $\\Delta$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O(\\sqrt{\\log a})}\\cdot\\log^2 n$. Further, for graphs with bounded neighborhood independence, we show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03797","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.03797","created_at":"2026-05-17T23:41:06.828181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03797v1","created_at":"2026-05-17T23:41:06.828181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03797","created_at":"2026-05-17T23:41:06.828181+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBRE5CABD7OH","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBRE5CABD7OHVLCA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBRE5CAB","created_at":"2026-05-18T12:33:21.387695+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/MBRE5CABD7OHVLCAGJ3XKBZVFZ","json":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ.json","graph_json":"https://pith.science/api/pith-number/MBRE5CABD7OHVLCAGJ3XKBZVFZ/graph.json","events_json":"https://pith.science/api/pith-number/MBRE5CABD7OHVLCAGJ3XKBZVFZ/events.json","paper":"https://pith.science/paper/MBRE5CAB"},"agent_actions":{"view_html":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ","download_json":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ.json","view_paper":"https://pith.science/paper/MBRE5CAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03797&json=true","fetch_graph":"https://pith.science/api/pith-number/MBRE5CABD7OHVLCAGJ3XKBZVFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MBRE5CABD7OHVLCAGJ3XKBZVFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/action/storage_attestation","attest_author":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/action/author_attestation","sign_citation":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/action/citation_signature","submit_replication":"https://pith.science/pith/MBRE5CABD7OHVLCAGJ3XKBZVFZ/action/replication_record"}},"created_at":"2026-05-17T23:41:06.828181+00:00","updated_at":"2026-05-17T23:41:06.828181+00:00"}