{"id":"W3038043972","doi":"10.4230/lipics.icalp.2020.87","title":"On the Complexity of Zero Gap MIP*","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Complexity class; Class (philosophy); Connection (principal bundle); Discrete mathematics; Mathematical proof; Computability; PSPACE; Mathematics; Quantum complexity theory; Set (abstract data type); Core (optical fiber); Complement (music); Computer science; Operator (biology); Hierarchy; Computational complexity theory; Quantum; Time complexity; Quantum computer; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007680447,0.0004295144,0.0005954069,0.0001200631,0.0003274816,0.0003171157,0.003063769,0.0001512782,0.00006950998],"category_scores_gemma":[0.0004060772,0.000308564,0.000389495,0.0006343446,0.0005273228,0.0008314204,0.001259652,0.0005724826,0.0002105841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009415443,"about_ca_system_score_gemma":0.0001086732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001914904,"about_ca_topic_score_gemma":0.000006525486,"domain_scores_codex":[0.9967081,0.0001077575,0.001257441,0.0004045024,0.000824358,0.0006978709],"domain_scores_gemma":[0.9968132,0.0006127757,0.0005390194,0.001387501,0.0003647855,0.0002827144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001684351,0.0007700789,0.001886774,0.0008008429,0.0002321446,0.000007254707,0.0230916,0.001207532,0.000111032,0.9310535,0.02425507,0.01641575],"study_design_scores_gemma":[0.002825285,0.001390921,0.001991518,0.0001238911,0.00003691939,0.00003494911,0.0006524571,0.8401401,0.003203146,0.1197724,0.02895953,0.000868876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08755115,0.00002925049,0.8895993,0.01138562,0.000949393,0.001828559,0.0003656741,0.0003932054,0.007897879],"genre_scores_gemma":[0.9450809,0.000005090207,0.04843164,0.006182875,0.0001185794,0.00005756224,0.00005870949,0.00002766746,0.00003692273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8575298,"threshold_uncertainty_score":0.9999366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09277187158679966,"score_gpt":0.2694113754011682,"score_spread":0.1766395038143685,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}