{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FAYJ5MLYPBFQMVLO2ZPVZLXQEF","short_pith_number":"pith:FAYJ5MLY","schema_version":"1.0","canonical_sha256":"28309eb178784b06556ed65f5caef021799cb7c506d001e3cfbf33e6fe526344","source":{"kind":"arxiv","id":"2512.17718","version":2},"attestation_state":"computed","paper":{"title":"Gaussian random graphs and Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Zach Hunter","submitted_at":"2025-12-19T15:52:01Z","abstract_excerpt":"We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction based on Gaussian random graphs, which allows us to simplify their analysis significantly. As a consequence of this simpler analysis, we also obtain better quantitative bounds."},"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":"2512.17718","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-12-19T15:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"a6685b6ce12669b9f294d65a7aa315fafc91d064b57ef4979db39210460d0656","abstract_canon_sha256":"88e09ef2d8c6e371b36574f19f3d7445d3170c1a2abb4dfe737925d19487b1e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:39.449483Z","signature_b64":"7QYsp2Z7QiXQ975nsMlKuuC1oQ9MONgH6ax9xnJcQB+VDG6T2EE3VtAE+kftNFKIxxLxr58tIXBXV26rg/GmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28309eb178784b06556ed65f5caef021799cb7c506d001e3cfbf33e6fe526344","last_reissued_at":"2026-05-20T00:05:39.448699Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:39.448699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian random graphs and Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Zach Hunter","submitted_at":"2025-12-19T15:52:01Z","abstract_excerpt":"We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction based on Gaussian random graphs, which allows us to simplify their analysis significantly. As a consequence of this simpler analysis, we also obtain better quantitative bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.17718","kind":"arxiv","version":2},"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/2512.17718/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":"2512.17718","created_at":"2026-05-20T00:05:39.448839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.17718v2","created_at":"2026-05-20T00:05:39.448839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.17718","created_at":"2026-05-20T00:05:39.448839+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAYJ5MLYPBFQ","created_at":"2026-05-20T00:05:39.448839+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAYJ5MLYPBFQMVLO","created_at":"2026-05-20T00:05:39.448839+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAYJ5MLY","created_at":"2026-05-20T00:05:39.448839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2604.02835","citing_title":"A Note on Generalized Erd\\H{o}s-Rogers Problems","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04105","citing_title":"An improved double-exponential lower bound for $r_4(5,n)$","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23986","citing_title":"A double-exponential lower bound for $r_4(5,n)$","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04105","citing_title":"An improved double-exponential lower bound for $r_4(5,n)$","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF","json":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF.json","graph_json":"https://pith.science/api/pith-number/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/graph.json","events_json":"https://pith.science/api/pith-number/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/events.json","paper":"https://pith.science/paper/FAYJ5MLY"},"agent_actions":{"view_html":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF","download_json":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF.json","view_paper":"https://pith.science/paper/FAYJ5MLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.17718&json=true","fetch_graph":"https://pith.science/api/pith-number/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/graph.json","fetch_events":"https://pith.science/api/pith-number/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/action/storage_attestation","attest_author":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/action/author_attestation","sign_citation":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/action/citation_signature","submit_replication":"https://pith.science/pith/FAYJ5MLYPBFQMVLO2ZPVZLXQEF/action/replication_record"}},"created_at":"2026-05-20T00:05:39.448839+00:00","updated_at":"2026-05-20T00:05:39.448839+00:00"}