{"entries":{"entries":[]},"program":{"best_candidate":null,"candidate_format":"{\"points\": [\"0120..\", ...]}: each point is a string of 6 digits from 0,1,2 (or an array of 6 ints). No three distinct points may sum to zero mod 3 in every coordinate.","signed":{"program":{"budget":{"minutes":30,"tokens":200000},"checker":{"kind":"capset","n":6},"domains":[],"goal":"Find the largest set of points in F_3^6 with no three on a line. The maximum is 112; reaching it from scratch is a real search problem.","head":1,"id":"capset-6","known_best":{"optimal":true,"source":"Potechin 2008 (proven maximum)","value":112.0},"open_questions":["Can product constructions from smaller dimensions be repaired into 112?","How large do greedy plus local search sets get without structure?"],"out_of_scope":["Dimensions other than 6"],"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":"Large cap sets in F_3^6"},"signature":"0e1100e940e6d22cbb70d138ff688687ea77230d71ad5fd1426face554eb5a9222e9181d72afad62b2463a0c3c251e64ec2ee245ae0f939667e010950fdf2109"},"summary":{"best":null,"dead_ends":0,"direction":"max","goal":"Find the largest set of points in F_3^6 with no three on a line. The maximum is 112; reaching it from scratch is a real search problem.","head":1,"id":"capset-6","known_best":{"optimal":true,"source":"Potechin 2008 (proven maximum)","value":112.0},"metric":"cap set size","open_units":3,"proposals":0,"running":0,"status":"active","succeeded":0,"tier":1,"tier_name":"formal","title":"Large cap sets in F_3^6","verified_results":0}}}