{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5V7LGYO7KOKYYCX2CNQJLBWLZ7","short_pith_number":"pith:5V7LGYO7","canonical_record":{"source":{"id":"1302.2184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-09T00:09:51Z","cross_cats_sorted":[],"title_canon_sha256":"bb18a4b1aad56f4887e00fadefa853135d0621a83836ef9197a7b492f23eb182","abstract_canon_sha256":"924fe8b14492ed592a18c0a090939f3f3e0d3603cf566505702f9de9475a2586"},"schema_version":"1.0"},"canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","source":{"kind":"arxiv","id":"1302.2184","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2184","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2184v2","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2184","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"5V7LGYO7KOKY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5V7LGYO7KOKYYCX2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5V7LGYO7","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5V7LGYO7KOKYYCX2CNQJLBWLZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-09T00:09:51Z","cross_cats_sorted":[],"title_canon_sha256":"bb18a4b1aad56f4887e00fadefa853135d0621a83836ef9197a7b492f23eb182","abstract_canon_sha256":"924fe8b14492ed592a18c0a090939f3f3e0d3603cf566505702f9de9475a2586"},"schema_version":"1.0"},"canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:30.468790Z","signature_b64":"qZd2Wi2ZsDJsjNssvOUrHsUzxN2cwsfyKquMEX5Il8VmR2RdbEOkWU0qxlgfWlO9umb3fDdR+nfFOvdZHgNaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","last_reissued_at":"2026-05-18T01:31:30.468149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:30.468149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2184","source_version":2,"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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3iCUWplC5sXkmtTuS199tR5M2uctzub1YqJyvuAIO3nLLa3H8ot64oXPPmc5Lo7k0yZ6Vm2QggoHQixxeLGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:01:05.099529Z"},"content_sha256":"544df59b2b64a99c6e3def828f5a7f04e896b90638bc9fc2483c7bea74a53c2d","schema_version":"1.0","event_id":"sha256:544df59b2b64a99c6e3def828f5a7f04e896b90638bc9fc2483c7bea74a53c2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5V7LGYO7KOKYYCX2CNQJLBWLZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The two-edge connectivity survivable-network design problem in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Glencora Borradaile, Philip Klein","submitted_at":"2013-02-09T00:09:51Z","abstract_excerpt":"Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient analog of the Steiner tree problem arising, for example, in telecommunications applications. We study a more general mixed-connectivity formulation, also employed in telecommunications optimization. Given a number (or requirement) r(v) in {0, 1, 2} for each vertex v in the graph, find a minimum-cost subgraph in which there are min{r(u), r(v)} edge-disjoint u-to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2184","kind":"arxiv","version":2},"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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCNqauwc66aZyWuzGPDnVMUB4PrrJLUisLEvCPcDzpxoLNpfusF9ue/MLnNPxlijb4ChPNBFf00hQkwHOS60BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:01:05.099874Z"},"content_sha256":"4cc7a00f9ec7fbf122a9060f614b869ebe1cdb59099ef1f8ae149a12f65f8ea2","schema_version":"1.0","event_id":"sha256:4cc7a00f9ec7fbf122a9060f614b869ebe1cdb59099ef1f8ae149a12f65f8ea2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/bundle.json","state_url":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/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-24T03:01:05Z","links":{"resolver":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7","bundle":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/bundle.json","state":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5V7LGYO7KOKYYCX2CNQJLBWLZ7","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":"924fe8b14492ed592a18c0a090939f3f3e0d3603cf566505702f9de9475a2586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-09T00:09:51Z","title_canon_sha256":"bb18a4b1aad56f4887e00fadefa853135d0621a83836ef9197a7b492f23eb182"},"schema_version":"1.0","source":{"id":"1302.2184","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2184","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2184v2","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2184","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"5V7LGYO7KOKY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5V7LGYO7KOKYYCX2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5V7LGYO7","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:4cc7a00f9ec7fbf122a9060f614b869ebe1cdb59099ef1f8ae149a12f65f8ea2","target":"graph","created_at":"2026-05-18T01:31:30Z","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":"Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient analog of the Steiner tree problem arising, for example, in telecommunications applications. We study a more general mixed-connectivity formulation, also employed in telecommunications optimization. Given a number (or requirement) r(v) in {0, 1, 2} for each vertex v in the graph, find a minimum-cost subgraph in which there are min{r(u), r(v)} edge-disjoint u-to","authors_text":"Glencora Borradaile, Philip Klein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-09T00:09:51Z","title":"The two-edge connectivity survivable-network design problem in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2184","kind":"arxiv","version":2},"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:544df59b2b64a99c6e3def828f5a7f04e896b90638bc9fc2483c7bea74a53c2d","target":"record","created_at":"2026-05-18T01:31:30Z","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":"924fe8b14492ed592a18c0a090939f3f3e0d3603cf566505702f9de9475a2586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-09T00:09:51Z","title_canon_sha256":"bb18a4b1aad56f4887e00fadefa853135d0621a83836ef9197a7b492f23eb182"},"schema_version":"1.0","source":{"id":"1302.2184","kind":"arxiv","version":2}},"canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","first_computed_at":"2026-05-18T01:31:30.468149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:30.468149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZd2Wi2ZsDJsjNssvOUrHsUzxN2cwsfyKquMEX5Il8VmR2RdbEOkWU0qxlgfWlO9umb3fDdR+nfFOvdZHgNaBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:30.468790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2184","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:544df59b2b64a99c6e3def828f5a7f04e896b90638bc9fc2483c7bea74a53c2d","sha256:4cc7a00f9ec7fbf122a9060f614b869ebe1cdb59099ef1f8ae149a12f65f8ea2"],"state_sha256":"8e2007d9bcc7c1d0b01071e931bc5a8c6b2e06eced46877e881e29ab947dcee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"So9d2ETS6u5sGE/TtzIA07aOaxJexkyV/cRSG5XdlZvlsnLt/YXMP98FujhoH2cRknb6mR0Stn1yc29i6q8QDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:01:05.101765Z","bundle_sha256":"6e1e01a0677ab3a6c35f75e5507b29cb232a97b89f285fd44cd9179b73810ab2"}}