{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3UR6QQIUZUD3CZ7ZKIP53AOKWV","short_pith_number":"pith:3UR6QQIU","canonical_record":{"source":{"id":"1108.1425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:24:46Z","cross_cats_sorted":[],"title_canon_sha256":"cc0bf8a0aab4aa70f839e16e3d29a68b51e4316b09e21fd252b08d658677d319","abstract_canon_sha256":"735e3469ed9b6c2f4346e752f4902f9720a74f99a143be8f1424e0cbe1a0e137"},"schema_version":"1.0"},"canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","source":{"kind":"arxiv","id":"1108.1425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1425","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1425v1","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1425","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"3UR6QQIUZUD3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UR6QQIUZUD3CZ7Z","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UR6QQIU","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3UR6QQIUZUD3CZ7ZKIP53AOKWV","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:24:46Z","cross_cats_sorted":[],"title_canon_sha256":"cc0bf8a0aab4aa70f839e16e3d29a68b51e4316b09e21fd252b08d658677d319","abstract_canon_sha256":"735e3469ed9b6c2f4346e752f4902f9720a74f99a143be8f1424e0cbe1a0e137"},"schema_version":"1.0"},"canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:01.122895Z","signature_b64":"O5HtyLy5bZY3YwpUvXtt+pNX/kFDAigv2dDJCrHEZmOQdRs+xIbSAepPTwGsdXqGbMAvJEh/Lm8TKI6QvzsFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","last_reissued_at":"2026-05-18T04:16:01.122215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:01.122215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1425","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-18T04:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8mE+Xp3Y8t2llMOj9iqCFNkKg+NZV4CR9ilQSfoCcBGjfNtfrA9VUVVC3IM+8DlLGChlMB8PrukTuKK9c3KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:11:35.779369Z"},"content_sha256":"3b055dac972cc7dbb81f49b8e27d8eeceaf97ae5c51c6c111a7266752063dcfa","schema_version":"1.0","event_id":"sha256:3b055dac972cc7dbb81f49b8e27d8eeceaf97ae5c51c6c111a7266752063dcfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3UR6QQIUZUD3CZ7ZKIP53AOKWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Driven Backup Routing Table to Find Alternative Dijoint Path in Ad Hoc Wireless","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Mohammed Ghanbari, Radwan abujassar","submitted_at":"2011-08-05T23:24:46Z","abstract_excerpt":"The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-to- end delays will increase thereby reducing throughput and degrading the performance of the network. This paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve the existing proactive protocols such as DSDV (Destination Sequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1425","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-18T04:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAaS9E1nqiIVnHFiryEIAFbtNcKAWjcmG2iIYc2HRCnKMq4o+HhXoGKl0fXMTZwKVo07PzqgK1Ho6N5o/dGaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:11:35.779722Z"},"content_sha256":"ebe14429f13fd9bfe52a0d16132dc964bbd9e7962bfe5ae183a90db8348d2eef","schema_version":"1.0","event_id":"sha256:ebe14429f13fd9bfe52a0d16132dc964bbd9e7962bfe5ae183a90db8348d2eef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/bundle.json","state_url":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/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-30T19:11:35Z","links":{"resolver":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV","bundle":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/bundle.json","state":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3UR6QQIUZUD3CZ7ZKIP53AOKWV","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":"735e3469ed9b6c2f4346e752f4902f9720a74f99a143be8f1424e0cbe1a0e137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:24:46Z","title_canon_sha256":"cc0bf8a0aab4aa70f839e16e3d29a68b51e4316b09e21fd252b08d658677d319"},"schema_version":"1.0","source":{"id":"1108.1425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1425","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1425v1","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1425","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"3UR6QQIUZUD3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"3UR6QQIUZUD3CZ7Z","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"3UR6QQIU","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:ebe14429f13fd9bfe52a0d16132dc964bbd9e7962bfe5ae183a90db8348d2eef","target":"graph","created_at":"2026-05-18T04:16:01Z","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":"The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-to- end delays will increase thereby reducing throughput and degrading the performance of the network. This paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve the existing proactive protocols such as DSDV (Destination Sequ","authors_text":"Mohammed Ghanbari, Radwan abujassar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:24:46Z","title":"A Driven Backup Routing Table to Find Alternative Dijoint Path in Ad Hoc Wireless"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1425","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:3b055dac972cc7dbb81f49b8e27d8eeceaf97ae5c51c6c111a7266752063dcfa","target":"record","created_at":"2026-05-18T04:16:01Z","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":"735e3469ed9b6c2f4346e752f4902f9720a74f99a143be8f1424e0cbe1a0e137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:24:46Z","title_canon_sha256":"cc0bf8a0aab4aa70f839e16e3d29a68b51e4316b09e21fd252b08d658677d319"},"schema_version":"1.0","source":{"id":"1108.1425","kind":"arxiv","version":1}},"canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","first_computed_at":"2026-05-18T04:16:01.122215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:01.122215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O5HtyLy5bZY3YwpUvXtt+pNX/kFDAigv2dDJCrHEZmOQdRs+xIbSAepPTwGsdXqGbMAvJEh/Lm8TKI6QvzsFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:01.122895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b055dac972cc7dbb81f49b8e27d8eeceaf97ae5c51c6c111a7266752063dcfa","sha256:ebe14429f13fd9bfe52a0d16132dc964bbd9e7962bfe5ae183a90db8348d2eef"],"state_sha256":"7e538ba5f01c68d9dce7fe53730691097855cf17986b5701f23673e58fd5d1f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XN1e3JDTyBS70Vmk67xUm6ol+OnNbCfkqHRmfssrKKz/I9d3ZwLapJaUE6X/llhee99Lv/4lmEZiVEtGkdrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:11:35.781705Z","bundle_sha256":"30af23d9e23329bab893d26e91e372149797fe0013656e14a7bdc40119072686"}}