{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YK2V7WGZWAOVSYTR3C2BAKPB4G","short_pith_number":"pith:YK2V7WGZ","schema_version":"1.0","canonical_sha256":"c2b55fd8d9b01d596271d8b41029e1e1b620d365d982c2e50aeb18788c95e3f6","source":{"kind":"arxiv","id":"2304.09679","version":2},"attestation_state":"computed","paper":{"title":"Sparse graphs without long induced paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Florent Raymond, Oscar Defrain","submitted_at":"2023-04-19T14:13:07Z","abstract_excerpt":"Graphs of bounded degeneracy are known to contain induced paths of order $\\Omega(\\log \\log n)$ when they contain a path of order $n$, as proved by Ne\\v{s}et\\v{r}il and Ossona de Mendez (2012). In 2016 Esperet, Lemoine, and Maffray conjectured that this bound could be improved to $\\Omega((\\log n)^c)$ for some constant $c>0$ depending on the degeneracy. We disprove this conjecture by constructing, for arbitrarily large values of $n$, a graph that is 2-degenerate, has a path of order $n$, and where all induced paths have order $O((\\log \\log n)^2)$. We also show that the graphs we construct have l"},"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":"2304.09679","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-04-19T14:13:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cf63ee6e0d45ebe545f7996971c70b808692df149c1983a1afadebbb4ca74f4e","abstract_canon_sha256":"6634aa84a2f0fbf4f8dfeee4759e88c268982804e52a9c8bb1e99de22b6bc12d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:13.320835Z","signature_b64":"VtAboEovsy7/mR20FPGpn2pbBsq/cUAnbr+3FbvJCuzbfss0q5cqyMGZmcGXMv9pBbRorzNnoKURjKLNuqDUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b55fd8d9b01d596271d8b41029e1e1b620d365d982c2e50aeb18788c95e3f6","last_reissued_at":"2026-07-05T07:26:13.320349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:13.320349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse graphs without long induced paths","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Florent Raymond, Oscar Defrain","submitted_at":"2023-04-19T14:13:07Z","abstract_excerpt":"Graphs of bounded degeneracy are known to contain induced paths of order $\\Omega(\\log \\log n)$ when they contain a path of order $n$, as proved by Ne\\v{s}et\\v{r}il and Ossona de Mendez (2012). In 2016 Esperet, Lemoine, and Maffray conjectured that this bound could be improved to $\\Omega((\\log n)^c)$ for some constant $c>0$ depending on the degeneracy. We disprove this conjecture by constructing, for arbitrarily large values of $n$, a graph that is 2-degenerate, has a path of order $n$, and where all induced paths have order $O((\\log \\log n)^2)$. We also show that the graphs we construct have l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.09679","kind":"arxiv","version":2},"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/2304.09679/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":"2304.09679","created_at":"2026-07-05T07:26:13.320406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.09679v2","created_at":"2026-07-05T07:26:13.320406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.09679","created_at":"2026-07-05T07:26:13.320406+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK2V7WGZWAOV","created_at":"2026-07-05T07:26:13.320406+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK2V7WGZWAOVSYTR","created_at":"2026-07-05T07:26:13.320406+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK2V7WGZ","created_at":"2026-07-05T07:26:13.320406+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/YK2V7WGZWAOVSYTR3C2BAKPB4G","json":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G.json","graph_json":"https://pith.science/api/pith-number/YK2V7WGZWAOVSYTR3C2BAKPB4G/graph.json","events_json":"https://pith.science/api/pith-number/YK2V7WGZWAOVSYTR3C2BAKPB4G/events.json","paper":"https://pith.science/paper/YK2V7WGZ"},"agent_actions":{"view_html":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G","download_json":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G.json","view_paper":"https://pith.science/paper/YK2V7WGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.09679&json=true","fetch_graph":"https://pith.science/api/pith-number/YK2V7WGZWAOVSYTR3C2BAKPB4G/graph.json","fetch_events":"https://pith.science/api/pith-number/YK2V7WGZWAOVSYTR3C2BAKPB4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G/action/storage_attestation","attest_author":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G/action/author_attestation","sign_citation":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G/action/citation_signature","submit_replication":"https://pith.science/pith/YK2V7WGZWAOVSYTR3C2BAKPB4G/action/replication_record"}},"created_at":"2026-07-05T07:26:13.320406+00:00","updated_at":"2026-07-05T07:26:13.320406+00:00"}