{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GRKFNDOROGNHKIPHFH2KFNPRHF","short_pith_number":"pith:GRKFNDOR","canonical_record":{"source":{"id":"1506.04729","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-15T19:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"3f55032ab53c07a83b73a27e8817996990316332250ee130572ddcadd4d55928","abstract_canon_sha256":"201accc9caf190322b5d2f5fa960ba3ccd2793bc1d424875e08bad70fb1da439"},"schema_version":"1.0"},"canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","source":{"kind":"arxiv","id":"1506.04729","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04729","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04729v4","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04729","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"GRKFNDOROGNH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRKFNDOROGNHKIPH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRKFNDOR","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GRKFNDOROGNHKIPHFH2KFNPRHF","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04729","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-15T19:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"3f55032ab53c07a83b73a27e8817996990316332250ee130572ddcadd4d55928","abstract_canon_sha256":"201accc9caf190322b5d2f5fa960ba3ccd2793bc1d424875e08bad70fb1da439"},"schema_version":"1.0"},"canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:10.781209Z","signature_b64":"7AC5QvbqcExhFnKxw/qNp/GBYcYTPdHQbOKAny3LZUoxcVmolrpwp6W+rluGtvyNynZGQBEcPJhWS91YFQgCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","last_reissued_at":"2026-05-18T01:44:10.780403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:10.780403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04729","source_version":4,"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-18T01:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvaHwx4gGBPWMvyS9MJ2w1FoDTqSh3212z3KE5ZQBC9ffiqqeH52FlLq7c9oousuI1NfHX18KSfLZ9LPrW3xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:42:41.254622Z"},"content_sha256":"9b9cd54b6fbb538033ab1cc2da18f0a2f8337ae2e94a3a2224b87874473d4ab2","schema_version":"1.0","event_id":"sha256:9b9cd54b6fbb538033ab1cc2da18f0a2f8337ae2e94a3a2224b87874473d4ab2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GRKFNDOROGNHKIPHFH2KFNPRHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks with Meeting Rate Estimations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mark Coates, Shohreh Shaghaghian","submitted_at":"2015-06-15T19:49:48Z","abstract_excerpt":"Data transfer in opportunistic Delay Tolerant Networks (DTNs) must rely on unscheduled sporadic meetings between nodes. The main challenge in these networks is to develop a mechanism based on which nodes can learn to make nearly optimal forwarding decision rules despite having no a-priori knowledge of the network topology. The forwarding mechanism should ideally result in a high delivery probability, low average latency and efficient usage of the network resources. In this paper, we propose both centralized and decentralized single-copy message forwarding algorithms that, under relatively stro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04729","kind":"arxiv","version":4},"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-18T01:44:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMUsZFjAneo4+lMRjPcw3GjahfcgUp6467O0B/crfeVxZ0oMBxy7anXLnUFmFEdvsm1hCdhaZP/9VCEYLiqlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:42:41.254964Z"},"content_sha256":"818cb29997150fc50b74af07fccbc6866c8feaecb2944be3c22ee0e824b7b296","schema_version":"1.0","event_id":"sha256:818cb29997150fc50b74af07fccbc6866c8feaecb2944be3c22ee0e824b7b296"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/bundle.json","state_url":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/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-07-05T11:42:41Z","links":{"resolver":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF","bundle":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/bundle.json","state":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GRKFNDOROGNHKIPHFH2KFNPRHF","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":"201accc9caf190322b5d2f5fa960ba3ccd2793bc1d424875e08bad70fb1da439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-15T19:49:48Z","title_canon_sha256":"3f55032ab53c07a83b73a27e8817996990316332250ee130572ddcadd4d55928"},"schema_version":"1.0","source":{"id":"1506.04729","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04729","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04729v4","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04729","created_at":"2026-05-18T01:44:10Z"},{"alias_kind":"pith_short_12","alias_value":"GRKFNDOROGNH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRKFNDOROGNHKIPH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRKFNDOR","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:818cb29997150fc50b74af07fccbc6866c8feaecb2944be3c22ee0e824b7b296","target":"graph","created_at":"2026-05-18T01:44:10Z","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":"Data transfer in opportunistic Delay Tolerant Networks (DTNs) must rely on unscheduled sporadic meetings between nodes. The main challenge in these networks is to develop a mechanism based on which nodes can learn to make nearly optimal forwarding decision rules despite having no a-priori knowledge of the network topology. The forwarding mechanism should ideally result in a high delivery probability, low average latency and efficient usage of the network resources. In this paper, we propose both centralized and decentralized single-copy message forwarding algorithms that, under relatively stro","authors_text":"Mark Coates, Shohreh Shaghaghian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-15T19:49:48Z","title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks with Meeting Rate Estimations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04729","kind":"arxiv","version":4},"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:9b9cd54b6fbb538033ab1cc2da18f0a2f8337ae2e94a3a2224b87874473d4ab2","target":"record","created_at":"2026-05-18T01:44:10Z","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":"201accc9caf190322b5d2f5fa960ba3ccd2793bc1d424875e08bad70fb1da439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-15T19:49:48Z","title_canon_sha256":"3f55032ab53c07a83b73a27e8817996990316332250ee130572ddcadd4d55928"},"schema_version":"1.0","source":{"id":"1506.04729","kind":"arxiv","version":4}},"canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","first_computed_at":"2026-05-18T01:44:10.780403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:10.780403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7AC5QvbqcExhFnKxw/qNp/GBYcYTPdHQbOKAny3LZUoxcVmolrpwp6W+rluGtvyNynZGQBEcPJhWS91YFQgCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:10.781209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04729","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9cd54b6fbb538033ab1cc2da18f0a2f8337ae2e94a3a2224b87874473d4ab2","sha256:818cb29997150fc50b74af07fccbc6866c8feaecb2944be3c22ee0e824b7b296"],"state_sha256":"e2d320e7365cd22b4141717644e030da57e17aa8455df32e16149db48fe19ab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bv+Sh0AedQZXdk8cEQmFUD/DeaQZHfj22ySbTYQiLQTHStjgrElu05aI4DkoWsDdZoZxqdIEKRs81DRqHJWoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:42:41.256812Z","bundle_sha256":"347a2be8fc7250e7c56212c4e6e31ed8a81caeccbb1973b7b2cdbf3d88670b3d"}}