{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OONMUWPXCVNLFSDNA7P6NASG2W","short_pith_number":"pith:OONMUWPX","schema_version":"1.0","canonical_sha256":"739aca59f7155ab2c86d07dfe68246d5969c54233b3152c7f3e4c70f39f88efe","source":{"kind":"arxiv","id":"1306.0461","version":1},"attestation_state":"computed","paper":{"title":"The Ramsey number of the clique and the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Saxton, Gonzalo Fiz Pontiveros, Jozef Skokan, Robert Morris, Simon Griffiths","submitted_at":"2013-06-03T15:37:09Z","abstract_excerpt":"The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering a question of Burr and Erd\\H{o}s from 1983, and improving on recent results of Conlon, Fox, Lee and Sudakov, and of the current authors, we show that r(K_s,Q_n) = (s-1) (2^n - 1) + 1 for every s \\in \\N and every sufficiently large n \\in \\N."},"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":"1306.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-03T15:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"50ae867710f7f2c168f47d88ede627b85fff34c5410a8304bc7a488dbdd41633","abstract_canon_sha256":"e8a979f08a1e29da98e7a757d0c7fb964b2d56ca7938c4311132e5a08a32a654"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:29.771765Z","signature_b64":"bMLMA3SrqJnvgV/k6wNy6umbhBSaTcNOFNEqGiGpWtLAFvhmdCQp3pl6t2NDHLqHH5tC40RxyEF1ZyFHWgL5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739aca59f7155ab2c86d07dfe68246d5969c54233b3152c7f3e4c70f39f88efe","last_reissued_at":"2026-05-18T00:44:29.771255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:29.771255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Ramsey number of the clique and the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Saxton, Gonzalo Fiz Pontiveros, Jozef Skokan, Robert Morris, Simon Griffiths","submitted_at":"2013-06-03T15:37:09Z","abstract_excerpt":"The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering a question of Burr and Erd\\H{o}s from 1983, and improving on recent results of Conlon, Fox, Lee and Sudakov, and of the current authors, we show that r(K_s,Q_n) = (s-1) (2^n - 1) + 1 for every s \\in \\N and every sufficiently large n \\in \\N."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0461","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":"1306.0461","created_at":"2026-05-18T00:44:29.771349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0461v1","created_at":"2026-05-18T00:44:29.771349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0461","created_at":"2026-05-18T00:44:29.771349+00:00"},{"alias_kind":"pith_short_12","alias_value":"OONMUWPXCVNL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OONMUWPXCVNLFSDN","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OONMUWPX","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/OONMUWPXCVNLFSDNA7P6NASG2W","json":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W.json","graph_json":"https://pith.science/api/pith-number/OONMUWPXCVNLFSDNA7P6NASG2W/graph.json","events_json":"https://pith.science/api/pith-number/OONMUWPXCVNLFSDNA7P6NASG2W/events.json","paper":"https://pith.science/paper/OONMUWPX"},"agent_actions":{"view_html":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W","download_json":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W.json","view_paper":"https://pith.science/paper/OONMUWPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0461&json=true","fetch_graph":"https://pith.science/api/pith-number/OONMUWPXCVNLFSDNA7P6NASG2W/graph.json","fetch_events":"https://pith.science/api/pith-number/OONMUWPXCVNLFSDNA7P6NASG2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W/action/storage_attestation","attest_author":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W/action/author_attestation","sign_citation":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W/action/citation_signature","submit_replication":"https://pith.science/pith/OONMUWPXCVNLFSDNA7P6NASG2W/action/replication_record"}},"created_at":"2026-05-18T00:44:29.771349+00:00","updated_at":"2026-05-18T00:44:29.771349+00:00"}