{"id":"W102471322","doi":"10.11575/prism/30585","title":"ASYMPTOTICALLY EFFICIENT ALGORITHMS FOR THE FROBENIUS FORM","year":2000,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Computation; Algorithm; Matrix (chemical analysis); Asymptotically optimal algorithm; Finite field; Matrix multiplication; Field (mathematics); Computational complexity theory; Invariant (physics); Discrete mathematics; Pure mathematics","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.0002791959,0.00008297004,0.0001161634,0.000060858,0.0003405392,0.00002627893,0.001022218,0.00005196753,0.0001695973],"category_scores_gemma":[0.000008633477,0.00007354728,0.0001823301,0.0002177764,0.0001383063,0.0001238073,0.0001288697,0.0000903881,0.0000273212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000143761,"about_ca_system_score_gemma":0.00003067438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004738636,"about_ca_topic_score_gemma":0.000001833905,"domain_scores_codex":[0.9993008,0.00002863734,0.00007737153,0.0002135239,0.0001766221,0.0002030182],"domain_scores_gemma":[0.9992151,0.0002331832,0.0000426729,0.0003945135,0.00004636544,0.00006811798],"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.00004523027,0.00006437691,0.00001704178,0.000006518579,0.00003186963,0.000004031234,0.001075775,0.00002317792,0.00003416847,0.1341878,0.0004833058,0.8640267],"study_design_scores_gemma":[0.0008208885,0.0001817005,0.003454558,0.00001556712,0.00004609,0.000005497418,0.00003684417,0.9068873,0.0001339258,0.02651932,0.06171632,0.0001820096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02049612,0.00009357664,0.9706992,0.001072762,0.00009699003,0.0002038832,3.687418e-7,0.00008009781,0.007257005],"genre_scores_gemma":[0.3198592,0.0001076424,0.6759945,0.0004219927,0.00004133548,0.000002284071,0.000003619519,0.00001469979,0.003554748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9068641,"threshold_uncertainty_score":0.2999171,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009492412432150656,"score_gpt":0.1910036190265119,"score_spread":0.1815112065943613,"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."}}