{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AM4DUEIBLQHOSVQMUDCSJKCOGE","short_pith_number":"pith:AM4DUEIB","schema_version":"1.0","canonical_sha256":"03383a11015c0ee9560ca0c524a84e312f1b3054ce1ff1b49e19ece051b1bded","source":{"kind":"arxiv","id":"1708.04290","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Distributed Edge Coloring with Small Palettes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Jara Uitto, Qizheng He, Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-08-14T19:47:53Z","abstract_excerpt":"The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes.\n  1. We simplify the \\emph{round elimination} technique of Brandt et al. and prove that $(2\\Delta-2)$-edge coloring requires $\\Omega(\\log_\\Delta \\log n)$ time w.h.p. and $\\Omega(\\log_\\Delta n)$ time deterministically, even on trees. The simplified technique is based on two ideas: the notion of an irregular running time and some general observations that transfo"},"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":"1708.04290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-14T19:47:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ca910b1a9263a712557488ccaf1d15de9e06b4b98639c7db908ffaf44ff3e92","abstract_canon_sha256":"2fe952c30fd0b7bbf9decd1ca063c3385709a88eb1c838962dd09c75206d105c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:05.277975Z","signature_b64":"NxyJeiPxAUeipfLTzEiMhJdvHiuAFUZJqtOnf1GvL4qG9tDJejoJjhqlxTx6pSs5gam/9jUgRGehcrpwabOADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03383a11015c0ee9560ca0c524a84e312f1b3054ce1ff1b49e19ece051b1bded","last_reissued_at":"2026-05-18T00:18:05.277389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:05.277389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Distributed Edge Coloring with Small Palettes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Jara Uitto, Qizheng He, Seth Pettie, Wenzheng Li, Yi-Jun Chang","submitted_at":"2017-08-14T19:47:53Z","abstract_excerpt":"The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes.\n  1. We simplify the \\emph{round elimination} technique of Brandt et al. and prove that $(2\\Delta-2)$-edge coloring requires $\\Omega(\\log_\\Delta \\log n)$ time w.h.p. and $\\Omega(\\log_\\Delta n)$ time deterministically, even on trees. The simplified technique is based on two ideas: the notion of an irregular running time and some general observations that transfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04290","kind":"arxiv","version":2},"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":"1708.04290","created_at":"2026-05-18T00:18:05.277473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04290v2","created_at":"2026-05-18T00:18:05.277473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04290","created_at":"2026-05-18T00:18:05.277473+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM4DUEIBLQHO","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM4DUEIBLQHOSVQM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM4DUEIB","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20836","citing_title":"Dynamic Construction of the Lov\\'asz Local Lemma","ref_index":79,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE","json":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE.json","graph_json":"https://pith.science/api/pith-number/AM4DUEIBLQHOSVQMUDCSJKCOGE/graph.json","events_json":"https://pith.science/api/pith-number/AM4DUEIBLQHOSVQMUDCSJKCOGE/events.json","paper":"https://pith.science/paper/AM4DUEIB"},"agent_actions":{"view_html":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE","download_json":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE.json","view_paper":"https://pith.science/paper/AM4DUEIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04290&json=true","fetch_graph":"https://pith.science/api/pith-number/AM4DUEIBLQHOSVQMUDCSJKCOGE/graph.json","fetch_events":"https://pith.science/api/pith-number/AM4DUEIBLQHOSVQMUDCSJKCOGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE/action/storage_attestation","attest_author":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE/action/author_attestation","sign_citation":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE/action/citation_signature","submit_replication":"https://pith.science/pith/AM4DUEIBLQHOSVQMUDCSJKCOGE/action/replication_record"}},"created_at":"2026-05-18T00:18:05.277473+00:00","updated_at":"2026-05-18T00:18:05.277473+00:00"}