{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YFQSJFA5RZYHBXCJU3Y4QO3WLT","short_pith_number":"pith:YFQSJFA5","schema_version":"1.0","canonical_sha256":"c16124941d8e7070dc49a6f1c83b765ce0639f3cae9291fd29740c7613a6b3f3","source":{"kind":"arxiv","id":"1908.03788","version":1},"attestation_state":"computed","paper":{"title":"Avoidable paths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jocelyn Thiebaut, Marthe Bonamy, Meike Hatzel, Oscar Defrain","submitted_at":"2019-08-10T17:23:53Z","abstract_excerpt":"We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of chordal graphs. The conjecture was only established for k in {1,2} (Ohtsuki et al. 1976, and Beisegel et al. 2019, respectively). Our result also implies a result of Chv\\'atal et al. 2002, which assumed cycle restrictions. We provide a constructive and elementary proof, relying on a single trick regarding the induction hypothesis. In the line of previous works, w"},"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":"1908.03788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-10T17:23:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9882dbc6dbd597814eabac54474f7e4956ab130a658fb50a5b8cddc09979c3c","abstract_canon_sha256":"823f11b580835bbb63642accdd19b3aa0510b07fbc2fdae3fb10676adb4c7915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:18.304145Z","signature_b64":"Ou+b23puYOe689yLi10r+Nbkf1C11J/efP3s3VLDn4SE/ogzxDPlpcgv5yqqqiMKVN2NuX1vqAa33IdxbD7aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c16124941d8e7070dc49a6f1c83b765ce0639f3cae9291fd29740c7613a6b3f3","last_reissued_at":"2026-07-04T23:53:18.303739Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:18.303739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoidable paths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jocelyn Thiebaut, Marthe Bonamy, Meike Hatzel, Oscar Defrain","submitted_at":"2019-08-10T17:23:53Z","abstract_excerpt":"We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of chordal graphs. The conjecture was only established for k in {1,2} (Ohtsuki et al. 1976, and Beisegel et al. 2019, respectively). Our result also implies a result of Chv\\'atal et al. 2002, which assumed cycle restrictions. We provide a constructive and elementary proof, relying on a single trick regarding the induction hypothesis. In the line of previous works, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03788","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/1908.03788/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":"1908.03788","created_at":"2026-07-04T23:53:18.303799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03788v1","created_at":"2026-07-04T23:53:18.303799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03788","created_at":"2026-07-04T23:53:18.303799+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFQSJFA5RZYH","created_at":"2026-07-04T23:53:18.303799+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFQSJFA5RZYHBXCJ","created_at":"2026-07-04T23:53:18.303799+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFQSJFA5","created_at":"2026-07-04T23:53:18.303799+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/YFQSJFA5RZYHBXCJU3Y4QO3WLT","json":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT.json","graph_json":"https://pith.science/api/pith-number/YFQSJFA5RZYHBXCJU3Y4QO3WLT/graph.json","events_json":"https://pith.science/api/pith-number/YFQSJFA5RZYHBXCJU3Y4QO3WLT/events.json","paper":"https://pith.science/paper/YFQSJFA5"},"agent_actions":{"view_html":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT","download_json":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT.json","view_paper":"https://pith.science/paper/YFQSJFA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03788&json=true","fetch_graph":"https://pith.science/api/pith-number/YFQSJFA5RZYHBXCJU3Y4QO3WLT/graph.json","fetch_events":"https://pith.science/api/pith-number/YFQSJFA5RZYHBXCJU3Y4QO3WLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT/action/storage_attestation","attest_author":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT/action/author_attestation","sign_citation":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT/action/citation_signature","submit_replication":"https://pith.science/pith/YFQSJFA5RZYHBXCJU3Y4QO3WLT/action/replication_record"}},"created_at":"2026-07-04T23:53:18.303799+00:00","updated_at":"2026-07-04T23:53:18.303799+00:00"}