{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:D32JJBND3R3YRPSQ67XYUA6D5E","short_pith_number":"pith:D32JJBND","schema_version":"1.0","canonical_sha256":"1ef49485a3dc7788be50f7ef8a03c3e915dbc7f5eba3e264d3218d0df48ea7ea","source":{"kind":"arxiv","id":"1907.04585","version":4},"attestation_state":"computed","paper":{"title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Maria Chudnovsky, Micha{\\l} Pilipczuk, St\\'ephan Thomass\\'e","submitted_at":"2019-07-10T09:21:33Z","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 "},"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":"1907.04585","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T09:21:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bcef7a7e58c0a5ea02748775a11991cfa73a97e941b758c66eb9984efcafe530","abstract_canon_sha256":"78da02614a8f01dfa7437b852294c70b84e5dde700dd785d1ec6de571d31c044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:31.438446Z","signature_b64":"tg/EuUhLPXCO5op7RfOYiIJld5bQoIhuzVhOo+bGXyDMSURgYn3c4foAH1SH941g+I3cmillh+dcdS1l1HrKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef49485a3dc7788be50f7ef8a03c3e915dbc7f5eba3e264d3218d0df48ea7ea","last_reissued_at":"2026-07-05T07:12:31.438071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:31.438071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Maria Chudnovsky, Micha{\\l} Pilipczuk, St\\'ephan Thomass\\'e","submitted_at":"2019-07-10T09:21:33Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04585","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.04585/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.04585","created_at":"2026-07-05T07:12:31.438126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04585v4","created_at":"2026-07-05T07:12:31.438126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04585","created_at":"2026-07-05T07:12:31.438126+00:00"},{"alias_kind":"pith_short_12","alias_value":"D32JJBND3R3Y","created_at":"2026-07-05T07:12:31.438126+00:00"},{"alias_kind":"pith_short_16","alias_value":"D32JJBND3R3YRPSQ","created_at":"2026-07-05T07:12:31.438126+00:00"},{"alias_kind":"pith_short_8","alias_value":"D32JJBND","created_at":"2026-07-05T07:12:31.438126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07595","citing_title":"Induced packing treewidth","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E","json":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E.json","graph_json":"https://pith.science/api/pith-number/D32JJBND3R3YRPSQ67XYUA6D5E/graph.json","events_json":"https://pith.science/api/pith-number/D32JJBND3R3YRPSQ67XYUA6D5E/events.json","paper":"https://pith.science/paper/D32JJBND"},"agent_actions":{"view_html":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E","download_json":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E.json","view_paper":"https://pith.science/paper/D32JJBND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04585&json=true","fetch_graph":"https://pith.science/api/pith-number/D32JJBND3R3YRPSQ67XYUA6D5E/graph.json","fetch_events":"https://pith.science/api/pith-number/D32JJBND3R3YRPSQ67XYUA6D5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E/action/storage_attestation","attest_author":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E/action/author_attestation","sign_citation":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E/action/citation_signature","submit_replication":"https://pith.science/pith/D32JJBND3R3YRPSQ67XYUA6D5E/action/replication_record"}},"created_at":"2026-07-05T07:12:31.438126+00:00","updated_at":"2026-07-05T07:12:31.438126+00:00"}