{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HGRTLDHTKNLIZEDPME63KPT2WK","short_pith_number":"pith:HGRTLDHT","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"},"canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","source":{"kind":"arxiv","id":"1701.08315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08315","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08315v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08315","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"HGRTLDHTKNLI","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGRTLDHTKNLIZEDP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGRTLDHT","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HGRTLDHTKNLIZEDPME63KPT2WK","target":"record","payload":{"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"},"canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","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"},"source_kind":"arxiv","source_id":"1701.08315","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFmXd2BbA5xOwxvL7lhSpBUEyCz/swK5W8vf3YQPfIbipRpJzmZlgJk/F9vSphSSCXFJozFK+niPbTRDSVWaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:23:15.406547Z"},"content_sha256":"8ade7f294507128a2d38b079b5d78f2f54d2a70c5b7257424dbfe46951b3007d","schema_version":"1.0","event_id":"sha256:8ade7f294507128a2d38b079b5d78f2f54d2a70c5b7257424dbfe46951b3007d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HGRTLDHTKNLIZEDPME63KPT2WK","target":"graph","payload":{"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"},"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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLknUc8bSR30vaaUa5OG+1kQgXLOfDPb49IYy/4eiM28weK0lStuJ4jW22ssEyhgns1+NlBCN1u5pEnBuiDeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:23:15.406889Z"},"content_sha256":"daf3d3180a47ab2d2758cd2689c73f93d2f44c9f7e3b823987a3249df192af55","schema_version":"1.0","event_id":"sha256:daf3d3180a47ab2d2758cd2689c73f93d2f44c9f7e3b823987a3249df192af55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/bundle.json","state_url":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGRTLDHTKNLIZEDPME63KPT2WK/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-02T01:23:15Z","links":{"resolver":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK","bundle":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/bundle.json","state":"https://pith.science/pith/HGRTLDHTKNLIZEDPME63KPT2WK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGRTLDHTKNLIZEDPME63KPT2WK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HGRTLDHTKNLIZEDPME63KPT2WK","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":"18ddf447cfd30e3531c7dad4382871b2f2c16be2ba4f52d90baf79f2dd0ca336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-28T19:05:52Z","title_canon_sha256":"b0887cfd7df90874b855965fc437bcc002508ada7d0fcee3fc420d60b16b8950"},"schema_version":"1.0","source":{"id":"1701.08315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08315","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08315v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08315","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"HGRTLDHTKNLI","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGRTLDHTKNLIZEDP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGRTLDHT","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:daf3d3180a47ab2d2758cd2689c73f93d2f44c9f7e3b823987a3249df192af55","target":"graph","created_at":"2026-05-18T00:51:54Z","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 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.","authors_text":"Baigong Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-28T19:05:52Z","title":"Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08315","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:8ade7f294507128a2d38b079b5d78f2f54d2a70c5b7257424dbfe46951b3007d","target":"record","created_at":"2026-05-18T00:51:54Z","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":"18ddf447cfd30e3531c7dad4382871b2f2c16be2ba4f52d90baf79f2dd0ca336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-28T19:05:52Z","title_canon_sha256":"b0887cfd7df90874b855965fc437bcc002508ada7d0fcee3fc420d60b16b8950"},"schema_version":"1.0","source":{"id":"1701.08315","kind":"arxiv","version":1}},"canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39a3358cf353568c906f613db53e7ab2904d70294103a26270c59ecd5dda9a43","first_computed_at":"2026-05-18T00:51:54.552540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:54.552540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6oHgW2dKFWjYB2RUU4/UfMu5OjKA+gf6c836ra2z9Zw8A5rk59RSVzP6jfRZpuokFNPDbqJdd5fQfcRLqKMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:54.553214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ade7f294507128a2d38b079b5d78f2f54d2a70c5b7257424dbfe46951b3007d","sha256:daf3d3180a47ab2d2758cd2689c73f93d2f44c9f7e3b823987a3249df192af55"],"state_sha256":"1ee2c1e326dc5c59ba4c5fca7936394333fd03d69d7786cd580df86aa53fa30d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UFD74nhP1zhNEHn6qY1BgE/SQ4fn1qmYqjKDd3wowqyOnvMl9N83jnvscIfG6wbCdV64kxpAhpnT6rvpIBhCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:23:15.408806Z","bundle_sha256":"aa99659a9f072000cd9b9297f4404b9915efa0de24e4cbf4bb9d3889d9364ae5"}}