{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:55YRCQTGWZWCFRAIJNQTBNY64N","short_pith_number":"pith:55YRCQTG","canonical_record":{"source":{"id":"1205.1552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-07T22:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"7761c890fa04037cee9e665ff99cc10b3e4313d6f4eea1386ed45ca74a8d4aa5","abstract_canon_sha256":"a6255d6961b01b8f668d0a74c7efe97e3f85d401f886e62160a64ed0849bf473"},"schema_version":"1.0"},"canonical_sha256":"ef71114266b66c22c4084b6130b71ee3785f45b35123b4a0277cfb67e939ac99","source":{"kind":"arxiv","id":"1205.1552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1552","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1552v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1552","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"55YRCQTGWZWC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"55YRCQTGWZWCFRAI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"55YRCQTG","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:55YRCQTGWZWCFRAIJNQTBNY64N","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-07T22:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"7761c890fa04037cee9e665ff99cc10b3e4313d6f4eea1386ed45ca74a8d4aa5","abstract_canon_sha256":"a6255d6961b01b8f668d0a74c7efe97e3f85d401f886e62160a64ed0849bf473"},"schema_version":"1.0"},"canonical_sha256":"ef71114266b66c22c4084b6130b71ee3785f45b35123b4a0277cfb67e939ac99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.983191Z","signature_b64":"RUu7BCAFFz1646mxjUzDJwcCWHbEAPK8wETdHmC6Dgf2O9EbydUvAs8tuAnMjuVpBBvX0NMeAnm1FAr5nXJ3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef71114266b66c22c4084b6130b71ee3785f45b35123b4a0277cfb67e939ac99","last_reissued_at":"2026-05-18T00:59:35.982610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.982610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1552","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03ScwCl2fH9gI9ygbwv1IESXyXex29Yj72m6MbeWQSjJq8cVV5UCnWsHJB2AbjNw+xzsxHVkjOQguhcQRldeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:10:39.728400Z"},"content_sha256":"9243c4b4bb64de161fbfabc23a53974f058e8b968b5fca5fed6a12c3add73787","schema_version":"1.0","event_id":"sha256:9243c4b4bb64de161fbfabc23a53974f058e8b968b5fca5fed6a12c3add73787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:55YRCQTGWZWCFRAIJNQTBNY64N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Near-Hitless Network Restoration via Diversity 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":"2012-05-07T22:13:53Z","abstract_excerpt":"Diversity coding is a network restoration technique which offers near-hitless restoration, while other state-of-the art techniques are significantly slower. Furthermore, the extra spare capacity requirement of diversity coding is competitive with the others. Previously, we developed heuristic algorithms to employ diversity coding structures in networks with arbitrary topology. This paper presents two algorithms to solve the network design problems using diversity coding in an optimal manner. The first technique pre-provisions static traffic whereas the second technique carries out the dynamic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1552","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmBr7i4hXyjhwfj539GX/JRV8CJpVEJgCOdSmBMVlRiBs86MEaeartoLKHP77osIIQLS4TSlsxVGeqgBr4RgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:10:39.728735Z"},"content_sha256":"916111c26da64a4262b0bb4afbcfdec786019878d510f24960653a3fbce2a89f","schema_version":"1.0","event_id":"sha256:916111c26da64a4262b0bb4afbcfdec786019878d510f24960653a3fbce2a89f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55YRCQTGWZWCFRAIJNQTBNY64N/bundle.json","state_url":"https://pith.science/pith/55YRCQTGWZWCFRAIJNQTBNY64N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55YRCQTGWZWCFRAIJNQTBNY64N/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-24T01:10:39Z","links":{"resolver":"https://pith.science/pith/55YRCQTGWZWCFRAIJNQTBNY64N","bundle":"https://pith.science/pith/55YRCQTGWZWCFRAIJNQTBNY64N/bundle.json","state":"https://pith.science/pith/55YRCQTGWZWCFRAIJNQTBNY64N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55YRCQTGWZWCFRAIJNQTBNY64N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:55YRCQTGWZWCFRAIJNQTBNY64N","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":"a6255d6961b01b8f668d0a74c7efe97e3f85d401f886e62160a64ed0849bf473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-07T22:13:53Z","title_canon_sha256":"7761c890fa04037cee9e665ff99cc10b3e4313d6f4eea1386ed45ca74a8d4aa5"},"schema_version":"1.0","source":{"id":"1205.1552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1552","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1552v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1552","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"55YRCQTGWZWC","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"55YRCQTGWZWCFRAI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"55YRCQTG","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:916111c26da64a4262b0bb4afbcfdec786019878d510f24960653a3fbce2a89f","target":"graph","created_at":"2026-05-18T00:59:35Z","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":"Diversity coding is a network restoration technique which offers near-hitless restoration, while other state-of-the art techniques are significantly slower. Furthermore, the extra spare capacity requirement of diversity coding is competitive with the others. Previously, we developed heuristic algorithms to employ diversity coding structures in networks with arbitrary topology. This paper presents two algorithms to solve the network design problems using diversity coding in an optimal manner. The first technique pre-provisions static traffic whereas the second technique carries out the dynamic ","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-05-07T22:13:53Z","title":"Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1552","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:9243c4b4bb64de161fbfabc23a53974f058e8b968b5fca5fed6a12c3add73787","target":"record","created_at":"2026-05-18T00:59:35Z","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":"a6255d6961b01b8f668d0a74c7efe97e3f85d401f886e62160a64ed0849bf473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-07T22:13:53Z","title_canon_sha256":"7761c890fa04037cee9e665ff99cc10b3e4313d6f4eea1386ed45ca74a8d4aa5"},"schema_version":"1.0","source":{"id":"1205.1552","kind":"arxiv","version":1}},"canonical_sha256":"ef71114266b66c22c4084b6130b71ee3785f45b35123b4a0277cfb67e939ac99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef71114266b66c22c4084b6130b71ee3785f45b35123b4a0277cfb67e939ac99","first_computed_at":"2026-05-18T00:59:35.982610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:35.982610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RUu7BCAFFz1646mxjUzDJwcCWHbEAPK8wETdHmC6Dgf2O9EbydUvAs8tuAnMjuVpBBvX0NMeAnm1FAr5nXJ3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:35.983191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9243c4b4bb64de161fbfabc23a53974f058e8b968b5fca5fed6a12c3add73787","sha256:916111c26da64a4262b0bb4afbcfdec786019878d510f24960653a3fbce2a89f"],"state_sha256":"08e0c7770d665068b73ecb637c49784babe643c2ed5878fb1d18e23d9e007743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJToXGyz03kFegrmXCxR/eHC4uFbhRbtPu6tPIgX8Zv/HUoYINHzQEHKqKugL8QHh+7cOEtnDR8PYx3Dozv0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:10:39.730666Z","bundle_sha256":"5a8410632f0d3476ce18f672a9a7ca2dd5ab509a02ffe462dc9c95b1d8fb6aaa"}}