{"id":"W4406308961","doi":"10.1016/j.laa.2025.01.010","title":"A low-complexity algorithm to search for Legendre pairs","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Mathematics; Legendre polynomials; Algorithm; Search algorithm; Combinatorics; Mathematical optimization; Mathematical analysis","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.0001483951,0.0001107618,0.0001298476,0.0001067504,0.0003702011,0.0001133651,0.0005721291,0.00005221341,0.00000789701],"category_scores_gemma":[0.00001084433,0.0001006779,0.00004082725,0.0005043276,0.00002833511,0.0001981566,0.0004350442,0.00008882368,0.00005319839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001535131,"about_ca_system_score_gemma":0.00006826331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001405998,"about_ca_topic_score_gemma":0.000002784284,"domain_scores_codex":[0.9990065,0.00001798953,0.0001745162,0.0004494784,0.0001208037,0.000230736],"domain_scores_gemma":[0.9991034,0.000100333,0.00002416107,0.0004953234,0.0001412873,0.000135464],"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.000003117198,0.00008932119,0.000009625344,0.00004341022,0.00001029218,3.023603e-7,0.0001239834,0.00002150358,0.0005944498,0.5533533,0.003276567,0.4424742],"study_design_scores_gemma":[0.0005064239,0.0000851835,0.0008698132,0.00004658708,0.00001343828,0.000004197035,0.00006531834,0.6085438,0.01663222,0.02137093,0.3515646,0.0002975841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001071059,0.0002000822,0.9937241,0.003116871,0.00007512841,0.0009051047,0.0001282281,0.000131653,0.0006477718],"genre_scores_gemma":[0.03583068,0.0001198062,0.9570983,0.002453548,0.0003830303,0.001407511,0.000158089,0.00002066449,0.002528379],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6085222,"threshold_uncertainty_score":0.4105524,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02699690164220393,"score_gpt":0.3060585453568677,"score_spread":0.2790616437146638,"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."}}