{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IJQOAP6XVEPZH3TN7W7UZSHU4J","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":"e08391cf3ac11ec1882fd3a3880655a4dcd95f9fb987ac5d109ea3dc460e26b2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-19T13:27:25Z","title_canon_sha256":"2fb6880987755fab2f815b4bbe06bf307877eb3287e427c820332cbaf7b0e47f"},"schema_version":"1.0","source":{"id":"2412.14836","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14836","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14836v4","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14836","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"IJQOAP6XVEPZ","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"IJQOAP6XVEPZH3TN","created_at":"2026-05-20T00:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"IJQOAP6X","created_at":"2026-05-20T00:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:2349b0319029594515f80f0cf0c8aabf6a506c8a2c177fb165f107e0d6ad0c44","target":"graph","created_at":"2026-05-20T00:04:07Z","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/2412.14836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many natural computational problems, including e.g. Max Weight Independent Set, Feedback Vertex Set, or Vertex Planarization, can be unified under an umbrella of finding the largest sparse induced subgraph, that satisfies some property definable in CMSO$_2$ logic.\n  It is believed that each problem expressible with this formalism can be solved in polynomial time in graphs that exclude a fixed path as an induced subgraph.\n  This belief is supported by the existence of a quasipolynomial-time algorithm by Gartland, Lokshtanov, Pilipczuk, Pilipczuk, and Rz\\k{a}\\.zewski [STOC 2021], and a recent po","authors_text":"Jadwiga Czy\\.zewska, Kacper Kluk, Marcin Pilipczuk, Maria Chudnovsky, Pawe{\\l} Rz\\k{a}\\.zewski","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-19T13:27:25Z","title":"Sparse induced subgraphs in $P_7$-free graphs of bounded clique number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14836","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:d80715b4cdf104c59eaf6544bea644bba0b64b1f596cd0f1cf5d9faf3f1eee21","target":"record","created_at":"2026-05-20T00:04:07Z","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":"e08391cf3ac11ec1882fd3a3880655a4dcd95f9fb987ac5d109ea3dc460e26b2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-19T13:27:25Z","title_canon_sha256":"2fb6880987755fab2f815b4bbe06bf307877eb3287e427c820332cbaf7b0e47f"},"schema_version":"1.0","source":{"id":"2412.14836","kind":"arxiv","version":4}},"canonical_sha256":"4260e03fd7a91f93ee6dfdbf4cc8f4e27ec48999182c8be62117fb770b665fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4260e03fd7a91f93ee6dfdbf4cc8f4e27ec48999182c8be62117fb770b665fc1","first_computed_at":"2026-05-20T00:04:07.130937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:07.130937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1lNmKk34jOQc0NhxAJNMXfXqX1wGlXE71PgTDgH+qsUmyeNX9/cYIUersnnugN1qb239jUy+1ujElNeq324Cg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:07.131465Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.14836","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80715b4cdf104c59eaf6544bea644bba0b64b1f596cd0f1cf5d9faf3f1eee21","sha256:2349b0319029594515f80f0cf0c8aabf6a506c8a2c177fb165f107e0d6ad0c44"],"state_sha256":"5abb8b88494c856dddfa05ce48695d6ad38ceec05383c9542d2a9d849698984c"}