{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001595261,0.000461645,0.000528345,0.00148791,0.0004641117,0.0008338307,0.001726359,0.000324436,0.000009632804],"category_scores_gemma":[0.0001873058,0.0004612118,0.00009400488,0.0009377015,0.0001984679,0.0008859045,0.0006676637,0.0008274663,0.00003592624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009898352,"about_ca_system_score_gemma":0.0004208652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000208801,"about_ca_topic_score_gemma":0.0003991825,"domain_scores_codex":[0.9961463,0.0001604711,0.0007342717,0.001429258,0.0009725352,0.0005571904],"domain_scores_gemma":[0.9973572,0.0006613752,0.0003272294,0.001021766,0.0004836483,0.0001487854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009065311,0.0000497644,0.00008480894,0.00001151806,0.000004034227,0.00001859908,0.000519686,0.7741084,0.001019698,0.002822671,0.0002147959,0.2211369],"study_design_scores_gemma":[0.0003718336,0.0001475542,0.001656869,0.0007349789,0.000008377756,0.00003118396,3.72322e-7,0.9676626,0.006691723,0.021156,0.0009349817,0.0006034937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003223808,0.0001574766,0.9925504,0.0008582145,0.001083545,0.002655114,0.000007496787,0.0003340168,0.00203137],"genre_scores_gemma":[0.4913265,0.00003223732,0.5063587,0.001188772,0.000321475,0.0003259872,0.00003661169,0.00004242346,0.0003672581],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4910041,"threshold_uncertainty_score":0.9997839,"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."}}