{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P7K3U7S7ACMQM3LPK2UNGC2XCW","short_pith_number":"pith:P7K3U7S7","schema_version":"1.0","canonical_sha256":"7fd5ba7e5f0099066d6f56a8d30b5715b15417e13f4cd6ee761c12aec1de15da","source":{"kind":"arxiv","id":"1304.6910","version":2},"attestation_state":"computed","paper":{"title":"Graham's Number is Less Than 2^^^6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Mackey, Mikhail Lavrov, Mitchell Lee","submitted_at":"2013-04-25T13:50:35Z","abstract_excerpt":"In [5] Graham and Rothschild consider a geometric Ramsey problem: finding the least n such that if all edges of the complete graph on the points {+1,-1}^n are 2-colored, there exist 4 coplanar points such that the 6 edges between them are monochromatic. They give an explicit upper bound: F(F(F(F(F(F(F(12))))))), where F(m) = 2^^(m)^^3, an extremely fast-growing function. By reducing the problem to a variant of the Hales-Jewett problem, we find an upper bound which is between F(4) and F(5)."},"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":"1304.6910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"1e52cc9512379c9076b722627db79fbb5e852933fb103e13c8c2ccddf0f1aa02","abstract_canon_sha256":"9e2240c8555b4f573b3332647cae99e9b4cdc0d7dc5de487427780a50193b72f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:05.906536Z","signature_b64":"/pJMOCBEQ3G0Q0qvsN3Z8OfvdoKuFrLxnPKypGu23hWw7wJYjl4gELg+a0I2kKrlJ0gTcIH0VI0bGogUNk/5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd5ba7e5f0099066d6f56a8d30b5715b15417e13f4cd6ee761c12aec1de15da","last_reissued_at":"2026-05-18T03:15:05.905657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:05.905657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graham's Number is Less Than 2^^^6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Mackey, Mikhail Lavrov, Mitchell Lee","submitted_at":"2013-04-25T13:50:35Z","abstract_excerpt":"In [5] Graham and Rothschild consider a geometric Ramsey problem: finding the least n such that if all edges of the complete graph on the points {+1,-1}^n are 2-colored, there exist 4 coplanar points such that the 6 edges between them are monochromatic. They give an explicit upper bound: F(F(F(F(F(F(F(12))))))), where F(m) = 2^^(m)^^3, an extremely fast-growing function. By reducing the problem to a variant of the Hales-Jewett problem, we find an upper bound which is between F(4) and F(5)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6910","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":""},"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":"1304.6910","created_at":"2026-05-18T03:15:05.905797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6910v2","created_at":"2026-05-18T03:15:05.905797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6910","created_at":"2026-05-18T03:15:05.905797+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7K3U7S7ACMQ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7K3U7S7ACMQM3LP","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7K3U7S7","created_at":"2026-05-18T12:27:54.935989+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/P7K3U7S7ACMQM3LPK2UNGC2XCW","json":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW.json","graph_json":"https://pith.science/api/pith-number/P7K3U7S7ACMQM3LPK2UNGC2XCW/graph.json","events_json":"https://pith.science/api/pith-number/P7K3U7S7ACMQM3LPK2UNGC2XCW/events.json","paper":"https://pith.science/paper/P7K3U7S7"},"agent_actions":{"view_html":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW","download_json":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW.json","view_paper":"https://pith.science/paper/P7K3U7S7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6910&json=true","fetch_graph":"https://pith.science/api/pith-number/P7K3U7S7ACMQM3LPK2UNGC2XCW/graph.json","fetch_events":"https://pith.science/api/pith-number/P7K3U7S7ACMQM3LPK2UNGC2XCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW/action/storage_attestation","attest_author":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW/action/author_attestation","sign_citation":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW/action/citation_signature","submit_replication":"https://pith.science/pith/P7K3U7S7ACMQM3LPK2UNGC2XCW/action/replication_record"}},"created_at":"2026-05-18T03:15:05.905797+00:00","updated_at":"2026-05-18T03:15:05.905797+00:00"}