{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2HIOJL466VMTNXFFNFH6ZHNXHU","short_pith_number":"pith:2HIOJL46","schema_version":"1.0","canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","source":{"kind":"arxiv","id":"1902.06371","version":1},"attestation_state":"computed","paper":{"title":"Achieving Throughput via Fine-Grained Path Planning in Small World DTNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Dhrubojyoti Roy, Mukundan Sridharan, Satyajeet Deshpande","submitted_at":"2019-02-18T01:30:14Z","abstract_excerpt":"We explore the benefits of using fine-grained statistics in small world DTNs to achieve high throughput without the aid of external infrastructure. We first design an empirical node-pair inter-contacts model that predicts meetings within a time frame of suitable length, typically of the order of days, with a probability above some threshold, and can be readily computed with low overhead. This temporal knowledge enables effective time-dependent path planning that can be respond to even per-packet deadline variabilities. We describe one such routing framework, REAPER (for Reliable, Efficient and"},"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":"1902.06371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-18T01:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"8be8dedaab87f4814997e44b1adb0b225a56b12729d4bf6343b602b7c6d75484","abstract_canon_sha256":"7e4ddd86a0b9e4bab42363900418e057e3b6af5c2492b1651a4385e22edd1163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:45.733230Z","signature_b64":"Us8ZWzk+C2aYTk02lOStSFL6YP78k/Dv1vHmB5i4XDh5Nnr/6OGQS0Ha4Mez6eMv7lho/4oK0BCn5Rj4B3byAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","last_reissued_at":"2026-05-17T23:53:45.732652Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:45.732652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Throughput via Fine-Grained Path Planning in Small World DTNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Dhrubojyoti Roy, Mukundan Sridharan, Satyajeet Deshpande","submitted_at":"2019-02-18T01:30:14Z","abstract_excerpt":"We explore the benefits of using fine-grained statistics in small world DTNs to achieve high throughput without the aid of external infrastructure. We first design an empirical node-pair inter-contacts model that predicts meetings within a time frame of suitable length, typically of the order of days, with a probability above some threshold, and can be readily computed with low overhead. This temporal knowledge enables effective time-dependent path planning that can be respond to even per-packet deadline variabilities. We describe one such routing framework, REAPER (for Reliable, Efficient and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06371","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":"1902.06371","created_at":"2026-05-17T23:53:45.732739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06371v1","created_at":"2026-05-17T23:53:45.732739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06371","created_at":"2026-05-17T23:53:45.732739+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HIOJL466VMT","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HIOJL466VMTNXFF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HIOJL46","created_at":"2026-05-18T12:33:07.085635+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/2HIOJL466VMTNXFFNFH6ZHNXHU","json":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU.json","graph_json":"https://pith.science/api/pith-number/2HIOJL466VMTNXFFNFH6ZHNXHU/graph.json","events_json":"https://pith.science/api/pith-number/2HIOJL466VMTNXFFNFH6ZHNXHU/events.json","paper":"https://pith.science/paper/2HIOJL46"},"agent_actions":{"view_html":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU","download_json":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU.json","view_paper":"https://pith.science/paper/2HIOJL46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06371&json=true","fetch_graph":"https://pith.science/api/pith-number/2HIOJL466VMTNXFFNFH6ZHNXHU/graph.json","fetch_events":"https://pith.science/api/pith-number/2HIOJL466VMTNXFFNFH6ZHNXHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/action/storage_attestation","attest_author":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/action/author_attestation","sign_citation":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/action/citation_signature","submit_replication":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/action/replication_record"}},"created_at":"2026-05-17T23:53:45.732739+00:00","updated_at":"2026-05-17T23:53:45.732739+00:00"}