{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KV7KJL6WV23JUUGORKP6JM3VAF","short_pith_number":"pith:KV7KJL6W","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"},"canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","source":{"kind":"arxiv","id":"1906.00482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00482","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00482v1","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00482","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"KV7KJL6WV23J","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KV7KJL6WV23JUUGO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KV7KJL6W","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KV7KJL6WV23JUUGORKP6JM3VAF","target":"record","payload":{"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"},"canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","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"},"source_kind":"arxiv","source_id":"1906.00482","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1pcQYiMZJ/SNCV9iY+ilc47rTOG8ceWP3EOfv3uTxXr9Q6FgM57/CtPWpvxgo8tO4s05wIRyRkYqSDAz9kzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:36:37.364156Z"},"content_sha256":"e8688b232a57a64318c7540d81fe95922fdd1c1f74aaf21f8543c17d5f3c60f1","schema_version":"1.0","event_id":"sha256:e8688b232a57a64318c7540d81fe95922fdd1c1f74aaf21f8543c17d5f3c60f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KV7KJL6WV23JUUGORKP6JM3VAF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSil1pXs/hLkXpeFkHYG6gUXERJbKezdBPxYdMNPljm4mbEHEeHC1de+Xayq5nsX2k1UI33U1C9zR3Q9sbxzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:36:37.364609Z"},"content_sha256":"2d003c3b41b3833bb18d70a01e1280031a59b4733e695c6c16f9639a314eaa78","schema_version":"1.0","event_id":"sha256:2d003c3b41b3833bb18d70a01e1280031a59b4733e695c6c16f9639a314eaa78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/bundle.json","state_url":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV7KJL6WV23JUUGORKP6JM3VAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T12:36:37Z","links":{"resolver":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF","bundle":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/bundle.json","state":"https://pith.science/pith/KV7KJL6WV23JUUGORKP6JM3VAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV7KJL6WV23JUUGORKP6JM3VAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KV7KJL6WV23JUUGORKP6JM3VAF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7f63f4b8a85dca49c7d0e3db8077c1d1bfbca56b8db24bd3c70b44c5f80fe711","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T20:51:15Z","title_canon_sha256":"0292505a5cb4be04b59dd89bedb51fd9c5fe511fea31de5975a23843dc87b5ff"},"schema_version":"1.0","source":{"id":"1906.00482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00482","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00482v1","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00482","created_at":"2026-05-17T23:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"KV7KJL6WV23J","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KV7KJL6WV23JUUGO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KV7KJL6W","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2d003c3b41b3833bb18d70a01e1280031a59b4733e695c6c16f9639a314eaa78","target":"graph","created_at":"2026-05-17T23:44:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fabian Kuhn, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T20:51:15Z","title":"On the Use of Randomness in Local Distributed Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00482","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e8688b232a57a64318c7540d81fe95922fdd1c1f74aaf21f8543c17d5f3c60f1","target":"record","created_at":"2026-05-17T23:44:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7f63f4b8a85dca49c7d0e3db8077c1d1bfbca56b8db24bd3c70b44c5f80fe711","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T20:51:15Z","title_canon_sha256":"0292505a5cb4be04b59dd89bedb51fd9c5fe511fea31de5975a23843dc87b5ff"},"schema_version":"1.0","source":{"id":"1906.00482","kind":"arxiv","version":1}},"canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"557ea4afd6aeb69a50ce8a9fe4b375014cb3072b44844c84915c525e3ca2721a","first_computed_at":"2026-05-17T23:44:26.969357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:26.969357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65MAcI1K88VXIDgF+saWeBoXfkSwnqEIChXffv9Gb6d+B2iNpXx/5dmKXOpHl+07VUXexLg3kmCV9m1U898kAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:26.970007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8688b232a57a64318c7540d81fe95922fdd1c1f74aaf21f8543c17d5f3c60f1","sha256:2d003c3b41b3833bb18d70a01e1280031a59b4733e695c6c16f9639a314eaa78"],"state_sha256":"bcb3abdaf39a9f41696975014ca03aba77109ce22cb8c5f9786e1764b02e55c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frF6cmPPdv5ecCmqXWi0a38UHmJ+Y7b+QSP90VDrofvXh+t8uCg6EQkvxC7MZ59ObGGOlMwaAcqj4dkZmgAkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:36:37.367024Z","bundle_sha256":"335094f3d7e4bf6c7296f732c138e5d6466650d35162fb130f51f8fb5d15b361"}}