{"id":"W3189524441","doi":"10.24963/ijcai.2021/643","title":"Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Boolean satisfiability problem; Solver; Satisfiability; Set (abstract data type); Computer science; Conjunctive normal form; Theoretical computer science; Core (optical fiber); Mathematical optimization; Algorithm; Mathematics; Programming language; 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.0008924829,0.0001387104,0.0001698565,0.000108249,0.00008892055,0.0002418308,0.0006323375,0.00008980401,0.000169506],"category_scores_gemma":[0.0003727522,0.0001374025,0.00005796051,0.0004518397,0.00002596821,0.000845793,0.0002721639,0.0002606076,0.0001052418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008759029,"about_ca_system_score_gemma":0.00011054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301714,"about_ca_topic_score_gemma":0.00007718267,"domain_scores_codex":[0.9984138,0.00005123033,0.0004356941,0.0004587236,0.0002649507,0.0003755798],"domain_scores_gemma":[0.9988067,0.0002085912,0.0001340605,0.0006762936,0.00009779355,0.00007658001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00001314836,0.0002279164,0.007361279,0.0001477727,0.00002769249,0.0003322262,0.002650858,0.0007558249,0.1871873,0.3027114,0.001244929,0.4973396],"study_design_scores_gemma":[0.0003363868,0.00002149679,0.812528,0.00007843117,0.000002782934,0.0000825519,0.0004017696,0.04938853,0.1250002,0.01056704,0.00121898,0.0003738135],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5634589,0.0001997608,0.36303,0.0008988067,0.0009533017,0.0002348428,0.000003793115,0.0004629875,0.07075766],"genre_scores_gemma":[0.5993398,0.00001109129,0.4002221,0.0002204085,0.00003484654,0.000007091165,0.000003221886,0.000007242501,0.000154218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8051667,"threshold_uncertainty_score":0.5603112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04543824220183446,"score_gpt":0.3273672162031793,"score_spread":0.2819289740013448,"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."}}