{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WHBLOUOROQPQA5BXLCOJNUL2TE","short_pith_number":"pith:WHBLOUOR","schema_version":"1.0","canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","source":{"kind":"arxiv","id":"1006.3020","version":2},"attestation_state":"computed","paper":{"title":"Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"James Nastos, Yong Gao","submitted_at":"2010-06-15T16:03:13Z","abstract_excerpt":"Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the tri"},"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":"1006.3020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-06-15T16:03:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d24e5f89a24cf464b4a87abaff71b3dd5104b9d5c20979882713800eb8085524","abstract_canon_sha256":"b543f386bf7811922c64bb3f53bce0020efc47298f3798b6a2f53b53ac5cdc27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:53.277053Z","signature_b64":"R0LHv+pQPxklkbecwD8sY8a4GFLzl9LqSuGYi2WkSvRn7O4DLPaJISUOrMD3/f9Ns/KCfWF6Tr/Pf9K4trBbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","last_reissued_at":"2026-05-18T02:06:53.276148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:53.276148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"James Nastos, Yong Gao","submitted_at":"2010-06-15T16:03:13Z","abstract_excerpt":"Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the tri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3020","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":"1006.3020","created_at":"2026-05-18T02:06:53.276297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.3020v2","created_at":"2026-05-18T02:06:53.276297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3020","created_at":"2026-05-18T02:06:53.276297+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHBLOUOROQPQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHBLOUOROQPQA5BX","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHBLOUOR","created_at":"2026-05-18T12:26:15.391820+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/WHBLOUOROQPQA5BXLCOJNUL2TE","json":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE.json","graph_json":"https://pith.science/api/pith-number/WHBLOUOROQPQA5BXLCOJNUL2TE/graph.json","events_json":"https://pith.science/api/pith-number/WHBLOUOROQPQA5BXLCOJNUL2TE/events.json","paper":"https://pith.science/paper/WHBLOUOR"},"agent_actions":{"view_html":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE","download_json":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE.json","view_paper":"https://pith.science/paper/WHBLOUOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.3020&json=true","fetch_graph":"https://pith.science/api/pith-number/WHBLOUOROQPQA5BXLCOJNUL2TE/graph.json","fetch_events":"https://pith.science/api/pith-number/WHBLOUOROQPQA5BXLCOJNUL2TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/action/storage_attestation","attest_author":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/action/author_attestation","sign_citation":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/action/citation_signature","submit_replication":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/action/replication_record"}},"created_at":"2026-05-18T02:06:53.276297+00:00","updated_at":"2026-05-18T02:06:53.276297+00:00"}