{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KV7KJL6WV23JUUGORKP6JM3VAF","short_pith_number":"pith:KV7KJL6W","schema_version":"1.0","canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","source":{"kind":"arxiv","id":"1906.00482","version":1},"attestation_state":"computed","paper":{"title":"On the Use of Randomness in Local Distributed Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Mohsen Ghaffari","submitted_at":"2019-06-02T20:51:15Z","abstract_excerpt":"We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: - We first ask the question of how much randomness is needed to obtain efficient randomized algorithms. We show that for all locally checkable problems for which polylog $n$-time randomized algorithms exist, there are such algorithms even if either (I) there is a only a single (private) independent random bit in each polylog $n$-neighborhood of the graph, (II) the (private) bits of randomness of different nodes are only polylog $n$-wise independe"},"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":"1906.00482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T20:51:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0292505a5cb4be04b59dd89bedb51fd9c5fe511fea31de5975a23843dc87b5ff","abstract_canon_sha256":"7f63f4b8a85dca49c7d0e3db8077c1d1bfbca56b8db24bd3c70b44c5f80fe711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:26.970007Z","signature_b64":"65MAcI1K88VXIDgF+saWeBoXfkSwnqEIChXffv9Gb6d+B2iNpXx/5dmKXOpHl+07VUXexLg3kmCV9m1U898kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","last_reissued_at":"2026-05-17T23:44:26.969357Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:26.969357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Use of Randomness in Local Distributed Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Mohsen Ghaffari","submitted_at":"2019-06-02T20:51:15Z","abstract_excerpt":"We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: - We first ask the question of how much randomness is needed to obtain efficient randomized algorithms. We show that for all locally checkable problems for which polylog $n$-time randomized algorithms exist, there are such algorithms even if either (I) there is a only a single (private) independent random bit in each polylog $n$-neighborhood of the graph, (II) the (private) bits of randomness of different nodes are only polylog $n$-wise independe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00482","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":"1906.00482","created_at":"2026-05-17T23:44:26.969459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00482v1","created_at":"2026-05-17T23:44:26.969459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00482","created_at":"2026-05-17T23:44:26.969459+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV7KJL6WV23J","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV7KJL6WV23JUUGO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV7KJL6W","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/KV7KJL6WV23JUUGORKP6JM3VAF","json":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF.json","graph_json":"https://pith.science/api/pith-number/KV7KJL6WV23JUUGORKP6JM3VAF/graph.json","events_json":"https://pith.science/api/pith-number/KV7KJL6WV23JUUGORKP6JM3VAF/events.json","paper":"https://pith.science/paper/KV7KJL6W"},"agent_actions":{"view_html":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF","download_json":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF.json","view_paper":"https://pith.science/paper/KV7KJL6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00482&json=true","fetch_graph":"https://pith.science/api/pith-number/KV7KJL6WV23JUUGORKP6JM3VAF/graph.json","fetch_events":"https://pith.science/api/pith-number/KV7KJL6WV23JUUGORKP6JM3VAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/action/storage_attestation","attest_author":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/action/author_attestation","sign_citation":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/action/citation_signature","submit_replication":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/action/replication_record"}},"created_at":"2026-05-17T23:44:26.969459+00:00","updated_at":"2026-05-17T23:44:26.969459+00:00"}