{"id":"W1975277392","doi":"10.1103/physreve.90.033315","title":"Faster identification of optimal contraction sequences for tensor networks","year":2014,"lang":"en","type":"article","venue":"Physical Review E","topic":"Quantum many-body systems","field":"Physics and Astronomy","cited_by":78,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Industry Canada; Austrian Science Fund; Ontario Ministry of Research and Innovation; Government of Canada","keywords":"Pruning; Contraction (grammar); Tensor (intrinsic definition); Quantum; Computer science; Tensor contraction; Mathematics; Dynamic programming; Algorithm; Physics; Quantum mechanics; Pure mathematics; Tensor product","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":[],"consensus_categories":[],"category_scores_codex":[0.0002863068,0.000100555,0.0003380618,0.0000120655,0.00003887236,0.00002031501,0.0001012918,0.00001259287,0.00002377382],"category_scores_gemma":[0.0000355996,0.00007986705,0.0001783518,0.00007817205,0.00003668619,0.0001309593,0.00001187524,0.00006071282,0.00004124908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008650697,"about_ca_system_score_gemma":0.00001072306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002407219,"about_ca_topic_score_gemma":2.516005e-7,"domain_scores_codex":[0.9991334,0.00007358147,0.0003402276,0.0001776872,0.0001138698,0.0001612115],"domain_scores_gemma":[0.9991307,0.0001739357,0.0003277914,0.0002073321,0.0001156269,0.000044637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004101616,0.0005524446,0.004749408,0.002940957,0.0002253386,9.354896e-8,0.0001765466,0.00232142,0.04313322,0.7320529,0.003367577,0.210439],"study_design_scores_gemma":[0.0006842574,0.0002085429,0.004829397,0.001728717,0.0003994581,6.108859e-7,0.00007804552,0.9250663,0.007492853,0.01046024,0.04861181,0.0004397521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4411765,0.002358612,0.5509241,0.000494322,0.0005348821,0.002050387,0.0000507643,0.00004814501,0.00236229],"genre_scores_gemma":[0.9986569,0.00005660085,0.0001152935,0.00005315412,0.0008309258,0.0001626266,0.00003773572,0.00001130044,0.00007543877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9227449,"threshold_uncertainty_score":0.3256884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0177510951620015,"score_gpt":0.3114681698451172,"score_spread":0.2937170746831156,"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."}}