{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PYD5QLJUST7PUIWWQO56R5WWOE","short_pith_number":"pith:PYD5QLJU","canonical_record":{"source":{"id":"1605.04434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-14T16:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"7c0baea6a2c4ce90900cafd74401b074c4b2b85ba44ed3e38a7b328a777884b5","abstract_canon_sha256":"e1ac22e57e53e9d0f624f3179abcc5b7743bf2da72d43e89850093a71226058a"},"schema_version":"1.0"},"canonical_sha256":"7e07d82d3494fefa22d683bbe8f6d671081ff3c92af63809bd50349eb892c3d6","source":{"kind":"arxiv","id":"1605.04434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04434","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04434v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04434","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"PYD5QLJUST7P","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYD5QLJUST7PUIWW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYD5QLJU","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PYD5QLJUST7PUIWWQO56R5WWOE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-14T16:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"7c0baea6a2c4ce90900cafd74401b074c4b2b85ba44ed3e38a7b328a777884b5","abstract_canon_sha256":"e1ac22e57e53e9d0f624f3179abcc5b7743bf2da72d43e89850093a71226058a"},"schema_version":"1.0"},"canonical_sha256":"7e07d82d3494fefa22d683bbe8f6d671081ff3c92af63809bd50349eb892c3d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:51.667274Z","signature_b64":"VwmPJ1H0sqQfqTERItKOfY++y2f/YxMf2Veug/lEQ10GX37PN+kjdkoH9qeh8HoP9EGs/uur/9cXIhmuvzpHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e07d82d3494fefa22d683bbe8f6d671081ff3c92af63809bd50349eb892c3d6","last_reissued_at":"2026-05-18T01:14:51.666655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:51.666655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04434","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-18T01:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NbrWetCE0q9hg5j/tHnukfoZ7wMCPLTtKMDP1WI9ojz4LuVg4RfphoITRIneyVjZmjh5ZYIbhI+6FfEd6GbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:03:58.684727Z"},"content_sha256":"ecbe00ba4fa6828789b482a6d1491df527aa3bebbd748e3aea893b30a129b6ea","schema_version":"1.0","event_id":"sha256:ecbe00ba4fa6828789b482a6d1491df527aa3bebbd748e3aea893b30a129b6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PYD5QLJUST7PUIWWQO56R5WWOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Establishing Multiple Survivable Connections (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ariel Orda, Michael Keslassy","submitted_at":"2016-05-14T16:27:39Z","abstract_excerpt":"We consider the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a single connection, only heuristics have been proposed for the multi-connection case. We investigate the algorithmic tractability of multi-connection establishment problems, both in online and offline frameworks. First, we focus on the special case of two connections, and study the tractability of three variants of the problem. We show that only one variant is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04434","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-18T01:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7jHoRVvg6YLM1Ayw2ZW+Fd0aeKRoKA4zbm+qWForLBxlBXoCF+DwbTF9V8Ev8nXePMr0bYNJIDZOxyAhIKsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:03:58.685063Z"},"content_sha256":"0e79ccea174b6eed6244cc58b358f8cd7a448cb263277cea027076c2383b02c9","schema_version":"1.0","event_id":"sha256:0e79ccea174b6eed6244cc58b358f8cd7a448cb263277cea027076c2383b02c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYD5QLJUST7PUIWWQO56R5WWOE/bundle.json","state_url":"https://pith.science/pith/PYD5QLJUST7PUIWWQO56R5WWOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYD5QLJUST7PUIWWQO56R5WWOE/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-07-07T08:03:58Z","links":{"resolver":"https://pith.science/pith/PYD5QLJUST7PUIWWQO56R5WWOE","bundle":"https://pith.science/pith/PYD5QLJUST7PUIWWQO56R5WWOE/bundle.json","state":"https://pith.science/pith/PYD5QLJUST7PUIWWQO56R5WWOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYD5QLJUST7PUIWWQO56R5WWOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PYD5QLJUST7PUIWWQO56R5WWOE","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":"e1ac22e57e53e9d0f624f3179abcc5b7743bf2da72d43e89850093a71226058a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-14T16:27:39Z","title_canon_sha256":"7c0baea6a2c4ce90900cafd74401b074c4b2b85ba44ed3e38a7b328a777884b5"},"schema_version":"1.0","source":{"id":"1605.04434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04434","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04434v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04434","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"PYD5QLJUST7P","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYD5QLJUST7PUIWW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYD5QLJU","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:0e79ccea174b6eed6244cc58b358f8cd7a448cb263277cea027076c2383b02c9","target":"graph","created_at":"2026-05-18T01:14: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 the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a single connection, only heuristics have been proposed for the multi-connection case. We investigate the algorithmic tractability of multi-connection establishment problems, both in online and offline frameworks. First, we focus on the special case of two connections, and study the tractability of three variants of the problem. We show that only one variant is ","authors_text":"Ariel Orda, Michael Keslassy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-14T16:27:39Z","title":"Establishing Multiple Survivable Connections (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04434","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:ecbe00ba4fa6828789b482a6d1491df527aa3bebbd748e3aea893b30a129b6ea","target":"record","created_at":"2026-05-18T01:14: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":"e1ac22e57e53e9d0f624f3179abcc5b7743bf2da72d43e89850093a71226058a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-14T16:27:39Z","title_canon_sha256":"7c0baea6a2c4ce90900cafd74401b074c4b2b85ba44ed3e38a7b328a777884b5"},"schema_version":"1.0","source":{"id":"1605.04434","kind":"arxiv","version":1}},"canonical_sha256":"7e07d82d3494fefa22d683bbe8f6d671081ff3c92af63809bd50349eb892c3d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e07d82d3494fefa22d683bbe8f6d671081ff3c92af63809bd50349eb892c3d6","first_computed_at":"2026-05-18T01:14:51.666655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:51.666655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VwmPJ1H0sqQfqTERItKOfY++y2f/YxMf2Veug/lEQ10GX37PN+kjdkoH9qeh8HoP9EGs/uur/9cXIhmuvzpHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:51.667274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecbe00ba4fa6828789b482a6d1491df527aa3bebbd748e3aea893b30a129b6ea","sha256:0e79ccea174b6eed6244cc58b358f8cd7a448cb263277cea027076c2383b02c9"],"state_sha256":"3107e888b16adba1bd1404e69a5cca3d1379f233b3194a9c7e9329d68b51cf65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uMrjz0BrjN6ItfGhENNv7QTUFXjYYnkRSP7YrX6WIlXoZ0w32mBxUBCjXDdkfxZ9G1QZN4LM1p+VSXMddhRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:03:58.686895Z","bundle_sha256":"e947c06ff2e53a17a56b6438fb1d7a085b0e0e1876d1aad76e56f4b4b550287e"}}