{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:15:46Z","timestamp":1780409746110,"version":"3.54.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031998713","type":"print"},{"value":"9783031998720","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99872-0_5","type":"book-chapter","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T11:08:43Z","timestamp":1755774523000},"page":"63-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Optimal Contraction Strategies for\u00a0the\u00a0Scalar Product in\u00a0the\u00a0Tensor-Train Format"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4459-1497","authenticated-orcid":false,"given":"Atte","family":"Torri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0984-9213","authenticated-orcid":false,"given":"Przemys\u0142aw","family":"Dominikowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2262-2224","authenticated-orcid":false,"given":"Brice","family":"Pointal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-1516","authenticated-orcid":false,"given":"Oguz","family":"Kaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0997-586X","authenticated-orcid":false,"given":"La\u00e9rcio","family":"Lima Pilla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2924-284X","authenticated-orcid":false,"given":"Olivier","family":"Coulaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"108337","DOI":"10.1016\/j.patcog.2021.108337","volume":"122","author":"C Chen","year":"2022","unstructured":"Chen, C., Batselier, K., Yu, W., Wong, N.: Kernelized support tensor train machines. Pattern Recogn. 122, 108337 (2022)","journal-title":"Pattern Recogn."},{"key":"5_CR2","unstructured":"Dudek, J.M., Due\u00f1as-Osorio, L., Vardi, M.Y.: Efficient contraction of large tensor networks for weighted model counting through graph decompositions. arXiv (2019)"},{"key":"5_CR3","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 201\u2013208. AUAI Press, Arlington, Virginia, USA (2004)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"410","DOI":"10.22331\/q-2021-03-15-410","volume":"5","author":"J Gray","year":"2021","unstructured":"Gray, J., Kourtis, S.: Hyper-optimized tensor network contraction. Quantum 5, 410 (2021)","journal-title":"Quantum"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/11428831_20","volume-title":"Computational Science \u2013 ICCS 2005","author":"A Hartono","year":"2005","unstructured":"Hartono, A., et al.: Automated operation minimization of tensor contraction expressions in electronic structure calculations. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2005. LNCS, vol. 3514, pp. 155\u2013164. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11428831_20"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00365-011-9131-1","volume":"34","author":"BN Khoromskij","year":"2011","unstructured":"Khoromskij, B.N.: O(dlogN)-quantics approximation of N-d tensors in high-dimensional numerical modeling. Constr. Approx. 34(2), 257\u2013280 (2011)","journal-title":"Constr. Approx."},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"02","key":"5_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S0129626497000176","volume":"07","author":"CC Lam","year":"1997","unstructured":"Lam, C.C., Sadayappan, P., Wenger, R.: On optimizing a class of multi-dimensional loops with reduction for parallel execution. Parall. Process. Lett. 07(02), 157\u2013168 (1997)","journal-title":"Parall. Process. Lett."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/050644756","volume":"38","author":"IL Markov","year":"2008","unstructured":"Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38(3), 963\u2013981 (2008)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","unstructured":"Merom, E., Maron, H., Mannor, S., Chechick, G.: Optimizing tensor network contraction using reinforcement learning. In: Proceedings of the 39th International Conference on Machine Learning, vol.\u00a0162, pp. 15278\u201315292. PMLR (2022)"},{"key":"5_CR11","unstructured":"Orgler, S., Blacher, M.: Optimizing tensor contraction paths: a greedy algorithm approach with improved cost functions. arXiv (2024)"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"033315","DOI":"10.1103\/PhysRevE.90.033315","volume":"90","author":"RNC Pfeifer","year":"2014","unstructured":"Pfeifer, R.N.C., Haegeman, J., Verstraete, F.: Faster identification of optimal contraction sequences for tensor networks. Phys. Rev. E 90(3), 033315 (2014)","journal-title":"Phys. Rev. E"},{"issue":"12","key":"5_CR14","doi-asserted-by":"publisher","first-page":"124101","DOI":"10.1063\/1.4962420","volume":"145","author":"M Rakhuba","year":"2016","unstructured":"Rakhuba, M., Oseledets, I.V.: Calculating vibrational spectra of molecules using TT decomposition. J. Chem. Phys. 145(12), 124101 (2016)","journal-title":"J. Chem. Phys."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Schlag, S., Heuer, T., Gottesb\u00fcren, L., Akhremtsev, Y., Schulz, C., Sanders, P.: High-quality hypergraph partitioning. ACM J. Exp. Algorithmics 27, 1.9:1\u20131.9:39 (2023)","DOI":"10.1145\/3529090"},{"key":"5_CR16","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv (2017)"},{"key":"5_CR17","unstructured":"Strasser, B.: Computing tree decompositions with FlowCutter: PACE 2017 submission. arXiv (2017)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99872-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:24:38Z","timestamp":1780406678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99872-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"ISBN":["9783031998713","9783031998720"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99872-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"22 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}