{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WHBLOUOROQPQA5BXLCOJNUL2TE","short_pith_number":"pith:WHBLOUOR","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"},"canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","source":{"kind":"arxiv","id":"1006.3020","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3020","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3020v2","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3020","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"WHBLOUOROQPQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WHBLOUOROQPQA5BX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WHBLOUOR","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WHBLOUOROQPQA5BXLCOJNUL2TE","target":"record","payload":{"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"},"canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","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"},"source_kind":"arxiv","source_id":"1006.3020","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyvvYfQfi7hL/YM1W/XY26Qyshgg64d6YINpvUz6vtouW5+4CsYlOBS1zcdFaQ1+Qcqp1pVeX3YTO2L2K7nsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:13:44.990105Z"},"content_sha256":"27a5c0fd84f9eb7427b0687d79ed9b6ed230222d88bb31c3fe42fbe9c4260acc","schema_version":"1.0","event_id":"sha256:27a5c0fd84f9eb7427b0687d79ed9b6ed230222d88bb31c3fe42fbe9c4260acc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WHBLOUOROQPQA5BXLCOJNUL2TE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2y/iU/pkCnaoLdxj2B5Anq2ZOJpxYIljKPG0EtqQa1Dfwg18ZAtNyc61z2Y1bRDx6t/yrvIW3akT/TdQ0eM+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:13:44.990451Z"},"content_sha256":"98cc5ae215999db9a3505e8db2e66683c58f2c0caad257e4313f841232cd5132","schema_version":"1.0","event_id":"sha256:98cc5ae215999db9a3505e8db2e66683c58f2c0caad257e4313f841232cd5132"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/bundle.json","state_url":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T16:13:44Z","links":{"resolver":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE","bundle":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/bundle.json","state":"https://pith.science/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHBLOUOROQPQA5BXLCOJNUL2TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WHBLOUOROQPQA5BXLCOJNUL2TE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b543f386bf7811922c64bb3f53bce0020efc47298f3798b6a2f53b53ac5cdc27","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-06-15T16:03:13Z","title_canon_sha256":"d24e5f89a24cf464b4a87abaff71b3dd5104b9d5c20979882713800eb8085524"},"schema_version":"1.0","source":{"id":"1006.3020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3020","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3020v2","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3020","created_at":"2026-05-18T02:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"WHBLOUOROQPQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WHBLOUOROQPQA5BX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WHBLOUOR","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:98cc5ae215999db9a3505e8db2e66683c58f2c0caad257e4313f841232cd5132","target":"graph","created_at":"2026-05-18T02:06:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"James Nastos, Yong Gao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-06-15T16:03:13Z","title":"Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3020","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:27a5c0fd84f9eb7427b0687d79ed9b6ed230222d88bb31c3fe42fbe9c4260acc","target":"record","created_at":"2026-05-18T02:06:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b543f386bf7811922c64bb3f53bce0020efc47298f3798b6a2f53b53ac5cdc27","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-06-15T16:03:13Z","title_canon_sha256":"d24e5f89a24cf464b4a87abaff71b3dd5104b9d5c20979882713800eb8085524"},"schema_version":"1.0","source":{"id":"1006.3020","kind":"arxiv","version":2}},"canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1c2b751d1741f007437589c96d17a993971a5c95027bba7e4ee7e2aff301675","first_computed_at":"2026-05-18T02:06:53.276148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:53.276148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0LHv+pQPxklkbecwD8sY8a4GFLzl9LqSuGYi2WkSvRn7O4DLPaJISUOrMD3/f9Ns/KCfWF6Tr/Pf9K4trBbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:53.277053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a5c0fd84f9eb7427b0687d79ed9b6ed230222d88bb31c3fe42fbe9c4260acc","sha256:98cc5ae215999db9a3505e8db2e66683c58f2c0caad257e4313f841232cd5132"],"state_sha256":"ae02ce70aba8bdc7d76b78c4436a1a88e0e598649b96cd08a21064d9ed9042ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9vXVrpf0S+tdTlP7MalvMoXunZ46hsXLJWK9pDoqwH07Q1rqrjOxnmXDRCHM3/nPCGdxmDheBXtZMHZm+tGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:13:44.992422Z","bundle_sha256":"94d6227d01d97c19775e56641a7a586ae52835669bc849736919f148090c18d4"}}