{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VD5KXMO3CTCHS5YY54557CTVNZ","short_pith_number":"pith:VD5KXMO3","canonical_record":{"source":{"id":"1301.6299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-26T23:51:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2a931b1d31452a3a7320bac4db90d9a62afcef33ee4e027b660063eb99f205c9","abstract_canon_sha256":"b7ef7ae4538026c2008fa78f0a1bc04aed25d6dd529b7cb006055cd5adc1d808"},"schema_version":"1.0"},"canonical_sha256":"a8faabb1db14c4797718ef3bdf8a756e51deecca19c3e662676d04617ff0e871","source":{"kind":"arxiv","id":"1301.6299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6299","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6299v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6299","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"VD5KXMO3CTCH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VD5KXMO3CTCHS5YY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VD5KXMO3","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VD5KXMO3CTCHS5YY54557CTVNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-26T23:51:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2a931b1d31452a3a7320bac4db90d9a62afcef33ee4e027b660063eb99f205c9","abstract_canon_sha256":"b7ef7ae4538026c2008fa78f0a1bc04aed25d6dd529b7cb006055cd5adc1d808"},"schema_version":"1.0"},"canonical_sha256":"a8faabb1db14c4797718ef3bdf8a756e51deecca19c3e662676d04617ff0e871","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.851196Z","signature_b64":"1VKKciRKMih4GkpFihEDMfv56UMc2PhPas19JaJ3u2SJBDMwOldUPCDMyg8Rq4KUDY7j79sjd8evWxRRR57SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8faabb1db14c4797718ef3bdf8a756e51deecca19c3e662676d04617ff0e871","last_reissued_at":"2026-05-18T03:35:15.848680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.848680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6299","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFV34KdFrwR6QCcjZzqGFmJnmx4mWrkAk2NOSsI8mH3q08Br3WBotWtb0VTPlLwZkaeyJiFVc4hUrYIWeg5RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:32:27.655677Z"},"content_sha256":"576c0c38b095e9e225ba3a1ca9197524f1bf406a0673adff3c1a64416ad2f5c1","schema_version":"1.0","event_id":"sha256:576c0c38b095e9e225ba3a1ca9197524f1bf406a0673adff3c1a64416ad2f5c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VD5KXMO3CTCHS5YY54557CTVNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"David Adjiashvili","submitted_at":"2013-01-26T23:51:15Z","abstract_excerpt":"The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform scenario set. Such a scenario set assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ comprises a scenario. While this approach yields problems with clean combinatorial structure and good algorithms, it often fails to capture the true nature of the scenario set coming from applications.\n  One natural refinement of the uniform model is obtained by partitioning the set of resources into faulty and secure resources. The scenario set contains every subset of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6299","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSPjFymam0X+3h00u2fszjFRVAs4s3WK+2hxDOcjs+oQscwnfKgD/WvVDsaDEPcCP0aGZdQVtqSUe4bv8n+oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:32:27.656037Z"},"content_sha256":"b0297654d5a7dcf3e426a138f39a88a7d34a534aa68c3ed1c44065c3fda3ab1c","schema_version":"1.0","event_id":"sha256:b0297654d5a7dcf3e426a138f39a88a7d34a534aa68c3ed1c44065c3fda3ab1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VD5KXMO3CTCHS5YY54557CTVNZ/bundle.json","state_url":"https://pith.science/pith/VD5KXMO3CTCHS5YY54557CTVNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VD5KXMO3CTCHS5YY54557CTVNZ/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-21T20:32:27Z","links":{"resolver":"https://pith.science/pith/VD5KXMO3CTCHS5YY54557CTVNZ","bundle":"https://pith.science/pith/VD5KXMO3CTCHS5YY54557CTVNZ/bundle.json","state":"https://pith.science/pith/VD5KXMO3CTCHS5YY54557CTVNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VD5KXMO3CTCHS5YY54557CTVNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VD5KXMO3CTCHS5YY54557CTVNZ","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":"b7ef7ae4538026c2008fa78f0a1bc04aed25d6dd529b7cb006055cd5adc1d808","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-26T23:51:15Z","title_canon_sha256":"2a931b1d31452a3a7320bac4db90d9a62afcef33ee4e027b660063eb99f205c9"},"schema_version":"1.0","source":{"id":"1301.6299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6299","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6299v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6299","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"VD5KXMO3CTCH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VD5KXMO3CTCHS5YY","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VD5KXMO3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:b0297654d5a7dcf3e426a138f39a88a7d34a534aa68c3ed1c44065c3fda3ab1c","target":"graph","created_at":"2026-05-18T03:35:15Z","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":"The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform scenario set. Such a scenario set assumes that every subset of the network resources (edges or vertices) of a given cardinality $k$ comprises a scenario. While this approach yields problems with clean combinatorial structure and good algorithms, it often fails to capture the true nature of the scenario set coming from applications.\n  One natural refinement of the uniform model is obtained by partitioning the set of resources into faulty and secure resources. The scenario set contains every subset of","authors_text":"David Adjiashvili","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-26T23:51:15Z","title":"Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6299","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:576c0c38b095e9e225ba3a1ca9197524f1bf406a0673adff3c1a64416ad2f5c1","target":"record","created_at":"2026-05-18T03:35:15Z","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":"b7ef7ae4538026c2008fa78f0a1bc04aed25d6dd529b7cb006055cd5adc1d808","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-26T23:51:15Z","title_canon_sha256":"2a931b1d31452a3a7320bac4db90d9a62afcef33ee4e027b660063eb99f205c9"},"schema_version":"1.0","source":{"id":"1301.6299","kind":"arxiv","version":1}},"canonical_sha256":"a8faabb1db14c4797718ef3bdf8a756e51deecca19c3e662676d04617ff0e871","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8faabb1db14c4797718ef3bdf8a756e51deecca19c3e662676d04617ff0e871","first_computed_at":"2026-05-18T03:35:15.848680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:15.848680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1VKKciRKMih4GkpFihEDMfv56UMc2PhPas19JaJ3u2SJBDMwOldUPCDMyg8Rq4KUDY7j79sjd8evWxRRR57SDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:15.851196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576c0c38b095e9e225ba3a1ca9197524f1bf406a0673adff3c1a64416ad2f5c1","sha256:b0297654d5a7dcf3e426a138f39a88a7d34a534aa68c3ed1c44065c3fda3ab1c"],"state_sha256":"0a00202d75f01b5141d7ce33e75ba97d9a2ba77ae67a93fe29e1c2d43ef433f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsvcENNTVtMlGUT3wKbsndJscJXkrMQ58IVVzt8mvyBh9/Xd0oqE0EeOdwF2DSOdpEefuXsb9cXoYOfwSXEECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:32:27.658193Z","bundle_sha256":"fba6276ef842ade47fef0b974c403fa11b428a65afac7a9cad511a7a87029c28"}}