{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XX5P32XHHCGLPZLNJAYNEI5FOZ","short_pith_number":"pith:XX5P32XH","canonical_record":{"source":{"id":"1008.4264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-25T12:35:58Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"0008a501c3c58533d106eea36758144a1fe0a447d6bb2aafc47332feb6fd224b","abstract_canon_sha256":"24295b8e09145ada3718a2be281b84e6984505a3910bb4f375b2855964ffe1c6"},"schema_version":"1.0"},"canonical_sha256":"bdfafdeae7388cb7e56d4830d223a576689fb3fd5be5a7a1421465d706dc92b1","source":{"kind":"arxiv","id":"1008.4264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4264","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4264v1","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4264","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"XX5P32XHHCGL","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XX5P32XHHCGLPZLN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XX5P32XH","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XX5P32XHHCGLPZLNJAYNEI5FOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-25T12:35:58Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"0008a501c3c58533d106eea36758144a1fe0a447d6bb2aafc47332feb6fd224b","abstract_canon_sha256":"24295b8e09145ada3718a2be281b84e6984505a3910bb4f375b2855964ffe1c6"},"schema_version":"1.0"},"canonical_sha256":"bdfafdeae7388cb7e56d4830d223a576689fb3fd5be5a7a1421465d706dc92b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:53.317120Z","signature_b64":"limVMsA6l0W+4QzU7Jll7fGycRDkG2PMS38UKtQx8xoaAljOnx/NA4/OOGPPBOPm/dAprzhUddhfZfNGCUPkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdfafdeae7388cb7e56d4830d223a576689fb3fd5be5a7a1421465d706dc92b1","last_reissued_at":"2026-05-18T04:41:53.316608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:53.316608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4264","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:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYCAwjpw9E1RyFh1jyJxDEl4tt2ycVImrxIgq9UPSmmXqE4IX1hVR/Itn5uPWu4cxWQ43nBhN/3kEilUG5QHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:07:49.568362Z"},"content_sha256":"e0ac6c0fbb090333f306b2cd51fcf15f0ba41b9afe918587798a2836ea67f6ca","schema_version":"1.0","event_id":"sha256:e0ac6c0fbb090333f306b2cd51fcf15f0ba41b9afe918587798a2836ea67f6ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XX5P32XHHCGLPZLNJAYNEI5FOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Protection Design 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, Anwar I. Walid, Salah A. Aly","submitted_at":"2010-08-25T12:35:58Z","abstract_excerpt":"Link and node failures are two common fundamental problems that affect operational networks. Protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4264","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:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIc7qNR2Z0aTxYewM9dGxYPWOjqDGv71O4pMVWX7W0eWZZ+Y+rrxrkAjn59l+QPsxETjdLc7MoB5PCShr7dKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:07:49.569041Z"},"content_sha256":"3719c36ef081d1fbf4f95145921bbbca8e5074432dfaa6109781d1b78805e510","schema_version":"1.0","event_id":"sha256:3719c36ef081d1fbf4f95145921bbbca8e5074432dfaa6109781d1b78805e510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/bundle.json","state_url":"https://pith.science/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/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-05-27T15:07:49Z","links":{"resolver":"https://pith.science/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ","bundle":"https://pith.science/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/bundle.json","state":"https://pith.science/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX5P32XHHCGLPZLNJAYNEI5FOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XX5P32XHHCGLPZLNJAYNEI5FOZ","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":"24295b8e09145ada3718a2be281b84e6984505a3910bb4f375b2855964ffe1c6","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-25T12:35:58Z","title_canon_sha256":"0008a501c3c58533d106eea36758144a1fe0a447d6bb2aafc47332feb6fd224b"},"schema_version":"1.0","source":{"id":"1008.4264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4264","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4264v1","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4264","created_at":"2026-05-18T04:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"XX5P32XHHCGL","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XX5P32XHHCGLPZLN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XX5P32XH","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:3719c36ef081d1fbf4f95145921bbbca8e5074432dfaa6109781d1b78805e510","target":"graph","created_at":"2026-05-18T04:41:53Z","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":"Link and node failures are two common fundamental problems that affect operational networks. Protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection codes (NPC) are proposed to protect operational networks against link and node failures. Furthermore, encoding and decoding operations of such codes are well developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we establish limits on network protection d","authors_text":"Ahmed E. Kamal, Anwar I. Walid, 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":"2010-08-25T12:35:58Z","title":"Network Protection Design Using Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4264","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:e0ac6c0fbb090333f306b2cd51fcf15f0ba41b9afe918587798a2836ea67f6ca","target":"record","created_at":"2026-05-18T04:41:53Z","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":"24295b8e09145ada3718a2be281b84e6984505a3910bb4f375b2855964ffe1c6","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-25T12:35:58Z","title_canon_sha256":"0008a501c3c58533d106eea36758144a1fe0a447d6bb2aafc47332feb6fd224b"},"schema_version":"1.0","source":{"id":"1008.4264","kind":"arxiv","version":1}},"canonical_sha256":"bdfafdeae7388cb7e56d4830d223a576689fb3fd5be5a7a1421465d706dc92b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdfafdeae7388cb7e56d4830d223a576689fb3fd5be5a7a1421465d706dc92b1","first_computed_at":"2026-05-18T04:41:53.316608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:53.316608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"limVMsA6l0W+4QzU7Jll7fGycRDkG2PMS38UKtQx8xoaAljOnx/NA4/OOGPPBOPm/dAprzhUddhfZfNGCUPkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:53.317120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ac6c0fbb090333f306b2cd51fcf15f0ba41b9afe918587798a2836ea67f6ca","sha256:3719c36ef081d1fbf4f95145921bbbca8e5074432dfaa6109781d1b78805e510"],"state_sha256":"bfd0af50db2aa987b9dca1e9f70f1b8a71f13a9a437c92c3de5a38b28b7ed164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBFW7srEbcjg9zy31ZISuWi9WEbu3iYXxFjx8EcPGzQbtExGFgUP9o2uawSnA8DDz4a0CidmzQYZXP/cO+cxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:07:49.571676Z","bundle_sha256":"3d7e67dec5364338f54dd933687a2b9e5f0dfbbbccb9c5a2d81e68dc1a31e92b"}}