{"id":"W2157381209","doi":"10.1109/ccc.2011.15","title":"Approximation Algorithms for QMA-Complete Problems","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Constraint satisfaction problem; Polynomial-time approximation scheme; Approximation theory; Class (philosophy); Computer science; Hamiltonian (control theory); Algorithm; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0002823785,0.0001262078,0.0001335509,0.0001061579,0.0001703557,0.00009232594,0.0008294444,0.00004497746,0.00006705678],"category_scores_gemma":[0.00001560886,0.0001100532,0.0001001678,0.0002937405,0.00004853864,0.0005163996,0.0001543919,0.00006784176,0.0000548938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000014486,"about_ca_system_score_gemma":0.00002234178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005286295,"about_ca_topic_score_gemma":0.00001006645,"domain_scores_codex":[0.9989328,0.00002189962,0.0002221878,0.0003629145,0.0001688351,0.0002913726],"domain_scores_gemma":[0.9992297,0.0000546973,0.00006886414,0.0004690381,0.0001025679,0.00007512492],"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.000002938827,0.0001070097,0.00003052384,0.00003017582,0.00001602878,9.404058e-7,0.001512864,0.000007352064,0.0002088591,0.8696789,0.0008880158,0.1275165],"study_design_scores_gemma":[0.0004189663,0.0001758,0.0005826189,0.0000122406,0.000004731216,0.00001383587,0.00004008485,0.5173795,0.00231526,0.465281,0.01351613,0.0002598517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002339342,0.00002928963,0.9789295,0.00022018,0.0003828038,0.0004528316,0.000005558045,0.0003541531,0.0193918],"genre_scores_gemma":[0.02822383,0.000003986473,0.9706812,0.0002768417,0.0000764434,0.0001401795,0.000007135583,0.000009260592,0.00058115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5173721,"threshold_uncertainty_score":0.4487838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1384565972042934,"score_gpt":0.2649026646200964,"score_spread":0.126446067415803,"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."}}