{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VRGMVVDM2VOW6HMGTXBODL5I4I","short_pith_number":"pith:VRGMVVDM","schema_version":"1.0","canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","source":{"kind":"arxiv","id":"2411.19173","version":2},"attestation_state":"computed","paper":{"title":"Long induced paths in $K_{s, s}$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","submitted_at":"2024-11-28T14:24:13Z","abstract_excerpt":"More than 40 years ago, Galvin, Rival and Sands showed that every $K_{s, s}$-free graph containing an $n$-vertex path must contain an induced path of length $f(n)$, where $f(n)\\to \\infty$ as $n\\to \\infty$. Recently, it was shown by Duron, Esperet and Raymond that one can take $f(n)=(\\log \\log n)^{1/5-o(1)}$. In this note, we give a short self-contained proof that a $K_{s, s}$-free graphs with an $n$-vertex path contains an induced path of length at least $(\\log \\log n)^{1-o(1)}$. Combined with the recent remarkable example of Cou\\\"etoux, Defrain, and Raymond, which provides an upper bound of $"},"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":"2411.19173","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T14:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"ba775df8837be5b921f614600fdf5cd4f25037cd0ea38c4512f77e9697fdc74e","abstract_canon_sha256":"b17319aec3ab4c49c15a04842a4a51c091ff18e685dc9a59867dec3480f06c4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:38.090654Z","signature_b64":"oKlbwa/x4k2Gdmf+Im924CuXdKdp0gLMAw5wUzgq8GDCGk/FQl4ZKnlK+5q8NChvX9ZXFkPfUkvdSAsoX7VwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac4ccad46cd55d6f1d869dc2e1afa8e2046d6fe2da7b67676a07d7ddfd62f454","last_reissued_at":"2026-07-05T12:02:38.090135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:38.090135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long induced paths in $K_{s, s}$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","submitted_at":"2024-11-28T14:24:13Z","abstract_excerpt":"More than 40 years ago, Galvin, Rival and Sands showed that every $K_{s, s}$-free graph containing an $n$-vertex path must contain an induced path of length $f(n)$, where $f(n)\\to \\infty$ as $n\\to \\infty$. Recently, it was shown by Duron, Esperet and Raymond that one can take $f(n)=(\\log \\log n)^{1/5-o(1)}$. In this note, we give a short self-contained proof that a $K_{s, s}$-free graphs with an $n$-vertex path contains an induced path of length at least $(\\log \\log n)^{1-o(1)}$. Combined with the recent remarkable example of Cou\\\"etoux, Defrain, and Raymond, which provides an upper bound of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19173","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/2411.19173/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":"2411.19173","created_at":"2026-07-05T12:02:38.090193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19173v2","created_at":"2026-07-05T12:02:38.090193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19173","created_at":"2026-07-05T12:02:38.090193+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRGMVVDM2VOW","created_at":"2026-07-05T12:02:38.090193+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRGMVVDM2VOW6HMG","created_at":"2026-07-05T12:02:38.090193+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRGMVVDM","created_at":"2026-07-05T12:02:38.090193+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04166","citing_title":"Graph classes through the lens of logic","ref_index":83,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I","json":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I.json","graph_json":"https://pith.science/api/pith-number/VRGMVVDM2VOW6HMGTXBODL5I4I/graph.json","events_json":"https://pith.science/api/pith-number/VRGMVVDM2VOW6HMGTXBODL5I4I/events.json","paper":"https://pith.science/paper/VRGMVVDM"},"agent_actions":{"view_html":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I","download_json":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I.json","view_paper":"https://pith.science/paper/VRGMVVDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19173&json=true","fetch_graph":"https://pith.science/api/pith-number/VRGMVVDM2VOW6HMGTXBODL5I4I/graph.json","fetch_events":"https://pith.science/api/pith-number/VRGMVVDM2VOW6HMGTXBODL5I4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/action/storage_attestation","attest_author":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/action/author_attestation","sign_citation":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/action/citation_signature","submit_replication":"https://pith.science/pith/VRGMVVDM2VOW6HMGTXBODL5I4I/action/replication_record"}},"created_at":"2026-07-05T12:02:38.090193+00:00","updated_at":"2026-07-05T12:02:38.090193+00:00"}