{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737046,0.0001181691,0.0002092834,0.0003758604,0.0001317997,0.00007666201,0.0003602827,0.00004710852,0.000007378446],"category_scores_gemma":[0.00005304448,0.0001056467,0.0001728524,0.0006050514,0.00003347585,0.0002008281,0.00004863898,0.000107863,0.000006055114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003381978,"about_ca_system_score_gemma":0.0000761643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003997842,"about_ca_topic_score_gemma":4.558307e-7,"domain_scores_codex":[0.9988165,0.00008610889,0.0004753822,0.000164307,0.0002803295,0.0001773883],"domain_scores_gemma":[0.998447,0.0001942845,0.0004609257,0.0001103831,0.0006948595,0.00009252498],"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.0001600936,0.0006946112,0.0003829032,0.00005867708,0.0001699976,0.00001932459,0.01252235,0.08564477,0.0004851657,0.08035469,0.000951783,0.8185557],"study_design_scores_gemma":[0.001311558,0.0006723223,0.0088296,0.00006268983,0.00004446555,0.0001336197,0.0001962613,0.8973155,0.0007455114,0.09023398,0.0002459445,0.000208546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181038,0.00007041769,0.8803029,0.000167823,0.000768618,0.0001385962,0.000001110666,0.00004381157,0.0004029104],"genre_scores_gemma":[0.7078949,0.000002630841,0.2918818,0.00009266323,0.000112039,0.000003151029,0.000001032794,0.000006898528,0.000004944547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8183471,"threshold_uncertainty_score":0.4308149,"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."}}