{"id":"W2788459610","doi":"10.1609/aaai.v32i1.12203","title":"A SAT+CAS Method for Enumerating Williamson Matrices of Even Order","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Solver; Satisfiability; Order (exchange); Symbolic computation; Field (mathematics); Boolean satisfiability problem; Computation; Domain (mathematical analysis); Discrete mathematics; Computer science; Mathematics; Algebra over a field; Combinatorics; Algorithm; Pure 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001739401,0.0001964231,0.0003007604,0.0001474906,0.0002183371,0.0001418783,0.002039628,0.0001047542,0.00003032759],"category_scores_gemma":[0.001893836,0.0001502403,0.0001141644,0.001016957,0.0002782317,0.0005436336,0.0003020205,0.0001690251,0.00002641355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003851002,"about_ca_system_score_gemma":0.0001115093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000045833,"about_ca_topic_score_gemma":0.000008289138,"domain_scores_codex":[0.9980319,0.00004252079,0.0007099122,0.0004661432,0.0004370652,0.0003124615],"domain_scores_gemma":[0.9966972,0.0002437094,0.000815922,0.0003733331,0.001812187,0.00005766976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005978467,0.0000606011,0.00007063025,0.0000748889,0.00001318237,2.414204e-8,0.002192733,0.00002125089,0.09110308,0.7019832,0.0000559596,0.2043647],"study_design_scores_gemma":[0.0000194671,0.0003182756,0.00008841891,0.0001398426,0.0000114907,0.000002053744,0.000247042,0.2445411,0.6460482,0.1083065,0.0001570093,0.000120579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02796649,0.00002538377,0.966827,0.0009000074,0.0004776618,0.0006001481,0.000006573217,0.00006256971,0.003134174],"genre_scores_gemma":[0.4894404,0.00001031423,0.5102791,0.000072392,0.00008548869,0.00003546178,2.47361e-7,0.000008734401,0.00006791942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5936767,"threshold_uncertainty_score":0.612662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1032482280250316,"score_gpt":0.3815032565618653,"score_spread":0.2782550285368338,"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."}}