{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4JH5LHF6QLSVFQAO5GSRZEWBQF","short_pith_number":"pith:4JH5LHF6","schema_version":"1.0","canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","source":{"kind":"arxiv","id":"2607.13995","version":1},"attestation_state":"computed","paper":{"title":"Excluding paths and bicliques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Julien Codsi, Maria Chudnovsky, Martin Milani\\v{c}, Matja\\v{z} Krnc","submitted_at":"2026-07-15T16:25:33Z","abstract_excerpt":"Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type result due to Galvin, Rival, and Sands (1982), establishing the existence of a function $f$ bounding the maximum length of a path in terms of clique number $\\omega$. We improve the best known bound on $f$ to a function that is a singly exponential in $\\omega^c$, for some constant $c$, which we show is best possible, up to optimizing $c$.\n  Our approach also has consequences for treedepth. In particular, we show that"},"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":"2607.13995","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T16:25:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"641ca774b27f4d86b62a05aee7077a2da39a41c6c1dea597fbace3fcfd381e3c","abstract_canon_sha256":"b7b7c796fdf7f8f31a94bad93a5416baec6af9b9543f3ce06d3d5117c5a380df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:23:18.529058Z","signature_b64":"yBkRB4chpPfZVTMM93S9gyQi1GHpsoGDwRdsfStpv4emaAfcxXX6hmwX6k2mNdrISWznW1bQ5Ro/eqOhNSEbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e24fd59cbe82e552c00ee9a51c92c1814c273e5430f2447d9d949bf580c4ab0a","last_reissued_at":"2026-07-16T01:23:18.528219Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:23:18.528219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Excluding paths and bicliques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Julien Codsi, Maria Chudnovsky, Martin Milani\\v{c}, Matja\\v{z} Krnc","submitted_at":"2026-07-15T16:25:33Z","abstract_excerpt":"Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type result due to Galvin, Rival, and Sands (1982), establishing the existence of a function $f$ bounding the maximum length of a path in terms of clique number $\\omega$. We improve the best known bound on $f$ to a function that is a singly exponential in $\\omega^c$, for some constant $c$, which we show is best possible, up to optimizing $c$.\n  Our approach also has consequences for treedepth. In particular, we show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13995","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/2607.13995/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":"2607.13995","created_at":"2026-07-16T01:23:18.528654+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13995v1","created_at":"2026-07-16T01:23:18.528654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13995","created_at":"2026-07-16T01:23:18.528654+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JH5LHF6QLSV","created_at":"2026-07-16T01:23:18.528654+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JH5LHF6QLSVFQAO","created_at":"2026-07-16T01:23:18.528654+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JH5LHF6","created_at":"2026-07-16T01:23:18.528654+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/4JH5LHF6QLSVFQAO5GSRZEWBQF","json":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF.json","graph_json":"https://pith.science/api/pith-number/4JH5LHF6QLSVFQAO5GSRZEWBQF/graph.json","events_json":"https://pith.science/api/pith-number/4JH5LHF6QLSVFQAO5GSRZEWBQF/events.json","paper":"https://pith.science/paper/4JH5LHF6"},"agent_actions":{"view_html":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF","download_json":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF.json","view_paper":"https://pith.science/paper/4JH5LHF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13995&json=true","fetch_graph":"https://pith.science/api/pith-number/4JH5LHF6QLSVFQAO5GSRZEWBQF/graph.json","fetch_events":"https://pith.science/api/pith-number/4JH5LHF6QLSVFQAO5GSRZEWBQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/action/storage_attestation","attest_author":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/action/author_attestation","sign_citation":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/action/citation_signature","submit_replication":"https://pith.science/pith/4JH5LHF6QLSVFQAO5GSRZEWBQF/action/replication_record"}},"created_at":"2026-07-16T01:23:18.528654+00:00","updated_at":"2026-07-16T01:23:18.528654+00:00"}