{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2233DFPXH5QDVTLUPA66HDTY2M","short_pith_number":"pith:2233DFPX","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"},"canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","source":{"kind":"arxiv","id":"1105.0477","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0477","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0477v3","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0477","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"pith_short_12","alias_value":"2233DFPXH5QD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2233DFPXH5QDVTLU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2233DFPX","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2233DFPXH5QDVTLUPA66HDTY2M","target":"record","payload":{"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"},"canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","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"},"source_kind":"arxiv","source_id":"1105.0477","source_version":3,"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-18T03:56:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIMakN1ewXVVi9d44ugW6/37hdsYz2GDepioaEFPUkz1jZX7vDsr50L1VY16/QJlDSU7dznvhXQrQZVBXwhlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T03:18:37.249515Z"},"content_sha256":"f2eaae824bc9c5693a2477b9c87af2fd30284c1cccafecc11adf6302217a3018","schema_version":"1.0","event_id":"sha256:f2eaae824bc9c5693a2477b9c87af2fd30284c1cccafecc11adf6302217a3018"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2233DFPXH5QDVTLUPA66HDTY2M","target":"graph","payload":{"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"},"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-18T03:56:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSP0EoMKi6qLQJkTEak/yzW9aDACJyLRrJgjT+NStkQg3HseTj/uRxLSsxmlWtBHrWHHUsRLUGAw9gFvF0CKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T03:18:37.250055Z"},"content_sha256":"1d7361e0f420390e49cb1ac198531cfa2fe0af495fbcfe22c0b3c9899d64371c","schema_version":"1.0","event_id":"sha256:1d7361e0f420390e49cb1ac198531cfa2fe0af495fbcfe22c0b3c9899d64371c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/bundle.json","state_url":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2233DFPXH5QDVTLUPA66HDTY2M/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-05-19T03:18:37Z","links":{"resolver":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M","bundle":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/bundle.json","state":"https://pith.science/pith/2233DFPXH5QDVTLUPA66HDTY2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2233DFPXH5QDVTLUPA66HDTY2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2233DFPXH5QDVTLUPA66HDTY2M","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":"1ec179aca78883b3eb19868e0d2b0c3882d65349879472881149eac3d93f55a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T05:25:14Z","title_canon_sha256":"6ca5cc301b2ca58f8f464a63f86951f3c46d9bdb7738614855aaad7f8db43a4e"},"schema_version":"1.0","source":{"id":"1105.0477","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0477","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0477v3","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0477","created_at":"2026-05-18T03:56:36Z"},{"alias_kind":"pith_short_12","alias_value":"2233DFPXH5QD","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2233DFPXH5QDVTLU","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2233DFPX","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:1d7361e0f420390e49cb1ac198531cfa2fe0af495fbcfe22c0b3c9899d64371c","target":"graph","created_at":"2026-05-18T03:56:36Z","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":"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","authors_text":"Bingkai Lin, Yijia Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T05:25:14Z","title":"The parameterized complexity of k-edge induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0477","kind":"arxiv","version":3},"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:f2eaae824bc9c5693a2477b9c87af2fd30284c1cccafecc11adf6302217a3018","target":"record","created_at":"2026-05-18T03:56:36Z","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":"1ec179aca78883b3eb19868e0d2b0c3882d65349879472881149eac3d93f55a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-03T05:25:14Z","title_canon_sha256":"6ca5cc301b2ca58f8f464a63f86951f3c46d9bdb7738614855aaad7f8db43a4e"},"schema_version":"1.0","source":{"id":"1105.0477","kind":"arxiv","version":3}},"canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6b7b195f73f603acd74783de38e78d31be096f8717fe32988ce6546a9faa658","first_computed_at":"2026-05-18T03:56:36.325003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:36.325003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YNgOI5UzqGU9aoXhHhBJqsfHjAgOsh/9F4CtFIcfJwyKxnLK/XV2Yj3TTBInO1nS7ZG7bdHNgTyUmeSshFT+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:36.325535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0477","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2eaae824bc9c5693a2477b9c87af2fd30284c1cccafecc11adf6302217a3018","sha256:1d7361e0f420390e49cb1ac198531cfa2fe0af495fbcfe22c0b3c9899d64371c"],"state_sha256":"5b48e54c4014795bc6e9e2332e04288e7b42698c6b5abc624eb5660ce414462a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMKaFgxmRTS4avcC5nsh7ZjZ89B01yPyfV+aOVRveb5rvIAMC30Mcze04xcoSNxdwO3LfWwCm6UadIk4eAtqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T03:18:37.251762Z","bundle_sha256":"18530c71d8346100cc8361fd42c39b3db0992a7e3b2836fcbae135a01ec43f6d"}}