{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MAJKWIUX74PF6OOUK2LOIFCTGG","short_pith_number":"pith:MAJKWIUX","canonical_record":{"source":{"id":"1412.2504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T10:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"5a75eee4ee94b48457a36cd05f005e40f80b4d1a197ed04f0694831bb90805d0","abstract_canon_sha256":"927d6846712d25ed108d8201eeb363a020fcdc1b8b2b104b49dee453adf532e2"},"schema_version":"1.0"},"canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","source":{"kind":"arxiv","id":"1412.2504","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2504","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2504v2","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2504","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"MAJKWIUX74PF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAJKWIUX74PF6OOU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAJKWIUX","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MAJKWIUX74PF6OOUK2LOIFCTGG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T10:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"5a75eee4ee94b48457a36cd05f005e40f80b4d1a197ed04f0694831bb90805d0","abstract_canon_sha256":"927d6846712d25ed108d8201eeb363a020fcdc1b8b2b104b49dee453adf532e2"},"schema_version":"1.0"},"canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:07.663172Z","signature_b64":"SsuiK1ePYqIVGH7CtKfoXCD//FMg6EvUd1RCcCFW5q76brtPz1aVMR3nep0KtlikR00c61jft6xRBVIGFgfwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","last_reissued_at":"2026-05-18T02:30:07.662574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:07.662574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2504","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9k2+FnnzE6PdBJq3dqVhpyzNKTlkvRW1Bt2W78hx5tRSesjLiJKskYYakNmKQvryFB6UfLT+10m+8658sMaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:46:32.638363Z"},"content_sha256":"a64e85496e9bd31350d84aac64a10a28986f5e2373daa817cd35caac5777520c","schema_version":"1.0","event_id":"sha256:a64e85496e9bd31350d84aac64a10a28986f5e2373daa817cd35caac5777520c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MAJKWIUX74PF6OOUK2LOIFCTGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An explicit Ramsey graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'abor Heged\\\"us","submitted_at":"2014-12-08T10:28:53Z","abstract_excerpt":"Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl--Wilson \\cite{FW}, Alon \\cite{A} and Grolmusz \\cite{G2} gave the best explicit constructions of graphs on $m$ vertices with no clique or independent set of size $m^{(1+o(1))\\frac{1}{4}\\frac{\\log m}{\\log \\log m}}$.\n  We describe here an explicit construction which produces for every integer $m>1$ a graph on at least $m^{(1+o(1))\\frac{1}{3}\\frac{\\log m}{\\log \\log m}}$ vertices containing neither a clique of size $m$ nor an independent set of size $m$. In the proof we use the polynomial subspace"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2504","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDRHSP/Rc6IhcMrW+Mji7xKdRy+r+7HvLByp0eZxC4qSY8XpgPLtmKqjM/ieb3WqnPYtl6z1ZssQWRY7pbs2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:46:32.639034Z"},"content_sha256":"2a296995862f5b4a2f1e299324296b8015c3e5e82188fd2ce4aa6b2d60f63268","schema_version":"1.0","event_id":"sha256:2a296995862f5b4a2f1e299324296b8015c3e5e82188fd2ce4aa6b2d60f63268"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/bundle.json","state_url":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/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-06-07T23:46:32Z","links":{"resolver":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG","bundle":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/bundle.json","state":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MAJKWIUX74PF6OOUK2LOIFCTGG","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":"927d6846712d25ed108d8201eeb363a020fcdc1b8b2b104b49dee453adf532e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T10:28:53Z","title_canon_sha256":"5a75eee4ee94b48457a36cd05f005e40f80b4d1a197ed04f0694831bb90805d0"},"schema_version":"1.0","source":{"id":"1412.2504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2504","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2504v2","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2504","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"MAJKWIUX74PF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAJKWIUX74PF6OOU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAJKWIUX","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2a296995862f5b4a2f1e299324296b8015c3e5e82188fd2ce4aa6b2d60f63268","target":"graph","created_at":"2026-05-18T02:30:07Z","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":"Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl--Wilson \\cite{FW}, Alon \\cite{A} and Grolmusz \\cite{G2} gave the best explicit constructions of graphs on $m$ vertices with no clique or independent set of size $m^{(1+o(1))\\frac{1}{4}\\frac{\\log m}{\\log \\log m}}$.\n  We describe here an explicit construction which produces for every integer $m>1$ a graph on at least $m^{(1+o(1))\\frac{1}{3}\\frac{\\log m}{\\log \\log m}}$ vertices containing neither a clique of size $m$ nor an independent set of size $m$. In the proof we use the polynomial subspace","authors_text":"G\\'abor Heged\\\"us","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T10:28:53Z","title":"An explicit Ramsey graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2504","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:a64e85496e9bd31350d84aac64a10a28986f5e2373daa817cd35caac5777520c","target":"record","created_at":"2026-05-18T02:30:07Z","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":"927d6846712d25ed108d8201eeb363a020fcdc1b8b2b104b49dee453adf532e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-08T10:28:53Z","title_canon_sha256":"5a75eee4ee94b48457a36cd05f005e40f80b4d1a197ed04f0694831bb90805d0"},"schema_version":"1.0","source":{"id":"1412.2504","kind":"arxiv","version":2}},"canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","first_computed_at":"2026-05-18T02:30:07.662574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:07.662574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsuiK1ePYqIVGH7CtKfoXCD//FMg6EvUd1RCcCFW5q76brtPz1aVMR3nep0KtlikR00c61jft6xRBVIGFgfwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:07.663172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a64e85496e9bd31350d84aac64a10a28986f5e2373daa817cd35caac5777520c","sha256:2a296995862f5b4a2f1e299324296b8015c3e5e82188fd2ce4aa6b2d60f63268"],"state_sha256":"483006f7d7328ea64c498ac212ad96abefdd253df0a514ad92b911ca212b4f75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfK7myedWUg7qugOjkgLEBr8sB2iXAcJ+f5n4ryVGo01BVCU8hhy6n2mghYubh7CGuoEDvcplplB9zf5DsaQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:46:32.643308Z","bundle_sha256":"c70555459e43e9f6d32ab8688b5dbeb4f576b2508c3a6d5396e8f00a047b4bd2"}}