{"id":"W1954679557","doi":"10.1007/11758501_39","title":"Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Oak Ridge National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; UT-Battelle; Battelle; National Science Foundation","keywords":"Tensor contraction; Contraction (grammar); Computer science; Tensor (intrinsic definition); Associative property; Cartesian tensor; Algorithm; Algebra over a field; Applied mathematics; Mathematics; Tensor product; Pure mathematics; Tensor density; Exact solutions in general relativity; Tensor field; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.002328777,0.00134914,0.001527122,0.001438487,0.0008514122,0.001319806,0.001508426,0.0007710955,0.004681085],"category_scores_gemma":[0.01178938,0.000596229,0.0008840279,0.001778419,0.001146395,0.00327819,0.001636122,0.001640727,0.0009155152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006935138,"about_ca_system_score_gemma":0.002379085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00166338,"about_ca_topic_score_gemma":0.004847351,"domain_scores_codex":[0.9981445,0.0005925897,0.0001257388,0.0001732228,0.0006606596,0.000303268],"domain_scores_gemma":[0.9936699,0.002997551,0.0003979568,0.001318008,0.001389272,0.0002273383],"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.001418176,0.0004959772,0.003178472,0.0005328697,0.0001039987,0.0003293297,0.0005357119,0.1163013,0.05593446,0.09950356,0.01192422,0.709742],"study_design_scores_gemma":[0.00009100347,0.0002705547,0.0007456309,0.00005777564,0.0001104754,0.0001964997,0.0001935671,0.8631499,0.04307259,0.08801824,0.004049466,0.00004429238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1161619,0.0004934529,0.8755409,0.0003807131,0.000138062,0.0001857071,0.000130082,0.002040663,0.004928558],"genre_scores_gemma":[0.3474755,0.000332814,0.6450059,0.0001448272,0.0001036864,0.0001929788,0.0004006882,0.001211276,0.005132359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004681085,"threshold_uncertainty_score":0.01565975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03318684147215604,"score_gpt":0.339915394699827,"score_spread":0.3067285532276709,"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."}}