{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X6O5CHFAV2QOUXOWBRHSYMDXG7","short_pith_number":"pith:X6O5CHFA","canonical_record":{"source":{"id":"1804.07869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T00:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"8adc33f9dba332c6c772f13a970e5727fcbea99de692c3f38c22143b86fb95e2","abstract_canon_sha256":"e0fcfe7a414f899c81671db1d8283dc782b5bb6c1d3307421996a694c96efd29"},"schema_version":"1.0"},"canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","source":{"kind":"arxiv","id":"1804.07869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07869","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07869v1","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07869","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"X6O5CHFAV2QO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X6O5CHFAV2QOUXOW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X6O5CHFA","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X6O5CHFAV2QOUXOWBRHSYMDXG7","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T00:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"8adc33f9dba332c6c772f13a970e5727fcbea99de692c3f38c22143b86fb95e2","abstract_canon_sha256":"e0fcfe7a414f899c81671db1d8283dc782b5bb6c1d3307421996a694c96efd29"},"schema_version":"1.0"},"canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:52.537006Z","signature_b64":"WJxxwL/X/SGNczeyqmo6dYL+//WPvDSrCGLxcR7U+r4ioQPjjaMOWqMbAQKzN81HbuUR7KbNKnZWfLyCKogrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","last_reissued_at":"2026-05-18T00:17:52.536366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:52.536366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07869","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:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lozp6Cqr0ffcWFMHRlp4pf7YBn9jW2E477LYg2Oukgwd8vVAngs6lGKqjtIvfwYuAtRMRZnKMahMPPtH10cQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:06:42.065792Z"},"content_sha256":"681102b36bb823b1581ed89acce08ff7802c202a505faa714ffd69389c021188","schema_version":"1.0","event_id":"sha256:681102b36bb823b1581ed89acce08ff7802c202a505faa714ffd69389c021188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X6O5CHFAV2QOUXOWBRHSYMDXG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baigong Zheng, Glencora Borradaile, Hung Le","submitted_at":"2018-04-21T00:27:28Z","abstract_excerpt":"We present two algorithms for the minimum feedback vertex set problem in planar graphs: an $O(n \\log n)$ PTAS using a linear kernel and balanced separator, and a heuristic algorithm using kernelization and local search. We implemented these algorithms and compared their performance with Becker and Geiger's 2-approximation algorithm. We observe that while our PTAS is competitive with the 2-approximation algorithm on large planar graphs, its running time is much longer. And our heuristic algorithm can outperform the 2-approximation algorithm on most large planar graphs and provide a trade-off be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07869","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:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUT7wZ8pysALLMnhKJ/SUPyr3IdL5Gbn1qpJHoM+5lleizMVrC6DtE2mP6D2P/HlB9WjfQ4yTtX+BrOrfWcBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:06:42.066131Z"},"content_sha256":"8af0c9366731cf03e64d0dd6b5c66a50b5af3629a224f29bb1a78f1f32e7320f","schema_version":"1.0","event_id":"sha256:8af0c9366731cf03e64d0dd6b5c66a50b5af3629a224f29bb1a78f1f32e7320f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/bundle.json","state_url":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/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-02T05:06:42Z","links":{"resolver":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7","bundle":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/bundle.json","state":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X6O5CHFAV2QOUXOWBRHSYMDXG7","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":"e0fcfe7a414f899c81671db1d8283dc782b5bb6c1d3307421996a694c96efd29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T00:27:28Z","title_canon_sha256":"8adc33f9dba332c6c772f13a970e5727fcbea99de692c3f38c22143b86fb95e2"},"schema_version":"1.0","source":{"id":"1804.07869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07869","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07869v1","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07869","created_at":"2026-05-18T00:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"X6O5CHFAV2QO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X6O5CHFAV2QOUXOW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X6O5CHFA","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:8af0c9366731cf03e64d0dd6b5c66a50b5af3629a224f29bb1a78f1f32e7320f","target":"graph","created_at":"2026-05-18T00:17:52Z","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 two algorithms for the minimum feedback vertex set problem in planar graphs: an $O(n \\log n)$ PTAS using a linear kernel and balanced separator, and a heuristic algorithm using kernelization and local search. We implemented these algorithms and compared their performance with Becker and Geiger's 2-approximation algorithm. We observe that while our PTAS is competitive with the 2-approximation algorithm on large planar graphs, its running time is much longer. And our heuristic algorithm can outperform the 2-approximation algorithm on most large planar graphs and provide a trade-off be","authors_text":"Baigong Zheng, Glencora Borradaile, Hung Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T00:27:28Z","title":"Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07869","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:681102b36bb823b1581ed89acce08ff7802c202a505faa714ffd69389c021188","target":"record","created_at":"2026-05-18T00:17:52Z","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":"e0fcfe7a414f899c81671db1d8283dc782b5bb6c1d3307421996a694c96efd29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T00:27:28Z","title_canon_sha256":"8adc33f9dba332c6c772f13a970e5727fcbea99de692c3f38c22143b86fb95e2"},"schema_version":"1.0","source":{"id":"1804.07869","kind":"arxiv","version":1}},"canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","first_computed_at":"2026-05-18T00:17:52.536366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:52.536366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJxxwL/X/SGNczeyqmo6dYL+//WPvDSrCGLxcR7U+r4ioQPjjaMOWqMbAQKzN81HbuUR7KbNKnZWfLyCKogrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:52.537006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:681102b36bb823b1581ed89acce08ff7802c202a505faa714ffd69389c021188","sha256:8af0c9366731cf03e64d0dd6b5c66a50b5af3629a224f29bb1a78f1f32e7320f"],"state_sha256":"20ded5e75a478dd726d674b16c4d378270a6f1eb3ff02c0866d03b1956e824a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOusRjNw2bZpqBGiMRiGDDyso1M6hR9ERb1eP+FrfHLwHWZ2MX9eeDLu3uUHFJcvgrOIbsNAVVw9dbalpJo6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:06:42.067994Z","bundle_sha256":"78b81216a35c591a83944ec3bee3a7407d886625d54e3a28c85641caf7e09dce"}}