{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GRKFNDOROGNHKIPHFH2KFNPRHF","short_pith_number":"pith:GRKFNDOR","schema_version":"1.0","canonical_sha256":"3454568dd1719a7521e729f4a2b5f1395a85bb4463c86e72daf622dd70506c55","source":{"kind":"arxiv","id":"1506.04729","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.04729","created_at":"2026-05-18T01:44:10.780555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04729v4","created_at":"2026-05-18T01:44:10.780555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04729","created_at":"2026-05-18T01:44:10.780555+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRKFNDOROGNH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRKFNDOROGNHKIPH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRKFNDOR","created_at":"2026-05-18T12:29:22.688609+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/GRKFNDOROGNHKIPHFH2KFNPRHF","json":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF.json","graph_json":"https://pith.science/api/pith-number/GRKFNDOROGNHKIPHFH2KFNPRHF/graph.json","events_json":"https://pith.science/api/pith-number/GRKFNDOROGNHKIPHFH2KFNPRHF/events.json","paper":"https://pith.science/paper/GRKFNDOR"},"agent_actions":{"view_html":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF","download_json":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF.json","view_paper":"https://pith.science/paper/GRKFNDOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04729&json=true","fetch_graph":"https://pith.science/api/pith-number/GRKFNDOROGNHKIPHFH2KFNPRHF/graph.json","fetch_events":"https://pith.science/api/pith-number/GRKFNDOROGNHKIPHFH2KFNPRHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/action/storage_attestation","attest_author":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/action/author_attestation","sign_citation":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/action/citation_signature","submit_replication":"https://pith.science/pith/GRKFNDOROGNHKIPHFH2KFNPRHF/action/replication_record"}},"created_at":"2026-05-18T01:44:10.780555+00:00","updated_at":"2026-05-18T01:44:10.780555+00:00"}