{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297152,0.0009856222,0.0005495944,0.001925555,0.001017042,0.001562122,0.001211273,0.0006618548,0.01604765],"category_scores_gemma":[0.004002084,0.0004430717,0.0008247929,0.001828828,0.000863002,0.002697804,0.001302973,0.001223007,0.004203665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008351834,"about_ca_system_score_gemma":0.002373171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001988669,"about_ca_topic_score_gemma":0.007185588,"domain_scores_codex":[0.9993259,0.0001313814,0.00005152513,0.000152515,0.0002496541,0.00008894359],"domain_scores_gemma":[0.9984115,0.0007865638,0.0001401484,0.0002658041,0.0003228827,0.00007295163],"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.000400064,0.0002665153,0.003661175,0.0008202339,0.0001193857,0.0005358519,0.0004963488,0.04801679,0.02775592,0.4296714,0.03222765,0.4560288],"study_design_scores_gemma":[0.0001080227,0.0002157219,0.0008517505,0.0001629041,0.00009326567,0.0007106831,0.0003331716,0.420106,0.04122493,0.4643985,0.07169726,0.00009775873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03118384,0.0002680954,0.9362836,0.0003344156,0.0001243827,0.000253386,0.001257675,0.003576554,0.02671806],"genre_scores_gemma":[0.143697,0.0001946229,0.8395204,0.0002326046,0.00004763244,0.0003102839,0.002634727,0.0006320804,0.01273062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01604765,"threshold_uncertainty_score":0.05368477,"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."}}