{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HGRTLDHTKNLIZEDPME63KPT2WK","short_pith_number":"pith:HGRTLDHT","schema_version":"1.0","canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","source":{"kind":"arxiv","id":"1701.08315","version":1},"attestation_state":"computed","paper":{"title":"Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baigong Zheng","submitted_at":"2017-01-28T19:05:52Z","abstract_excerpt":"We present the first polynomial-time approximation schemes, i.e., (1 + {\\epsilon})-approximation algorithm for any constant {\\epsilon} > 0, for the minimum three-edge connected spanning subgraph problem and the minimum three-vertex connected spanning subgraph problem in undirected planar graphs. Both the approximation schemes run in linear time."},"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":"1701.08315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-28T19:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"b0887cfd7df90874b855965fc437bcc002508ada7d0fcee3fc420d60b16b8950","abstract_canon_sha256":"18ddf447cfd30e3531c7dad4382871b2f2c16be2ba4f52d90baf79f2dd0ca336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.553214Z","signature_b64":"X6oHgW2dKFWjYB2RUU4/UfMu5OjKA+gf6c836ra2z9Zw8A5rk59RSVzP6jfRZpuokFNPDbqJdd5fQfcRLqKMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","last_reissued_at":"2026-05-18T00:51:54.552540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.552540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baigong Zheng","submitted_at":"2017-01-28T19:05:52Z","abstract_excerpt":"We present the first polynomial-time approximation schemes, i.e., (1 + {\\epsilon})-approximation algorithm for any constant {\\epsilon} > 0, for the minimum three-edge connected spanning subgraph problem and the minimum three-vertex connected spanning subgraph problem in undirected planar graphs. Both the approximation schemes run in linear time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08315","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.08315","created_at":"2026-05-18T00:51:54.552644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08315v1","created_at":"2026-05-18T00:51:54.552644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08315","created_at":"2026-05-18T00:51:54.552644+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGRTLDHTKNLI","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGRTLDHTKNLIZEDP","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGRTLDHT","created_at":"2026-05-18T12:31:18.294218+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/HGRTLDHTKNLIZEDPME63KPT2WK","json":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK.json","graph_json":"https://pith.science/api/pith-number/HGRTLDHTKNLIZEDPME63KPT2WK/graph.json","events_json":"https://pith.science/api/pith-number/HGRTLDHTKNLIZEDPME63KPT2WK/events.json","paper":"https://pith.science/paper/HGRTLDHT"},"agent_actions":{"view_html":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK","download_json":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK.json","view_paper":"https://pith.science/paper/HGRTLDHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08315&json=true","fetch_graph":"https://pith.science/api/pith-number/HGRTLDHTKNLIZEDPME63KPT2WK/graph.json","fetch_events":"https://pith.science/api/pith-number/HGRTLDHTKNLIZEDPME63KPT2WK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/action/storage_attestation","attest_author":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/action/author_attestation","sign_citation":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/action/citation_signature","submit_replication":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/action/replication_record"}},"created_at":"2026-05-18T00:51:54.552644+00:00","updated_at":"2026-05-18T00:51:54.552644+00:00"}