{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:565IYPRA6JFUG25XB7XXDKWJ6R","short_pith_number":"pith:565IYPRA","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"},"canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","source":{"kind":"arxiv","id":"2607.16118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16118","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16118v1","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16118","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"565IYPRA6JFU","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_16","alias_value":"565IYPRA6JFUG25X","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_8","alias_value":"565IYPRA","created_at":"2026-07-20T02:19:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:565IYPRA6JFUG25XB7XXDKWJ6R","target":"record","payload":{"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"},"canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","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"},"source_kind":"arxiv","source_id":"2607.16118","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-20T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkhwtE8+iWWJSjHqnFH1xpmOKbhpxzV40fUSR91tm6URDqJLsXmg7m7kZ5ATcw8JxsDuQtf2dTjeeQ/GFDz/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:05:43.824949Z"},"content_sha256":"22647c758f3caa80a910af9699872d0daaa250d177600ed62c521a76a4394c7a","schema_version":"1.0","event_id":"sha256:22647c758f3caa80a910af9699872d0daaa250d177600ed62c521a76a4394c7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:565IYPRA6JFUG25XB7XXDKWJ6R","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-20T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cN5L6idzcMU30BejL+V18wqNiTG2Px8A5bcqz4LitYy2eWeJzuZZ3N8RJBX0pQSAfAsY8ERtDXF+M6bTS6KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:05:43.825626Z"},"content_sha256":"6a394ea2570fc59dc10a64ff329d4d2e53d72aea9102c0e18111838691892e56","schema_version":"1.0","event_id":"sha256:6a394ea2570fc59dc10a64ff329d4d2e53d72aea9102c0e18111838691892e56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/bundle.json","state_url":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/565IYPRA6JFUG25XB7XXDKWJ6R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T22:05:43Z","links":{"resolver":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R","bundle":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/bundle.json","state":"https://pith.science/pith/565IYPRA6JFUG25XB7XXDKWJ6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/565IYPRA6JFUG25XB7XXDKWJ6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:565IYPRA6JFUG25XB7XXDKWJ6R","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b8585e32efcbb7c529d28bca47c3d31b08bdf4844822d2c1702e1a41aac08ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:56:28Z","title_canon_sha256":"4c7d93fa366f6b39772a2b6d067cd5f908f64499ff4be6d88f6d2ab91a5d1f1b"},"schema_version":"1.0","source":{"id":"2607.16118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16118","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16118v1","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16118","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"565IYPRA6JFU","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_16","alias_value":"565IYPRA6JFUG25X","created_at":"2026-07-20T02:19:34Z"},{"alias_kind":"pith_short_8","alias_value":"565IYPRA","created_at":"2026-07-20T02:19:34Z"}],"graph_snapshots":[{"event_id":"sha256:6a394ea2570fc59dc10a64ff329d4d2e53d72aea9102c0e18111838691892e56","target":"graph","created_at":"2026-07-20T02:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.16118/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jacques Verstra\\\"ete, Julian Sahasrabudhe, Robert Morris","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:56:28Z","title":"On the Erd\\H{o}s-Rogers function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16118","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:22647c758f3caa80a910af9699872d0daaa250d177600ed62c521a76a4394c7a","target":"record","created_at":"2026-07-20T02:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b8585e32efcbb7c529d28bca47c3d31b08bdf4844822d2c1702e1a41aac08ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:56:28Z","title_canon_sha256":"4c7d93fa366f6b39772a2b6d067cd5f908f64499ff4be6d88f6d2ab91a5d1f1b"},"schema_version":"1.0","source":{"id":"2607.16118","kind":"arxiv","version":1}},"canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efba8c3e20f24b436bb70fef71aac9f44e28b45078483f67bb496cdaa5d7ebcf","first_computed_at":"2026-07-20T02:19:34.380981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T02:19:34.380981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dei7kylFDp3K2QVKpcNnjWE8HvSOE9LmpKtUHlLCGeBBCO57ECC7qMsJYf+8qvOfaTrxfL+xHTtVfykh5EQ0Dw==","signature_status":"signed_v1","signed_at":"2026-07-20T02:19:34.381836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.16118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22647c758f3caa80a910af9699872d0daaa250d177600ed62c521a76a4394c7a","sha256:6a394ea2570fc59dc10a64ff329d4d2e53d72aea9102c0e18111838691892e56"],"state_sha256":"7c37420e548ca11ea449f92d15c44df0d17891f26a60ab67092d6f1b782867a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUYVs1wiUM+nEOCiZU+8GGXuSfzKZBIm0Dja25kW8Mia66xpSJskZsqDyszHAg6TA5bMGA5DDeUIR3QaIyPHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:05:43.831023Z","bundle_sha256":"e111dfac7f0167766d888e6d52d5ea3f2ab43d79b3f0168d239917417b5f0205"}}