{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GKLSALP3DO2BXKV2VNTCL7BXVQ","short_pith_number":"pith:GKLSALP3","schema_version":"1.0","canonical_sha256":"3297202dfb1bb41baabaab6625fc37ac18a4687c3f35fcc95b6ac9493ac0b8b0","source":{"kind":"arxiv","id":"2307.16611","version":1},"attestation_state":"computed","paper":{"title":"On the Kohayakawa-Kreuter conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson","submitted_at":"2023-07-31T12:38:29Z","abstract_excerpt":"Let us say that a graph $G$ is Ramsey for a tuple $(H_1,\\dots,H_r)$ of graphs if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i \\in [r]$. A famous conjecture of Kohayakawa and Kreuter, extending seminal work of R\\\"odl and Ruci\\'nski, predicts the threshold at which the binomial random graph $G_{n,p}$ becomes Ramsey for $(H_1,\\dots,H_r)$ asymptotically almost surely. In this paper, we resolve the Kohayakawa-Kreuter conjecture for almost all tuples of graphs. Moreover, we reduce its validity to the truth of a certain deterministic statemen"},"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":"2307.16611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-31T12:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"0db046b8fea3c320378137bc1a42e58500ef1c4fc58602e21cff3041bbba6032","abstract_canon_sha256":"6f9f5c59d0ddf5ca47892eab619843362acf8d362e90c7b1adb1e0b3a8e8cc82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:05.825724Z","signature_b64":"66MmEuTKTqq99yT0mH0K7j0tRjMQibd6QkE/Xqqn2qXfCi6i5YFPV6dW+RA9TRfaOpUEONSD7m/ZRRQMTdPEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3297202dfb1bb41baabaab6625fc37ac18a4687c3f35fcc95b6ac9493ac0b8b0","last_reissued_at":"2026-07-05T06:36:05.825263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:05.825263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Kohayakawa-Kreuter conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson","submitted_at":"2023-07-31T12:38:29Z","abstract_excerpt":"Let us say that a graph $G$ is Ramsey for a tuple $(H_1,\\dots,H_r)$ of graphs if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i \\in [r]$. A famous conjecture of Kohayakawa and Kreuter, extending seminal work of R\\\"odl and Ruci\\'nski, predicts the threshold at which the binomial random graph $G_{n,p}$ becomes Ramsey for $(H_1,\\dots,H_r)$ asymptotically almost surely. In this paper, we resolve the Kohayakawa-Kreuter conjecture for almost all tuples of graphs. Moreover, we reduce its validity to the truth of a certain deterministic statemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16611","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/2307.16611/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":"2307.16611","created_at":"2026-07-05T06:36:05.825330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.16611v1","created_at":"2026-07-05T06:36:05.825330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16611","created_at":"2026-07-05T06:36:05.825330+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKLSALP3DO2B","created_at":"2026-07-05T06:36:05.825330+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKLSALP3DO2BXKV2","created_at":"2026-07-05T06:36:05.825330+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKLSALP3","created_at":"2026-07-05T06:36:05.825330+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/GKLSALP3DO2BXKV2VNTCL7BXVQ","json":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ.json","graph_json":"https://pith.science/api/pith-number/GKLSALP3DO2BXKV2VNTCL7BXVQ/graph.json","events_json":"https://pith.science/api/pith-number/GKLSALP3DO2BXKV2VNTCL7BXVQ/events.json","paper":"https://pith.science/paper/GKLSALP3"},"agent_actions":{"view_html":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ","download_json":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ.json","view_paper":"https://pith.science/paper/GKLSALP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.16611&json=true","fetch_graph":"https://pith.science/api/pith-number/GKLSALP3DO2BXKV2VNTCL7BXVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GKLSALP3DO2BXKV2VNTCL7BXVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ/action/storage_attestation","attest_author":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ/action/author_attestation","sign_citation":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ/action/citation_signature","submit_replication":"https://pith.science/pith/GKLSALP3DO2BXKV2VNTCL7BXVQ/action/replication_record"}},"created_at":"2026-07-05T06:36:05.825330+00:00","updated_at":"2026-07-05T06:36:05.825330+00:00"}