{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:V4D3SW5CARICRIYSDSKXOC7Q7O","short_pith_number":"pith:V4D3SW5C","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"},"canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","source":{"kind":"arxiv","id":"1011.3550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3550","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3550v1","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3550","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"V4D3SW5CARIC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V4D3SW5CARICRIYS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V4D3SW5C","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:V4D3SW5CARICRIYSDSKXOC7Q7O","target":"record","payload":{"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"},"canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","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"},"source_kind":"arxiv","source_id":"1011.3550","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:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smyvsYzaR1P+cuMPFaSRxtNK/qb3hTGH76+nDZ3BDLBrcfJ9jy1T48UJ6dxphxOIF6JQUnBXfshgT8kKBmm4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:56:30.852795Z"},"content_sha256":"e11db2e3de68b14a5a21c7604806c8e72e668beb7fef45e18def4147ea516118","schema_version":"1.0","event_id":"sha256:e11db2e3de68b14a5a21c7604806c8e72e668beb7fef45e18def4147ea516118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:V4D3SW5CARICRIYSDSKXOC7Q7O","target":"graph","payload":{"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"},"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:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trSQhOeXof9ReiuTjAmP9NyAqr9tAg3OBL91iiyZYEiljTTbM+888ZUmL818eTJIJtNIuDkif2jTIS//KgMaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:56:30.853148Z"},"content_sha256":"56a1a69ecff0928d14d76fca01df40b1fdb76a8df019b8190d48e73a6bb25fee","schema_version":"1.0","event_id":"sha256:56a1a69ecff0928d14d76fca01df40b1fdb76a8df019b8190d48e73a6bb25fee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/bundle.json","state_url":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/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-22T20:56:30Z","links":{"resolver":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O","bundle":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/bundle.json","state":"https://pith.science/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4D3SW5CARICRIYSDSKXOC7Q7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:V4D3SW5CARICRIYSDSKXOC7Q7O","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":"4f9728603470b0540f324dda6e1726a5399370a86a29dc55e0859b808029cf63","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-15T23:19:01Z","title_canon_sha256":"b85eca899f8235c711799ce651f85c8c2a59ee4cd054fd1f1272861275db0490"},"schema_version":"1.0","source":{"id":"1011.3550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3550","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3550v1","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3550","created_at":"2026-05-18T04:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"V4D3SW5CARIC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V4D3SW5CARICRIYS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V4D3SW5C","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:56a1a69ecff0928d14d76fca01df40b1fdb76a8df019b8190d48e73a6bb25fee","target":"graph","created_at":"2026-05-18T04:35:48Z","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":"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","authors_text":"Aditya Ramamoorthy, Ahmed E. Kamal, Long Long, Shizheng Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-15T23:19:01Z","title":"Overlay Protection Against Link Failures Using Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3550","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:e11db2e3de68b14a5a21c7604806c8e72e668beb7fef45e18def4147ea516118","target":"record","created_at":"2026-05-18T04:35:48Z","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":"4f9728603470b0540f324dda6e1726a5399370a86a29dc55e0859b808029cf63","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-15T23:19:01Z","title_canon_sha256":"b85eca899f8235c711799ce651f85c8c2a59ee4cd054fd1f1272861275db0490"},"schema_version":"1.0","source":{"id":"1011.3550","kind":"arxiv","version":1}},"canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af07b95ba2045028a3121c95770bf0fb97ce2a92691984b16e0b7b50e520ccf9","first_computed_at":"2026-05-18T04:35:48.579527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:48.579527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FB73ItJvNPyI5HTKhJt8A+NdSEhX7aM8VACgxwaV6ntInlyYoCJKr/YEiPw/5TICcuNaoTu7spA04x1L7BptBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:48.580191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e11db2e3de68b14a5a21c7604806c8e72e668beb7fef45e18def4147ea516118","sha256:56a1a69ecff0928d14d76fca01df40b1fdb76a8df019b8190d48e73a6bb25fee"],"state_sha256":"2252c9bc9c1d05dc32a6ccad58f499900ab2187ccc0872c813c15a77c88625c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxypVRhnmO8Rj2CTSFalE8I7+JLvMKigdWf2+6yZmQRXGJ+YiFMmbsEu8CLKFXDndOlLL9zSfnh8qJdbrzvICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:56:30.855114Z","bundle_sha256":"c1a02bfb54eaf68157a0b08332e3c6173243b2d2577fce820b59e2dd3d97f4ba"}}