{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KIDCYF524CHPOWZP5Q7YETHTNN","short_pith_number":"pith:KIDCYF52","schema_version":"1.0","canonical_sha256":"52062c17bae08ef75b2fec3f824cf36b4e51c34db853674b6fb9f939afd8e812","source":{"kind":"arxiv","id":"1004.1672","version":2},"attestation_state":"computed","paper":{"title":"On Feedback Vertex Set: New Measure and New Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yang Liu, Yixin Cao","submitted_at":"2010-04-10T03:05:53Z","abstract_excerpt":"We present a new parameterized algorithm for the {feedback vertex set} problem ({\\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\\sc disjoint-fvs}), which finds a feedback vertex set of size $k$ that has no overlap with a given feedback vertex set $F$ of the graph $G$. We develop an improved kernelization algorithm for {\\sc disjoint-fvs} and show that {\\sc disjoint-fvs} can be solved in polynomial time when all vertices in $G \\setminus F$ have degrees upper bounded by three. We then propose a new branch-and-"},"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":"1004.1672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-10T03:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"b857535a402e9008729d5a09c496cf84383046e3016f88debc242b15ce716c4d","abstract_canon_sha256":"689fc623030202dc96e4bb41a40bc918cf927d036f22c0795b8e60ce6218ddfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:40.801631Z","signature_b64":"hdSGgKpNAbcJp2KqtKREG7mQIDWwDmfdaoFjdEasoOhWOAZJ2TNuBugcPFnn7/yqoCQxEG8uJcE1JWzqxbzpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52062c17bae08ef75b2fec3f824cf36b4e51c34db853674b6fb9f939afd8e812","last_reissued_at":"2026-05-18T02:50:40.801021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:40.801021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Feedback Vertex Set: New Measure and New Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Yang Liu, Yixin Cao","submitted_at":"2010-04-10T03:05:53Z","abstract_excerpt":"We present a new parameterized algorithm for the {feedback vertex set} problem ({\\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\\sc disjoint-fvs}), which finds a feedback vertex set of size $k$ that has no overlap with a given feedback vertex set $F$ of the graph $G$. We develop an improved kernelization algorithm for {\\sc disjoint-fvs} and show that {\\sc disjoint-fvs} can be solved in polynomial time when all vertices in $G \\setminus F$ have degrees upper bounded by three. We then propose a new branch-and-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1672","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":"1004.1672","created_at":"2026-05-18T02:50:40.801104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1672v2","created_at":"2026-05-18T02:50:40.801104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1672","created_at":"2026-05-18T02:50:40.801104+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIDCYF524CHP","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIDCYF524CHPOWZP","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIDCYF52","created_at":"2026-05-18T12:26:09.077623+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/KIDCYF524CHPOWZP5Q7YETHTNN","json":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN.json","graph_json":"https://pith.science/api/pith-number/KIDCYF524CHPOWZP5Q7YETHTNN/graph.json","events_json":"https://pith.science/api/pith-number/KIDCYF524CHPOWZP5Q7YETHTNN/events.json","paper":"https://pith.science/paper/KIDCYF52"},"agent_actions":{"view_html":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN","download_json":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN.json","view_paper":"https://pith.science/paper/KIDCYF52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1672&json=true","fetch_graph":"https://pith.science/api/pith-number/KIDCYF524CHPOWZP5Q7YETHTNN/graph.json","fetch_events":"https://pith.science/api/pith-number/KIDCYF524CHPOWZP5Q7YETHTNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN/action/storage_attestation","attest_author":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN/action/author_attestation","sign_citation":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN/action/citation_signature","submit_replication":"https://pith.science/pith/KIDCYF524CHPOWZP5Q7YETHTNN/action/replication_record"}},"created_at":"2026-05-18T02:50:40.801104+00:00","updated_at":"2026-05-18T02:50:40.801104+00:00"}