{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OKF22ONWBBWS3F6QJEIPSA7DL7","short_pith_number":"pith:OKF22ONW","canonical_record":{"source":{"id":"1708.04723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T23:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"5c37dfc69657bacdaf363c3541cc77dea42212d612300e9578cbcf0721047fc4","abstract_canon_sha256":"cfe68cfe649e497cdc6ecb2c8bf93213a74bc088d896b75b43fd236fc7dfbff2"},"schema_version":"1.0"},"canonical_sha256":"728bad39b6086d2d97d04910f903e35fe300aa8259966959b6b1743eeb782a1b","source":{"kind":"arxiv","id":"1708.04723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04723","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04723v1","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04723","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"OKF22ONWBBWS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKF22ONWBBWS3F6Q","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKF22ONW","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OKF22ONWBBWS3F6QJEIPSA7DL7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T23:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"5c37dfc69657bacdaf363c3541cc77dea42212d612300e9578cbcf0721047fc4","abstract_canon_sha256":"cfe68cfe649e497cdc6ecb2c8bf93213a74bc088d896b75b43fd236fc7dfbff2"},"schema_version":"1.0"},"canonical_sha256":"728bad39b6086d2d97d04910f903e35fe300aa8259966959b6b1743eeb782a1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.086956Z","signature_b64":"j7LaJZRrISTk3ofP5WbM608Lvgtirfo/seg0UAokSFjVycC6auAmsu1dicwqCfUd0Vw31gOYijO54NJ3Na/fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728bad39b6086d2d97d04910f903e35fe300aa8259966959b6b1743eeb782a1b","last_reissued_at":"2026-05-18T00:37:58.086294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.086294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04723","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:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkSpUilx4iTkmxYxryOefjbnkT954K1AZXXs6PH79UIwxKUdODLiKsKkOxFGiFytwxtkPOB/tNChso1Gv9vOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:20.865117Z"},"content_sha256":"ec1f798058a8406be5bc8a96f268314fd2c155d91da1911abdfde932adcae9ca","schema_version":"1.0","event_id":"sha256:ec1f798058a8406be5bc8a96f268314fd2c155d91da1911abdfde932adcae9ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OKF22ONWBBWS3F6QJEIPSA7DL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polylogarithmic approximation for minimum planarization (almost)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ken-ichi Kawarabayashi","submitted_at":"2017-08-15T23:54:36Z","abstract_excerpt":"In the minimum planarization problem, given some $n$-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a fundamental problem in topological graph theory. We present a $\\log^{O(1)} n$-approximation algorithm for this problem on general graphs with running time $n^{O(\\log n/\\log\\log n)}$. We also obtain a $O(n^\\varepsilon)$-approximation with running time $n^{O(1/\\varepsilon)}$ for any arbitrarily small constant $\\varepsilon > 0$. Prior to our work, no non-trivial algorithm was known for this problem on general graphs, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04723","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:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nvm0PThrwQZ53YAXTxhF79FqY2xpCery+6I6YWQhFogrED9GCuOufUee+muP7hWFtbBva0AQVmpSNN3qhbGmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:20.865478Z"},"content_sha256":"ee383889d7a67357316f4c918ee1e8f5f9e37061da2161dc8e3e000cb9bdab21","schema_version":"1.0","event_id":"sha256:ee383889d7a67357316f4c918ee1e8f5f9e37061da2161dc8e3e000cb9bdab21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/bundle.json","state_url":"https://pith.science/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/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-02T20:47:20Z","links":{"resolver":"https://pith.science/pith/OKF22ONWBBWS3F6QJEIPSA7DL7","bundle":"https://pith.science/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/bundle.json","state":"https://pith.science/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKF22ONWBBWS3F6QJEIPSA7DL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OKF22ONWBBWS3F6QJEIPSA7DL7","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":"cfe68cfe649e497cdc6ecb2c8bf93213a74bc088d896b75b43fd236fc7dfbff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T23:54:36Z","title_canon_sha256":"5c37dfc69657bacdaf363c3541cc77dea42212d612300e9578cbcf0721047fc4"},"schema_version":"1.0","source":{"id":"1708.04723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04723","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04723v1","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04723","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"OKF22ONWBBWS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKF22ONWBBWS3F6Q","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKF22ONW","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:ee383889d7a67357316f4c918ee1e8f5f9e37061da2161dc8e3e000cb9bdab21","target":"graph","created_at":"2026-05-18T00:37:58Z","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":"In the minimum planarization problem, given some $n$-vertex graph, the goal is to find a set of vertices of minimum cardinality whose removal leaves a planar graph. This is a fundamental problem in topological graph theory. We present a $\\log^{O(1)} n$-approximation algorithm for this problem on general graphs with running time $n^{O(\\log n/\\log\\log n)}$. We also obtain a $O(n^\\varepsilon)$-approximation with running time $n^{O(1/\\varepsilon)}$ for any arbitrarily small constant $\\varepsilon > 0$. Prior to our work, no non-trivial algorithm was known for this problem on general graphs, and the","authors_text":"Anastasios Sidiropoulos, Ken-ichi Kawarabayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T23:54:36Z","title":"Polylogarithmic approximation for minimum planarization (almost)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04723","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:ec1f798058a8406be5bc8a96f268314fd2c155d91da1911abdfde932adcae9ca","target":"record","created_at":"2026-05-18T00:37:58Z","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":"cfe68cfe649e497cdc6ecb2c8bf93213a74bc088d896b75b43fd236fc7dfbff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T23:54:36Z","title_canon_sha256":"5c37dfc69657bacdaf363c3541cc77dea42212d612300e9578cbcf0721047fc4"},"schema_version":"1.0","source":{"id":"1708.04723","kind":"arxiv","version":1}},"canonical_sha256":"728bad39b6086d2d97d04910f903e35fe300aa8259966959b6b1743eeb782a1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"728bad39b6086d2d97d04910f903e35fe300aa8259966959b6b1743eeb782a1b","first_computed_at":"2026-05-18T00:37:58.086294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:58.086294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j7LaJZRrISTk3ofP5WbM608Lvgtirfo/seg0UAokSFjVycC6auAmsu1dicwqCfUd0Vw31gOYijO54NJ3Na/fBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:58.086956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec1f798058a8406be5bc8a96f268314fd2c155d91da1911abdfde932adcae9ca","sha256:ee383889d7a67357316f4c918ee1e8f5f9e37061da2161dc8e3e000cb9bdab21"],"state_sha256":"0d6610d881c68ae91776fff7ce15bb86a728c878d73137d1c73fe4e7b2abcaa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRuLN0AM95CVgTrMVpoqaFF87JT/Bob50jkxLRrdB0Pxb0Bb5wTDHYUXDWXdwgX0HKBUTxieW10ErxQZxtuVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:47:20.867489Z","bundle_sha256":"0db12cda7a56ceb5fb7f58bfcf1e45e919c0909b6f291925892ff438f2d530c0"}}