{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V4D3SW5CARICRIYSDSKXOC7Q7O","short_pith_number":"pith:V4D3SW5C","schema_version":"1.0","canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","source":{"kind":"arxiv","id":"1011.3550","version":1},"attestation_state":"computed","paper":{"title":"Overlay Protection Against Link Failures Using Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Ahmed E. Kamal, Long Long, Shizheng Li","submitted_at":"2010-11-15T23:19:01Z","abstract_excerpt":"This paper introduces a network coding-based protection scheme against single and multiple link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one copy on the working circuit, and a second copy that can be extracted from linear combinations of data units transmitted on a shared protection path. This guarantees instantaneous recovery of data units upon the failure of a working circuit. The strategy can be implemented at an overlay layer, which makes its deployment simple and scalable. While the proposed strategy is similar in s"},"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":"1011.3550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-15T23:19:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b85eca899f8235c711799ce651f85c8c2a59ee4cd054fd1f1272861275db0490","abstract_canon_sha256":"4f9728603470b0540f324dda6e1726a5399370a86a29dc55e0859b808029cf63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:48.580191Z","signature_b64":"FB73ItJvNPyI5HTKhJt8A+NdSEhX7aM8VACgxwaV6ntInlyYoCJKr/YEiPw/5TICcuNaoTu7spA04x1L7BptBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","last_reissued_at":"2026-05-18T04:35:48.579527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:48.579527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlay Protection Against Link Failures Using Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Ahmed E. Kamal, Long Long, Shizheng Li","submitted_at":"2010-11-15T23:19:01Z","abstract_excerpt":"This paper introduces a network coding-based protection scheme against single and multiple link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one copy on the working circuit, and a second copy that can be extracted from linear combinations of data units transmitted on a shared protection path. This guarantees instantaneous recovery of data units upon the failure of a working circuit. The strategy can be implemented at an overlay layer, which makes its deployment simple and scalable. While the proposed strategy is similar in s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3550","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":"1011.3550","created_at":"2026-05-18T04:35:48.579628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3550v1","created_at":"2026-05-18T04:35:48.579628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3550","created_at":"2026-05-18T04:35:48.579628+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4D3SW5CARIC","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4D3SW5CARICRIYS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4D3SW5C","created_at":"2026-05-18T12:26:15.391820+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/V4D3SW5CARICRIYSDSKXOC7Q7O","json":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O.json","graph_json":"https://pith.science/api/pith-number/V4D3SW5CARICRIYSDSKXOC7Q7O/graph.json","events_json":"https://pith.science/api/pith-number/V4D3SW5CARICRIYSDSKXOC7Q7O/events.json","paper":"https://pith.science/paper/V4D3SW5C"},"agent_actions":{"view_html":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O","download_json":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O.json","view_paper":"https://pith.science/paper/V4D3SW5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3550&json=true","fetch_graph":"https://pith.science/api/pith-number/V4D3SW5CARICRIYSDSKXOC7Q7O/graph.json","fetch_events":"https://pith.science/api/pith-number/V4D3SW5CARICRIYSDSKXOC7Q7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/action/storage_attestation","attest_author":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/action/author_attestation","sign_citation":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/action/citation_signature","submit_replication":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/action/replication_record"}},"created_at":"2026-05-18T04:35:48.579628+00:00","updated_at":"2026-05-18T04:35:48.579628+00:00"}