{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5DAOTHE4WQG7WTKM67H74RVWWA","short_pith_number":"pith:5DAOTHE4","schema_version":"1.0","canonical_sha256":"e8c0e99c9cb40dfb4d4cf7cffe46b6b01f55c056dd335c319ccf6edb3d75e845","source":{"kind":"arxiv","id":"1101.4609","version":2},"attestation_state":"computed","paper":{"title":"Tight Bounds on Information Dissemination in Sparse Mobile Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Alberto Pettarin, Andrea Pietracaprina, Eli Upfal, Geppino Pucci","submitted_at":"2011-01-24T18:08:19Z","abstract_excerpt":"Motivated by the growing interest in mobile systems, we study the dynamics of information dissemination between agents moving independently on a plane. Formally, we consider $k$ mobile agents performing independent random walks on an $n$-node grid. At time $0$, each agent is located at a random node of the grid and one agent has a rumor. The spread of the rumor is governed by a dynamic communication graph process ${G_t(r) | t \\geq 0}$, where two agents are connected by an edge in $G_t(r)$ iff their distance at time $t$ is within their transmission radius $r$. Modeling the physical reality that"},"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":"1101.4609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T18:08:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fbf34d406bcdfc6897f67941b2b39000004b2a79892bd711a6304e63733dfbe5","abstract_canon_sha256":"44deb7399b72cdd22114b23504bf3048f9bd8676e3b96f58628b4fe6b245fb06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:13.411224Z","signature_b64":"u4ObWONp4ivceGnnLPzvJ39PmIRKac5wv4C8YVaL7rV514qJBpfy7/urec4ZD1lDPJYKopPOBl4INw6aUhY4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c0e99c9cb40dfb4d4cf7cffe46b6b01f55c056dd335c319ccf6edb3d75e845","last_reissued_at":"2026-05-18T04:30:13.410442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:13.410442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds on Information Dissemination in Sparse Mobile Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Alberto Pettarin, Andrea Pietracaprina, Eli Upfal, Geppino Pucci","submitted_at":"2011-01-24T18:08:19Z","abstract_excerpt":"Motivated by the growing interest in mobile systems, we study the dynamics of information dissemination between agents moving independently on a plane. Formally, we consider $k$ mobile agents performing independent random walks on an $n$-node grid. At time $0$, each agent is located at a random node of the grid and one agent has a rumor. The spread of the rumor is governed by a dynamic communication graph process ${G_t(r) | t \\geq 0}$, where two agents are connected by an edge in $G_t(r)$ iff their distance at time $t$ is within their transmission radius $r$. Modeling the physical reality that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4609","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":"1101.4609","created_at":"2026-05-18T04:30:13.410570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4609v2","created_at":"2026-05-18T04:30:13.410570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4609","created_at":"2026-05-18T04:30:13.410570+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DAOTHE4WQG7","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DAOTHE4WQG7WTKM","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DAOTHE4","created_at":"2026-05-18T12:26:20.644004+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/5DAOTHE4WQG7WTKM67H74RVWWA","json":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA.json","graph_json":"https://pith.science/api/pith-number/5DAOTHE4WQG7WTKM67H74RVWWA/graph.json","events_json":"https://pith.science/api/pith-number/5DAOTHE4WQG7WTKM67H74RVWWA/events.json","paper":"https://pith.science/paper/5DAOTHE4"},"agent_actions":{"view_html":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA","download_json":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA.json","view_paper":"https://pith.science/paper/5DAOTHE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4609&json=true","fetch_graph":"https://pith.science/api/pith-number/5DAOTHE4WQG7WTKM67H74RVWWA/graph.json","fetch_events":"https://pith.science/api/pith-number/5DAOTHE4WQG7WTKM67H74RVWWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA/action/storage_attestation","attest_author":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA/action/author_attestation","sign_citation":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA/action/citation_signature","submit_replication":"https://pith.science/pith/5DAOTHE4WQG7WTKM67H74RVWWA/action/replication_record"}},"created_at":"2026-05-18T04:30:13.410570+00:00","updated_at":"2026-05-18T04:30:13.410570+00:00"}