{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:54O4PKZUD2J7VPFDHDNAEEDHJE","short_pith_number":"pith:54O4PKZU","schema_version":"1.0","canonical_sha256":"ef1dc7ab341e93fabca338da021067493aa1f4d048f091366834bf959c904eb4","source":{"kind":"arxiv","id":"2003.12345","version":1},"attestation_state":"computed","paper":{"title":"Covering minimal separators and potential maximal cliques in $P_t$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2020-03-27T11:54:41Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.12345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-03-27T11:54:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e3871aa29812769ddb309aed3c6357aefeeefe6169b6ab5874f1f4de830915ad","abstract_canon_sha256":"8d4a551e67a21b4546e37c088385b3b1503e30b19089c2399fbafb8ec7d8d019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:57.407804Z","signature_b64":"QMh1BXhEPf0pX65LQvPSJeKEpTP5dmu6+FsmBgHS3ZDaPI/g6ui26ykZxtl+70G7U4NPPwz7mK2MteZOTmNoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1dc7ab341e93fabca338da021067493aa1f4d048f091366834bf959c904eb4","last_reissued_at":"2026-07-05T00:50:57.407463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:57.407463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering minimal separators and potential maximal cliques in $P_t$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrzej Grzesik, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Tereza Klimo\\v{s}ov\\'a","submitted_at":"2020-03-27T11:54:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12345","kind":"arxiv","version":1},"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/2003.12345/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.12345","created_at":"2026-07-05T00:50:57.407512+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.12345v1","created_at":"2026-07-05T00:50:57.407512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12345","created_at":"2026-07-05T00:50:57.407512+00:00"},{"alias_kind":"pith_short_12","alias_value":"54O4PKZUD2J7","created_at":"2026-07-05T00:50:57.407512+00:00"},{"alias_kind":"pith_short_16","alias_value":"54O4PKZUD2J7VPFD","created_at":"2026-07-05T00:50:57.407512+00:00"},{"alias_kind":"pith_short_8","alias_value":"54O4PKZU","created_at":"2026-07-05T00:50:57.407512+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE","json":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE.json","graph_json":"https://pith.science/api/pith-number/54O4PKZUD2J7VPFDHDNAEEDHJE/graph.json","events_json":"https://pith.science/api/pith-number/54O4PKZUD2J7VPFDHDNAEEDHJE/events.json","paper":"https://pith.science/paper/54O4PKZU"},"agent_actions":{"view_html":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE","download_json":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE.json","view_paper":"https://pith.science/paper/54O4PKZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.12345&json=true","fetch_graph":"https://pith.science/api/pith-number/54O4PKZUD2J7VPFDHDNAEEDHJE/graph.json","fetch_events":"https://pith.science/api/pith-number/54O4PKZUD2J7VPFDHDNAEEDHJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE/action/storage_attestation","attest_author":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE/action/author_attestation","sign_citation":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE/action/citation_signature","submit_replication":"https://pith.science/pith/54O4PKZUD2J7VPFDHDNAEEDHJE/action/replication_record"}},"created_at":"2026-07-05T00:50:57.407512+00:00","updated_at":"2026-07-05T00:50:57.407512+00:00"}