{"id":"W1517853613","doi":"10.1007/978-3-540-74915-8_29","title":"Relativizing Small Complexity Classes and Their Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oracle; Stack (abstract data type); Hierarchy; Bounded function; Class (philosophy); Function (biology); Limit (mathematics); Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","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","sts"],"consensus_categories":[],"category_scores_codex":[0.001653813,0.0007162196,0.0007024314,0.0009970975,0.0006524787,0.0008475989,0.003044028,0.0003654004,0.00001701344],"category_scores_gemma":[0.0001178565,0.0005975584,0.0001615568,0.0007722669,0.003190491,0.0006468967,0.002624706,0.001304455,0.00001272652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000166516,"about_ca_system_score_gemma":0.0003074336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003904308,"about_ca_topic_score_gemma":0.0004112359,"domain_scores_codex":[0.9961629,0.0000600561,0.0005863575,0.001717447,0.000623579,0.0008496687],"domain_scores_gemma":[0.9962174,0.001603457,0.0003048785,0.001410527,0.000233911,0.0002298187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003801281,0.00001555603,0.00006946649,0.00002695569,0.00001123139,0.00003555345,0.001051817,0.0002916682,0.00001941699,0.499044,0.000002788755,0.4994278],"study_design_scores_gemma":[0.0001723829,0.0001233911,0.0003685199,0.0003066794,0.0000044569,0.0001275607,9.399557e-7,0.1457087,0.000511379,0.8498335,0.002191362,0.0006510812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001925324,0.001365752,0.9837263,0.0006352689,0.001424581,0.0003197776,0.000009794365,0.0002752312,0.01205082],"genre_scores_gemma":[0.1166413,0.0001618602,0.8804746,0.001772714,0.0005940995,0.000005906648,0.000006290497,0.00004877756,0.0002944261],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4987767,"threshold_uncertainty_score":0.9996476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05651785826671054,"score_gpt":0.2645528429285027,"score_spread":0.2080349846617922,"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."}}