{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X6O5CHFAV2QOUXOWBRHSYMDXG7","short_pith_number":"pith:X6O5CHFA","schema_version":"1.0","canonical_sha256":"bf9dd11ca0aea0ea5dd60c4f2c307737c166bdf3e81de6f80a1212c886a8354a","source":{"kind":"arxiv","id":"1804.07869","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.07869","created_at":"2026-05-18T00:17:52.536459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07869v1","created_at":"2026-05-18T00:17:52.536459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07869","created_at":"2026-05-18T00:17:52.536459+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6O5CHFAV2QO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6O5CHFAV2QOUXOW","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6O5CHFA","created_at":"2026-05-18T12:33:01.666342+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/X6O5CHFAV2QOUXOWBRHSYMDXG7","json":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7.json","graph_json":"https://pith.science/api/pith-number/X6O5CHFAV2QOUXOWBRHSYMDXG7/graph.json","events_json":"https://pith.science/api/pith-number/X6O5CHFAV2QOUXOWBRHSYMDXG7/events.json","paper":"https://pith.science/paper/X6O5CHFA"},"agent_actions":{"view_html":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7","download_json":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7.json","view_paper":"https://pith.science/paper/X6O5CHFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07869&json=true","fetch_graph":"https://pith.science/api/pith-number/X6O5CHFAV2QOUXOWBRHSYMDXG7/graph.json","fetch_events":"https://pith.science/api/pith-number/X6O5CHFAV2QOUXOWBRHSYMDXG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/action/storage_attestation","attest_author":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/action/author_attestation","sign_citation":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/action/citation_signature","submit_replication":"https://pith.science/pith/X6O5CHFAV2QOUXOWBRHSYMDXG7/action/replication_record"}},"created_at":"2026-05-18T00:17:52.536459+00:00","updated_at":"2026-05-18T00:17:52.536459+00:00"}