{"id":"W2966446838","doi":"10.1016/j.jsc.2019.10.013","title":"Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Binary Golay code; Mathematics; Sequence (biology); Algebraic number; Symbolic computation; Algorithm; Search algorithm; Conjecture; Satisfiability; Computation; Discrete mathematics; Combinatorics","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.0005315957,0.0001412587,0.000319891,0.0002545724,0.00004352723,0.00009298347,0.0001188304,0.00005040031,0.00002393231],"category_scores_gemma":[0.00000481595,0.0001257019,0.00008001631,0.0002368444,0.00001948214,0.0001751774,0.00002817195,0.0001913414,0.00007936901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000476753,"about_ca_system_score_gemma":0.00001434671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004676736,"about_ca_topic_score_gemma":0.000001630586,"domain_scores_codex":[0.9988615,0.0001043712,0.0004521206,0.0001054457,0.0002712411,0.0002053004],"domain_scores_gemma":[0.9994296,0.0001065404,0.00009281027,0.00009390728,0.0001221785,0.0001550068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001625943,0.0001360066,0.01506431,0.001604191,0.0006631064,0.00004447086,0.02813869,0.4580325,0.01714089,0.003193642,0.003095888,0.4727237],"study_design_scores_gemma":[0.001698734,0.0007843951,0.09289031,0.0004228662,0.00005309903,0.0006675011,0.0009934488,0.8972041,0.000328842,0.002965166,0.001589306,0.000402206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8895276,0.0001054746,0.1091584,0.00008526633,0.0006323508,0.0003037354,0.000001093368,0.00005635165,0.0001297714],"genre_scores_gemma":[0.9964426,0.000005723567,0.003248501,0.00004934851,0.0002025149,0.00000265077,0.000003968541,0.00002391952,0.00002074971],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4723215,"threshold_uncertainty_score":0.5125976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01170022914688148,"score_gpt":0.2303518437023994,"score_spread":0.2186516145555179,"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."}}