{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2HIOJL466VMTNXFFNFH6ZHNXHU","short_pith_number":"pith:2HIOJL46","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"},"canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","source":{"kind":"arxiv","id":"1902.06371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06371","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06371v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06371","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"2HIOJL466VMT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2HIOJL466VMTNXFF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2HIOJL46","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2HIOJL466VMTNXFFNFH6ZHNXHU","target":"record","payload":{"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"},"canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","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"},"source_kind":"arxiv","source_id":"1902.06371","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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xXzBlUxnk2IA+S0FFP0+iExh3K3GR+SWsnpaaXgQwVRl9fj+qvrqmWkFNCeg1yL8C5IclduXN0tzl9427oxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:45:07.158275Z"},"content_sha256":"72c24d8d811708980a735f6e06eedc27a5b5914fabea5a916633e6506a3b18ab","schema_version":"1.0","event_id":"sha256:72c24d8d811708980a735f6e06eedc27a5b5914fabea5a916633e6506a3b18ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2HIOJL466VMTNXFFNFH6ZHNXHU","target":"graph","payload":{"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"},"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-17T23:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FHZZI+HHdNDQuRUQpsLCjjjgiXSUhZSL/uVo/R3ODQF0lp9RFt6ckavm8xwNE85scg0mrR9Umni+jA2iW93BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:45:07.158894Z"},"content_sha256":"2ddd568904c6621f3cbd45d3838b5e33c8a58b0b698b38925ce505b54b23302e","schema_version":"1.0","event_id":"sha256:2ddd568904c6621f3cbd45d3838b5e33c8a58b0b698b38925ce505b54b23302e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/bundle.json","state_url":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/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-05-26T14:45:07Z","links":{"resolver":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU","bundle":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/bundle.json","state":"https://pith.science/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HIOJL466VMTNXFFNFH6ZHNXHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2HIOJL466VMTNXFFNFH6ZHNXHU","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":"7e4ddd86a0b9e4bab42363900418e057e3b6af5c2492b1651a4385e22edd1163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-18T01:30:14Z","title_canon_sha256":"8be8dedaab87f4814997e44b1adb0b225a56b12729d4bf6343b602b7c6d75484"},"schema_version":"1.0","source":{"id":"1902.06371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06371","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06371v1","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06371","created_at":"2026-05-17T23:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"2HIOJL466VMT","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2HIOJL466VMTNXFF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2HIOJL46","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:2ddd568904c6621f3cbd45d3838b5e33c8a58b0b698b38925ce505b54b23302e","target":"graph","created_at":"2026-05-17T23:53:45Z","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 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","authors_text":"Anish Arora, Dhrubojyoti Roy, Mukundan Sridharan, Satyajeet Deshpande","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-18T01:30:14Z","title":"Achieving Throughput via Fine-Grained Path Planning in Small World DTNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06371","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:72c24d8d811708980a735f6e06eedc27a5b5914fabea5a916633e6506a3b18ab","target":"record","created_at":"2026-05-17T23:53:45Z","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":"7e4ddd86a0b9e4bab42363900418e057e3b6af5c2492b1651a4385e22edd1163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-18T01:30:14Z","title_canon_sha256":"8be8dedaab87f4814997e44b1adb0b225a56b12729d4bf6343b602b7c6d75484"},"schema_version":"1.0","source":{"id":"1902.06371","kind":"arxiv","version":1}},"canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1d0e4af9ef55936dca5694fec9db73d2406e6f794cbe47e03cea9ac31e30919","first_computed_at":"2026-05-17T23:53:45.732652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:45.732652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Us8ZWzk+C2aYTk02lOStSFL6YP78k/Dv1vHmB5i4XDh5Nnr/6OGQS0Ha4Mez6eMv7lho/4oK0BCn5Rj4B3byAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:45.733230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72c24d8d811708980a735f6e06eedc27a5b5914fabea5a916633e6506a3b18ab","sha256:2ddd568904c6621f3cbd45d3838b5e33c8a58b0b698b38925ce505b54b23302e"],"state_sha256":"6ac7bef3fe78eee77b9ae08bd66e3cf78e381b057d20ec18c9ddfff07a340ec9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nA8a0Y7BnIGiXFznwITclz8+8qaUCj8fXlzUKw8793C5seEz05QqWUEr4UaJISMmRPtTLy4FeRuZg7LXG/XuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:45:07.161895Z","bundle_sha256":"eee280eecacaae1beac58af4c97c7a1640c29905fe19ed95f7011e5d486a20d5"}}