{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7V7Z2V2LMJUKKXXEAZK5RJQDRM","short_pith_number":"pith:7V7Z2V2L","canonical_record":{"source":{"id":"1609.08141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-26T19:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"7168e3d9c50d9636017342d5810fa6056f4c63c0f36fb9c87b3cfd6190111b4c","abstract_canon_sha256":"91ec42e8b60a036a0243c35b70754f0078cbfb2266ef895e4898c37d0feb99c5"},"schema_version":"1.0"},"canonical_sha256":"fd7f9d574b6268a55ee40655d8a6038b260de54919ea57105281dff376694695","source":{"kind":"arxiv","id":"1609.08141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08141","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08141v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08141","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"7V7Z2V2LMJUK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7V7Z2V2LMJUKKXXE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7V7Z2V2L","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7V7Z2V2LMJUKKXXEAZK5RJQDRM","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-26T19:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"7168e3d9c50d9636017342d5810fa6056f4c63c0f36fb9c87b3cfd6190111b4c","abstract_canon_sha256":"91ec42e8b60a036a0243c35b70754f0078cbfb2266ef895e4898c37d0feb99c5"},"schema_version":"1.0"},"canonical_sha256":"fd7f9d574b6268a55ee40655d8a6038b260de54919ea57105281dff376694695","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.223866Z","signature_b64":"ohnr7TKt3qB7/Ewe0IWa5Rq0GHyJX7uRo0ns26GygP4rmfpN7rSA66p81iUClL2wXWfBI/X1j8thJ8f8jIJiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7f9d574b6268a55ee40655d8a6038b260de54919ea57105281dff376694695","last_reissued_at":"2026-05-18T00:41:18.223145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.223145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08141","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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVGCTQxlEFr69UbK8etuDS6HIhSTTreAvIXLOh68aO5WPwY/Fr9P1Vc366Zya0OfmWt0sw1VcEl9huzvQ8u1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:30:00.592301Z"},"content_sha256":"b953a3237d7d89c3a52d86a01113358711b8e6689c1a448e182aded9fa597083","schema_version":"1.0","event_id":"sha256:b953a3237d7d89c3a52d86a01113358711b8e6689c1a448e182aded9fa597083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7V7Z2V2LMJUKKXXEAZK5RJQDRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On-Demand Routing Algorithm with Mobility Prediction in the Mobile Ad-hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sungoh Kwon, Trung Kien Vu","submitted_at":"2016-09-26T19:54:39Z","abstract_excerpt":"In this paper, we propose an ad-hoc on-demand distance vector routing algorithm for mobile ad-hoc networks taking into account node mobility. Changeable topology of such mobile ad-hoc networks provokes overhead messages in order to search available routes and maintain found routes. The overhead messages impede data delivery from sources to destination and deteriorate network performance. To overcome such a challenge, our proposed algorithm estimates link duration based neighboring node mobility and chooses the most reliable route. The proposed algorithm also applies the estimate for route main"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08141","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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLEQ8xRntBJMh0RsPGex5Yq+ihRRmvPfCf11l8X6/G9/Sctxct4h4UTJURAJyl6mOlEOB6FjC6V7Ryg31q0LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:30:00.592665Z"},"content_sha256":"b563c9b26b24746f438dec2fcee4cd60940fb998044d0950693e8b7e4251bac9","schema_version":"1.0","event_id":"sha256:b563c9b26b24746f438dec2fcee4cd60940fb998044d0950693e8b7e4251bac9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/bundle.json","state_url":"https://pith.science/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/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-25T19:30:00Z","links":{"resolver":"https://pith.science/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM","bundle":"https://pith.science/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/bundle.json","state":"https://pith.science/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7V7Z2V2LMJUKKXXEAZK5RJQDRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7V7Z2V2LMJUKKXXEAZK5RJQDRM","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":"91ec42e8b60a036a0243c35b70754f0078cbfb2266ef895e4898c37d0feb99c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-26T19:54:39Z","title_canon_sha256":"7168e3d9c50d9636017342d5810fa6056f4c63c0f36fb9c87b3cfd6190111b4c"},"schema_version":"1.0","source":{"id":"1609.08141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08141","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08141v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08141","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"7V7Z2V2LMJUK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7V7Z2V2LMJUKKXXE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7V7Z2V2L","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b563c9b26b24746f438dec2fcee4cd60940fb998044d0950693e8b7e4251bac9","target":"graph","created_at":"2026-05-18T00:41:18Z","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":"In this paper, we propose an ad-hoc on-demand distance vector routing algorithm for mobile ad-hoc networks taking into account node mobility. Changeable topology of such mobile ad-hoc networks provokes overhead messages in order to search available routes and maintain found routes. The overhead messages impede data delivery from sources to destination and deteriorate network performance. To overcome such a challenge, our proposed algorithm estimates link duration based neighboring node mobility and chooses the most reliable route. The proposed algorithm also applies the estimate for route main","authors_text":"Sungoh Kwon, Trung Kien Vu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-26T19:54:39Z","title":"On-Demand Routing Algorithm with Mobility Prediction in the Mobile Ad-hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08141","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:b953a3237d7d89c3a52d86a01113358711b8e6689c1a448e182aded9fa597083","target":"record","created_at":"2026-05-18T00:41:18Z","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":"91ec42e8b60a036a0243c35b70754f0078cbfb2266ef895e4898c37d0feb99c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-09-26T19:54:39Z","title_canon_sha256":"7168e3d9c50d9636017342d5810fa6056f4c63c0f36fb9c87b3cfd6190111b4c"},"schema_version":"1.0","source":{"id":"1609.08141","kind":"arxiv","version":1}},"canonical_sha256":"fd7f9d574b6268a55ee40655d8a6038b260de54919ea57105281dff376694695","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7f9d574b6268a55ee40655d8a6038b260de54919ea57105281dff376694695","first_computed_at":"2026-05-18T00:41:18.223145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:18.223145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohnr7TKt3qB7/Ewe0IWa5Rq0GHyJX7uRo0ns26GygP4rmfpN7rSA66p81iUClL2wXWfBI/X1j8thJ8f8jIJiBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:18.223866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b953a3237d7d89c3a52d86a01113358711b8e6689c1a448e182aded9fa597083","sha256:b563c9b26b24746f438dec2fcee4cd60940fb998044d0950693e8b7e4251bac9"],"state_sha256":"6a75b9cab01065e08ab61a949fdff7ec3b162a7ba16e6c7c5fa3a06f3bf98ede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFo7+gXUQhXge39ppiRUUDPaiXSFi8jYtmqRJzi8t1K+Em14fEcE6qA28gkg93UZMwzLGYgnvYUSbCAMydBrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:30:00.594855Z","bundle_sha256":"38032bef86fa3097cdeec96685461217b62f4fd7cc365f0d9fa5140aa65ab724"}}