{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UKR4VNEYM7IDP75SE2MTTKCD37","short_pith_number":"pith:UKR4VNEY","schema_version":"1.0","canonical_sha256":"a2a3cab49867d037ffb2269939a843dfd963e16f4d942f2f795917a876a700e3","source":{"kind":"arxiv","id":"1104.5268","version":2},"attestation_state":"computed","paper":{"title":"Information Dissemination via Random Walks in d-Dimensional Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Henry Lam, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang, Zhenming Liu","submitted_at":"2011-04-27T23:22:48Z","abstract_excerpt":"We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the $d$-dimensional space $\\{-n, ..., n\\}^d$ at time zero, and one of the agents holds a piece of information to be disseminated. All the agents then perform independent random walks over the space, and the information is transmitted from one agent to another if the two agents are sufficiently close. We wish to bound the total time before all agents receive the information (with high probability). Our work extends Pettarin et al.'s work (Infecti"},"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":"1104.5268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-27T23:22:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"38ae59c993967e4d14038fe488a01c1cfc848744204c7989bda26e20ea37ae17","abstract_canon_sha256":"85ce849991d32ccd5852b2ed095fa4762d0e6b4afafa667f9563a1f3a710cecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:51.512298Z","signature_b64":"okQGse2M2oXqEgvnQmtaG1kugdRfE8h8DAm/cgzhMdPZDrort7aSddZymGES1XOF5Ry/LRaEZDNcNRmep/j3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a3cab49867d037ffb2269939a843dfd963e16f4d942f2f795917a876a700e3","last_reissued_at":"2026-05-18T04:11:51.511556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:51.511556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Dissemination via Random Walks in d-Dimensional Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Henry Lam, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang, Zhenming Liu","submitted_at":"2011-04-27T23:22:48Z","abstract_excerpt":"We study a natural information dissemination problem for multiple mobile agents in a bounded Euclidean space. Agents are placed uniformly at random in the $d$-dimensional space $\\{-n, ..., n\\}^d$ at time zero, and one of the agents holds a piece of information to be disseminated. All the agents then perform independent random walks over the space, and the information is transmitted from one agent to another if the two agents are sufficiently close. We wish to bound the total time before all agents receive the information (with high probability). Our work extends Pettarin et al.'s work (Infecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5268","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":"1104.5268","created_at":"2026-05-18T04:11:51.511674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5268v2","created_at":"2026-05-18T04:11:51.511674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5268","created_at":"2026-05-18T04:11:51.511674+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKR4VNEYM7ID","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKR4VNEYM7IDP75S","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKR4VNEY","created_at":"2026-05-18T12:26:42.757692+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/UKR4VNEYM7IDP75SE2MTTKCD37","json":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37.json","graph_json":"https://pith.science/api/pith-number/UKR4VNEYM7IDP75SE2MTTKCD37/graph.json","events_json":"https://pith.science/api/pith-number/UKR4VNEYM7IDP75SE2MTTKCD37/events.json","paper":"https://pith.science/paper/UKR4VNEY"},"agent_actions":{"view_html":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37","download_json":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37.json","view_paper":"https://pith.science/paper/UKR4VNEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5268&json=true","fetch_graph":"https://pith.science/api/pith-number/UKR4VNEYM7IDP75SE2MTTKCD37/graph.json","fetch_events":"https://pith.science/api/pith-number/UKR4VNEYM7IDP75SE2MTTKCD37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37/action/storage_attestation","attest_author":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37/action/author_attestation","sign_citation":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37/action/citation_signature","submit_replication":"https://pith.science/pith/UKR4VNEYM7IDP75SE2MTTKCD37/action/replication_record"}},"created_at":"2026-05-18T04:11:51.511674+00:00","updated_at":"2026-05-18T04:11:51.511674+00:00"}