{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KSD4HCGEUTADND4RICEQYNU2NN","short_pith_number":"pith:KSD4HCGE","canonical_record":{"source":{"id":"1208.5528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-27T22:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"bd068e531e466fd87641e75ef372f6b6e1549eec269504cf33e19ab1f9e9fb36","abstract_canon_sha256":"1a774743f5b271d8a5a6466121b95954ce24c0bca2d39c3269de1957fd7ca040"},"schema_version":"1.0"},"canonical_sha256":"5487c388c4a4c0368f9140890c369a6b68e0645a7ed4e776a4a557d2f729cad1","source":{"kind":"arxiv","id":"1208.5528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5528","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5528v1","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5528","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"KSD4HCGEUTAD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSD4HCGEUTADND4R","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSD4HCGE","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KSD4HCGEUTADND4RICEQYNU2NN","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-27T22:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"bd068e531e466fd87641e75ef372f6b6e1549eec269504cf33e19ab1f9e9fb36","abstract_canon_sha256":"1a774743f5b271d8a5a6466121b95954ce24c0bca2d39c3269de1957fd7ca040"},"schema_version":"1.0"},"canonical_sha256":"5487c388c4a4c0368f9140890c369a6b68e0645a7ed4e776a4a557d2f729cad1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:58.461028Z","signature_b64":"v3OdNBGMdldYh5cyxSB+KhmKxeKQ1XWSqoddc1qh/g+9+gYlcP+Ir8TS3SRMCY96C7ROo57ZcLBgK+oz7D55BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5487c388c4a4c0368f9140890c369a6b68e0645a7ed4e776a4a557d2f729cad1","last_reissued_at":"2026-05-18T03:46:58.460497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:58.460497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5528","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-18T03:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZJJcApdXaRxCr09SavCRvPgPg67gV+Fo8Ao/RqGwsG3xTUMMY2Uv1s/wL4b88Z8vWVmkAT/GZY7q9mzfORuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:04:25.166620Z"},"content_sha256":"7f7afcdf044a83144231191d7772252a6ad1e76e8167e474567fb9a532ba877a","schema_version":"1.0","event_id":"sha256:7f7afcdf044a83144231191d7772252a6ad1e76e8167e474567fb9a532ba877a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KSD4HCGEUTADND4RICEQYNU2NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Path Protection Part 2: Design, Implementation, and Performance","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":"2012-08-27T22:52:24Z","abstract_excerpt":"In Part 1 of this paper, we introduced a coding-based proactive network protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream of the primary data is encoded with other data streams, resulting in capacity savings. In addition to being a systematic approach of building valid coding structures, CPP is an optimal and simple capacity placement and coding group formation algorithm. It converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. In this Part 2 of the paper, we describe the imple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5528","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-18T03:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1RGk83WJDQqcR6ckiiwqbl3ZLGzFhsaI6IMkcIeV7lIiznVaE8vcxk/q33yOih0I7NoxLZSpBY7m+FY9WS7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:04:25.166965Z"},"content_sha256":"40107a84d9150689e866c531410f5b21929514acf20930c46475bfc371e2820a","schema_version":"1.0","event_id":"sha256:40107a84d9150689e866c531410f5b21929514acf20930c46475bfc371e2820a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSD4HCGEUTADND4RICEQYNU2NN/bundle.json","state_url":"https://pith.science/pith/KSD4HCGEUTADND4RICEQYNU2NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSD4HCGEUTADND4RICEQYNU2NN/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-20T18:04:25Z","links":{"resolver":"https://pith.science/pith/KSD4HCGEUTADND4RICEQYNU2NN","bundle":"https://pith.science/pith/KSD4HCGEUTADND4RICEQYNU2NN/bundle.json","state":"https://pith.science/pith/KSD4HCGEUTADND4RICEQYNU2NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSD4HCGEUTADND4RICEQYNU2NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KSD4HCGEUTADND4RICEQYNU2NN","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":"1a774743f5b271d8a5a6466121b95954ce24c0bca2d39c3269de1957fd7ca040","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-27T22:52:24Z","title_canon_sha256":"bd068e531e466fd87641e75ef372f6b6e1549eec269504cf33e19ab1f9e9fb36"},"schema_version":"1.0","source":{"id":"1208.5528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5528","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5528v1","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5528","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"KSD4HCGEUTAD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSD4HCGEUTADND4R","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSD4HCGE","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:40107a84d9150689e866c531410f5b21929514acf20930c46475bfc371e2820a","target":"graph","created_at":"2026-05-18T03:46:58Z","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":"In Part 1 of this paper, we introduced a coding-based proactive network protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream of the primary data is encoded with other data streams, resulting in capacity savings. In addition to being a systematic approach of building valid coding structures, CPP is an optimal and simple capacity placement and coding group formation algorithm. It converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity. In this Part 2 of the paper, we describe the imple","authors_text":"Ender Ayanoglu, Serhat Nazim Avci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-27T22:52:24Z","title":"Coded Path Protection Part 2: Design, Implementation, and Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5528","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:7f7afcdf044a83144231191d7772252a6ad1e76e8167e474567fb9a532ba877a","target":"record","created_at":"2026-05-18T03:46:58Z","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":"1a774743f5b271d8a5a6466121b95954ce24c0bca2d39c3269de1957fd7ca040","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-27T22:52:24Z","title_canon_sha256":"bd068e531e466fd87641e75ef372f6b6e1549eec269504cf33e19ab1f9e9fb36"},"schema_version":"1.0","source":{"id":"1208.5528","kind":"arxiv","version":1}},"canonical_sha256":"5487c388c4a4c0368f9140890c369a6b68e0645a7ed4e776a4a557d2f729cad1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5487c388c4a4c0368f9140890c369a6b68e0645a7ed4e776a4a557d2f729cad1","first_computed_at":"2026-05-18T03:46:58.460497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:58.460497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v3OdNBGMdldYh5cyxSB+KhmKxeKQ1XWSqoddc1qh/g+9+gYlcP+Ir8TS3SRMCY96C7ROo57ZcLBgK+oz7D55BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:58.461028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f7afcdf044a83144231191d7772252a6ad1e76e8167e474567fb9a532ba877a","sha256:40107a84d9150689e866c531410f5b21929514acf20930c46475bfc371e2820a"],"state_sha256":"c6ec7c02dcf9f20437cc0dd0e9349839939413b9232c35ca0f6de747780880a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgtBsQYBFuNZnY06lXY71zFeMa0dadj2at1iaz2qedT/kRnJ2D/ooblJnjLRYoXQF29Nns+spSxj8HPTcHhNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:04:25.168927Z","bundle_sha256":"fa963acd65e13549ad96130157d6a79cd8b77a7031aa554306656c6510eebcc1"}}