{"id":"W2921963619","doi":"10.1007/s10472-019-09681-3","title":"The SAT+CAS method for combinatorial search with applications to best matrices","year":2019,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Satisfiability; Computer science; DPLL algorithm; Variety (cybernetics); Mathematics; Theoretical computer science; Combinatorics; Algorithm; Discrete mathematics; Artificial intelligence","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.0006691305,0.00008490871,0.0001515376,0.00003485322,0.00009959754,0.00005857351,0.0001635253,0.0000328377,0.000005904677],"category_scores_gemma":[0.00001895096,0.00005706974,0.00003719423,0.0001677054,0.00003771668,0.00003588785,0.00001913223,0.00005149345,0.00004295949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002234334,"about_ca_system_score_gemma":0.000007201611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007563897,"about_ca_topic_score_gemma":0.00001002083,"domain_scores_codex":[0.9993595,0.00001389998,0.0002535612,0.00009953175,0.0001164038,0.0001571202],"domain_scores_gemma":[0.9990415,0.0005504162,0.00003974125,0.0001980199,0.0001189278,0.00005138164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002153118,0.00005383673,0.00001158328,0.0003083441,0.00003801834,1.060265e-7,0.001032109,0.002924127,0.002475061,0.9630966,0.00005020376,0.02998849],"study_design_scores_gemma":[0.00004383706,0.0004693056,0.000007014924,0.0001863624,0.00002978972,0.000005551869,0.007682336,0.08887771,0.2515309,0.6427016,0.008192424,0.0002731683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2233641,0.0005089245,0.7731084,0.0002984128,0.0001828481,0.001299955,0.00002714112,0.00004090177,0.001169314],"genre_scores_gemma":[0.9855304,0.0001204359,0.01405356,0.00001649955,0.00006955815,0.0001313691,0.000001421725,0.00001839098,0.00005839346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7621663,"threshold_uncertainty_score":0.2327237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08461102999157805,"score_gpt":0.3603761015870476,"score_spread":0.2757650715954696,"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."}}