{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5V7LGYO7KOKYYCX2CNQJLBWLZ7","short_pith_number":"pith:5V7LGYO7","schema_version":"1.0","canonical_sha256":"ed7eb361df53958c0afa13609586cbcfe6b63e92cebfe608677a107c118b87e7","source":{"kind":"arxiv","id":"1302.2184","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.2184","created_at":"2026-05-18T01:31:30.468240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2184v2","created_at":"2026-05-18T01:31:30.468240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2184","created_at":"2026-05-18T01:31:30.468240+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V7LGYO7KOKY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V7LGYO7KOKYYCX2","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V7LGYO7","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7","json":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7.json","graph_json":"https://pith.science/api/pith-number/5V7LGYO7KOKYYCX2CNQJLBWLZ7/graph.json","events_json":"https://pith.science/api/pith-number/5V7LGYO7KOKYYCX2CNQJLBWLZ7/events.json","paper":"https://pith.science/paper/5V7LGYO7"},"agent_actions":{"view_html":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7","download_json":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7.json","view_paper":"https://pith.science/paper/5V7LGYO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2184&json=true","fetch_graph":"https://pith.science/api/pith-number/5V7LGYO7KOKYYCX2CNQJLBWLZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/5V7LGYO7KOKYYCX2CNQJLBWLZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/action/storage_attestation","attest_author":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/action/author_attestation","sign_citation":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/action/citation_signature","submit_replication":"https://pith.science/pith/5V7LGYO7KOKYYCX2CNQJLBWLZ7/action/replication_record"}},"created_at":"2026-05-18T01:31:30.468240+00:00","updated_at":"2026-05-18T01:31:30.468240+00:00"}