{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WI4YIFQB7FE77VNK4ISNTLHZVO","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":"be3b1ebe78efabdc96e0df33475df6b0ed1e4126a53dff64f42d7ddc6db3a2cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T16:32:17Z","title_canon_sha256":"4e28a9e394d4714698ca80b159f9c2e59691850107af051f668b07212178e809"},"schema_version":"1.0","source":{"id":"1804.04077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04077","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04077v1","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04077","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"WI4YIFQB7FE7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WI4YIFQB7FE77VNK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WI4YIFQB","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:edf69f5ce894f331f4e39e8a9f8ee75636ced3b297c052dfcf12d3f6207d106c","target":"graph","created_at":"2026-05-18T00:18:42Z","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 algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_t$-free graphs, that is, on graphs not containing any induced path on $t$ vertices. So far, polynomial-time algorithms are known only for $t\\le 5$ [Lokshtanov et al., SODA 2014, 570--581, 2014], and an algorithm for $t=6$ announced recently [Grzesik et al. Arxiv 1707.05491, 2017]. Here we study the existence of subexponential-time algorithms for the problem: we show that for any $t\\ge 1$, there is an algorithm for Maximum Independent Set on $P_t$-free graphs whose ru","authors_text":"Daniel Lokshtanov, D\\'aniel Marx, Erik Jan van Leeuwen, G\\'abor Bacs\\'o, Marcin Pilipczuk, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T16:32:17Z","title":"Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04077","kind":"arxiv","version":1},"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:2795bebcb3b3c36f6a02f61b89b62312525852fc08b27e0e5dfc60efde1a8657","target":"record","created_at":"2026-05-18T00:18:42Z","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":"be3b1ebe78efabdc96e0df33475df6b0ed1e4126a53dff64f42d7ddc6db3a2cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T16:32:17Z","title_canon_sha256":"4e28a9e394d4714698ca80b159f9c2e59691850107af051f668b07212178e809"},"schema_version":"1.0","source":{"id":"1804.04077","kind":"arxiv","version":1}},"canonical_sha256":"b239841601f949ffd5aae224d9acf9ab8125c85f9e0361b09a3adadedae45f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b239841601f949ffd5aae224d9acf9ab8125c85f9e0361b09a3adadedae45f56","first_computed_at":"2026-05-18T00:18:42.170447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:42.170447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A5vsYd9R6WF9/fmclVJr+kNhJEo8tr11RYWL/0UWhABV0hOGWmgHkINq5HxaPdzrpim7BQih4flg3t68cnkBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:42.171164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2795bebcb3b3c36f6a02f61b89b62312525852fc08b27e0e5dfc60efde1a8657","sha256:edf69f5ce894f331f4e39e8a9f8ee75636ced3b297c052dfcf12d3f6207d106c"],"state_sha256":"a190d4c4166c05d98c55e25106d2bd9c0768f5693ff1e58dbaf43620877dddce"}