{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FLMWCPPYDQUQVPMO4SK72K7P7G","short_pith_number":"pith:FLMWCPPY","schema_version":"1.0","canonical_sha256":"2ad9613df81c290abd8ee495fd2beff9b5e97f25f7c78b6cbea312c5936d18ef","source":{"kind":"arxiv","id":"1108.1426","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms to Enhance Recovery Schema in Link State Protocols","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:30:46Z","abstract_excerpt":"With the increasing demands for real-time applications traffic in net- works such as video and voice a high convergence time for the existing routing protocols when failure occurred is required. These applications can be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithms schemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternative and disjoint path with the primary one from the source to the destination by re-routing traffic through it, regardless of the locations of failure and the number of failed"},"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.1426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-05T23:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"9ca4fb5f6d0cc0cc350f61ca34317a69971354943a6f81a3d0170a317ad92bdd","abstract_canon_sha256":"bcaeb3ff0170787ac1e5f054bfdf7ef3aec37232ae71723445382f28a17030b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:01.112651Z","signature_b64":"vDnAv56lkHsr2YtV/+N9siOUenl3zlmnbG8MP8x4fKm9WgUO981OUrJvaZYR/xB3rMq7Sn3iXrCk0hAbQYTSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ad9613df81c290abd8ee495fd2beff9b5e97f25f7c78b6cbea312c5936d18ef","last_reissued_at":"2026-05-18T04:16:01.111906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:01.111906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms to Enhance Recovery Schema in Link State Protocols","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:30:46Z","abstract_excerpt":"With the increasing demands for real-time applications traffic in net- works such as video and voice a high convergence time for the existing routing protocols when failure occurred is required. These applications can be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithms schemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternative and disjoint path with the primary one from the source to the destination by re-routing traffic through it, regardless of the locations of failure and the number of failed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1426","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.1426","created_at":"2026-05-18T04:16:01.112033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1426v1","created_at":"2026-05-18T04:16:01.112033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1426","created_at":"2026-05-18T04:16:01.112033+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLMWCPPYDQUQ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLMWCPPYDQUQVPMO","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLMWCPPY","created_at":"2026-05-18T12:26:28.662955+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/FLMWCPPYDQUQVPMO4SK72K7P7G","json":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G.json","graph_json":"https://pith.science/api/pith-number/FLMWCPPYDQUQVPMO4SK72K7P7G/graph.json","events_json":"https://pith.science/api/pith-number/FLMWCPPYDQUQVPMO4SK72K7P7G/events.json","paper":"https://pith.science/paper/FLMWCPPY"},"agent_actions":{"view_html":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G","download_json":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G.json","view_paper":"https://pith.science/paper/FLMWCPPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1426&json=true","fetch_graph":"https://pith.science/api/pith-number/FLMWCPPYDQUQVPMO4SK72K7P7G/graph.json","fetch_events":"https://pith.science/api/pith-number/FLMWCPPYDQUQVPMO4SK72K7P7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G/action/storage_attestation","attest_author":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G/action/author_attestation","sign_citation":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G/action/citation_signature","submit_replication":"https://pith.science/pith/FLMWCPPYDQUQVPMO4SK72K7P7G/action/replication_record"}},"created_at":"2026-05-18T04:16:01.112033+00:00","updated_at":"2026-05-18T04:16:01.112033+00:00"}