{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DSLUNLPMEYWYDMPEM5PAKGTURQ","short_pith_number":"pith:DSLUNLPM","canonical_record":{"source":{"id":"1205.5525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-24T18:36:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e76775b20fa887b09e79a91e5b6db588a5d3d4460fa08ac341ab2c45a97155be","abstract_canon_sha256":"bfb24c6e35b9cadb62f81bc0eac4601e5ffcbc00085ce6e851ae46a33b58748d"},"schema_version":"1.0"},"canonical_sha256":"1c9746adec262d81b1e4675e051a748c077b8bfc902d8a103b4d1b27627960b0","source":{"kind":"arxiv","id":"1205.5525","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DSLUNLPMEYWYDMPEM5PAKGTURQ","target":"record","payload":{"canonical_record":{"source":{"id":"1205.5525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-05-24T18:36:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e76775b20fa887b09e79a91e5b6db588a5d3d4460fa08ac341ab2c45a97155be","abstract_canon_sha256":"bfb24c6e35b9cadb62f81bc0eac4601e5ffcbc00085ce6e851ae46a33b58748d"},"schema_version":"1.0"},"canonical_sha256":"1c9746adec262d81b1e4675e051a748c077b8bfc902d8a103b4d1b27627960b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:00.893811Z","signature_b64":"eeYKyEJGvGKR/exZhhlPlWmS9ieZRidKk4OJWKGmvNgyRR/a5o8rM/2Mo1d2Dn63fN0DFbuHhZCJaWb8pEpFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c9746adec262d81b1e4675e051a748c077b8bfc902d8a103b4d1b27627960b0","last_reissued_at":"2026-05-18T03:55:00.893244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:00.893244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.5525","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-18T03:55:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkYVoaBFDb7PpwQlt7M10bLHUn5wr3ohzX0M5vDcw7iFXaxQi/3iGbIhQIkYXLbcPr3Rb61LO5AaU+cYQep1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:31:49.466433Z"},"content_sha256":"db41a8cdfef03fab0d9539e97bb3cdd9e852e81619d1d88e52fd98c66a5bd50f","schema_version":"1.0","event_id":"sha256:db41a8cdfef03fab0d9539e97bb3cdd9e852e81619d1d88e52fd98c66a5bd50f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DSLUNLPMEYWYDMPEM5PAKGTURQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distributed Computation in Dynamic Networks via Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","submitted_at":"2012-05-24T18:36:18Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5525","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-18T03:55:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxhYGG8Wn/l02aIzBsBdlz+ZbBMQsRNIetWhXQdTL9HTP2bn6vm/ifv/sdzBZqOPnIFBMVtf+glwCnWOP6HTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:31:49.466777Z"},"content_sha256":"14cf06cd039cd93e588caa7ff281ed176f813f56eb95ee4f43b57fc3c1dbe6ac","schema_version":"1.0","event_id":"sha256:14cf06cd039cd93e588caa7ff281ed176f813f56eb95ee4f43b57fc3c1dbe6ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/bundle.json","state_url":"https://pith.science/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/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-06-30T21:31:49Z","links":{"resolver":"https://pith.science/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ","bundle":"https://pith.science/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/bundle.json","state":"https://pith.science/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSLUNLPMEYWYDMPEM5PAKGTURQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RF7tmDCCXZxzb2gXkHpMVAXLN2Ou7QKFUxINckZBclK1p4+7LAKx1KSG8oueKLtOn6Zgu/SaTVawdEVLjN4nDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:31:49.468736Z","bundle_sha256":"5e618139f980af9f8940f97e122c50d8a2ac8debf750f1f594c418fef3a30859"}}