{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000870895,0.001238105,0.001254199,0.002788038,0.001152794,0.001900164,0.001751077,0.001245493,0.01342302],"category_scores_gemma":[0.006467383,0.0005751459,0.0008268601,0.003008764,0.0009744982,0.003010787,0.00275085,0.001875763,0.006939437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006507899,"about_ca_system_score_gemma":0.001588772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001281623,"about_ca_topic_score_gemma":0.002336195,"domain_scores_codex":[0.9989123,0.0002307686,0.00008890501,0.0002177555,0.0004198274,0.0001303249],"domain_scores_gemma":[0.9984478,0.0006476854,0.00009319006,0.0004072965,0.0003235313,0.00008053398],"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.0004285325,0.0002086271,0.0008003849,0.0002770816,0.0000823986,0.0001546619,0.000222995,0.01389656,0.02313115,0.09459455,0.02798055,0.8382226],"study_design_scores_gemma":[0.0003324976,0.0004316232,0.000943506,0.0001137402,0.0001104492,0.00124364,0.0003742158,0.5694969,0.04015758,0.3458866,0.04072822,0.0001810622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01091214,0.0003710698,0.9808977,0.0002846344,0.0001981498,0.0001385611,0.0001971695,0.002129555,0.004871117],"genre_scores_gemma":[0.07460713,0.0001769584,0.9184071,0.0002230823,0.0001058882,0.0002124096,0.0007773696,0.0003298374,0.005160259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01342302,"threshold_uncertainty_score":0.04490447,"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."}}