{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D32JJBND3R3YRPSQ67XYUA6D5E","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":"78da02614a8f01dfa7437b852294c70b84e5dde700dd785d1ec6de571d31c044","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T09:21:33Z","title_canon_sha256":"bcef7a7e58c0a5ea02748775a11991cfa73a97e941b758c66eb9984efcafe530"},"schema_version":"1.0","source":{"id":"1907.04585","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04585","created_at":"2026-07-05T07:12:31Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04585v4","created_at":"2026-07-05T07:12:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04585","created_at":"2026-07-05T07:12:31Z"},{"alias_kind":"pith_short_12","alias_value":"D32JJBND3R3Y","created_at":"2026-07-05T07:12:31Z"},{"alias_kind":"pith_short_16","alias_value":"D32JJBND3R3YRPSQ","created_at":"2026-07-05T07:12:31Z"},{"alias_kind":"pith_short_8","alias_value":"D32JJBND","created_at":"2026-07-05T07:12:31Z"}],"graph_snapshots":[{"event_id":"sha256:672d7f40d38464e5d15eaa6aac507f1418ae82f8895d942c70af1c23344a6956","target":"graph","created_at":"2026-07-05T07:12:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.04585/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to approximate within a factor of $n^{1-\\varepsilon}$ for any $\\varepsilon > 0$. Due to this, investigating the complexity of Maximum Independent Set in various graph classes in hope of finding better tractability results is an active research direction.\n  In $H$-free graphs, that is, graphs not containing a fixed graph $H$ as an induced subgraph, the problem is known ","authors_text":"Marcin Pilipczuk, Maria Chudnovsky, Micha{\\l} Pilipczuk, St\\'ephan Thomass\\'e","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T09:21:33Z","title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04585","kind":"arxiv","version":4},"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:9a07fb058f5a4e703bf3f845c7cdf305c6b6f60a9bc3441b55328b313f18950d","target":"record","created_at":"2026-07-05T07:12:31Z","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":"78da02614a8f01dfa7437b852294c70b84e5dde700dd785d1ec6de571d31c044","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T09:21:33Z","title_canon_sha256":"bcef7a7e58c0a5ea02748775a11991cfa73a97e941b758c66eb9984efcafe530"},"schema_version":"1.0","source":{"id":"1907.04585","kind":"arxiv","version":4}},"canonical_sha256":"1ef49485a3dc7788be50f7ef8a03c3e915dbc7f5eba3e264d3218d0df48ea7ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ef49485a3dc7788be50f7ef8a03c3e915dbc7f5eba3e264d3218d0df48ea7ea","first_computed_at":"2026-07-05T07:12:31.438071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:31.438071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tg/EuUhLPXCO5op7RfOYiIJld5bQoIhuzVhOo+bGXyDMSURgYn3c4foAH1SH941g+I3cmillh+dcdS1l1HrKDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:31.438446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04585","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a07fb058f5a4e703bf3f845c7cdf305c6b6f60a9bc3441b55328b313f18950d","sha256:672d7f40d38464e5d15eaa6aac507f1418ae82f8895d942c70af1c23344a6956"],"state_sha256":"25eb4a8803baadb6b197908956b5cc418c53bd00c4fd8c059bb3a90b642cc886"}