{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JS5Z5TU2IJ4TL7U24RTVSCRKKJ","short_pith_number":"pith:JS5Z5TU2","canonical_record":{"source":{"id":"1304.8026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T15:15:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f5ed6fa3e5d10d8911b62f9d8a8a9754b46e4bd33aca73a8a36a45d941afecd","abstract_canon_sha256":"98a05ba298089875d2edb7cfa10db5566348f6032eae2ca0364cf82246281aca"},"schema_version":"1.0"},"canonical_sha256":"4cbb9ece9a427935fe9ae467590a2a5272f5930dbd522e0307d6b98f8e5bb454","source":{"kind":"arxiv","id":"1304.8026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8026","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8026v1","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8026","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"JS5Z5TU2IJ4T","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JS5Z5TU2IJ4TL7U2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JS5Z5TU2","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JS5Z5TU2IJ4TL7U24RTVSCRKKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.8026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T15:15:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f5ed6fa3e5d10d8911b62f9d8a8a9754b46e4bd33aca73a8a36a45d941afecd","abstract_canon_sha256":"98a05ba298089875d2edb7cfa10db5566348f6032eae2ca0364cf82246281aca"},"schema_version":"1.0"},"canonical_sha256":"4cbb9ece9a427935fe9ae467590a2a5272f5930dbd522e0307d6b98f8e5bb454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:51.105564Z","signature_b64":"6lFo9xoSqgbvNPbWNilI6rCUvKWRplI0Es8cLAXVHA/XHi/Sqg2eag4atgAfHk891xsF/yZdyZ9k4mRBPn4EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cbb9ece9a427935fe9ae467590a2a5272f5930dbd522e0307d6b98f8e5bb454","last_reissued_at":"2026-05-18T03:26:51.105092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:51.105092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.8026","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:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3ffLPztqAdb/GageKplx3XG5qKqmMKIdyZr9jLHKiQNKaptLWZI99Z7u6e21gJJdnU/+q58bjs3W4wbw514CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:20.350641Z"},"content_sha256":"054186f8461862a2aa39176cc259682dcbdc3ced2c840c8d28e66f4f6d946904","schema_version":"1.0","event_id":"sha256:054186f8461862a2aa39176cc259682dcbdc3ced2c840c8d28e66f4f6d946904"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JS5Z5TU2IJ4TL7U24RTVSCRKKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Survivable Paths in Multilayer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Eytan Modiano, Hyang-Won Lee, Marzieh Parandehgheibi","submitted_at":"2013-04-30T15:15:29Z","abstract_excerpt":"We consider protection problems in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where disjoint paths may not always exist. In this paper, we take a new approach which is based on finding a set of paths that may not be disjoint but together will survive any single physical link failure. First, we consider the problem of finding the minimum number of survivable paths. In particular, we focus on two versions of this problem: one where th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8026","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:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRADUxZmz4Dt1p99GuXUUecF2mmuPfT/JT3Vp8YBzcQ33V+LWF+L9its7eJ9IjTZ6e7hsgnHuRsKHIPUjVY3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:20.351334Z"},"content_sha256":"be4a977ada6fd91aa4503911c692649c41d7b2238146a3cfba49aa9489b681cd","schema_version":"1.0","event_id":"sha256:be4a977ada6fd91aa4503911c692649c41d7b2238146a3cfba49aa9489b681cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/bundle.json","state_url":"https://pith.science/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/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-27T23:18:20Z","links":{"resolver":"https://pith.science/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ","bundle":"https://pith.science/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/bundle.json","state":"https://pith.science/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JS5Z5TU2IJ4TL7U24RTVSCRKKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JS5Z5TU2IJ4TL7U24RTVSCRKKJ","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":"98a05ba298089875d2edb7cfa10db5566348f6032eae2ca0364cf82246281aca","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T15:15:29Z","title_canon_sha256":"2f5ed6fa3e5d10d8911b62f9d8a8a9754b46e4bd33aca73a8a36a45d941afecd"},"schema_version":"1.0","source":{"id":"1304.8026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8026","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8026v1","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8026","created_at":"2026-05-18T03:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"JS5Z5TU2IJ4T","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JS5Z5TU2IJ4TL7U2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JS5Z5TU2","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:be4a977ada6fd91aa4503911c692649c41d7b2238146a3cfba49aa9489b681cd","target":"graph","created_at":"2026-05-18T03:26:51Z","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":"We consider protection problems in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where disjoint paths may not always exist. In this paper, we take a new approach which is based on finding a set of paths that may not be disjoint but together will survive any single physical link failure. First, we consider the problem of finding the minimum number of survivable paths. In particular, we focus on two versions of this problem: one where th","authors_text":"Eytan Modiano, Hyang-Won Lee, Marzieh Parandehgheibi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T15:15:29Z","title":"Survivable Paths in Multilayer Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8026","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:054186f8461862a2aa39176cc259682dcbdc3ced2c840c8d28e66f4f6d946904","target":"record","created_at":"2026-05-18T03:26:51Z","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":"98a05ba298089875d2edb7cfa10db5566348f6032eae2ca0364cf82246281aca","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-30T15:15:29Z","title_canon_sha256":"2f5ed6fa3e5d10d8911b62f9d8a8a9754b46e4bd33aca73a8a36a45d941afecd"},"schema_version":"1.0","source":{"id":"1304.8026","kind":"arxiv","version":1}},"canonical_sha256":"4cbb9ece9a427935fe9ae467590a2a5272f5930dbd522e0307d6b98f8e5bb454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cbb9ece9a427935fe9ae467590a2a5272f5930dbd522e0307d6b98f8e5bb454","first_computed_at":"2026-05-18T03:26:51.105092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:51.105092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6lFo9xoSqgbvNPbWNilI6rCUvKWRplI0Es8cLAXVHA/XHi/Sqg2eag4atgAfHk891xsF/yZdyZ9k4mRBPn4EDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:51.105564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.8026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:054186f8461862a2aa39176cc259682dcbdc3ced2c840c8d28e66f4f6d946904","sha256:be4a977ada6fd91aa4503911c692649c41d7b2238146a3cfba49aa9489b681cd"],"state_sha256":"06cb01e224dfda04944a517b774bb207fbbaacf4251266c64eea6c810420b517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2DiwoPWjOBuFPpRgvwWiKVlYw7jHDYe+rBtkGvn9cJNW3exE/wSpsG+95DxHcFTNlWBoiCT4F1C8++OWV0dDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:20.354163Z","bundle_sha256":"fa665752dde9ce6412c3e8e7a69e042e6fc7744f94631c524887f1e0f5720352"}}