{"id":"W2242376712","doi":"10.1117/12.734195","title":"On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Polynomial basis; Matrix multiplication; Polynomial; Finite field; Multiplication (music); Polynomial matrix; Basis (linear algebra); Field (mathematics); Toeplitz matrix; Discrete mathematics; Matrix (chemical analysis); Irreducible polynomial; Field extension; Matrix polynomial; Algebra over a field; Combinatorics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001377381,0.0002992506,0.0003404548,0.0001750472,0.0001517186,0.0001655861,0.001466268,0.0001357475,0.000004438156],"category_scores_gemma":[0.001188534,0.0002570347,0.0006525397,0.0005221238,0.0001862204,0.000465015,0.0001372566,0.0002640674,0.000001403507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001040838,"about_ca_system_score_gemma":0.00003458243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003578844,"about_ca_topic_score_gemma":2.315656e-7,"domain_scores_codex":[0.9978076,2.885795e-8,0.000623474,0.0005350936,0.0006013551,0.0004324816],"domain_scores_gemma":[0.9972855,0.0007316571,0.0003724595,0.0001313656,0.001357589,0.0001213789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001424687,0.0001648373,0.0001125875,0.0003230293,0.0001121916,3.73461e-8,0.00007614249,0.0000358834,0.2822382,0.7148743,0.0007836439,0.001136734],"study_design_scores_gemma":[0.001465058,0.000929049,0.001113244,0.0003142135,0.00009450152,0.000007085931,0.0001615727,0.1510917,0.8020223,0.04003089,0.002273641,0.0004968063],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9585589,0.00004857301,0.03526583,0.004307345,0.0002702888,0.0009238762,0.00001938589,0.0001662395,0.0004395134],"genre_scores_gemma":[0.6608029,0.00000608838,0.3385336,0.0002125277,0.0002303537,0.0001486927,0.000005236299,0.00002794447,0.00003258963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6748434,"threshold_uncertainty_score":0.9999882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01629122406793056,"score_gpt":0.2520449906508605,"score_spread":0.2357537665829299,"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."}}