{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K4HGF2SAMFUGWJALSYWRSHTVZY","short_pith_number":"pith:K4HGF2SA","canonical_record":{"source":{"id":"1208.1732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-08T18:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"b0354630f74f6024f07fa51eab41add4dd10314b7960866a0f64c49cb288871a","abstract_canon_sha256":"b8125735ef60c00eab18ca8008773d10b03a8b5c014fc7767be25926f285558c"},"schema_version":"1.0"},"canonical_sha256":"570e62ea4061686b240b962d191e75ce3c6604d0a64aeacfd8d611811559c1be","source":{"kind":"arxiv","id":"1208.1732","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1732","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1732v2","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1732","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"K4HGF2SAMFUG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K4HGF2SAMFUGWJAL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K4HGF2SA","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K4HGF2SAMFUGWJALSYWRSHTVZY","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-08T18:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"b0354630f74f6024f07fa51eab41add4dd10314b7960866a0f64c49cb288871a","abstract_canon_sha256":"b8125735ef60c00eab18ca8008773d10b03a8b5c014fc7767be25926f285558c"},"schema_version":"1.0"},"canonical_sha256":"570e62ea4061686b240b962d191e75ce3c6604d0a64aeacfd8d611811559c1be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:50.021067Z","signature_b64":"MXP9wUx8ClsowkZZUIK08xM+ci8e+fUdzeaVog0oqqmnUPmeGF0O2zeln6fXjrpVhMXJcFO1Z+yi+GQbuFwVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"570e62ea4061686b240b962d191e75ce3c6604d0a64aeacfd8d611811559c1be","last_reissued_at":"2026-05-18T03:04:50.020352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:50.020352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1732","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efbsDXqlqXuPr/Ccd41HpAqf6yBQ2oRFui7bCNQlMEWvspunpKQZqlmPEjwTSNcmcfuTGriep8oCzOMfWERHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:45:08.665059Z"},"content_sha256":"3a2878a56d6dd92103a1542c1f3b4de3c365ef0d45b42e3f2f3a976184f22e3c","schema_version":"1.0","event_id":"sha256:3a2878a56d6dd92103a1542c1f3b4de3c365ef0d45b42e3f2f3a976184f22e3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K4HGF2SAMFUGWJALSYWRSHTVZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey numbers of cubes versus cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, David Conlon, Jacob Fox","submitted_at":"2012-08-08T18:40:22Z","abstract_excerpt":"The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of order s. Burr and Erdos in 1983 asked whether the simple lower bound r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1732","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJznzi9kuJgkxZQ5rh8jp37wGDeV5ypWuXIeGwh+9SeSX4IVmWEHxaTrJMl+5p0m2YZ5is14sjG5Vb4K3YfWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:45:08.665948Z"},"content_sha256":"12020b42a920db5e67a986053bbe640e604ce296e3d8d45c4f08d3f370329bda","schema_version":"1.0","event_id":"sha256:12020b42a920db5e67a986053bbe640e604ce296e3d8d45c4f08d3f370329bda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/bundle.json","state_url":"https://pith.science/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T09:45:08Z","links":{"resolver":"https://pith.science/pith/K4HGF2SAMFUGWJALSYWRSHTVZY","bundle":"https://pith.science/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/bundle.json","state":"https://pith.science/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4HGF2SAMFUGWJALSYWRSHTVZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K4HGF2SAMFUGWJALSYWRSHTVZY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b8125735ef60c00eab18ca8008773d10b03a8b5c014fc7767be25926f285558c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-08T18:40:22Z","title_canon_sha256":"b0354630f74f6024f07fa51eab41add4dd10314b7960866a0f64c49cb288871a"},"schema_version":"1.0","source":{"id":"1208.1732","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1732","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1732v2","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1732","created_at":"2026-05-18T03:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"K4HGF2SAMFUG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K4HGF2SAMFUGWJAL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K4HGF2SA","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:12020b42a920db5e67a986053bbe640e604ce296e3d8d45c4f08d3f370329bda","target":"graph","created_at":"2026-05-18T03:04:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of order s. Burr and Erdos in 1983 asked whether the simple lower bound r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.","authors_text":"Benny Sudakov, Choongbum Lee, David Conlon, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-08T18:40:22Z","title":"Ramsey numbers of cubes versus cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1732","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a2878a56d6dd92103a1542c1f3b4de3c365ef0d45b42e3f2f3a976184f22e3c","target":"record","created_at":"2026-05-18T03:04:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b8125735ef60c00eab18ca8008773d10b03a8b5c014fc7767be25926f285558c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-08T18:40:22Z","title_canon_sha256":"b0354630f74f6024f07fa51eab41add4dd10314b7960866a0f64c49cb288871a"},"schema_version":"1.0","source":{"id":"1208.1732","kind":"arxiv","version":2}},"canonical_sha256":"570e62ea4061686b240b962d191e75ce3c6604d0a64aeacfd8d611811559c1be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"570e62ea4061686b240b962d191e75ce3c6604d0a64aeacfd8d611811559c1be","first_computed_at":"2026-05-18T03:04:50.020352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:50.020352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MXP9wUx8ClsowkZZUIK08xM+ci8e+fUdzeaVog0oqqmnUPmeGF0O2zeln6fXjrpVhMXJcFO1Z+yi+GQbuFwVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:50.021067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1732","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a2878a56d6dd92103a1542c1f3b4de3c365ef0d45b42e3f2f3a976184f22e3c","sha256:12020b42a920db5e67a986053bbe640e604ce296e3d8d45c4f08d3f370329bda"],"state_sha256":"4baf37055e718d62c0038be1a9d73a953879f4db43dc0b5fab7df2a11d17a54b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hD/vRNDEoi+XEsGnYoP8X9ptF+mMfYmXtHHfVSRPeozzXMctGdO4xbumUJGXr7kDn8wTG6pkhVlCgmjai0CCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:45:08.670152Z","bundle_sha256":"13842fa43a6a561e55feaf3270778902ec91150c99dbab0a0d9b3090338698af"}}