{"id":"W26022181","doi":"","title":"Some Results in Computational Complexity","year":2005,"lang":"en","type":"article","venue":"TSpace","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904092,0.0001006463,0.0001257769,0.0001374499,0.00008982699,0.00007858201,0.0006034317,0.00003494625,0.00002042681],"category_scores_gemma":[0.0000314115,0.0001052772,0.00004425661,0.0004027884,0.00009072633,0.0003942721,0.0002184399,0.0001610194,0.0001556943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005416783,"about_ca_system_score_gemma":0.0000453994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001021931,"about_ca_topic_score_gemma":0.0001265209,"domain_scores_codex":[0.9989265,0.00005564891,0.0002095501,0.0003081993,0.0002521789,0.000247984],"domain_scores_gemma":[0.9993731,0.0001281171,0.00005484238,0.0003377993,0.00003620925,0.00006993974],"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.00001411915,0.0001513424,0.0001153794,0.000004672494,0.000005301923,0.00001412176,0.002807595,0.01243095,0.00002357908,0.954487,0.003343429,0.02660247],"study_design_scores_gemma":[0.001119255,0.00004534159,0.02473695,0.0000195702,9.989373e-7,0.00001847755,0.00006587412,0.6859524,0.0001632267,0.2628515,0.02478679,0.0002396504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162817,0.0009362554,0.6460507,0.1514337,0.001154627,0.0005898465,0.00002829261,0.001125159,0.03586442],"genre_scores_gemma":[0.6652049,0.000007814025,0.3330551,0.0009285401,0.0002223542,0.000004724554,0.000008450187,0.000005002855,0.0005631676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6916355,"threshold_uncertainty_score":0.4293081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05971367665835516,"score_gpt":0.3318129561532285,"score_spread":0.2720992794948734,"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."}}