{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415506,0.00130915,0.001556211,0.002666815,0.001048655,0.002299035,0.003292612,0.001523321,0.01966807],"category_scores_gemma":[0.007566427,0.0007699732,0.001550572,0.003583201,0.001464883,0.002609753,0.001917853,0.00311881,0.003780602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261303,"about_ca_system_score_gemma":0.002963664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007849046,"about_ca_topic_score_gemma":0.01585102,"domain_scores_codex":[0.998773,0.0005245562,0.00004974345,0.000186194,0.0003704414,0.00009600837],"domain_scores_gemma":[0.996845,0.002170276,0.00009297359,0.0004064941,0.0003952435,0.00009014069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002586631,0.0001939412,0.0006485821,0.000442978,0.0001293652,0.0000991603,0.00007542042,0.2564679,0.00183273,0.3291185,0.03626119,0.3744715],"study_design_scores_gemma":[0.00005646089,0.00003446139,0.000102404,0.0000282275,0.00002140328,0.00005843621,0.00001562598,0.8564311,0.0008785619,0.1340026,0.00835364,0.00001712313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002674197,0.0005395326,0.9820823,0.0003580934,0.0001988689,0.00009711257,0.0002995645,0.001346606,0.01240372],"genre_scores_gemma":[0.08579866,0.000426734,0.9015577,0.0002849035,0.0003281466,0.0003209895,0.0006032732,0.0007806465,0.009898869],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01966807,"threshold_uncertainty_score":0.06579626,"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."}}