{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AEXP5CBS6UK4FCL2ZING3427ZE","short_pith_number":"pith:AEXP5CBS","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"},"canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","source":{"kind":"arxiv","id":"1108.0072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0072","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0072v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0072","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"AEXP5CBS6UK4","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AEXP5CBS6UK4FCL2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AEXP5CBS","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AEXP5CBS6UK4FCL2ZING3427ZE","target":"record","payload":{"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"},"canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","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"},"source_kind":"arxiv","source_id":"1108.0072","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-18T04:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/rOsxu4n0XuN/fu0tpg3JNz3S1azdB22z6mro3JUYSVJRo8MS/Ume3qIsIeRe8Zd7nE1+c8tVIX+97+KTfgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:50:21.865897Z"},"content_sha256":"bbc47b528c246d21d5e317459667fe9307aa15bd5cb5595116a00877dec16e11","schema_version":"1.0","event_id":"sha256:bbc47b528c246d21d5e317459667fe9307aa15bd5cb5595116a00877dec16e11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AEXP5CBS6UK4FCL2ZING3427ZE","target":"graph","payload":{"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"},"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-18T04:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7trE1Mcq6L47V2LZhw4hah0nkEA/knQYI4pmOhyxQSzvwGIDXxJhA/ZK8nYCm/w75BudFE6yZfN9wKWCsNKDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:50:21.866261Z"},"content_sha256":"3fb179113bc5bfebed6d8ebaa5d29712b760a7a1a90e441f474e807974a58de6","schema_version":"1.0","event_id":"sha256:3fb179113bc5bfebed6d8ebaa5d29712b760a7a1a90e441f474e807974a58de6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/bundle.json","state_url":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEXP5CBS6UK4FCL2ZING3427ZE/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-02T21:50:21Z","links":{"resolver":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE","bundle":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/bundle.json","state":"https://pith.science/pith/AEXP5CBS6UK4FCL2ZING3427ZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEXP5CBS6UK4FCL2ZING3427ZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AEXP5CBS6UK4FCL2ZING3427ZE","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":"de0956277cc624e2d5d6b3fd43583a894254b809f63e6da08905aaf09646610e","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-30T14:14:23Z","title_canon_sha256":"c7f07869ab93afb4aca86969021b14ab125aeb94f61f4cac8f7936478ac9dbca"},"schema_version":"1.0","source":{"id":"1108.0072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0072","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0072v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0072","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"AEXP5CBS6UK4","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AEXP5CBS6UK4FCL2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AEXP5CBS","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:3fb179113bc5bfebed6d8ebaa5d29712b760a7a1a90e441f474e807974a58de6","target":"graph","created_at":"2026-05-18T04:16:31Z","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":"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","authors_text":"Alonso Silva, Bernard Mans, Philippe Jacquet, Salman Malik","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-30T14:14:23Z","title":"On the Throughput-Delay Trade-off in Georouting Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0072","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:bbc47b528c246d21d5e317459667fe9307aa15bd5cb5595116a00877dec16e11","target":"record","created_at":"2026-05-18T04:16:31Z","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":"de0956277cc624e2d5d6b3fd43583a894254b809f63e6da08905aaf09646610e","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-30T14:14:23Z","title_canon_sha256":"c7f07869ab93afb4aca86969021b14ab125aeb94f61f4cac8f7936478ac9dbca"},"schema_version":"1.0","source":{"id":"1108.0072","kind":"arxiv","version":1}},"canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"012efe8832f515c2897aca1a6df35fc93216830ee53ca9e56d4fa4aa7cf099dc","first_computed_at":"2026-05-18T04:16:31.742177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:31.742177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2meJQ+o8kbiTFeP62SeBk+dB6HazAPjlJE52hzYTWdqCPTiU26R+SRWual9uF0pH9+fJqUKss8Bg7u7YfbnJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:31.742566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc47b528c246d21d5e317459667fe9307aa15bd5cb5595116a00877dec16e11","sha256:3fb179113bc5bfebed6d8ebaa5d29712b760a7a1a90e441f474e807974a58de6"],"state_sha256":"b9c3b4da210037f7896b8e4fb5d947a3029bdf83b51a85c561b97451fea52aab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pv7rtHBwwK3j2DbSoB+xVoacUNOJP201mLJFkFz1bANCDdqE6lp3i70Q3rNDoIvamnGAiqBrhH8yZqqBEay8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:50:21.868591Z","bundle_sha256":"6c9febae13dc5070cdcc1b5b57a48ac2e0280b60976685a11d31077b39fce5c9"}}