{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IJQOAP6XVEPZH3TN7W7UZSHU4J","short_pith_number":"pith:IJQOAP6X","canonical_record":{"source":{"id":"2412.14836","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-19T13:27:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2fb6880987755fab2f815b4bbe06bf307877eb3287e427c820332cbaf7b0e47f","abstract_canon_sha256":"e08391cf3ac11ec1882fd3a3880655a4dcd95f9fb987ac5d109ea3dc460e26b2"},"schema_version":"1.0"},"canonical_sha256":"4260e03fd7a91f93ee6dfdbf4cc8f4e27ec48999182c8be62117fb770b665fc1","source":{"kind":"arxiv","id":"2412.14836","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IJQOAP6XVEPZH3TN7W7UZSHU4J","target":"record","payload":{"canonical_record":{"source":{"id":"2412.14836","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-19T13:27:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2fb6880987755fab2f815b4bbe06bf307877eb3287e427c820332cbaf7b0e47f","abstract_canon_sha256":"e08391cf3ac11ec1882fd3a3880655a4dcd95f9fb987ac5d109ea3dc460e26b2"},"schema_version":"1.0"},"canonical_sha256":"4260e03fd7a91f93ee6dfdbf4cc8f4e27ec48999182c8be62117fb770b665fc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:07.131465Z","signature_b64":"+1lNmKk34jOQc0NhxAJNMXfXqX1wGlXE71PgTDgH+qsUmyeNX9/cYIUersnnugN1qb239jUy+1ujElNeq324Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4260e03fd7a91f93ee6dfdbf4cc8f4e27ec48999182c8be62117fb770b665fc1","last_reissued_at":"2026-05-20T00:04:07.130937Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:07.130937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.14836","source_version":4,"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-05-20T00:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eh7DY6A9q6aSeQhqjxbfnhzWQ4gFqztxTASPDterL2sjCQnhY+3ExT5nczWyPgw/J2+uPSdwLVmNRR9j3qJTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:16:05.923992Z"},"content_sha256":"d80715b4cdf104c59eaf6544bea644bba0b64b1f596cd0f1cf5d9faf3f1eee21","schema_version":"1.0","event_id":"sha256:d80715b4cdf104c59eaf6544bea644bba0b64b1f596cd0f1cf5d9faf3f1eee21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IJQOAP6XVEPZH3TN7W7UZSHU4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse induced subgraphs in $P_7$-free graphs of bounded clique number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Jadwiga Czy\\.zewska, Kacper Kluk, Marcin Pilipczuk, Maria Chudnovsky, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2024-12-19T13:27:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14836","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/2412.14836/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-05-20T00:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+hL3eMHiDynMoK/tP+UT98Lpq8RWhv4FlkBiZPxx8K0zkyyGnR+mlfSI/dPZ/eK8ahghEeFldlRjH1yLmZCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:16:05.924391Z"},"content_sha256":"2349b0319029594515f80f0cf0c8aabf6a506c8a2c177fb165f107e0d6ad0c44","schema_version":"1.0","event_id":"sha256:2349b0319029594515f80f0cf0c8aabf6a506c8a2c177fb165f107e0d6ad0c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/bundle.json","state_url":"https://pith.science/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/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-06-24T11:16:05Z","links":{"resolver":"https://pith.science/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J","bundle":"https://pith.science/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/bundle.json","state":"https://pith.science/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJQOAP6XVEPZH3TN7W7UZSHU4J/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMCuhCu1BIz9WkBs1X0HekKJWDC+vcTNiorVUGSToDiuWTdCVz6AF245eZUc16pzcZ+kzAW0hDhlm89REb0IAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:16:05.926448Z","bundle_sha256":"726795bcb0c1d71a004e9ca7e3d98af6faef04c84664c071e2b8be4b3a04b24b"}}