{"id":"W2000760108","doi":"10.1016/j.jsc.2011.12.009","title":"Efficient algorithms for order basis computation","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Order (exchange); Degree (music); Computation; Algorithm; Matrix (chemical analysis); Row; Field (mathematics); Exponent; Matrix multiplication; Normal basis; Row and column spaces; Combinatorics; Discrete mathematics; Computer science; Pure mathematics; Geometry; Galois theory","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.001333644,0.001242848,0.001566197,0.001948831,0.001517329,0.003536185,0.002068243,0.001397499,0.01216368],"category_scores_gemma":[0.007990655,0.0008329275,0.001221256,0.003185476,0.001844166,0.005355988,0.00352198,0.004134789,0.004153505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001906033,"about_ca_system_score_gemma":0.002072537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001749614,"about_ca_topic_score_gemma":0.003493557,"domain_scores_codex":[0.9982219,0.0004463287,0.000110158,0.0002149579,0.0007202539,0.0002863237],"domain_scores_gemma":[0.9967518,0.001511534,0.0001004426,0.001125929,0.0003907691,0.0001196113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003562194,0.0001876151,0.0004324483,0.000173953,0.00004902196,0.0000514081,0.0002417056,0.02542833,0.003006611,0.6816602,0.01458367,0.2738288],"study_design_scores_gemma":[0.00009584886,0.00003651238,0.00008740431,0.00002731528,0.00002209535,0.00004119791,0.00004550444,0.1076819,0.002185124,0.8833323,0.006424969,0.0000198703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02341248,0.0008682473,0.9499494,0.0008825781,0.0003082447,0.0001542358,0.000339711,0.002285255,0.02179983],"genre_scores_gemma":[0.3154993,0.0009934308,0.6635072,0.0004015872,0.0003054906,0.0004659493,0.001142803,0.0009294068,0.01675498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01216368,"threshold_uncertainty_score":0.04069155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04028607635485304,"score_gpt":0.2782715342282155,"score_spread":0.2379854578733624,"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."}}