{"id":"W4401974097","doi":"10.37256/cm.5320243304","title":"An Efficient Algorithm for Solving the 2-MAXSAT Problem","year":2024,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Maximum satisfiability problem; Mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Computer science; 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.0007386626,0.001737939,0.00103409,0.001220883,0.00128207,0.001934656,0.002186025,0.001929962,0.01668949],"category_scores_gemma":[0.002540983,0.000919792,0.001337591,0.002190926,0.0006100857,0.003589169,0.002027518,0.001602476,0.005686691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251409,"about_ca_system_score_gemma":0.002814677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836442,"about_ca_topic_score_gemma":0.003619226,"domain_scores_codex":[0.9987809,0.0002233727,0.00008033438,0.0003591685,0.000332334,0.000223888],"domain_scores_gemma":[0.99935,0.0002635006,0.00005514777,0.0001791463,0.0001164585,0.00003568917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005414986,0.0006093708,0.0008719747,0.0006333471,0.00012318,0.0003036433,0.0002532458,0.07880265,0.01712798,0.09304599,0.069264,0.7384232],"study_design_scores_gemma":[0.0006035383,0.0002606015,0.0007128027,0.000108898,0.00009080644,0.0007177236,0.0001771711,0.7320111,0.01411117,0.1676255,0.08349954,0.0000812531],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008467036,0.0005557636,0.9657255,0.0008847133,0.0002210243,0.0003794103,0.000573915,0.005941112,0.01725147],"genre_scores_gemma":[0.07700271,0.0003759763,0.9122088,0.0003412007,0.00009804235,0.0003991982,0.001613389,0.0004515715,0.007509092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01668949,"threshold_uncertainty_score":0.05583185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04618635100849945,"score_gpt":0.3021554689343263,"score_spread":0.2559691179258269,"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."}}