{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KAZQLTLFSV63ZJYL43O5YFTPPS","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":"e3572ddcf93c86564ec475bbeed52ba20492fb9a924afc9295487b8f153d262c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T09:53:22Z","title_canon_sha256":"f53b5c01b45c7b784032e5b4ed4e5a51117c6334f87e212bf2602903d2cee768"},"schema_version":"1.0","source":{"id":"1308.6696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6696","created_at":"2026-05-18T03:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6696v1","created_at":"2026-05-18T03:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6696","created_at":"2026-05-18T03:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"KAZQLTLFSV63","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KAZQLTLFSV63ZJYL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KAZQLTLF","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:05e616f4e6339d8bbff251d1e6635d0743a913be63dfd9df7005203b44e488f9","target":"graph","created_at":"2026-05-18T03:14:38Z","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":"In 1961 Erd\\H{o}s and Hajnal introduced the quantity $m(n)$ as the minimum number of edges in an $n$-uniform hypergraph with chromatic number at least 3. The best known lower and upper bounds for $ m(n) $ are $ c_1 \\sqrt{\\frac{n}{\\ln n}} 2^n$ and $c_2 n^2 2^n$ respectively. The lower bound is due to Radhakrishnan and Srinivasan (see \\cite{RS}). A natural generalization for $ m(n) $ is the quantity $ m(n,r) $, which is the minimum number of edges in an $n$-uniform hypergraph with chromatic number at least $r+1$. In this work, we present a new randomized algorithm yielding a bound $ m(n,r) \\ge c","authors_text":"Danila Cherkashin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T09:53:22Z","title":"A new randomized algorithm for the Erdos--Hajnal problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6696","kind":"arxiv","version":1},"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:3981e934e22b4e451b388e31bd6af7afee11118fcc20c53a11ac7389896dbd3c","target":"record","created_at":"2026-05-18T03:14:38Z","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":"e3572ddcf93c86564ec475bbeed52ba20492fb9a924afc9295487b8f153d262c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T09:53:22Z","title_canon_sha256":"f53b5c01b45c7b784032e5b4ed4e5a51117c6334f87e212bf2602903d2cee768"},"schema_version":"1.0","source":{"id":"1308.6696","kind":"arxiv","version":1}},"canonical_sha256":"503305cd65957dbca70be6dddc166f7ca959b019dcf1cff88864831dc7d130c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"503305cd65957dbca70be6dddc166f7ca959b019dcf1cff88864831dc7d130c4","first_computed_at":"2026-05-18T03:14:38.375218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:38.375218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rTbSShefiSdLTq1JKuNFk4Tdlby3QebmjP9FcOZon4VYC9OVRTw8cwUg0clnLBZ/VnpuV8g3wl8O7lDbYSVnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:38.375671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3981e934e22b4e451b388e31bd6af7afee11118fcc20c53a11ac7389896dbd3c","sha256:05e616f4e6339d8bbff251d1e6635d0743a913be63dfd9df7005203b44e488f9"],"state_sha256":"b1b8b66e0f1806b279432002eecd8461b0537d7dda7dd3fd35e0671b3d7b510d"}