{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4PSKLEBVGNZKZG5GB3OFQZMZN2","short_pith_number":"pith:4PSKLEBV","schema_version":"1.0","canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","source":{"kind":"arxiv","id":"1707.05491","version":3},"attestation_state":"computed","paper":{"title":"Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2017-07-18T06:34:08Z","abstract_excerpt":"In the classic Maximum Weight Independent Set problem we are given a graph $G$ with a nonnegative weight function on vertices, and the goal is to find an independent set in $G$ of maximum possible weight. While the problem is NP-hard in general, we give a polynomial-time algorithm working on any $P_6$-free graph, that is, a graph that has no path on $6$ vertices as an induced subgraph. This improves the polynomial-time algorithm on $P_5$-free graphs of Lokshtanov et al. (SODA 2014), and the quasipolynomial-time algorithm on $P_6$-free graphs of Lokshtanov et al (SODA 2016). The main technical "},"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":"1707.05491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T06:34:08Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae5972cf71d4077e3c18e2df3efca835b2a2b43d09916b2bf86335aacc115767","abstract_canon_sha256":"8b30c3fd736609a86616f2d8a3e7bf444e0e3379f79dd89d195c9e20785613ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:49:33.383742Z","signature_b64":"4badV4RWHrgUWBN1b83VAq0YeJBvIhJtwgbNTxc8RlIcQdFQ/lS+xpjH7Sgh45bqujnytoJAm7EV0A+WX90sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","last_reissued_at":"2026-07-05T00:49:33.383383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:49:33.383383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2017-07-18T06:34:08Z","abstract_excerpt":"In the classic Maximum Weight Independent Set problem we are given a graph $G$ with a nonnegative weight function on vertices, and the goal is to find an independent set in $G$ of maximum possible weight. While the problem is NP-hard in general, we give a polynomial-time algorithm working on any $P_6$-free graph, that is, a graph that has no path on $6$ vertices as an induced subgraph. This improves the polynomial-time algorithm on $P_5$-free graphs of Lokshtanov et al. (SODA 2014), and the quasipolynomial-time algorithm on $P_6$-free graphs of Lokshtanov et al (SODA 2016). The main technical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05491","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1707.05491/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":"1707.05491","created_at":"2026-07-05T00:49:33.383436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05491v3","created_at":"2026-07-05T00:49:33.383436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05491","created_at":"2026-07-05T00:49:33.383436+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PSKLEBVGNZK","created_at":"2026-07-05T00:49:33.383436+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PSKLEBVGNZKZG5G","created_at":"2026-07-05T00:49:33.383436+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PSKLEBV","created_at":"2026-07-05T00:49:33.383436+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/4PSKLEBVGNZKZG5GB3OFQZMZN2","json":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2.json","graph_json":"https://pith.science/api/pith-number/4PSKLEBVGNZKZG5GB3OFQZMZN2/graph.json","events_json":"https://pith.science/api/pith-number/4PSKLEBVGNZKZG5GB3OFQZMZN2/events.json","paper":"https://pith.science/paper/4PSKLEBV"},"agent_actions":{"view_html":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2","download_json":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2.json","view_paper":"https://pith.science/paper/4PSKLEBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05491&json=true","fetch_graph":"https://pith.science/api/pith-number/4PSKLEBVGNZKZG5GB3OFQZMZN2/graph.json","fetch_events":"https://pith.science/api/pith-number/4PSKLEBVGNZKZG5GB3OFQZMZN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/action/storage_attestation","attest_author":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/action/author_attestation","sign_citation":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/action/citation_signature","submit_replication":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/action/replication_record"}},"created_at":"2026-07-05T00:49:33.383436+00:00","updated_at":"2026-07-05T00:49:33.383436+00:00"}