{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R244JOA2IPTNOYW26S6XTP3OEX","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":"e52e29a922000fc4d64f166d340d8d2165f2a268a2a1e89d9084bf7317cf8986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T21:54:39Z","title_canon_sha256":"3816dbe3e166a6cb5e0f89de72a2d99b3a0796711b0f971920fbed7e131e0cda"},"schema_version":"1.0","source":{"id":"1611.03889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03889","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03889v1","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03889","created_at":"2026-05-18T00:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"R244JOA2IPTN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R244JOA2IPTNOYW2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R244JOA2","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:d9814daa34b79df3cac6b24571692c7578a00ad644da595fae943546991d3b4b","target":"graph","created_at":"2026-05-18T00:59:18Z","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 problem of finding the minimum-weight subgraph that satisfies given connectivity requirements. Specifically, given a requirement $r \\in \\{0,1,2,3\\}$ for every vertex, we seek the minimum-weight subgraph that contains, for every pair of vertices $u$ and $v$, at least $\\min\\{ r(v), r(u)\\}$ edge-disjoint $u$-to-$v$ paths. We give a polynomial-time approximation scheme (PTAS) for this problem when the input graph is planar and the subgraph may use multiple copies of any given edge. This generalizes an earlier result for $r \\in \\{0,1,2\\}$. In order to achieve this PTAS, we prove som","authors_text":"Baigong Zheng, Glencora Borradaile","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T21:54:39Z","title":"A PTAS for Three-Edge Connectivity in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03889","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:0f06604c0ebdaa6fff35cf10ca492ae8e6035b823b3443195248ee69ead14d9a","target":"record","created_at":"2026-05-18T00:59:18Z","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":"e52e29a922000fc4d64f166d340d8d2165f2a268a2a1e89d9084bf7317cf8986","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-11T21:54:39Z","title_canon_sha256":"3816dbe3e166a6cb5e0f89de72a2d99b3a0796711b0f971920fbed7e131e0cda"},"schema_version":"1.0","source":{"id":"1611.03889","kind":"arxiv","version":1}},"canonical_sha256":"8eb9c4b81a43e6d762daf4bd79bf6e25efaa0c02eacdabdddc5cc9a090fb3e65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eb9c4b81a43e6d762daf4bd79bf6e25efaa0c02eacdabdddc5cc9a090fb3e65","first_computed_at":"2026-05-18T00:59:18.158564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:18.158564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9gdNet1Kgzu/QQ/RUcy3BeMWdwyfrVYVhjO2yWG97hzuk5iy5nLFdJeylUpoJi9rJxF0yowtPAG1pNQNLhjnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:18.159242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f06604c0ebdaa6fff35cf10ca492ae8e6035b823b3443195248ee69ead14d9a","sha256:d9814daa34b79df3cac6b24571692c7578a00ad644da595fae943546991d3b4b"],"state_sha256":"0242ac2d093f1e4303e6de3389732cb95515875589bff0091778a1a793103a6b"}