{"id":"W4386159662","doi":"10.1109/csci58124.2022.00090","title":"The 2-MAXSAT Problem Can Be Solved in Polynomial Time","year":2022,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg; Manitoba Beekeepers' Association","funders":"","keywords":"Maximum satisfiability problem; Computer science; Polynomial; Bounded function; Combinatorics; Algorithm; Artificial intelligence; Discrete mathematics; Mathematics; Boolean function","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.0008067833,0.002384929,0.001544045,0.000602959,0.001131643,0.004012819,0.001729477,0.001930135,0.04419946],"category_scores_gemma":[0.003607161,0.0008834789,0.002053978,0.002397229,0.001123906,0.004680245,0.001720197,0.003077417,0.01127714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001638667,"about_ca_system_score_gemma":0.00243786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001699968,"about_ca_topic_score_gemma":0.005197106,"domain_scores_codex":[0.9989303,0.0002120135,0.00005707474,0.000403474,0.0001890498,0.0002081379],"domain_scores_gemma":[0.9979811,0.00131544,0.0001676815,0.000327074,0.0001382302,0.00007047474],"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.001274923,0.0004802636,0.001183056,0.003465266,0.0002579377,0.0009201147,0.0002279448,0.1405149,0.01630082,0.2624127,0.2706218,0.3023402],"study_design_scores_gemma":[0.0003307454,0.0001664284,0.001157948,0.0002958457,0.0001311974,0.001167249,0.0002178549,0.3205829,0.01038263,0.5181077,0.1473823,0.00007726438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04666378,0.006503121,0.6825132,0.01184302,0.00188284,0.0008338785,0.0252554,0.01084077,0.213664],"genre_scores_gemma":[0.4223002,0.005762522,0.4693885,0.003544218,0.001560383,0.001212669,0.02773545,0.003880286,0.06461579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04419946,"threshold_uncertainty_score":0.147862,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01369438464143977,"score_gpt":0.2278928376202346,"score_spread":0.2141984529787948,"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."}}