{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3JPG7V2GUKWO3QTVV6POCZDQTT","short_pith_number":"pith:3JPG7V2G","schema_version":"1.0","canonical_sha256":"da5e6fd746a2acedc275af9ee164709cf206305891565ad8334de0d7f048a6a3","source":{"kind":"arxiv","id":"1010.5974","version":1},"attestation_state":"computed","paper":{"title":"Feedback Vertex Set in Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Paul Bonsma","submitted_at":"2010-10-28T14:04:50Z","abstract_excerpt":"A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on $n$ vertices contains a feedback vertex set (FVS) of size at most $k$, in time $2^{O(k)}k! O(n^4)$. This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs."},"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":"1010.5974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-28T14:04:50Z","cross_cats_sorted":[],"title_canon_sha256":"290b4a5b947459e390ccc414b79d690a44b295369697b76427b80a93b7fd54b7","abstract_canon_sha256":"2b10818156a48e4ce745430eeb4af35b11b5afd78f4796280e5db9c146ece4d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.360091Z","signature_b64":"kIv+/j+RpDy82scHKyFixQBsYRacLwmo5MlSMTbHEbi9p34jtYYEN/7bn0zFgyzfiE7wo2BRVV226sUFzp4jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5e6fd746a2acedc275af9ee164709cf206305891565ad8334de0d7f048a6a3","last_reissued_at":"2026-05-18T02:23:38.358478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.358478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback Vertex Set in Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Paul Bonsma","submitted_at":"2010-10-28T14:04:50Z","abstract_excerpt":"A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on $n$ vertices contains a feedback vertex set (FVS) of size at most $k$, in time $2^{O(k)}k! O(n^4)$. This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5974","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":"1010.5974","created_at":"2026-05-18T02:23:38.358557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5974v1","created_at":"2026-05-18T02:23:38.358557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5974","created_at":"2026-05-18T02:23:38.358557+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JPG7V2GUKWO","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JPG7V2GUKWO3QTV","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JPG7V2G","created_at":"2026-05-18T12:26:03.138858+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/3JPG7V2GUKWO3QTVV6POCZDQTT","json":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT.json","graph_json":"https://pith.science/api/pith-number/3JPG7V2GUKWO3QTVV6POCZDQTT/graph.json","events_json":"https://pith.science/api/pith-number/3JPG7V2GUKWO3QTVV6POCZDQTT/events.json","paper":"https://pith.science/paper/3JPG7V2G"},"agent_actions":{"view_html":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT","download_json":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT.json","view_paper":"https://pith.science/paper/3JPG7V2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5974&json=true","fetch_graph":"https://pith.science/api/pith-number/3JPG7V2GUKWO3QTVV6POCZDQTT/graph.json","fetch_events":"https://pith.science/api/pith-number/3JPG7V2GUKWO3QTVV6POCZDQTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT/action/storage_attestation","attest_author":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT/action/author_attestation","sign_citation":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT/action/citation_signature","submit_replication":"https://pith.science/pith/3JPG7V2GUKWO3QTVV6POCZDQTT/action/replication_record"}},"created_at":"2026-05-18T02:23:38.358557+00:00","updated_at":"2026-05-18T02:23:38.358557+00:00"}