{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2233DFPXH5QDVTLUPA66HDTY2M","short_pith_number":"pith:2233DFPX","schema_version":"1.0","canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","source":{"kind":"arxiv","id":"1105.0477","version":3},"attestation_state":"computed","paper":{"title":"The parameterized complexity of k-edge induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bingkai Lin, Yijia Chen","submitted_at":"2011-05-03T05:25:14Z","abstract_excerpt":"We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \\emph{Eureka} theorem [Andrews, 86], and a generalization of the well-known fpt-algorithm for the model-checking problem for first-order logic on graphs with locally bounded tree-width due to Frick and Grohe [Frick and Grohe, 01]. On the other hand, we show that two natural counting versions of the problem are hard. Hence, the $k$-edge induced subgraph problem is one of the rare known exampl"},"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":"1105.0477","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T05:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"6ca5cc301b2ca58f8f464a63f86951f3c46d9bdb7738614855aaad7f8db43a4e","abstract_canon_sha256":"1ec179aca78883b3eb19868e0d2b0c3882d65349879472881149eac3d93f55a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:36.325535Z","signature_b64":"YNgOI5UzqGU9aoXhHhBJqsfHjAgOsh/9F4CtFIcfJwyKxnLK/XV2Yj3TTBInO1nS7ZG7bdHNgTyUmeSshFT+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","last_reissued_at":"2026-05-18T03:56:36.325003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:36.325003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The parameterized complexity of k-edge induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bingkai Lin, Yijia Chen","submitted_at":"2011-05-03T05:25:14Z","abstract_excerpt":"We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \\emph{Eureka} theorem [Andrews, 86], and a generalization of the well-known fpt-algorithm for the model-checking problem for first-order logic on graphs with locally bounded tree-width due to Frick and Grohe [Frick and Grohe, 01]. On the other hand, we show that two natural counting versions of the problem are hard. Hence, the $k$-edge induced subgraph problem is one of the rare known exampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0477","kind":"arxiv","version":3},"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":"1105.0477","created_at":"2026-05-18T03:56:36.325080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0477v3","created_at":"2026-05-18T03:56:36.325080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0477","created_at":"2026-05-18T03:56:36.325080+00:00"},{"alias_kind":"pith_short_12","alias_value":"2233DFPXH5QD","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2233DFPXH5QDVTLU","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2233DFPX","created_at":"2026-05-18T12:26:18.847500+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/2233DFPXH5QDVTLUPA66HDTY2M","json":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M.json","graph_json":"https://pith.science/api/pith-number/2233DFPXH5QDVTLUPA66HDTY2M/graph.json","events_json":"https://pith.science/api/pith-number/2233DFPXH5QDVTLUPA66HDTY2M/events.json","paper":"https://pith.science/paper/2233DFPX"},"agent_actions":{"view_html":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M","download_json":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M.json","view_paper":"https://pith.science/paper/2233DFPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0477&json=true","fetch_graph":"https://pith.science/api/pith-number/2233DFPXH5QDVTLUPA66HDTY2M/graph.json","fetch_events":"https://pith.science/api/pith-number/2233DFPXH5QDVTLUPA66HDTY2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/action/storage_attestation","attest_author":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/action/author_attestation","sign_citation":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/action/citation_signature","submit_replication":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/action/replication_record"}},"created_at":"2026-05-18T03:56:36.325080+00:00","updated_at":"2026-05-18T03:56:36.325080+00:00"}