{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:43GDJ76QX77LAJJ6WMK5S5OCJO","short_pith_number":"pith:43GDJ76Q","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"},"canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","source":{"kind":"arxiv","id":"1810.04620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04620","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04620v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04620","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"43GDJ76QX77L","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"43GDJ76QX77LAJJ6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"43GDJ76Q","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:43GDJ76QX77LAJJ6WMK5S5OCJO","target":"record","payload":{"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"},"canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","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"},"source_kind":"arxiv","source_id":"1810.04620","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-17T23:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPJwNrCBUdH580oCHAaKC4kftkzwi/BoXq4gsH3YCaK2EJMom1vHPQPrvK0PJsGFxEiYwcgeGhZupzK5zTCnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:02:40.608674Z"},"content_sha256":"0e1cfdf567622b257872b376c47502ddf40e22418dc8c7443123d9eabcc7b457","schema_version":"1.0","event_id":"sha256:0e1cfdf567622b257872b376c47502ddf40e22418dc8c7443123d9eabcc7b457"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:43GDJ76QX77LAJJ6WMK5S5OCJO","target":"graph","payload":{"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"},"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-17T23:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+APi4CkjDv0s/+0OP/iON+wuA86gdXhCemM4dQ+YrwQDd9wCE3fE2lXndKYJja61XY/XKyXt5NEzZW7wRtzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:02:40.609087Z"},"content_sha256":"f748f3ce30c7ea6a0f2a0b174523069f8fb984bb467339a24cf5393586f502c2","schema_version":"1.0","event_id":"sha256:f748f3ce30c7ea6a0f2a0b174523069f8fb984bb467339a24cf5393586f502c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/bundle.json","state_url":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/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-26T13:02:40Z","links":{"resolver":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO","bundle":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/bundle.json","state":"https://pith.science/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43GDJ76QX77LAJJ6WMK5S5OCJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:43GDJ76QX77LAJJ6WMK5S5OCJO","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":"d01ca846f27f51ba67eb807cdc22bbaa0824483a328fd8819d446f6667a9874f","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T16:24:29Z","title_canon_sha256":"0b664b2ec04a58ff3db9fec8d69adfda28b6b835635c699c4c3a3e2e7400d730"},"schema_version":"1.0","source":{"id":"1810.04620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04620","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04620v2","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04620","created_at":"2026-05-17T23:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"43GDJ76QX77L","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"43GDJ76QX77LAJJ6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"43GDJ76Q","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:f748f3ce30c7ea6a0f2a0b174523069f8fb984bb467339a24cf5393586f502c2","target":"graph","created_at":"2026-05-17T23:53:09Z","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":"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","authors_text":"\\'Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, R\\'emi Watrigant, St\\'ephan Thomass\\'e","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T16:24:29Z","title":"Parameterized Complexity of Independent Set in H-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04620","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:0e1cfdf567622b257872b376c47502ddf40e22418dc8c7443123d9eabcc7b457","target":"record","created_at":"2026-05-17T23:53:09Z","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":"d01ca846f27f51ba67eb807cdc22bbaa0824483a328fd8819d446f6667a9874f","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T16:24:29Z","title_canon_sha256":"0b664b2ec04a58ff3db9fec8d69adfda28b6b835635c699c4c3a3e2e7400d730"},"schema_version":"1.0","source":{"id":"1810.04620","kind":"arxiv","version":2}},"canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6cc34ffd0bffeb0253eb315d975c24bb4cc66f4ed02882e808a11aa96f4b05b","first_computed_at":"2026-05-17T23:53:09.229762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:09.229762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzjghIQf4gGERCiXbOSCQkJO8Dl3iJ7C9BUcHq0elRSOOAFbE2GaWHdkEa+7t3+j/+zP2vlU+YBWSitakX2ACg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:09.230233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e1cfdf567622b257872b376c47502ddf40e22418dc8c7443123d9eabcc7b457","sha256:f748f3ce30c7ea6a0f2a0b174523069f8fb984bb467339a24cf5393586f502c2"],"state_sha256":"0f3e5439192fb0ddfa27a269e3c04215edb54ac0474bacc6a80bb798ee8ea8aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZP7V/Ry8T7ghwIMgtw2qe3rt1psbt+wYlUT/WtYbBWjrukieRD/PJPXENC9idi6u50vzREwZnvrQtukOJIzxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:02:40.611564Z","bundle_sha256":"8ad50b102648c5dec2967dc09e50d06c09654af6aa83b596b0d5c906d3b0ab2d"}}