{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4PSKLEBVGNZKZG5GB3OFQZMZN2","short_pith_number":"pith:4PSKLEBV","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"},"canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","source":{"kind":"arxiv","id":"1707.05491","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05491","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05491v3","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05491","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"4PSKLEBVGNZK","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"4PSKLEBVGNZKZG5G","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"4PSKLEBV","created_at":"2026-07-05T00:49:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4PSKLEBVGNZKZG5GB3OFQZMZN2","target":"record","payload":{"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"},"canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","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"},"source_kind":"arxiv","source_id":"1707.05491","source_version":3,"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-07-05T00:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXxTHtm4ieZY1dAHavN8AuijHIghVlag+oh+IQ+YXczggzNjJCcWzem6pV0myK71KoCFUFhRfBj4SInv64gDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:20:59.618108Z"},"content_sha256":"7edcb2e253885dc39718964f375a9438c02412657f02ec058e39b0a845767f4f","schema_version":"1.0","event_id":"sha256:7edcb2e253885dc39718964f375a9438c02412657f02ec058e39b0a845767f4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4PSKLEBVGNZKZG5GB3OFQZMZN2","target":"graph","payload":{"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"},"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-07-05T00:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlSuxyC/cQF3Qk9yEfY+SNslWDQjZ38XI5YOyaVlfOu21MOYpVP86wpquIqo5w+FDESi2Yq+AI6kcCSYmQwLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T14:20:59.618687Z"},"content_sha256":"1974caa47a8d4b5622d34e055643e372fa05d4110a71b429484c22f5991a1e79","schema_version":"1.0","event_id":"sha256:1974caa47a8d4b5622d34e055643e372fa05d4110a71b429484c22f5991a1e79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/bundle.json","state_url":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/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-08-22T14:20:59Z","links":{"resolver":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2","bundle":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/bundle.json","state":"https://pith.science/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PSKLEBVGNZKZG5GB3OFQZMZN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4PSKLEBVGNZKZG5GB3OFQZMZN2","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":"8b30c3fd736609a86616f2d8a3e7bf444e0e3379f79dd89d195c9e20785613ed","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T06:34:08Z","title_canon_sha256":"ae5972cf71d4077e3c18e2df3efca835b2a2b43d09916b2bf86335aacc115767"},"schema_version":"1.0","source":{"id":"1707.05491","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05491","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05491v3","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05491","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"4PSKLEBVGNZK","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"4PSKLEBVGNZKZG5G","created_at":"2026-07-05T00:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"4PSKLEBV","created_at":"2026-07-05T00:49:33Z"}],"graph_snapshots":[{"event_id":"sha256:1974caa47a8d4b5622d34e055643e372fa05d4110a71b429484c22f5991a1e79","target":"graph","created_at":"2026-07-05T00:49:33Z","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/1707.05491/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T06:34:08Z","title":"Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05491","kind":"arxiv","version":3},"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:7edcb2e253885dc39718964f375a9438c02412657f02ec058e39b0a845767f4f","target":"record","created_at":"2026-07-05T00:49:33Z","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":"8b30c3fd736609a86616f2d8a3e7bf444e0e3379f79dd89d195c9e20785613ed","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T06:34:08Z","title_canon_sha256":"ae5972cf71d4077e3c18e2df3efca835b2a2b43d09916b2bf86335aacc115767"},"schema_version":"1.0","source":{"id":"1707.05491","kind":"arxiv","version":3}},"canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3e4a590353372ac9ba60edc5865996ea67b04275d85906d57710728d746d3c5","first_computed_at":"2026-07-05T00:49:33.383383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:33.383383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4badV4RWHrgUWBN1b83VAq0YeJBvIhJtwgbNTxc8RlIcQdFQ/lS+xpjH7Sgh45bqujnytoJAm7EV0A+WX90sDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:33.383742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05491","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7edcb2e253885dc39718964f375a9438c02412657f02ec058e39b0a845767f4f","sha256:1974caa47a8d4b5622d34e055643e372fa05d4110a71b429484c22f5991a1e79"],"state_sha256":"580d6f535289e6d502eb2128aadf8a767418a0a262611443b092c20c973de652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPKoe+lVHKrd2RzUeDkqCnsxUBU2Y44+OHlTOFnhOtIITKGP5vsPz6o3peJ1UcXPe3e/SH8nOWhDvEGwXJoOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T14:20:59.622656Z","bundle_sha256":"2d8ad92dbba9299d98af7a98b68a2330991a4dbf32eb87a82ed0ef46dbfcb4cf"}}