{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AEXP5CBS6UK4FCL2ZING3427ZE","short_pith_number":"pith:AEXP5CBS","schema_version":"1.0","canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","source":{"kind":"arxiv","id":"1108.0072","version":1},"attestation_state":"computed","paper":{"title":"On the Throughput-Delay Trade-off in Georouting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alonso Silva, Bernard Mans, Philippe Jacquet, Salman Malik","submitted_at":"2011-07-30T14:14:23Z","abstract_excerpt":"We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi linearly with $n$ while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity $v$ and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order $1/v$ and it achieves the network capacity of order $\\frac{n}{\\log n\\log\\log n}$. This shows a practical throughput-delay trade-off, in particular when compared with the seminal result"},"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":"1108.0072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-30T14:14:23Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"c7f07869ab93afb4aca86969021b14ab125aeb94f61f4cac8f7936478ac9dbca","abstract_canon_sha256":"de0956277cc624e2d5d6b3fd43583a894254b809f63e6da08905aaf09646610e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:31.742566Z","signature_b64":"2meJQ+o8kbiTFeP62SeBk+dB6HazAPjlJE52hzYTWdqCPTiU26R+SRWual9uF0pH9+fJqUKss8Bg7u7YfbnJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","last_reissued_at":"2026-05-18T04:16:31.742177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:31.742177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Throughput-Delay Trade-off in Georouting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Alonso Silva, Bernard Mans, Philippe Jacquet, Salman Malik","submitted_at":"2011-07-30T14:14:23Z","abstract_excerpt":"We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi linearly with $n$ while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity $v$ and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order $1/v$ and it achieves the network capacity of order $\\frac{n}{\\log n\\log\\log n}$. This shows a practical throughput-delay trade-off, in particular when compared with the seminal result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0072","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.0072","created_at":"2026-05-18T04:16:31.742239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0072v1","created_at":"2026-05-18T04:16:31.742239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0072","created_at":"2026-05-18T04:16:31.742239+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEXP5CBS6UK4","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEXP5CBS6UK4FCL2","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEXP5CBS","created_at":"2026-05-18T12:26:24.575870+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/AEXP5CBS6UK4FCL2ZING3427ZE","json":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE.json","graph_json":"https://pith.science/api/pith-number/AEXP5CBS6UK4FCL2ZING3427ZE/graph.json","events_json":"https://pith.science/api/pith-number/AEXP5CBS6UK4FCL2ZING3427ZE/events.json","paper":"https://pith.science/paper/AEXP5CBS"},"agent_actions":{"view_html":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE","download_json":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE.json","view_paper":"https://pith.science/paper/AEXP5CBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0072&json=true","fetch_graph":"https://pith.science/api/pith-number/AEXP5CBS6UK4FCL2ZING3427ZE/graph.json","fetch_events":"https://pith.science/api/pith-number/AEXP5CBS6UK4FCL2ZING3427ZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/action/storage_attestation","attest_author":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/action/author_attestation","sign_citation":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/action/citation_signature","submit_replication":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/action/replication_record"}},"created_at":"2026-05-18T04:16:31.742239+00:00","updated_at":"2026-05-18T04:16:31.742239+00:00"}