{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3UR6QQIUZUD3CZ7ZKIP53AOKWV","short_pith_number":"pith:3UR6QQIU","schema_version":"1.0","canonical_sha256":"dd23e84114cd07b167f9521fdd81cab562a80f22827646931b7065c502598f2a","source":{"kind":"arxiv","id":"1108.1425","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.1425","created_at":"2026-05-18T04:16:01.122347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1425v1","created_at":"2026-05-18T04:16:01.122347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1425","created_at":"2026-05-18T04:16:01.122347+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UR6QQIUZUD3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UR6QQIUZUD3CZ7Z","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UR6QQIU","created_at":"2026-05-18T12:26:20.644004+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/3UR6QQIUZUD3CZ7ZKIP53AOKWV","json":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV.json","graph_json":"https://pith.science/api/pith-number/3UR6QQIUZUD3CZ7ZKIP53AOKWV/graph.json","events_json":"https://pith.science/api/pith-number/3UR6QQIUZUD3CZ7ZKIP53AOKWV/events.json","paper":"https://pith.science/paper/3UR6QQIU"},"agent_actions":{"view_html":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV","download_json":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV.json","view_paper":"https://pith.science/paper/3UR6QQIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1425&json=true","fetch_graph":"https://pith.science/api/pith-number/3UR6QQIUZUD3CZ7ZKIP53AOKWV/graph.json","fetch_events":"https://pith.science/api/pith-number/3UR6QQIUZUD3CZ7ZKIP53AOKWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/action/storage_attestation","attest_author":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/action/author_attestation","sign_citation":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/action/citation_signature","submit_replication":"https://pith.science/pith/3UR6QQIUZUD3CZ7ZKIP53AOKWV/action/replication_record"}},"created_at":"2026-05-18T04:16:01.122347+00:00","updated_at":"2026-05-18T04:16:01.122347+00:00"}