{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7SIPZ4B7OTGG26ZATPYNYZAOVG","short_pith_number":"pith:7SIPZ4B7","canonical_record":{"source":{"id":"2407.03121","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-03T14:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"fa7583d4ee55b2e98b9dbd4f12ca06afdba2a167e18dad0cbcce27f89256a8b2","abstract_canon_sha256":"dfacf8e70ebb7058941ea9baedfe8ba3a3719ed808dcc597ab517b7abf1881b8"},"schema_version":"1.0"},"canonical_sha256":"fc90fcf03f74cc6d7b209bf0dc640ea99d9122bfe9712d91fa1c4271efb7fde2","source":{"kind":"arxiv","id":"2407.03121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03121","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03121v1","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03121","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"7SIPZ4B7OTGG","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"7SIPZ4B7OTGG26ZA","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"7SIPZ4B7","created_at":"2026-07-05T08:39:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7SIPZ4B7OTGG26ZATPYNYZAOVG","target":"record","payload":{"canonical_record":{"source":{"id":"2407.03121","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-03T14:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"fa7583d4ee55b2e98b9dbd4f12ca06afdba2a167e18dad0cbcce27f89256a8b2","abstract_canon_sha256":"dfacf8e70ebb7058941ea9baedfe8ba3a3719ed808dcc597ab517b7abf1881b8"},"schema_version":"1.0"},"canonical_sha256":"fc90fcf03f74cc6d7b209bf0dc640ea99d9122bfe9712d91fa1c4271efb7fde2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:46.639661Z","signature_b64":"P4RTzpp0CVyftmeTsEfeNqlQulXMmjaBg9wOZ932HKBagXoME2X7VW0kp8z9EyeqU+d1HqhzN8q/a/qnWDPLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc90fcf03f74cc6d7b209bf0dc640ea99d9122bfe9712d91fa1c4271efb7fde2","last_reissued_at":"2026-07-05T08:39:46.639188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:46.639188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.03121","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-05T08:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcGCujsnPpQzIFRl9IY+C0ClmfTHlKWuZFvLOWNlpo6yw1sOXyHHQfdANzggpMyypKzU+a+zjL/1Ly8LNnrCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:08:02.633295Z"},"content_sha256":"a25027567f4672f0235474579afb0ce76fd4d12a7db4de8804d493103c23777f","schema_version":"1.0","event_id":"sha256:a25027567f4672f0235474579afb0ce76fd4d12a7db4de8804d493103c23777f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7SIPZ4B7OTGG26ZATPYNYZAOVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Rogers functions for arbitrary pairs of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Jacques Verstraete","submitted_at":"2024-07-03T14:06:04Z","abstract_excerpt":"Let $f_{F,G}(n)$ be the largest size of an induced $F$-free subgraph that every $n$-vertex $G$-free graph is guaranteed to contain. We prove that for any triangle-free graph $F$, \\[ f_{F,K_3}(n) = f_{K_2,K_3}(n)^{1 + o(1)} = n^{\\frac{1}{2} + o(1)}.\\] Along the way we give a slight improvement of a construction of Erd\\H os-Frankl-R\\\"odl for the Brown-Erd\\H os-S\\'os $(3r-3,3)$-problem when $r$ is large.\n  In contrast to our result for $K_3$, for any $K_4$-free graph $F$ containing a cycle, we prove there exists $c_F > 0$ such that $$f_{F,K_4}(n) > f_{K_2,K_4}(n)^{1 + c_F} = n^{\\frac{1}{3}+c_F+o("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03121","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/2407.03121/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-05T08:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CrSE44i+A78WpKPeQt/uj/9oQqVB6HexqsZoDYNmyHBFwckoS2n3o6tB3NFsMnbGaeRbez8ZycVKVrcFHx2LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:08:02.633823Z"},"content_sha256":"02e501de5e7f20b234717de0a0b613c8284926c9d8911b694b7d39f22798c42b","schema_version":"1.0","event_id":"sha256:02e501de5e7f20b234717de0a0b613c8284926c9d8911b694b7d39f22798c42b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/bundle.json","state_url":"https://pith.science/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/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-04T17:08:02Z","links":{"resolver":"https://pith.science/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG","bundle":"https://pith.science/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/bundle.json","state":"https://pith.science/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SIPZ4B7OTGG26ZATPYNYZAOVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7SIPZ4B7OTGG26ZATPYNYZAOVG","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":"dfacf8e70ebb7058941ea9baedfe8ba3a3719ed808dcc597ab517b7abf1881b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-03T14:06:04Z","title_canon_sha256":"fa7583d4ee55b2e98b9dbd4f12ca06afdba2a167e18dad0cbcce27f89256a8b2"},"schema_version":"1.0","source":{"id":"2407.03121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.03121","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2407.03121v1","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.03121","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"7SIPZ4B7OTGG","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"7SIPZ4B7OTGG26ZA","created_at":"2026-07-05T08:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"7SIPZ4B7","created_at":"2026-07-05T08:39:46Z"}],"graph_snapshots":[{"event_id":"sha256:02e501de5e7f20b234717de0a0b613c8284926c9d8911b694b7d39f22798c42b","target":"graph","created_at":"2026-07-05T08:39:46Z","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/2407.03121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f_{F,G}(n)$ be the largest size of an induced $F$-free subgraph that every $n$-vertex $G$-free graph is guaranteed to contain. We prove that for any triangle-free graph $F$, \\[ f_{F,K_3}(n) = f_{K_2,K_3}(n)^{1 + o(1)} = n^{\\frac{1}{2} + o(1)}.\\] Along the way we give a slight improvement of a construction of Erd\\H os-Frankl-R\\\"odl for the Brown-Erd\\H os-S\\'os $(3r-3,3)$-problem when $r$ is large.\n  In contrast to our result for $K_3$, for any $K_4$-free graph $F$ containing a cycle, we prove there exists $c_F > 0$ such that $$f_{F,K_4}(n) > f_{K_2,K_4}(n)^{1 + c_F} = n^{\\frac{1}{3}+c_F+o(","authors_text":"Dhruv Mubayi, Jacques Verstraete","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-03T14:06:04Z","title":"Erd\\H{o}s-Rogers functions for arbitrary pairs of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.03121","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:a25027567f4672f0235474579afb0ce76fd4d12a7db4de8804d493103c23777f","target":"record","created_at":"2026-07-05T08:39:46Z","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":"dfacf8e70ebb7058941ea9baedfe8ba3a3719ed808dcc597ab517b7abf1881b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-03T14:06:04Z","title_canon_sha256":"fa7583d4ee55b2e98b9dbd4f12ca06afdba2a167e18dad0cbcce27f89256a8b2"},"schema_version":"1.0","source":{"id":"2407.03121","kind":"arxiv","version":1}},"canonical_sha256":"fc90fcf03f74cc6d7b209bf0dc640ea99d9122bfe9712d91fa1c4271efb7fde2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc90fcf03f74cc6d7b209bf0dc640ea99d9122bfe9712d91fa1c4271efb7fde2","first_computed_at":"2026-07-05T08:39:46.639188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:46.639188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4RTzpp0CVyftmeTsEfeNqlQulXMmjaBg9wOZ932HKBagXoME2X7VW0kp8z9EyeqU+d1HqhzN8q/a/qnWDPLDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:46.639661Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.03121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a25027567f4672f0235474579afb0ce76fd4d12a7db4de8804d493103c23777f","sha256:02e501de5e7f20b234717de0a0b613c8284926c9d8911b694b7d39f22798c42b"],"state_sha256":"3a810449692c7ddf02bf4c8deb512a765bf917081c7bf079cbc6f5ae602f28a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FR5lCdr5er1EcRSNa1KelMh23ShJ8SXcLpfBDN+XocX3JgmPBJNDMAhCyKzaW3ZIQadnXAAsLpFijn4TWNYuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:08:02.639575Z","bundle_sha256":"90bd10aa30fcfd37eb5eceab3e611d70b335f4a217e1af0b7f8519870d54021c"}}