{"id":"W4239560685","doi":"10.1109/dac.2005.193910","title":"Efficient SAT solving: beyond supercubes","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pruning; Computer science; Speedup; Boolean satisfiability problem; Benchmark (surveying); Maximum satisfiability problem; Solver; Theoretical computer science; Boolean function; Algorithm; Programming language; Parallel computing","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":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001766405,0.0003457782,0.0003095001,0.0004212866,0.0003597838,0.0008673813,0.001204093,0.0002031351,0.0001982532],"category_scores_gemma":[0.0003565718,0.0003327841,0.00008599301,0.0006708957,0.0001140883,0.001483097,0.0001929347,0.0002643172,0.0008509583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002429253,"about_ca_system_score_gemma":0.000251578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003960075,"about_ca_topic_score_gemma":0.000001241124,"domain_scores_codex":[0.9971042,0.00007724939,0.0006656963,0.000726698,0.0007622155,0.0006639675],"domain_scores_gemma":[0.9983572,0.00009285232,0.0002954739,0.0003940628,0.0006229404,0.0002374445],"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.00002282204,0.0002731699,0.0002328963,0.00008166729,0.00003224855,0.000001626615,0.004929539,0.003924532,0.02734515,0.8217582,0.008672047,0.1327261],"study_design_scores_gemma":[0.000330918,0.00008236955,0.001588705,0.00004721189,0.0000135594,0.00003592363,0.0001094886,0.9548234,0.03038977,0.003434881,0.008731784,0.0004120298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01475499,0.0001270517,0.9556574,0.0009646341,0.0003994038,0.0006291843,0.00000246625,0.001247143,0.0262177],"genre_scores_gemma":[0.4382619,0.00001522838,0.5607064,0.0002416216,0.0001376756,0.00007521897,0.000003727744,0.00001626838,0.0005419694],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9508988,"threshold_uncertainty_score":0.999927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04063998466356675,"score_gpt":0.274707702467188,"score_spread":0.2340677178036212,"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."}}