{"id":"W2084955549","doi":"10.1016/s0304-3975(03)00286-x","title":"On universally easy classes for NP-complete problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time complexity; Mathematics; NP-complete; Intersection (aeronautics); P versus NP problem; Polynomial; Combinatorics; Discrete mathematics; Computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002703619,0.0002578565,0.0002582419,0.0003741145,0.0007114871,0.000464939,0.003568003,0.00005974399,0.000038042],"category_scores_gemma":[0.0005409435,0.0002141481,0.0001178147,0.001765848,0.003262366,0.0008134191,0.0005509628,0.000273506,0.0001131261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112541,"about_ca_system_score_gemma":0.0002563597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.796825e-7,"about_ca_topic_score_gemma":7.474046e-7,"domain_scores_codex":[0.9962167,0.0002628136,0.0002708439,0.001211673,0.0009559337,0.001082059],"domain_scores_gemma":[0.9963541,0.001393754,0.00007521902,0.001368403,0.0003906623,0.0004178565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001943747,0.00007865235,0.00001703835,0.00001068956,0.000004837778,0.000006824695,0.0001114013,0.001321031,0.001044124,0.9920618,0.0000740355,0.005250162],"study_design_scores_gemma":[0.000443982,0.0007049289,0.00006710212,0.00002418782,0.000002253931,0.00002734652,0.000003783814,0.1574341,0.002967362,0.8350559,0.00299974,0.0002693159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00448315,0.00001745573,0.9820232,0.0006757614,0.0004695901,0.0005606735,0.00000425225,0.0002532954,0.01151266],"genre_scores_gemma":[0.7499499,0.000002312292,0.2492667,0.0006329917,0.00003753847,0.00002503795,6.05294e-7,0.00001456672,0.00007036307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7454667,"threshold_uncertainty_score":0.9994502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02652137339352883,"score_gpt":0.287435863305529,"score_spread":0.2609144899120002,"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."}}