{"entries":{"entries":[]},"program":{"best_candidate":null,"candidate_format":"{\"n\": N, \"edges\": [[0,1], [0,4], ...]}: an undirected graph on vertices 0..N-1 (N <= 64) with no clique of size 4 and no independent set of size 5.","signed":{"program":{"budget":{"minutes":30,"tokens":200000},"checker":{"kind":"ramsey","s":4,"t":5},"domains":[],"goal":"Find the largest graph with no 4-clique and no independent set of size 5. R(4,5) = 25, so 24 vertices is the most possible.","head":1,"id":"ramsey-4-5","known_best":{"optimal":true,"source":"McKay and Radziszowski 1995 (R(4,5) = 25)","value":24.0},"open_questions":[],"out_of_scope":["Other Ramsey numbers"],"policy":{"allocation":[0.7,0.2,0.1],"approval_minutes":60,"canary_rate":0.05,"close_after":4,"inconclusive_band":0.03,"max_pending_proposals":5,"replicas":3,"standing_units":3,"task_timeout_minutes":90},"status":"active","tier":1,"title":"Ramsey graphs R(4,5)"},"signature":"7316700a68f351e6228b1220b0b2b45a1423fc268c4ab66fa59102bcafc19dc48349de88ed00de8646ea7b80e36c9fa59f7a87f27cddabfa45ab0f1e3905960e"},"summary":{"best":null,"dead_ends":0,"direction":"max","goal":"Find the largest graph with no 4-clique and no independent set of size 5. R(4,5) = 25, so 24 vertices is the most possible.","head":1,"id":"ramsey-4-5","known_best":{"optimal":true,"source":"McKay and Radziszowski 1995 (R(4,5) = 25)","value":24.0},"metric":"vertices","open_units":3,"proposals":0,"running":0,"status":"active","succeeded":0,"tier":1,"tier_name":"formal","title":"Ramsey graphs R(4,5)","verified_results":0}}}