{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JJOZFBP2QTOMNX4PVZLUHSEMHH","short_pith_number":"pith:JJOZFBP2","schema_version":"1.0","canonical_sha256":"4a5d9285fa84dcc6df8fae5743c88c39f85d5e12b90e6796422c499c6dfd3bec","source":{"kind":"arxiv","id":"1206.4257","version":1},"attestation_state":"computed","paper":{"title":"Three Proofs of the Hypergraph Ramsey Theorem (An exposition)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andy Parrish, Sandow Sinai, William Gasarch","submitted_at":"2012-06-19T16:33:13Z","abstract_excerpt":"Ramsey, Erdos-Rado, and Conlon-Fox-Sudakov have given proofs of the 3-hypergraph Ramsey Theorem with better and better upper bounds on the 3-hypergraph Ramsey Number. Ramsey and Erdos-Rado also prove the a-hypergraph Ramsey Theorem. Conlon-Fox-Sudakov note that their upper bounds on the 3-hypergraph Ramsey Numbers, together with a recurrence of Erdos-Rado (which was the key to the Erdos-Rado proof), yield improved bounds on the a-hypergraph Ramsey numbers. We present all of these proofs and state explicit bounds for the 2-color case and the c-color case. We give a more detailed analysis of the"},"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":"1206.4257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-19T16:33:13Z","cross_cats_sorted":[],"title_canon_sha256":"3d1986b280b8befebc91c4c03d6060478ecd2b89d784f61c98f691147f6458f6","abstract_canon_sha256":"41f71a7005d709fe9616d9ee24aa41c29e545e904998e7e3f2ec594ebedd2dbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:07.602212Z","signature_b64":"pKP5cTS/GutpKtyLNVRCxJGG1TLfuPzL54EJU0EoQBVVZ8HhT4TWJ/iVptCJPmAYCAjry8WTb7TDiOUTL3qaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5d9285fa84dcc6df8fae5743c88c39f85d5e12b90e6796422c499c6dfd3bec","last_reissued_at":"2026-05-18T03:53:07.601398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:07.601398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three Proofs of the Hypergraph Ramsey Theorem (An exposition)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andy Parrish, Sandow Sinai, William Gasarch","submitted_at":"2012-06-19T16:33:13Z","abstract_excerpt":"Ramsey, Erdos-Rado, and Conlon-Fox-Sudakov have given proofs of the 3-hypergraph Ramsey Theorem with better and better upper bounds on the 3-hypergraph Ramsey Number. Ramsey and Erdos-Rado also prove the a-hypergraph Ramsey Theorem. Conlon-Fox-Sudakov note that their upper bounds on the 3-hypergraph Ramsey Numbers, together with a recurrence of Erdos-Rado (which was the key to the Erdos-Rado proof), yield improved bounds on the a-hypergraph Ramsey numbers. We present all of these proofs and state explicit bounds for the 2-color case and the c-color case. We give a more detailed analysis of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4257","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":""},"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":"1206.4257","created_at":"2026-05-18T03:53:07.601544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4257v1","created_at":"2026-05-18T03:53:07.601544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4257","created_at":"2026-05-18T03:53:07.601544+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJOZFBP2QTOM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJOZFBP2QTOMNX4P","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJOZFBP2","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16607","citing_title":"Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH","json":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH.json","graph_json":"https://pith.science/api/pith-number/JJOZFBP2QTOMNX4PVZLUHSEMHH/graph.json","events_json":"https://pith.science/api/pith-number/JJOZFBP2QTOMNX4PVZLUHSEMHH/events.json","paper":"https://pith.science/paper/JJOZFBP2"},"agent_actions":{"view_html":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH","download_json":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH.json","view_paper":"https://pith.science/paper/JJOZFBP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4257&json=true","fetch_graph":"https://pith.science/api/pith-number/JJOZFBP2QTOMNX4PVZLUHSEMHH/graph.json","fetch_events":"https://pith.science/api/pith-number/JJOZFBP2QTOMNX4PVZLUHSEMHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH/action/storage_attestation","attest_author":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH/action/author_attestation","sign_citation":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH/action/citation_signature","submit_replication":"https://pith.science/pith/JJOZFBP2QTOMNX4PVZLUHSEMHH/action/replication_record"}},"created_at":"2026-05-18T03:53:07.601544+00:00","updated_at":"2026-05-18T03:53:07.601544+00:00"}