{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581178,0.00005996598,0.00006334754,0.0000634051,0.0004186976,0.0001695956,0.0008660545,0.00001309202,0.0003770957],"category_scores_gemma":[0.00001224237,0.00004315359,0.00002646916,0.00041723,0.00002808,0.0001204644,0.0006380916,0.0001645284,0.00003095368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000780744,"about_ca_system_score_gemma":0.0001597573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001697376,"about_ca_topic_score_gemma":0.0002441242,"domain_scores_codex":[0.9989661,0.0001450915,0.0001515887,0.0001946172,0.0002755033,0.0002670805],"domain_scores_gemma":[0.999522,0.00007931757,0.00002923478,0.0002909397,0.00002263859,0.00005585537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006702194,0.0005267857,0.001755757,0.00001383221,0.00004684401,0.00005684492,0.01305169,0.1226912,0.004798985,0.3289619,0.4518875,0.07614165],"study_design_scores_gemma":[0.0006402,0.0001288909,0.0001794022,0.000001702434,6.952363e-7,0.000007963265,0.0001611634,0.7813231,0.0002753341,0.00147953,0.2156309,0.000171101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01208101,0.000231166,0.135014,0.4353076,0.001384264,0.003462718,0.00002394016,0.001335355,0.4111599],"genre_scores_gemma":[0.7063837,0.00004600447,0.08792585,0.01257776,0.0001105469,0.0005730611,0.00002653827,0.00004115186,0.1923154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6943027,"threshold_uncertainty_score":0.4128933,"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."}}