{"id":"W2161526001","doi":"10.1109/hldvt.2005.1568836","title":"B-cubing theory: new possibilities for efficient SAT-solving","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Correctness; Boolean satisfiability problem; Maximum satisfiability problem; Generalization; Range (aeronautics); Boolean expression; Pruning; Theoretical computer science; Solver; Standard Boolean model; Satisfiability modulo theories; Boolean circuit; And-inverter graph; Boolean function; Programming language; Algorithm; Mathematics","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.0009988662,0.0000919448,0.00009389274,0.00006927256,0.0001384714,0.0001773841,0.000510063,0.00003870187,0.00001732105],"category_scores_gemma":[0.0001978685,0.00007757814,0.0000607445,0.0001835379,0.00003237258,0.0002608349,0.0001024964,0.0000467003,0.00002713515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005764781,"about_ca_system_score_gemma":0.00006319726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009210464,"about_ca_topic_score_gemma":0.000006008233,"domain_scores_codex":[0.9990493,0.00006279762,0.0002076673,0.0002789814,0.0001519756,0.0002492953],"domain_scores_gemma":[0.9990861,0.0002821412,0.00006501811,0.0004642104,0.00005954402,0.00004291875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004207667,0.0000161591,0.00004062375,0.000008522048,0.000001785838,1.391336e-7,0.0003221071,0.001035651,0.0009904748,0.9680893,0.0005775194,0.02891348],"study_design_scores_gemma":[0.0003478564,0.00007715722,0.002015916,0.00002054561,0.000005427365,0.000006616976,0.0001579427,0.575061,0.03690399,0.3814134,0.003739756,0.0002503795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01852885,0.0001005959,0.967838,0.0001814007,0.0004430116,0.0002275642,7.428898e-7,0.0002728694,0.012407],"genre_scores_gemma":[0.1662053,3.437258e-7,0.8278734,0.0001191548,0.0001190893,0.00001344627,0.000001375809,0.000006713348,0.005661166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5866759,"threshold_uncertainty_score":0.3163545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362827668597089,"score_gpt":0.280469644698652,"score_spread":0.2568413680126811,"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."}}