{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DSLUNLPMEYWYDMPEM5PAKGTURQ","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":"bfb24c6e35b9cadb62f81bc0eac4601e5ffcbc00085ce6e851ae46a33b58748d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-24T18:36:18Z","title_canon_sha256":"e76775b20fa887b09e79a91e5b6db588a5d3d4460fa08ac341ab2c45a97155be"},"schema_version":"1.0","source":{"id":"1205.5525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5525","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5525v1","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5525","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"pith_short_12","alias_value":"DSLUNLPMEYWY","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DSLUNLPMEYWYDMPE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DSLUNLPM","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:14cf06cd039cd93e588caa7ff281ed176f813f56eb95ee4f43b57fc3c1dbe6ac","target":"graph","created_at":"2026-05-18T03:55:00Z","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":"The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round.\n  Our first contribution is a rigorous framework for design and analysis of distributed random walk algorithms in dynamic networks. We then develop a fast distributed random walk based algorithm that runs in $\\tilde{O}(\\sqrt{\\tau \\Phi})$ rounds (with high probability), where $\\tau$ is the dynamic mixing time and $\\Phi$ is the dynamic diameter of the network respectively, and returns a sample close to a suitably defined stationary distribution of ","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-24T18:36:18Z","title":"Fast Distributed Computation in Dynamic Networks via Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5525","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:db41a8cdfef03fab0d9539e97bb3cdd9e852e81619d1d88e52fd98c66a5bd50f","target":"record","created_at":"2026-05-18T03:55:00Z","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":"bfb24c6e35b9cadb62f81bc0eac4601e5ffcbc00085ce6e851ae46a33b58748d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-24T18:36:18Z","title_canon_sha256":"e76775b20fa887b09e79a91e5b6db588a5d3d4460fa08ac341ab2c45a97155be"},"schema_version":"1.0","source":{"id":"1205.5525","kind":"arxiv","version":1}},"canonical_sha256":"1c9746adec262d81b1e4675e051a748c077b8bfc902d8a103b4d1b27627960b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c9746adec262d81b1e4675e051a748c077b8bfc902d8a103b4d1b27627960b0","first_computed_at":"2026-05-18T03:55:00.893244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:00.893244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eeYKyEJGvGKR/exZhhlPlWmS9ieZRidKk4OJWKGmvNgyRR/a5o8rM/2Mo1d2Dn63fN0DFbuHhZCJaWb8pEpFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:00.893811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db41a8cdfef03fab0d9539e97bb3cdd9e852e81619d1d88e52fd98c66a5bd50f","sha256:14cf06cd039cd93e588caa7ff281ed176f813f56eb95ee4f43b57fc3c1dbe6ac"],"state_sha256":"5aec124f0ca7283b39616aeadd5293e77e979d995f5aaff9e18ba551503b3a9b"}