{"id":"W2018522462","doi":"10.1007/s00037-007-0225-x","title":"Special Issue “Conference on Computational Complexity 2006” Guest Editors’ Foreword","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computational complexity theory; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003773986,0.003354915,0.003767541,0.005936481,0.00345416,0.01039403,0.003141177,0.006158348,0.1118008],"category_scores_gemma":[0.009086918,0.0009145336,0.002296017,0.00345834,0.001085796,0.006033717,0.003354325,0.008743297,0.04897418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003809782,"about_ca_system_score_gemma":0.002743988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001081387,"about_ca_topic_score_gemma":0.002624253,"domain_scores_codex":[0.9971149,0.0004011033,0.0002644646,0.0005253659,0.001281303,0.0004129313],"domain_scores_gemma":[0.9894186,0.001771881,0.0005758337,0.0006177364,0.005320697,0.002295296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003434787,0.00002041825,0.00004364313,0.0001571715,0.000007672828,0.00003132289,0.000007038439,0.00004724337,0.0001086539,0.001517834,0.9879692,0.01005551],"study_design_scores_gemma":[0.0000397988,0.00004761585,0.0005490629,0.0002810947,0.00002927697,0.0001170958,0.0000295684,0.0004300284,0.0002851648,0.003172662,0.9949982,0.00002045379],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0002340621,0.01157959,0.0007740553,0.0357606,0.92936,0.00005332225,0.0002177313,0.0001611016,0.02185962],"genre_scores_gemma":[0.00343443,0.009913513,0.0006633239,0.01006974,0.8575864,0.0001357655,0.0005845721,0.0003586365,0.1172537],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1118008,"threshold_uncertainty_score":0.3740109,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09065063507808688,"score_gpt":0.3221336832850516,"score_spread":0.2314830482069647,"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."}}