{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5VFRWNKEJGTWFSTBGWTBC4PBUI","short_pith_number":"pith:5VFRWNKE","schema_version":"1.0","canonical_sha256":"ed4b1b354449a762ca6135a61171e1a233a145f91a549b3949c7fce786e9ac95","source":{"kind":"arxiv","id":"1210.4408","version":1},"attestation_state":"computed","paper":{"title":"On efficient constructions of short lists containing mostly Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2012-10-16T13:48:53Z","abstract_excerpt":"One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit construction of such a graph is a major open problem. We show that a reasonable hardness assumption implies that in polynomial time one can construct a list containing polylog(n) graphs such that most of them are 2 log n-Ramsey."},"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":"1210.4408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-16T13:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"a5f3e5d18e21058cb929d73b56348cf07040e2d20b192bb4b986fcc0ab16c927","abstract_canon_sha256":"92b38ca65d9c796c65b1049c3ae58c6140776d1bf93abcc4bd3ab69516149848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:06.062042Z","signature_b64":"3QXq/7hQqP+dKLNh8Cegtrrm6TcUgezVfFNr1sfTwm2LshfmQxSSq+iuuFVTcN8OLC2JXUHZsDJzusB8LoZHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed4b1b354449a762ca6135a61171e1a233a145f91a549b3949c7fce786e9ac95","last_reissued_at":"2026-05-18T03:43:06.061281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:06.061281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On efficient constructions of short lists containing mostly Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2012-10-16T13:48:53Z","abstract_excerpt":"One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit construction of such a graph is a major open problem. We show that a reasonable hardness assumption implies that in polynomial time one can construct a list containing polylog(n) graphs such that most of them are 2 log n-Ramsey."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4408","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":"1210.4408","created_at":"2026-05-18T03:43:06.061415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4408v1","created_at":"2026-05-18T03:43:06.061415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4408","created_at":"2026-05-18T03:43:06.061415+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VFRWNKEJGTW","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VFRWNKEJGTWFSTB","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VFRWNKE","created_at":"2026-05-18T12:26:56.085431+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/5VFRWNKEJGTWFSTBGWTBC4PBUI","json":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI.json","graph_json":"https://pith.science/api/pith-number/5VFRWNKEJGTWFSTBGWTBC4PBUI/graph.json","events_json":"https://pith.science/api/pith-number/5VFRWNKEJGTWFSTBGWTBC4PBUI/events.json","paper":"https://pith.science/paper/5VFRWNKE"},"agent_actions":{"view_html":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI","download_json":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI.json","view_paper":"https://pith.science/paper/5VFRWNKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4408&json=true","fetch_graph":"https://pith.science/api/pith-number/5VFRWNKEJGTWFSTBGWTBC4PBUI/graph.json","fetch_events":"https://pith.science/api/pith-number/5VFRWNKEJGTWFSTBGWTBC4PBUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI/action/storage_attestation","attest_author":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI/action/author_attestation","sign_citation":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI/action/citation_signature","submit_replication":"https://pith.science/pith/5VFRWNKEJGTWFSTBGWTBC4PBUI/action/replication_record"}},"created_at":"2026-05-18T03:43:06.061415+00:00","updated_at":"2026-05-18T03:43:06.061415+00:00"}