{"id":"W4283805190","doi":"10.1609/aaai.v36i4.20280","title":"Undercover Boolean Matrix Factorization with MaxSAT","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"","keywords":"Maximum satisfiability problem; Logical matrix; Factorization; Matrix (chemical analysis); Mathematics; Implicant; Combinatorics; Discrete mathematics; Block (permutation group theory); Product (mathematics); Algorithm; Boolean function; Computer science; Boolean expression; Group (periodic table); Physics; Chemistry","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.001668806,0.0015121,0.001403102,0.0008772045,0.0009291999,0.002372195,0.001700003,0.001691469,0.008899666],"category_scores_gemma":[0.01277258,0.0007567216,0.001574375,0.00138417,0.001458985,0.004974876,0.00243603,0.002459631,0.00193592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001614286,"about_ca_system_score_gemma":0.002087194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003232914,"about_ca_topic_score_gemma":0.005969401,"domain_scores_codex":[0.9975997,0.0008054932,0.00009874262,0.0005295645,0.0006440062,0.0003225669],"domain_scores_gemma":[0.99432,0.003374157,0.0004129554,0.001385481,0.000381413,0.000125947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008834945,0.0002573482,0.002325185,0.0004857672,0.0001390603,0.0003842545,0.0003947594,0.5431982,0.007910819,0.1477066,0.02902623,0.2672884],"study_design_scores_gemma":[0.00005503564,0.00006260847,0.0001855566,0.00003722513,0.0000176335,0.0001349134,0.00007141137,0.85037,0.003511635,0.1427082,0.002827435,0.00001823611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03510077,0.0004354629,0.9526215,0.0009664941,0.00008740394,0.0001282359,0.0008408799,0.002900348,0.006918736],"genre_scores_gemma":[0.4975826,0.0004615267,0.4914962,0.0008394255,0.000188,0.0003185532,0.002863867,0.0007158695,0.005533919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008899666,"threshold_uncertainty_score":0.02977234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05503056819948492,"score_gpt":0.2889159486216709,"score_spread":0.233885380422186,"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."}}