{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890649,0.001453323,0.001332916,0.001319064,0.0006514014,0.001227155,0.001332973,0.001205258,0.006080772],"category_scores_gemma":[0.01190028,0.0006639915,0.0006887101,0.0009440036,0.0009570308,0.002819214,0.001663139,0.001847781,0.001539918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009958465,"about_ca_system_score_gemma":0.001799585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001841066,"about_ca_topic_score_gemma":0.003727606,"domain_scores_codex":[0.9991892,0.0002929591,0.00005319411,0.0001537635,0.0002157145,0.00009514172],"domain_scores_gemma":[0.9950852,0.003450987,0.0003222145,0.0004014298,0.0005332805,0.0002069273],"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.0002950715,0.000202453,0.001798015,0.0004883996,0.00005481772,0.0002002021,0.0003597933,0.5415697,0.02050893,0.1021696,0.007362832,0.3249901],"study_design_scores_gemma":[0.00001301039,0.00003380979,0.0001000588,0.00001723658,0.000004420189,0.00003439712,0.00002966207,0.9653317,0.002052197,0.03134539,0.001030369,0.000007757223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.046497,0.0003041594,0.946531,0.0002866675,0.00005701595,0.0001172594,0.0001500435,0.0009827914,0.005074149],"genre_scores_gemma":[0.2065035,0.0002892031,0.7872518,0.0001402317,0.00004894248,0.0003122469,0.0007573481,0.0007971421,0.003899552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006080772,"threshold_uncertainty_score":0.02034223,"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."}}