{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MAJKWIUX74PF6OOUK2LOIFCTGG","short_pith_number":"pith:MAJKWIUX","schema_version":"1.0","canonical_sha256":"6012ab2297ff1e5f39d45696e414533185abbab9d2b66e9872220f2a6980ace7","source":{"kind":"arxiv","id":"1412.2504","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2504","created_at":"2026-05-18T02:30:07.662663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2504v2","created_at":"2026-05-18T02:30:07.662663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2504","created_at":"2026-05-18T02:30:07.662663+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAJKWIUX74PF","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAJKWIUX74PF6OOU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAJKWIUX","created_at":"2026-05-18T12:28:38.356838+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/MAJKWIUX74PF6OOUK2LOIFCTGG","json":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG.json","graph_json":"https://pith.science/api/pith-number/MAJKWIUX74PF6OOUK2LOIFCTGG/graph.json","events_json":"https://pith.science/api/pith-number/MAJKWIUX74PF6OOUK2LOIFCTGG/events.json","paper":"https://pith.science/paper/MAJKWIUX"},"agent_actions":{"view_html":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG","download_json":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG.json","view_paper":"https://pith.science/paper/MAJKWIUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2504&json=true","fetch_graph":"https://pith.science/api/pith-number/MAJKWIUX74PF6OOUK2LOIFCTGG/graph.json","fetch_events":"https://pith.science/api/pith-number/MAJKWIUX74PF6OOUK2LOIFCTGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/action/storage_attestation","attest_author":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/action/author_attestation","sign_citation":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/action/citation_signature","submit_replication":"https://pith.science/pith/MAJKWIUX74PF6OOUK2LOIFCTGG/action/replication_record"}},"created_at":"2026-05-18T02:30:07.662663+00:00","updated_at":"2026-05-18T02:30:07.662663+00:00"}