{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:HPR3CTL6XHBPQNYBZLXZKYMBPQ","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":"2a81d340643a454b52050d415d4b4f02c4bb44ffa9a0e8b214813879490e7716","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-07T23:03:22Z","title_canon_sha256":"63ab5029b2520ccf775e67f110108f05bd201f375779c9e7228bfeafca6914b1"},"schema_version":"1.0","source":{"id":"0809.1258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.1258","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0809.1258v2","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1258","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"HPR3CTL6XHBP","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"HPR3CTL6XHBPQNYB","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"HPR3CTL6","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:5ac312eef993ceb20c23274edb43925e03ab006a6735979ecf466f2f800b498d","target":"graph","created_at":"2026-05-18T00:58: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":"Protecting against link failures in communication networks is essential to increase robustness, accessibility, and reliability of data transmission. Recently, network coding has been proposed as a solution to provide agile and cost efficient network protection against link failures, which does not require data rerouting, or packet retransmission. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose. In this paper, we propose network protection codes against a sing","authors_text":"Ahmed E. Kamal, Salah A. Aly","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-07T23:03:22Z","title":"Network Protection Codes Against Link Failures Using Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1258","kind":"arxiv","version":2},"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:da57d8e34f89bf8df2ff2fec9cb7a2031b8ac4da7e2e719f98570e16ee7d88ff","target":"record","created_at":"2026-05-18T00:58: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":"2a81d340643a454b52050d415d4b4f02c4bb44ffa9a0e8b214813879490e7716","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-07T23:03:22Z","title_canon_sha256":"63ab5029b2520ccf775e67f110108f05bd201f375779c9e7228bfeafca6914b1"},"schema_version":"1.0","source":{"id":"0809.1258","kind":"arxiv","version":2}},"canonical_sha256":"3be3b14d7eb9c2f83701caef9561817c142695f8cded968d2c8cd56274902e9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3be3b14d7eb9c2f83701caef9561817c142695f8cded968d2c8cd56274902e9d","first_computed_at":"2026-05-18T00:58:48.384331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.384331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dlU4j25pbHR3RSwfRBnTZIcZBlBmKDKfSDRDOsOKIsp4/nG/OpH75nF5UihqPNWP1iwoX0V+P6UcfaU8DK0dCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.384878Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.1258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da57d8e34f89bf8df2ff2fec9cb7a2031b8ac4da7e2e719f98570e16ee7d88ff","sha256:5ac312eef993ceb20c23274edb43925e03ab006a6735979ecf466f2f800b498d"],"state_sha256":"f63252fa7f0bcaa5a187adf8c506a9cadd88640b9c1a189b4dfb4197425b886a"}