{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ONT5Z6FMDT5VMNGSSOSK7UWL3G","short_pith_number":"pith:ONT5Z6FM","schema_version":"1.0","canonical_sha256":"7367dcf8ac1cfb5634d293a4afd2cbd9986549ca50be20c69ff88551125121a1","source":{"kind":"arxiv","id":"1808.08419","version":3},"attestation_state":"computed","paper":{"title":"The Complexity of $(\\Delta + 1)$Coloring inCongested Clique, Massively Parallel Computation,and Centralized Local Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Manuela Fischer, Mohsen Ghaffari, Yi-Jun Chang, Yufan Zheng","submitted_at":"2018-08-25T12:17:41Z","abstract_excerpt":"We present new randomized algorithms that improve the complexity of the classic $(\\Delta+1)$-coloring problem, and its generalization $(\\Delta+1)$-list-coloring, in three well-studied models of distributed, parallel, and centralized computation:\n  Distributed Congested Clique: We present an $O(1)$-round randomized algorithm for $(\\Delta+1)$-list coloring in the congested clique model of distributed computing. This settles the asymptotic complexity of this problem. It moreover improves upon the $O(\\log^\\ast \\Delta)$-round randomized algorithms of Parter and Su [DISC'18] and $O((\\log\\log \\Delta)"},"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":"1808.08419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-25T12:17:41Z","cross_cats_sorted":[],"title_canon_sha256":"45ebf1f0429b5840ee6e27ad01da9823e45491090ca5a77403803a4ea927e4dc","abstract_canon_sha256":"a7c9ff542bd3ca6174c66cd2d870bf01589c1b4f6851721e3720a899fa8e8751"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.858989Z","signature_b64":"PNzRb0jSD35wKopE5oNp3PKLZvf8ywBd12dlvAWaVk3LWlR7itLqX8UHFT6plXVnEZpuk2l8tf0//+ifwvltAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7367dcf8ac1cfb5634d293a4afd2cbd9986549ca50be20c69ff88551125121a1","last_reissued_at":"2026-05-18T00:01:37.858474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.858474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of $(\\Delta + 1)$Coloring inCongested Clique, Massively Parallel Computation,and Centralized Local Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Manuela Fischer, Mohsen Ghaffari, Yi-Jun Chang, Yufan Zheng","submitted_at":"2018-08-25T12:17:41Z","abstract_excerpt":"We present new randomized algorithms that improve the complexity of the classic $(\\Delta+1)$-coloring problem, and its generalization $(\\Delta+1)$-list-coloring, in three well-studied models of distributed, parallel, and centralized computation:\n  Distributed Congested Clique: We present an $O(1)$-round randomized algorithm for $(\\Delta+1)$-list coloring in the congested clique model of distributed computing. This settles the asymptotic complexity of this problem. It moreover improves upon the $O(\\log^\\ast \\Delta)$-round randomized algorithms of Parter and Su [DISC'18] and $O((\\log\\log \\Delta)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08419","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":"1808.08419","created_at":"2026-05-18T00:01:37.858559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08419v3","created_at":"2026-05-18T00:01:37.858559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08419","created_at":"2026-05-18T00:01:37.858559+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONT5Z6FMDT5V","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONT5Z6FMDT5VMNGS","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONT5Z6FM","created_at":"2026-05-18T12:32:43.782077+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/ONT5Z6FMDT5VMNGSSOSK7UWL3G","json":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G.json","graph_json":"https://pith.science/api/pith-number/ONT5Z6FMDT5VMNGSSOSK7UWL3G/graph.json","events_json":"https://pith.science/api/pith-number/ONT5Z6FMDT5VMNGSSOSK7UWL3G/events.json","paper":"https://pith.science/paper/ONT5Z6FM"},"agent_actions":{"view_html":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G","download_json":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G.json","view_paper":"https://pith.science/paper/ONT5Z6FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08419&json=true","fetch_graph":"https://pith.science/api/pith-number/ONT5Z6FMDT5VMNGSSOSK7UWL3G/graph.json","fetch_events":"https://pith.science/api/pith-number/ONT5Z6FMDT5VMNGSSOSK7UWL3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G/action/storage_attestation","attest_author":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G/action/author_attestation","sign_citation":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G/action/citation_signature","submit_replication":"https://pith.science/pith/ONT5Z6FMDT5VMNGSSOSK7UWL3G/action/replication_record"}},"created_at":"2026-05-18T00:01:37.858559+00:00","updated_at":"2026-05-18T00:01:37.858559+00:00"}