{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AGE6CQX5MRXWHYLJSIDIOHZUCR","short_pith_number":"pith:AGE6CQX5","schema_version":"1.0","canonical_sha256":"0189e142fd646f63e1699206871f34144af5fddaed6ace894aea7e5ce4876c13","source":{"kind":"arxiv","id":"1710.07148","version":2},"attestation_state":"computed","paper":{"title":"A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Arne Telle, Lars Jaffke, O-joung Kwon","submitted_at":"2017-10-19T14:01:09Z","abstract_excerpt":"We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width $w$, we give an $n^{\\mathcal{O}(w)}$-time algorithm that solves Feedback Vertex Set. This provides a unified algorithm for many well-known classes, such as Interval graphs and Permutation graphs, and furthermore, it gives the first polynomial-time algorithms for other classes of bounded mim-width, such as Circular Permutation and Circular $k$-Trapezoid graphs for fixed $k$. In all these classes the de"},"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":"1710.07148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-19T14:01:09Z","cross_cats_sorted":[],"title_canon_sha256":"494dcc03cca6312c39ad967f9ce8155cbad664fbd61a63c45e455e12b879d707","abstract_canon_sha256":"35c4ebce2d047a074210c2445297802117eb771bcbde0f3c731a9f8cc94ce1f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.364175Z","signature_b64":"9V3NZtbVCPl63M0BL0qK7kBj5wNPySb0UkGhTGyzk6CiSRWex6nhfTaWqIMoY8YFdSxgIWIrw92Z8fnzvKasAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0189e142fd646f63e1699206871f34144af5fddaed6ace894aea7e5ce4876c13","last_reissued_at":"2026-05-18T00:26:14.363560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.363560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Arne Telle, Lars Jaffke, O-joung Kwon","submitted_at":"2017-10-19T14:01:09Z","abstract_excerpt":"We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width $w$, we give an $n^{\\mathcal{O}(w)}$-time algorithm that solves Feedback Vertex Set. This provides a unified algorithm for many well-known classes, such as Interval graphs and Permutation graphs, and furthermore, it gives the first polynomial-time algorithms for other classes of bounded mim-width, such as Circular Permutation and Circular $k$-Trapezoid graphs for fixed $k$. In all these classes the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07148","kind":"arxiv","version":2},"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":"1710.07148","created_at":"2026-05-18T00:26:14.363659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07148v2","created_at":"2026-05-18T00:26:14.363659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07148","created_at":"2026-05-18T00:26:14.363659+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGE6CQX5MRXW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGE6CQX5MRXWHYLJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGE6CQX5","created_at":"2026-05-18T12:31:05.417338+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/AGE6CQX5MRXWHYLJSIDIOHZUCR","json":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR.json","graph_json":"https://pith.science/api/pith-number/AGE6CQX5MRXWHYLJSIDIOHZUCR/graph.json","events_json":"https://pith.science/api/pith-number/AGE6CQX5MRXWHYLJSIDIOHZUCR/events.json","paper":"https://pith.science/paper/AGE6CQX5"},"agent_actions":{"view_html":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR","download_json":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR.json","view_paper":"https://pith.science/paper/AGE6CQX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07148&json=true","fetch_graph":"https://pith.science/api/pith-number/AGE6CQX5MRXWHYLJSIDIOHZUCR/graph.json","fetch_events":"https://pith.science/api/pith-number/AGE6CQX5MRXWHYLJSIDIOHZUCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR/action/storage_attestation","attest_author":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR/action/author_attestation","sign_citation":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR/action/citation_signature","submit_replication":"https://pith.science/pith/AGE6CQX5MRXWHYLJSIDIOHZUCR/action/replication_record"}},"created_at":"2026-05-18T00:26:14.363659+00:00","updated_at":"2026-05-18T00:26:14.363659+00:00"}