{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RNNF77WOVKGF57AMSGTANPG6T6","short_pith_number":"pith:RNNF77WO","canonical_record":{"source":{"id":"1602.08461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-02-26T20:07:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cd7b7f6c7db7adb7cdf6af34325c9aaccd2e58de3da710f213afe6bd79f750af","abstract_canon_sha256":"eb8b728299e5a230cde1a616332e0296353b28835cf679098cd412b3e3425e61"},"schema_version":"1.0"},"canonical_sha256":"8b5a5ffeceaa8c5efc0c91a606bcde9f839dd1b855a125ef18e732a828b2fbd6","source":{"kind":"arxiv","id":"1602.08461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08461","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08461v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08461","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"RNNF77WOVKGF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNNF77WOVKGF57AM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNNF77WO","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RNNF77WOVKGF57AMSGTANPG6T6","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-02-26T20:07:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cd7b7f6c7db7adb7cdf6af34325c9aaccd2e58de3da710f213afe6bd79f750af","abstract_canon_sha256":"eb8b728299e5a230cde1a616332e0296353b28835cf679098cd412b3e3425e61"},"schema_version":"1.0"},"canonical_sha256":"8b5a5ffeceaa8c5efc0c91a606bcde9f839dd1b855a125ef18e732a828b2fbd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.727582Z","signature_b64":"EmFHIQ5B9HxgwP2a3toE4gMozYDyyXijw8Rlsv2X4+YJCvqsamWw6COg28VrdjeXCsRD/HDAWFxJUAhf5BMUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b5a5ffeceaa8c5efc0c91a606bcde9f839dd1b855a125ef18e732a828b2fbd6","last_reissued_at":"2026-05-18T00:41:53.726901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.726901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08461","source_version":2,"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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RiShYpx6RtPRUTO97yt7Wyl5PUJ2dnKaMgLiPx/2azp1lSLtB8qQYJxjLFDOHFpaua6MC+2w3Ce3hgPDHJDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:32:01.488577Z"},"content_sha256":"f34a4f4adf16dc17cc503ef6a6746e3ac44b9ae1107bae4646466d3721d588c4","schema_version":"1.0","event_id":"sha256:f34a4f4adf16dc17cc503ef6a6746e3ac44b9ae1107bae4646466d3721d588c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RNNF77WOVKGF57AMSGTANPG6T6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A One-Hop Information Based Geographic Routing Protocol for Delay Tolerant MANETs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Changjiang We, Chenqu Dai, Jianbo Li, Lei You","submitted_at":"2016-02-26T20:07:24Z","abstract_excerpt":"Delay and Disruption Tolerant Networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional Mobile Ad hoc NETworks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this article, a geographic routing protocol is proposed for MANETs in delay tolerant situations, by using no more than one-hop information. A utility function is designed for implementing the under-controlled replica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08461","kind":"arxiv","version":2},"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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sc11FvDP6vm+t7Y1DgEUz58Ps0fnAoE+/m3OtuINmPX5qVnMHhLBit8wqpWkfY8Qswg9yJba1t0xQ94LVPacBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:32:01.489182Z"},"content_sha256":"ac78d29fc8e0691570d67eb2a829de8ae4de95eb206fafff8bca30feb6cfefea","schema_version":"1.0","event_id":"sha256:ac78d29fc8e0691570d67eb2a829de8ae4de95eb206fafff8bca30feb6cfefea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNNF77WOVKGF57AMSGTANPG6T6/bundle.json","state_url":"https://pith.science/pith/RNNF77WOVKGF57AMSGTANPG6T6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNNF77WOVKGF57AMSGTANPG6T6/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-04T06:32:01Z","links":{"resolver":"https://pith.science/pith/RNNF77WOVKGF57AMSGTANPG6T6","bundle":"https://pith.science/pith/RNNF77WOVKGF57AMSGTANPG6T6/bundle.json","state":"https://pith.science/pith/RNNF77WOVKGF57AMSGTANPG6T6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNNF77WOVKGF57AMSGTANPG6T6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RNNF77WOVKGF57AMSGTANPG6T6","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":"eb8b728299e5a230cde1a616332e0296353b28835cf679098cd412b3e3425e61","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-02-26T20:07:24Z","title_canon_sha256":"cd7b7f6c7db7adb7cdf6af34325c9aaccd2e58de3da710f213afe6bd79f750af"},"schema_version":"1.0","source":{"id":"1602.08461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08461","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08461v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08461","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"RNNF77WOVKGF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNNF77WOVKGF57AM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNNF77WO","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:ac78d29fc8e0691570d67eb2a829de8ae4de95eb206fafff8bca30feb6cfefea","target":"graph","created_at":"2026-05-18T00:41:53Z","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":"Delay and Disruption Tolerant Networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional Mobile Ad hoc NETworks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this article, a geographic routing protocol is proposed for MANETs in delay tolerant situations, by using no more than one-hop information. A utility function is designed for implementing the under-controlled replica","authors_text":"Changjiang We, Chenqu Dai, Jianbo Li, Lei You","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-02-26T20:07:24Z","title":"A One-Hop Information Based Geographic Routing Protocol for Delay Tolerant MANETs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08461","kind":"arxiv","version":2},"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:f34a4f4adf16dc17cc503ef6a6746e3ac44b9ae1107bae4646466d3721d588c4","target":"record","created_at":"2026-05-18T00:41:53Z","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":"eb8b728299e5a230cde1a616332e0296353b28835cf679098cd412b3e3425e61","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-02-26T20:07:24Z","title_canon_sha256":"cd7b7f6c7db7adb7cdf6af34325c9aaccd2e58de3da710f213afe6bd79f750af"},"schema_version":"1.0","source":{"id":"1602.08461","kind":"arxiv","version":2}},"canonical_sha256":"8b5a5ffeceaa8c5efc0c91a606bcde9f839dd1b855a125ef18e732a828b2fbd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b5a5ffeceaa8c5efc0c91a606bcde9f839dd1b855a125ef18e732a828b2fbd6","first_computed_at":"2026-05-18T00:41:53.726901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:53.726901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EmFHIQ5B9HxgwP2a3toE4gMozYDyyXijw8Rlsv2X4+YJCvqsamWw6COg28VrdjeXCsRD/HDAWFxJUAhf5BMUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:53.727582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34a4f4adf16dc17cc503ef6a6746e3ac44b9ae1107bae4646466d3721d588c4","sha256:ac78d29fc8e0691570d67eb2a829de8ae4de95eb206fafff8bca30feb6cfefea"],"state_sha256":"af8fe70f84d2655c747932223b6c1db65e37a0d04e844233027ff96e55eeea50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhthNWLhS2XMU5W5OtSCVv1+/oZwL/5R1MYdpFzI9BmnCgk+R996+ZzvL4eh+tbOYR039BFKRv+bwAZgGKGTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:32:01.491242Z","bundle_sha256":"3eeff7f6a794dae3c9a109dcb09c0d3754ef40a433268846828fe0d631536f1a"}}