{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073234,0.0006121446,0.0009819897,0.002300697,0.002005886,0.002366062,0.001231388,0.001251741,0.0219178],"category_scores_gemma":[0.007880579,0.0005412785,0.001123263,0.001976853,0.001908563,0.005187001,0.001918415,0.002278251,0.002133073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009593707,"about_ca_system_score_gemma":0.001424934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001524013,"about_ca_topic_score_gemma":0.002571351,"domain_scores_codex":[0.9993548,0.0002095883,0.00003029533,0.0001335472,0.000154573,0.0001172673],"domain_scores_gemma":[0.9973265,0.001955733,0.0001672601,0.0002520795,0.0002179429,0.00008047869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006681478,0.0003023048,0.002870492,0.0004130185,0.000074607,0.0005155661,0.0005417367,0.02842574,0.003074314,0.8448021,0.01797903,0.100333],"study_design_scores_gemma":[0.0001055482,0.00008252426,0.0003069415,0.00005075675,0.00003672295,0.0001749189,0.0002886716,0.08871409,0.002753934,0.9016327,0.005826656,0.00002658869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5548507,0.001065118,0.3211194,0.007587056,0.0002954777,0.0003018265,0.001535832,0.001592054,0.1116526],"genre_scores_gemma":[0.870295,0.0002746716,0.1173875,0.0005189223,0.0001331442,0.0001173131,0.0009746548,0.0003228986,0.00997596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0219178,"threshold_uncertainty_score":0.0733223,"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."}}