{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:744VDYTEIWU4K3BDKFCIEB4TNA","short_pith_number":"pith:744VDYTE","canonical_record":{"source":{"id":"2308.13455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-25T16:02:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3e2a479700f6f85afac1d21ab503aebc5ab27cfd2b0a950d9e5a53d36f5cdef7","abstract_canon_sha256":"712fdd41c93af2053e0bffc858d79e0d26804e40d454e610ebbbfb01c817b5df"},"schema_version":"1.0"},"canonical_sha256":"ff3951e26445a9c56c23514482079368398f380018e3ccbfdbc3612ef0dcf43e","source":{"kind":"arxiv","id":"2308.13455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13455","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13455v1","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13455","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"744VDYTEIWU4","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"744VDYTEIWU4K3BD","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"744VDYTE","created_at":"2026-07-05T06:44:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:744VDYTEIWU4K3BDKFCIEB4TNA","target":"record","payload":{"canonical_record":{"source":{"id":"2308.13455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-25T16:02:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3e2a479700f6f85afac1d21ab503aebc5ab27cfd2b0a950d9e5a53d36f5cdef7","abstract_canon_sha256":"712fdd41c93af2053e0bffc858d79e0d26804e40d454e610ebbbfb01c817b5df"},"schema_version":"1.0"},"canonical_sha256":"ff3951e26445a9c56c23514482079368398f380018e3ccbfdbc3612ef0dcf43e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:44.288348Z","signature_b64":"sVhfj14CK53GUPRh1ML6rqVdTrm/8BjgUXhCCp/jbi5F4iOPQKsmO/n3O9L3RO4KIyhlba9+Meeu+VXMOVsoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff3951e26445a9c56c23514482079368398f380018e3ccbfdbc3612ef0dcf43e","last_reissued_at":"2026-07-05T06:44:44.287825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:44.287825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.13455","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-05T06:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyZsKA+M1CT10x7DvRPfGg8swDeiUC7c9vnmALp3jnpopPZX/B60ibHVp1U5Gdqs38mkiVjMF0i1cq3LSGKeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:41:49.485751Z"},"content_sha256":"80980424996bbe71698f5539ae16f6401515ab8c7bab56db276a5451dfee4e73","schema_version":"1.0","event_id":"sha256:80980424996bbe71698f5539ae16f6401515ab8c7bab56db276a5451dfee4e73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:744VDYTEIWU4K3BDKFCIEB4TNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simonovits's theorem in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen, Wojciech Samotij","submitted_at":"2023-08-25T16:02:56Z","abstract_excerpt":"Let $H$ be a graph with $\\chi(H) = r+1$. Simonovits's theorem states that, if $H$ is edge-critical, the unique largest $H$-free subgraph of $K_n$ is its largest $r$-partite subgraph, provided that $n$ is sufficiently large. We show that the same holds with $K_n$ replaced by the binomial random graph $G_{n,p}$ whenever $H$ is also strictly $2$-balanced and $p \\ge (\\theta_H+o(1)) n^{-\\frac{1}{m_2(H)}} (\\log n)^{\\frac{1}{e_H-1}}$ for some explicit constant $\\theta_H$, which we believe to be optimal. This (partially) resolves a conjecture of DeMarco and Kahn."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13455","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/2308.13455/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-05T06:44:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouPay4rqIzjeWY4B/fkocIAaB3FAh4qpizmWPlii7Tbc+TTE5MaX+w1ERxY9mhWR/t2DqFgwkG9xHRmTY2UgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:41:49.486653Z"},"content_sha256":"89a89a855848bbc140aba11101976df3ac793aeaee7243abb504bdb5c323cd85","schema_version":"1.0","event_id":"sha256:89a89a855848bbc140aba11101976df3ac793aeaee7243abb504bdb5c323cd85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/744VDYTEIWU4K3BDKFCIEB4TNA/bundle.json","state_url":"https://pith.science/pith/744VDYTEIWU4K3BDKFCIEB4TNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/744VDYTEIWU4K3BDKFCIEB4TNA/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-05T15:41:49Z","links":{"resolver":"https://pith.science/pith/744VDYTEIWU4K3BDKFCIEB4TNA","bundle":"https://pith.science/pith/744VDYTEIWU4K3BDKFCIEB4TNA/bundle.json","state":"https://pith.science/pith/744VDYTEIWU4K3BDKFCIEB4TNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/744VDYTEIWU4K3BDKFCIEB4TNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:744VDYTEIWU4K3BDKFCIEB4TNA","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":"712fdd41c93af2053e0bffc858d79e0d26804e40d454e610ebbbfb01c817b5df","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-25T16:02:56Z","title_canon_sha256":"3e2a479700f6f85afac1d21ab503aebc5ab27cfd2b0a950d9e5a53d36f5cdef7"},"schema_version":"1.0","source":{"id":"2308.13455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13455","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13455v1","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13455","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_12","alias_value":"744VDYTEIWU4","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_16","alias_value":"744VDYTEIWU4K3BD","created_at":"2026-07-05T06:44:44Z"},{"alias_kind":"pith_short_8","alias_value":"744VDYTE","created_at":"2026-07-05T06:44:44Z"}],"graph_snapshots":[{"event_id":"sha256:89a89a855848bbc140aba11101976df3ac793aeaee7243abb504bdb5c323cd85","target":"graph","created_at":"2026-07-05T06:44:44Z","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/2308.13455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $H$ be a graph with $\\chi(H) = r+1$. Simonovits's theorem states that, if $H$ is edge-critical, the unique largest $H$-free subgraph of $K_n$ is its largest $r$-partite subgraph, provided that $n$ is sufficiently large. We show that the same holds with $K_n$ replaced by the binomial random graph $G_{n,p}$ whenever $H$ is also strictly $2$-balanced and $p \\ge (\\theta_H+o(1)) n^{-\\frac{1}{m_2(H)}} (\\log n)^{\\frac{1}{e_H-1}}$ for some explicit constant $\\theta_H$, which we believe to be optimal. This (partially) resolves a conjecture of DeMarco and Kahn.","authors_text":"Ilay Hoshen, Wojciech Samotij","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-25T16:02:56Z","title":"Simonovits's theorem in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13455","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:80980424996bbe71698f5539ae16f6401515ab8c7bab56db276a5451dfee4e73","target":"record","created_at":"2026-07-05T06:44:44Z","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":"712fdd41c93af2053e0bffc858d79e0d26804e40d454e610ebbbfb01c817b5df","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-25T16:02:56Z","title_canon_sha256":"3e2a479700f6f85afac1d21ab503aebc5ab27cfd2b0a950d9e5a53d36f5cdef7"},"schema_version":"1.0","source":{"id":"2308.13455","kind":"arxiv","version":1}},"canonical_sha256":"ff3951e26445a9c56c23514482079368398f380018e3ccbfdbc3612ef0dcf43e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff3951e26445a9c56c23514482079368398f380018e3ccbfdbc3612ef0dcf43e","first_computed_at":"2026-07-05T06:44:44.287825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:44:44.287825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVhfj14CK53GUPRh1ML6rqVdTrm/8BjgUXhCCp/jbi5F4iOPQKsmO/n3O9L3RO4KIyhlba9+Meeu+VXMOVsoCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:44:44.288348Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80980424996bbe71698f5539ae16f6401515ab8c7bab56db276a5451dfee4e73","sha256:89a89a855848bbc140aba11101976df3ac793aeaee7243abb504bdb5c323cd85"],"state_sha256":"24138a6ab252807d589498d596aa4d3da3937968bda4556a89a4e5a99a8673df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us+iObOrWKTAt6YYoIrfyWzppMzOCyTJxmY+MgAZ97mbNWlg4ku0jqFtEsbT0yhhEFhwhEIi+9n6F+v0I8B3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:41:49.491365Z","bundle_sha256":"1ffed454a6ed3906ebfed1e673688ea126702dc748e2d9cc932033b25f36b37d"}}