{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V4AIXZLDDSG2IJHKFWCOS6D3C7","short_pith_number":"pith:V4AIXZLD","schema_version":"1.0","canonical_sha256":"af008be5631c8da424ea2d84e9787b17ddbbba283ac9e13d6a604c94db7e7fb8","source":{"kind":"arxiv","id":"1112.4955","version":2},"attestation_state":"computed","paper":{"title":"Coded Path Protection: Efficient Conversion of Sharing to Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ender Ayanoglu, Serhat Nazim Avci","submitted_at":"2011-12-21T09:20:22Z","abstract_excerpt":"Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow and require complex signaling. Additionally, real-time reconfiguration of a cross-connect threatens their transmission integrity. On the other hand, coding-based protection schemes are proactive. Therefore, they have higher restoration speed, lower signaling complexity, and higher transmission integrity. This paper introduces a coding-based protection scheme, named Coded Path Protection (CPP). In CPP, a backup copy of the primary data "},"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":"1112.4955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-21T09:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"a57c264b700f0274934d4cf11eff0fbf7e87e29506d1646ad0615851e6c2fc81","abstract_canon_sha256":"d61a8d619d54c1e66f642a5afe87b06416acfed22c0bba88b69ea38280a834d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.930185Z","signature_b64":"2jT5Wd6JiaLEH5DR8nMZiUAyLqxbfQEFKpDgqyVIx8dMsGTdOcxRKA6Scp6hNzm1XjghOeVMVtTH7aChX9NlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af008be5631c8da424ea2d84e9787b17ddbbba283ac9e13d6a604c94db7e7fb8","last_reissued_at":"2026-05-18T03:53:44.929620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.929620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Path Protection: Efficient Conversion of Sharing to Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ender Ayanoglu, Serhat Nazim Avci","submitted_at":"2011-12-21T09:20:22Z","abstract_excerpt":"Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow and require complex signaling. Additionally, real-time reconfiguration of a cross-connect threatens their transmission integrity. On the other hand, coding-based protection schemes are proactive. Therefore, they have higher restoration speed, lower signaling complexity, and higher transmission integrity. This paper introduces a coding-based protection scheme, named Coded Path Protection (CPP). In CPP, a backup copy of the primary data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4955","kind":"arxiv","version":2},"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":"1112.4955","created_at":"2026-05-18T03:53:44.929725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4955v2","created_at":"2026-05-18T03:53:44.929725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4955","created_at":"2026-05-18T03:53:44.929725+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4AIXZLDDSG2","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4AIXZLDDSG2IJHK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4AIXZLD","created_at":"2026-05-18T12:26:42.757692+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/V4AIXZLDDSG2IJHKFWCOS6D3C7","json":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7.json","graph_json":"https://pith.science/api/pith-number/V4AIXZLDDSG2IJHKFWCOS6D3C7/graph.json","events_json":"https://pith.science/api/pith-number/V4AIXZLDDSG2IJHKFWCOS6D3C7/events.json","paper":"https://pith.science/paper/V4AIXZLD"},"agent_actions":{"view_html":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7","download_json":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7.json","view_paper":"https://pith.science/paper/V4AIXZLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4955&json=true","fetch_graph":"https://pith.science/api/pith-number/V4AIXZLDDSG2IJHKFWCOS6D3C7/graph.json","fetch_events":"https://pith.science/api/pith-number/V4AIXZLDDSG2IJHKFWCOS6D3C7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7/action/storage_attestation","attest_author":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7/action/author_attestation","sign_citation":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7/action/citation_signature","submit_replication":"https://pith.science/pith/V4AIXZLDDSG2IJHKFWCOS6D3C7/action/replication_record"}},"created_at":"2026-05-18T03:53:44.929725+00:00","updated_at":"2026-05-18T03:53:44.929725+00:00"}