{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:565IYPRA6JFUG25XB7XXDKWJ6R","short_pith_number":"pith:565IYPRA","schema_version":"1.0","canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","source":{"kind":"arxiv","id":"2607.16118","version":1},"attestation_state":"computed","paper":{"title":"On the Erd\\H{o}s-Rogers function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacques Verstra\\\"ete, Julian Sahasrabudhe, Robert Morris","submitted_at":"2026-07-17T16:56:28Z","abstract_excerpt":"We show that the Erd\\H{o}s-Rogers function $f_{s,s+1}(n)$ satisfies $$f_{s,s+1}(n) = \\Theta( \\sqrt{n \\log n} )$$ for every $s \\ge 2$. More precisely, we construct a $K_{s+1}$-free graph on $n$ vertices in which every set of at least $C(s)\\sqrt{n \\log n}$ vertices contains a copy of $K_s$ for some constant $C(s)$, which implies the upper bound. The matching lower bound follows from a theorem of Joret, Micek, Reed and Smid on the clique chromatic number of a graph."},"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.16118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"4c7d93fa366f6b39772a2b6d067cd5f908f64499ff4be6d88f6d2ab91a5d1f1b","abstract_canon_sha256":"3b8585e32efcbb7c529d28bca47c3d31b08bdf4844822d2c1702e1a41aac08ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T02:19:34.381836Z","signature_b64":"Dei7kylFDp3K2QVKpcNnjWE8HvSOE9LmpKtUHlLCGeBBCO57ECC7qMsJYf+8qvOfaTrxfL+xHTtVfykh5EQ0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","last_reissued_at":"2026-07-20T02:19:34.380981Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T02:19:34.380981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Erd\\H{o}s-Rogers function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacques Verstra\\\"ete, Julian Sahasrabudhe, Robert Morris","submitted_at":"2026-07-17T16:56:28Z","abstract_excerpt":"We show that the Erd\\H{o}s-Rogers function $f_{s,s+1}(n)$ satisfies $$f_{s,s+1}(n) = \\Theta( \\sqrt{n \\log n} )$$ for every $s \\ge 2$. More precisely, we construct a $K_{s+1}$-free graph on $n$ vertices in which every set of at least $C(s)\\sqrt{n \\log n}$ vertices contains a copy of $K_s$ for some constant $C(s)$, which implies the upper bound. The matching lower bound follows from a theorem of Joret, Micek, Reed and Smid on the clique chromatic number of a graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16118","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.16118/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.16118","created_at":"2026-07-20T02:19:34.381425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16118v1","created_at":"2026-07-20T02:19:34.381425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16118","created_at":"2026-07-20T02:19:34.381425+00:00"},{"alias_kind":"pith_short_12","alias_value":"565IYPRA6JFU","created_at":"2026-07-20T02:19:34.381425+00:00"},{"alias_kind":"pith_short_16","alias_value":"565IYPRA6JFUG25X","created_at":"2026-07-20T02:19:34.381425+00:00"},{"alias_kind":"pith_short_8","alias_value":"565IYPRA","created_at":"2026-07-20T02:19:34.381425+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/565IYPRA6JFUG25XB7XXDKWJ6R","json":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R.json","graph_json":"https://pith.science/api/pith-number/565IYPRA6JFUG25XB7XXDKWJ6R/graph.json","events_json":"https://pith.science/api/pith-number/565IYPRA6JFUG25XB7XXDKWJ6R/events.json","paper":"https://pith.science/paper/565IYPRA"},"agent_actions":{"view_html":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R","download_json":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R.json","view_paper":"https://pith.science/paper/565IYPRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16118&json=true","fetch_graph":"https://pith.science/api/pith-number/565IYPRA6JFUG25XB7XXDKWJ6R/graph.json","fetch_events":"https://pith.science/api/pith-number/565IYPRA6JFUG25XB7XXDKWJ6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/action/storage_attestation","attest_author":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/action/author_attestation","sign_citation":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/action/citation_signature","submit_replication":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/action/replication_record"}},"created_at":"2026-07-20T02:19:34.381425+00:00","updated_at":"2026-07-20T02:19:34.381425+00:00"}