{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:HPR3CTL6XHBPQNYBZLXZKYMBPQ","short_pith_number":"pith:HPR3CTL6","canonical_record":{"source":{"id":"0809.1258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-07T23:03:22Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"63ab5029b2520ccf775e67f110108f05bd201f375779c9e7228bfeafca6914b1","abstract_canon_sha256":"2a81d340643a454b52050d415d4b4f02c4bb44ffa9a0e8b214813879490e7716"},"schema_version":"1.0"},"canonical_sha256":"3be3b14d7eb9c2f83701caef9561817c142695f8cded968d2c8cd56274902e9d","source":{"kind":"arxiv","id":"0809.1258","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:HPR3CTL6XHBPQNYBZLXZKYMBPQ","target":"record","payload":{"canonical_record":{"source":{"id":"0809.1258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-07T23:03:22Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"63ab5029b2520ccf775e67f110108f05bd201f375779c9e7228bfeafca6914b1","abstract_canon_sha256":"2a81d340643a454b52050d415d4b4f02c4bb44ffa9a0e8b214813879490e7716"},"schema_version":"1.0"},"canonical_sha256":"3be3b14d7eb9c2f83701caef9561817c142695f8cded968d2c8cd56274902e9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.384878Z","signature_b64":"dlU4j25pbHR3RSwfRBnTZIcZBlBmKDKfSDRDOsOKIsp4/nG/OpH75nF5UihqPNWP1iwoX0V+P6UcfaU8DK0dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be3b14d7eb9c2f83701caef9561817c142695f8cded968d2c8cd56274902e9d","last_reissued_at":"2026-05-18T00:58:48.384331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.384331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.1258","source_version":2,"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Du8D5YZYJ9ebqhtS4ZvrmnOPX1Pn75RzKVZHQlvI6M25+T0uzWOTwnJbMiPUx3sirc43X58ov36Jo34xVbfPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:42:04.509712Z"},"content_sha256":"da57d8e34f89bf8df2ff2fec9cb7a2031b8ac4da7e2e719f98570e16ee7d88ff","schema_version":"1.0","event_id":"sha256:da57d8e34f89bf8df2ff2fec9cb7a2031b8ac4da7e2e719f98570e16ee7d88ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:HPR3CTL6XHBPQNYBZLXZKYMBPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Protection Codes Against Link Failures Using Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed E. Kamal, Salah A. Aly","submitted_at":"2008-09-07T23:03:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1258","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"},"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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X16qC4dFu5dGVHvCLWiVkdsRxiDJrOliV4Fm0MctozJ6pZguf7R6qEl/0+/vXBBAVXXD2S7FDHrDEI9DZ1aZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:42:04.510062Z"},"content_sha256":"5ac312eef993ceb20c23274edb43925e03ab006a6735979ecf466f2f800b498d","schema_version":"1.0","event_id":"sha256:5ac312eef993ceb20c23274edb43925e03ab006a6735979ecf466f2f800b498d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/bundle.json","state_url":"https://pith.science/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/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-26T10:42:04Z","links":{"resolver":"https://pith.science/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ","bundle":"https://pith.science/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/bundle.json","state":"https://pith.science/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPR3CTL6XHBPQNYBZLXZKYMBPQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aa/YsxGkJJvjficcPojUrtM8uvqoQci86qUI4tRteVaHWymyY+zEG88LBx07WOl5cHawEby6v/PJ2k1pczw/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:42:04.512654Z","bundle_sha256":"798d9869888bbeab33f657142af456a2bc0b40f5d6b80ee6a9de7a0bc6671ef7"}}