{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DKI5AYIO3WZ7EOCQ2KWR4X6PBC","short_pith_number":"pith:DKI5AYIO","schema_version":"1.0","canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","source":{"kind":"arxiv","id":"1611.02663","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Local Distributed Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Mohsen Ghaffari, Yannic Maus","submitted_at":"2016-11-08T19:28:01Z","abstract_excerpt":"This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for many of the classic distributed graph problems (including maximal independent set (MIS) and $(\\Delta+1)$-vertex coloring), the randomized complexity is at most polylogarithmic in the size $n$ of the network, while the best deterministic complexity is typically $2^{O(\\sqrt{\\log n})}$. Understanding and narrowing down this exponential gap is considered to be one of the central long-standing open questions in the area of "},"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":"1611.02663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-08T19:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"03163bd76e64bb37c5dabfe839822c9460821553f65bcddf4a8d6a1e6874f398","abstract_canon_sha256":"78b28d981681b4baf552d6e3bcfdd69e595c0e6cc4287d0ae5069ad0729af9f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.779837Z","signature_b64":"5jf2f4dEEguAyf9p/U1KhAyyDeIu7c40QUvFFCP2Gc36sWuNyfMOXcKg72u/eQrD5yehz89kUqz4U9gkKrrADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a91d0610eddb3f23850d2ad1e5fcf089e124e731f7c3def5066746b9b867cb6","last_reissued_at":"2026-05-18T00:31:51.779393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.779393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Local Distributed Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Mohsen Ghaffari, Yannic Maus","submitted_at":"2016-11-08T19:28:01Z","abstract_excerpt":"This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for many of the classic distributed graph problems (including maximal independent set (MIS) and $(\\Delta+1)$-vertex coloring), the randomized complexity is at most polylogarithmic in the size $n$ of the network, while the best deterministic complexity is typically $2^{O(\\sqrt{\\log n})}$. Understanding and narrowing down this exponential gap is considered to be one of the central long-standing open questions in the area of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02663","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":"1611.02663","created_at":"2026-05-18T00:31:51.779456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02663v2","created_at":"2026-05-18T00:31:51.779456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02663","created_at":"2026-05-18T00:31:51.779456+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKI5AYIO3WZ7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKI5AYIO3WZ7EOCQ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKI5AYIO","created_at":"2026-05-18T12:30:12.583610+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/DKI5AYIO3WZ7EOCQ2KWR4X6PBC","json":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC.json","graph_json":"https://pith.science/api/pith-number/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/graph.json","events_json":"https://pith.science/api/pith-number/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/events.json","paper":"https://pith.science/paper/DKI5AYIO"},"agent_actions":{"view_html":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC","download_json":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC.json","view_paper":"https://pith.science/paper/DKI5AYIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02663&json=true","fetch_graph":"https://pith.science/api/pith-number/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/graph.json","fetch_events":"https://pith.science/api/pith-number/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/action/storage_attestation","attest_author":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/action/author_attestation","sign_citation":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/action/citation_signature","submit_replication":"https://pith.science/pith/DKI5AYIO3WZ7EOCQ2KWR4X6PBC/action/replication_record"}},"created_at":"2026-05-18T00:31:51.779456+00:00","updated_at":"2026-05-18T00:31:51.779456+00:00"}