{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; 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":[],"consensus_categories":[],"category_scores_codex":[0.002265295,0.0001176747,0.0003785963,0.0001228577,0.00007516644,0.00002182429,0.00169911,0.0000639901,0.0000102943],"category_scores_gemma":[0.0002129622,0.00006933483,0.0003093198,0.0007311548,0.0007005649,0.0002485157,0.0002298081,0.0002843374,9.838288e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002464086,"about_ca_system_score_gemma":0.00022393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003526374,"about_ca_topic_score_gemma":0.000009283523,"domain_scores_codex":[0.9980303,0.0001274348,0.0008904738,0.0001406935,0.0005821366,0.0002289657],"domain_scores_gemma":[0.9976628,0.0003542131,0.001020099,0.000492253,0.0003913346,0.00007927986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001492047,0.001536658,0.0637657,0.0003378191,0.0002427583,0.00008995833,0.004382393,0.0002134574,0.19006,0.6483621,0.001775268,0.08908466],"study_design_scores_gemma":[0.001006448,0.0007950436,0.04791941,0.0002222854,0.00005128641,0.0008736583,0.000297579,0.000225465,0.4777196,0.4670812,0.003522963,0.0002850569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8483843,0.002847986,0.1315804,0.00505474,0.002324266,0.0003447335,0.000009663257,0.00003433465,0.009419691],"genre_scores_gemma":[0.9792139,0.00003357126,0.02016135,0.0004775358,0.0000887865,4.581732e-7,4.79037e-8,0.000003109114,0.00002125616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2876596,"threshold_uncertainty_score":0.3157397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.2388076825406868,"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."}}