{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:54O4PKZUD2J7VPFDHDNAEEDHJE","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":"8d4a551e67a21b4546e37c088385b3b1503e30b19089c2399fbafb8ec7d8d019","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-03-27T11:54:41Z","title_canon_sha256":"e3871aa29812769ddb309aed3c6357aefeeefe6169b6ab5874f1f4de830915ad"},"schema_version":"1.0","source":{"id":"2003.12345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.12345","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"2003.12345v1","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12345","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"54O4PKZUD2J7","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"54O4PKZUD2J7VPFD","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"54O4PKZU","created_at":"2026-07-05T00:50:57Z"}],"graph_snapshots":[{"event_id":"sha256:f9be8d74e82c689eb548c888b3c69e1cf39504d72bca13de398c236660504bc0","target":"graph","created_at":"2026-07-05T00:50:57Z","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/2003.12345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is called $P_t$-free} if it does not contain a $t$-vertex path as an induced subgraph. While $P_4$-free graphs are exactly cographs, the structure of $P_t$-free graphs for $t \\geq 5$ remains little understood. On one hand, classic computational problems such as Maximum Weight Independent Set (MWIS) and $3$-Coloring are not known to be NP-hard on $P_t$-free graphs for any fixed $t$. On the other hand, despite significant effort, polynomial-time algorithms for MWIS in $P_6$-free graphs~[SODA 2019] and $3$-Coloring in $P_7$-free graphs~[Combinatorica 2018] have been found only recently. I","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-03-27T11:54:41Z","title":"Covering minimal separators and potential maximal cliques in $P_t$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12345","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:d4309ad72fe3586866b05bce9b3fe2906b95bf94e7e7abe254f3069a7ec62795","target":"record","created_at":"2026-07-05T00:50:57Z","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":"8d4a551e67a21b4546e37c088385b3b1503e30b19089c2399fbafb8ec7d8d019","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-03-27T11:54:41Z","title_canon_sha256":"e3871aa29812769ddb309aed3c6357aefeeefe6169b6ab5874f1f4de830915ad"},"schema_version":"1.0","source":{"id":"2003.12345","kind":"arxiv","version":1}},"canonical_sha256":"ef1dc7ab341e93fabca338da021067493aa1f4d048f091366834bf959c904eb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef1dc7ab341e93fabca338da021067493aa1f4d048f091366834bf959c904eb4","first_computed_at":"2026-07-05T00:50:57.407463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:57.407463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMh1BXhEPf0pX65LQvPSJeKEpTP5dmu6+FsmBgHS3ZDaPI/g6ui26ykZxtl+70G7U4NPPwz7mK2MteZOTmNoDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:57.407804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.12345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4309ad72fe3586866b05bce9b3fe2906b95bf94e7e7abe254f3069a7ec62795","sha256:f9be8d74e82c689eb548c888b3c69e1cf39504d72bca13de398c236660504bc0"],"state_sha256":"c5d4aedee2336d1260c97131eec5b6cf5eaa558754a576f8a29f324774a2bea9"}