{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004685966,0.002733281,0.002964515,0.005385208,0.004935032,0.008233516,0.00405092,0.003318453,0.02036945],"category_scores_gemma":[0.02470269,0.002174775,0.00375129,0.0054387,0.007722395,0.02596967,0.01081274,0.01664854,0.002048093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005448453,"about_ca_system_score_gemma":0.001786684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003676356,"about_ca_topic_score_gemma":0.004428862,"domain_scores_codex":[0.9946511,0.001267741,0.0003222564,0.001122021,0.001498747,0.001138068],"domain_scores_gemma":[0.9770191,0.01874487,0.000780729,0.001488182,0.000811743,0.001155311],"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.0001876508,0.0001305919,0.0005795949,0.0002569954,0.00003100205,0.0001183798,0.0006576765,0.003896356,0.0004749065,0.9674826,0.006457955,0.01972639],"study_design_scores_gemma":[0.00004288232,0.00001871204,0.0002831829,0.00005815871,0.0000251207,0.00006104876,0.0001010713,0.004705921,0.0001597245,0.9903081,0.004214596,0.00002137402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.166907,0.008317287,0.5687959,0.01632654,0.001577532,0.0004609929,0.001948107,0.001580563,0.2340861],"genre_scores_gemma":[0.8233527,0.006303776,0.109293,0.003256871,0.003556472,0.0009727066,0.004020614,0.00150745,0.04773626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02036945,"threshold_uncertainty_score":0.06814259,"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."}}