{"id":"W3099726793","doi":"10.29007/91wj","title":"The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices","year":2019,"lang":"en","type":"paratext","venue":"EasyChair preprint","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"DPLL algorithm; Mathematics; Satisfiability; Combinatorics; Solver; Conjecture; Computer science; Discrete mathematics; Mathematical optimization","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.002096602,0.001593782,0.001231423,0.002903979,0.001533526,0.002828378,0.002676364,0.001217194,0.01989082],"category_scores_gemma":[0.00892027,0.001025849,0.002240811,0.003590592,0.002217811,0.004094874,0.002570605,0.003488458,0.005364901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724966,"about_ca_system_score_gemma":0.002817153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004423216,"about_ca_topic_score_gemma":0.009149282,"domain_scores_codex":[0.9971541,0.00105238,0.0001450146,0.0005769392,0.0008851393,0.0001864182],"domain_scores_gemma":[0.9950979,0.003201268,0.0002065415,0.0008089736,0.0005591442,0.000126084],"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.0001632597,0.0001426552,0.0008558779,0.0007639124,0.0001440668,0.0002222171,0.0001669258,0.07419502,0.003423484,0.5867528,0.02954542,0.3036244],"study_design_scores_gemma":[0.00009665476,0.00005946079,0.0001738761,0.0001149866,0.00005507112,0.0002595214,0.00005937431,0.3693396,0.004943874,0.5763963,0.04845345,0.00004792315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001713469,0.0005012061,0.9847402,0.0004021336,0.0001495079,0.0001193097,0.0002918306,0.001940048,0.01014226],"genre_scores_gemma":[0.05231885,0.000520723,0.938941,0.0003691873,0.0002194952,0.0002996855,0.0008780235,0.0007007889,0.005752242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01989082,"threshold_uncertainty_score":0.06654143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171623392903355,"score_gpt":0.3016068056143432,"score_spread":0.2844444663240077,"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."}}