{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:43GDJ76QX77LAJJ6WMK5S5OCJO","short_pith_number":"pith:43GDJ76Q","schema_version":"1.0","canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","source":{"kind":"arxiv","id":"1810.04620","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Independent Set in H-Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, R\\'emi Watrigant, St\\'ephan Thomass\\'e","submitted_at":"2018-10-10T16:24:29Z","abstract_excerpt":"In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we study its fixed-parameter tractability and make progress towards a dichotomy between $FPT$ and $W[1]$-hard cases. We first show that MIS remains $W[1]$-hard in graphs forbidding simultaneously $K_{1, 4}$, any finite set of cycles of length at least $4$, and any finite set of trees with at least two branching vertices. In particular, this answers an open ques"},"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":"1810.04620","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T16:24:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0b664b2ec04a58ff3db9fec8d69adfda28b6b835635c699c4c3a3e2e7400d730","abstract_canon_sha256":"d01ca846f27f51ba67eb807cdc22bbaa0824483a328fd8819d446f6667a9874f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.230233Z","signature_b64":"rzjghIQf4gGERCiXbOSCQkJO8Dl3iJ7C9BUcHq0elRSOOAFbE2GaWHdkEa+7t3+j/+zP2vlU+YBWSitakX2ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","last_reissued_at":"2026-05-17T23:53:09.229762Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.229762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Independent Set in H-Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, R\\'emi Watrigant, St\\'ephan Thomass\\'e","submitted_at":"2018-10-10T16:24:29Z","abstract_excerpt":"In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we study its fixed-parameter tractability and make progress towards a dichotomy between $FPT$ and $W[1]$-hard cases. We first show that MIS remains $W[1]$-hard in graphs forbidding simultaneously $K_{1, 4}$, any finite set of cycles of length at least $4$, and any finite set of trees with at least two branching vertices. In particular, this answers an open ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04620","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":"1810.04620","created_at":"2026-05-17T23:53:09.229828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04620v2","created_at":"2026-05-17T23:53:09.229828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04620","created_at":"2026-05-17T23:53:09.229828+00:00"},{"alias_kind":"pith_short_12","alias_value":"43GDJ76QX77L","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"43GDJ76QX77LAJJ6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"43GDJ76Q","created_at":"2026-05-18T12:32:05.422762+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/43GDJ76QX77LAJJ6WMK5S5OCJO","json":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO.json","graph_json":"https://pith.science/api/pith-number/43GDJ76QX77LAJJ6WMK5S5OCJO/graph.json","events_json":"https://pith.science/api/pith-number/43GDJ76QX77LAJJ6WMK5S5OCJO/events.json","paper":"https://pith.science/paper/43GDJ76Q"},"agent_actions":{"view_html":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO","download_json":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO.json","view_paper":"https://pith.science/paper/43GDJ76Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04620&json=true","fetch_graph":"https://pith.science/api/pith-number/43GDJ76QX77LAJJ6WMK5S5OCJO/graph.json","fetch_events":"https://pith.science/api/pith-number/43GDJ76QX77LAJJ6WMK5S5OCJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/action/storage_attestation","attest_author":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/action/author_attestation","sign_citation":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/action/citation_signature","submit_replication":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/action/replication_record"}},"created_at":"2026-05-17T23:53:09.229828+00:00","updated_at":"2026-05-17T23:53:09.229828+00:00"}