{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T23:10:15Z","timestamp":1772233815521,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T00:00:00Z","timestamp":1610755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T00:00:00Z","timestamp":1610755200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00500-020-05502-6","type":"journal-article","created":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T16:02:36Z","timestamp":1610812956000},"page":"1731-1749","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes"],"prefix":"10.1007","volume":"25","author":[{"given":"Yuya","family":"Sugie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1402-7840","authenticated-orcid":false,"given":"Yuki","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3025-7141","authenticated-orcid":false,"given":"Normann","family":"Mertig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5949-2252","authenticated-orcid":false,"given":"Takashi","family":"Takemoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Teramoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7078-8655","authenticated-orcid":false,"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5633-995X","authenticated-orcid":false,"given":"Ichigaku","family":"Takigawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanao","family":"Yamaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7175-8474","authenticated-orcid":false,"given":"Tamiki","family":"Komatsuzaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,16]]},"reference":[{"issue":"50","key":"5502_CR1","doi-asserted-by":"publisher","first-page":"7018","DOI":"10.1016\/j.tcs.2011.09.015","volume":"412","author":"I Adler","year":"2011","unstructured":"Adler I, Dorn F, Fomin FV, Sau I, Thilikos DM (2011) Faster parameterized algorithms for minor containment. Theor Comput Sci 412(50):7018\u20137028","journal-title":"Theor Comput Sci"},{"key":"5502_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47\u201397. https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev Mod Phys"},{"key":"5502_CR3","unstructured":"Aramon M, Rosenberg G, Valiante E, Miyazawa T, Tamura H, Katzgraber HG (2018) Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. arXiv:1806.08815"},{"key":"5502_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-58942-4_8","volume-title":"Integration of constraint programming, artificial intelligence, and operations research","author":"DE Bernal","year":"2020","unstructured":"Bernal DE, Booth KEC, Dridi R, Alghassi H, Tayur S, Venturelli D (2020) Integer programming techniques for minor-embedding in quantum annealers. In: Hebrard E, Musliu N (eds) Integration of constraint programming, artificial intelligence, and operations research. Springer, Cham, pp 112\u2013129"},{"key":"5502_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-007-9056-z","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender HL, Grigoriev A, Koster AMCA (2008) Treewidth lower bounds with brambles. Algorithmica 51:81\u201398. https:\/\/doi.org\/10.1007\/s00453-007-9056-z","journal-title":"Algorithmica"},{"key":"5502_CR6","volume-title":"Random graphs","author":"B Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s B (1985) Random graphs, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"key":"5502_CR7","unstructured":"Boothby K, Bunyk P, Raymond J, Roy A (2019) Next-generation topology of d-wave quantum processor. Technical Report (last accessed 3102020) pp 1\u201321, https:\/\/www.dwavesys.com\/sites\/default\/files\/14-1026A-C_Next-Generation-Topology-of-DW-Quantum-Processors.pdf"},{"issue":"1","key":"5502_CR8","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11128-015-1150-6","volume":"15","author":"T Boothby","year":"2016","unstructured":"Boothby T, King AD, Roy A (2016) Fast clique minor generation in chimera qubit connectivity graphs. Quantum Inf Process 15(1):495\u2013508. https:\/\/doi.org\/10.1007\/s11128-015-1150-6","journal-title":"Quantum Inf Process"},{"key":"5502_CR9","unstructured":"Cai J, Macready B, Roy A (2014) A practical heuristic for finding graph minors. arxiv:1406.2741"},{"issue":"5","key":"5502_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","volume":"7","author":"V Choi","year":"2008","unstructured":"Choi V (2008) Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf Process 7(5):193\u2013209","journal-title":"Quantum Inf Process"},{"issue":"3","key":"5502_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11128-010-0200-3","volume":"10","author":"V Choi","year":"2011","unstructured":"Choi V (2011) Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Quantum Inf Process 10(3):343\u2013353","journal-title":"Quantum Inf Process"},{"key":"5502_CR12","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Clifford S (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge","edition":"3"},{"key":"5502_CR13","unstructured":"D-Wave Systems Inc. (since 2007) See publications in technology section on the homepage of D-Wave Systems Inc., last accessed july 20th, 2018. https:\/\/www.dwavesys.com\/"},{"key":"5502_CR14","doi-asserted-by":"crossref","unstructured":"Date P, Patton R, Schuman C, Potok T (2019) Efficiently embedding qubo problems on adiabatic quantum computers. Quantum Information Processing 18","DOI":"10.1007\/s11128-019-2236-3"},{"key":"5502_CR15","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) Statistical mechanics of complex networks. Publ Math 6:290\u2013297","journal-title":"Publ Math"},{"issue":"5516","key":"5502_CR16","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi E, Goldstone J, Gutmann S, Lapan J, Lundgren A, Preda D (2001) A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292(5516):472\u2013475","journal-title":"Science"},{"key":"5502_CR17","doi-asserted-by":"crossref","unstructured":"Fomin FV, Kratsch D (2010) Exact exponential algorithms, 1st edn. Springer. https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"issue":"5","key":"5502_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s11128-018-1863-4","volume":"17","author":"TD Goodrich","year":"2018","unstructured":"Goodrich TD, Sullivan BD, Humble TS (2018) Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Inf Process 17(5):118. https:\/\/doi.org\/10.1007\/s11128-018-1863-4","journal-title":"Quantum Inf Process"},{"key":"5502_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin R (1976) S-functions for graphs. J Geom 8:171","journal-title":"J Geom"},{"key":"5502_CR20","unstructured":"Hitachi Ltd. (2018) Hitachi ltd., news release, last accessed february 20th, 2018. http:\/\/www.hitachi.co.jp\/New\/cnews\/month\/2018\/06\/0615.html"},{"key":"5502_CR21","doi-asserted-by":"publisher","DOI":"10.1126\/science.aah4243","author":"T Inagaki","year":"2016","unstructured":"Inagaki T, Haribara Y, Igarashi K, Sonobe T, Tamate S, Honjo T, Marandi A, McMahon PL, Umeki T, Enbutsu K, Tadanaga O, Takenouchi H, Aihara K, Kawarabayashi Ki, Inoue K, Utsunomiya S, Takesue H (2016) A coherent Ising machine for 2000-node optimization problems. Science. https:\/\/doi.org\/10.1126\/science.aah4243","journal-title":"Science"},{"key":"5502_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cpc.2015.02.015","volume":"192","author":"SV Isakov","year":"2015","unstructured":"Isakov SV, Zintchenko IN, R\u00f8nnow TF, Troyer M (2015) Optimised simulated annealing for Ising spin glasses. Comput Phys Commun 192:265\u2013271","journal-title":"Comput Phys Commun"},{"key":"5502_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson MW, Amin MHS, Gildert S, Lanting T, Hamze F, Dickson N, Harris R, Berkley AJ, Johansson J, Bunyk P, Chapple EM, Enderud C, Hilton JP, Kand Karimi E, Ladizinsky Ladizinsky N, Oh T, Perminov I, Rich C, Thom MC, Tolkacheva E, Truncik CJS, Uchaikin S, Wang J, Wilson B, Rose G (2011) Quantum annealing with manufactured spins. Nature 473:194\u2013198","journal-title":"Nature"},{"key":"5502_CR24","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki T, Nishimori H (1998) Quantum annealing in the transverse Ising model. Phys Rev E 58:5355\u20135363","journal-title":"Phys Rev E"},{"issue":"2","key":"5502_CR25","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K Ki","year":"2012","unstructured":"Ki K, Kobayashi Y, Reed B (2012) The disjoint paths problem in quadratic time. J Combinat Theory Ser B 102(2):424\u2013435. https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004","journal-title":"J Combinat Theory Ser B"},{"issue":"4598","key":"5502_CR26","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"3","key":"5502_CR27","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11128-013-0683-9","volume":"13","author":"C Klymko","year":"2014","unstructured":"Klymko C, Sullivan BD, Humble TS (2014) Adiabatic quantum programming: minor embedding with hard faults. Quantum Inf Process 13(3):709\u2013729","journal-title":"Quantum Inf Process"},{"issue":"1","key":"5502_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger G, Hao JK, Glover F, Lewis M, L\u00fc Z, Wang H, Wang Y (2014) The unconstrained binary quadratic programming problem: a survey. J Combinat Optim 28(1):58\u201381","journal-title":"J Combinat Optim"},{"key":"5502_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Front Phys 2:5","journal-title":"Front Phys"},{"key":"5502_CR30","doi-asserted-by":"crossref","unstructured":"Matsubara S, Tamura H, Takatsu M, Yoo D, Vatankhahghadim B, Miyazawa Yamasaki T H, Tsukamoto S, Watanabe Y, Kea Takemoto (2018) Ising-model optimizer with parallel-trial bit-sieve engine. In: Barolli L, Terzo O (eds) Complex intelligent, intensive software. Springer International Publishing, Systems, pp 423\u2013428","DOI":"10.1007\/978-3-319-61566-0_39"},{"issue":"6312","key":"5502_CR31","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1126\/science.aah5178","volume":"354","author":"PL McMahon","year":"2016","unstructured":"McMahon PL, Marandi A, Haribara Y, Hamerly R, Langrock C, Tamate S, Inagaki T, Takesue H, Utsunomiya S, Aihara K, Byer RL, Fejer MM, Mabuchi H, Yamamoto Y (2016) A fully programmable 100-spin coherent Ising machine with all-to-all connections. Science 354(6312):614\u2013617","journal-title":"Science"},{"key":"5502_CR32","unstructured":"Neven H, Denchev VS, Drew-Brook M, Zhang J, Macready WG, Rose G (2009) NIPS demonstration 2009: binary classification using hardware implementation of quantum annealing"},{"key":"5502_CR33","doi-asserted-by":"crossref","unstructured":"Okada S, Ohzeki M, Terabe M, Taguchi S (2019) Improving solutions by embedding larger subproblems in a d-wave quantum annealer. Sci Rep 9","DOI":"10.1038\/s41598-018-38388-4"},{"key":"5502_CR34","first-page":"97","volume":"116","author":"T Okuyama","year":"2016","unstructured":"Okuyama T, Yoshimura C, Hayashi M, Tanaka S, Yamaoka M (2016) Contractive graph-minor embedding for CMOS Ising computer. IEICE Tech Rep 116:97\u2013103","journal-title":"IEICE Tech Rep"},{"key":"5502_CR35","doi-asserted-by":"crossref","unstructured":"Okuyama T, Hayashi M, Yamaoka M (2017) An Ising computer based on simulated quantum annealing by path integral monte carlo method. In: 2017 IEEE international conference on rebooting computing (ICRC), pp 1\u20136","DOI":"10.1109\/ICRC.2017.8123652"},{"key":"5502_CR36","doi-asserted-by":"publisher","first-page":"012111","DOI":"10.1103\/PhysRevE.100.012111","volume":"100","author":"T Okuyama","year":"2019","unstructured":"Okuyama T, Sonobe T, Ki Kawarabayashi, Yamaoka M (2019) Binary optimization by momentum annealing. Phys Rev E 100:012111. https:\/\/doi.org\/10.1103\/PhysRevE.100.012111","journal-title":"Phys Rev E"},{"key":"5502_CR37","doi-asserted-by":"crossref","unstructured":"Pinilla J, Wilton S (2019) Layout-aware embedding for quantum annealing processors. In: M W, G J, C T, P S (eds) High performance computing, Springer, Cham, vol 11501, pp 111\u2013123, https:\/\/doi.org\/10.1007\/978-3-030-20656-7_7","DOI":"10.1007\/978-3-030-20656-7_7"},{"issue":"1","key":"5502_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson N, Seymour P (1995) Graph minors. xiii. the disjoint paths problem. J Combinat Theory Ser B 63(1):65\u2013110. https:\/\/doi.org\/10.1006\/jctb.1995.1006","journal-title":"J Combinat Theory Ser B"},{"key":"5502_CR39","doi-asserted-by":"crossref","unstructured":"Robertson N, Seymour PD (1986) Graph Minors. II. Algorithmic Aspects of Tree-Width. J Alg 7:309","DOI":"10.1016\/0196-6774(86)90023-4"},{"issue":"4","key":"5502_CR40","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A Steger","year":"1999","unstructured":"Steger A, Wormald NC (1999) Generating random regular graphs quickly. Combin Probab Comput 8(4):377\u2013396","journal-title":"Combin Probab Comput"},{"key":"5502_CR41","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-04070-3_9","volume-title":"Theory and practice of natural computing","author":"Y Sugie","year":"2018","unstructured":"Sugie Y, Yoshida Y, Mertig N, Takemoto T, Teramoto H, Nakamura A, Takigawa I, Minato SI, Yamaoka M, Komatsuzaki T (2018) Graph minors from simulated annealing for annealing machines with sparse connectivity. In: Fagan D, Mart\u00edn-Vide C, O\u2019Neill M, Vega-Rodr\u00edguez MA (eds) Theory and practice of natural computing. Springer, Cham, pp 111\u2013123"},{"key":"5502_CR42","unstructured":"Takemoto T, Hayashi M, Yoshimura C, Yamaoka M (2019) A 2x30k-spin multichip scalable annealing processor based on a processing-in-memory approach for solving large-scale combinatorial optimization problems. IEEE International Solid-State Circuits Conference (ISSCC), Dig Tech Papers pp 52\u201353"},{"key":"5502_CR43","first-page":"8","volume":"53","author":"S Tsukamoto","year":"2017","unstructured":"Tsukamoto S, Takatsu M, Matsubara S, Tamura H (2017) An accelerator architecture for combinatorial optimization problems. FUJITSU Sci Tech J 53:8\u201313","journal-title":"FUJITSU Sci Tech J"},{"key":"5502_CR44","doi-asserted-by":"publisher","first-page":"031040","DOI":"10.1103\/PhysRevX.5.031040","volume":"5","author":"D Venturelli","year":"2015","unstructured":"Venturelli D, Mandr\u00e0 S, Knysh S, O\u2019Gorman B, Biswas R, Smelyanskiy V (2015) Quantum optimization of fully connected spin glasses. Phys Rev X 5:031040. https:\/\/doi.org\/10.1103\/PhysRevX.5.031040","journal-title":"Phys Rev X"},{"issue":"13","key":"5502_CR45","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1021\/acs.jpcb.7b10371","volume":"122","author":"R Xia","year":"2018","unstructured":"Xia R, Bian T, Kais S (2018) Electronic structure calculations and the Ising Hamiltonian. J Phys Chem B 122(13):3384\u20133395","journal-title":"J Phys Chem B"},{"key":"5502_CR46","unstructured":"Yamamoto K, Ando K, Normann M, Takemoto T, Masanao Y, Teramoto H, Sakai A, Shinya TY, Masato M (2020) 7.3 statica: A 512-spin 0.25m-weight full-digital annealing processor with a near-memory all-spin-updates-at-once architecture for combinatorial optimization with complete spin-spin interactions. IEEE International Solid-State Circuits Conference (ISSCC), Dig Tech Papers pp 52\u201353. https:\/\/doi.org\/10.1109\/ISSCC19947.2020.9062965, https:\/\/ieeexplore.ieee.org\/abstract\/document\/9062965"},{"key":"5502_CR47","doi-asserted-by":"crossref","unstructured":"Yamamoto K, Kawamura K, Ando K, Mertig N, Takemoto T, Yamaoka M, Teramoto H, Sakai A, Takamaeda-Yamazaki S, Motomura M (2020) Statica: A 512-spin 0.25m-weight annealing processor with an all-spin-updates-at-once architecture for combinatorial optimization with complete spin-spin interactions. IEEE Journal of Solid-State Circuits pp 1\u20131. https:\/\/doi.org\/10.1109\/JSSC.2020.3027702","DOI":"10.1109\/JSSC.2020.3027702"},{"issue":"1","key":"5502_CR48","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/JSSC.2015.2498601","volume":"51","author":"M Yamaoka","year":"2016","unstructured":"Yamaoka M, Yoshimura C, Hayashi M, Okuyama T, Aoki H, Mizuno H (2016) A 20k-spin ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J Solid-State Circuits 51(1):303\u2013309","journal-title":"IEEE J Solid-State Circuits"},{"issue":"5","key":"5502_CR49","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s11128-017-1569-z","volume":"16","author":"A Zaribafiyan","year":"2017","unstructured":"Zaribafiyan A, Marchand DJJ, Changiz Rezaei SS (2017) Systematic and deterministic graph minor embedding for cartesian products of graphs. Quantum Inf Process 16(5):136. https:\/\/doi.org\/10.1007\/s11128-017-1569-z","journal-title":"Quantum Inf Process"},{"key":"5502_CR50","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-50743-5_10","volume-title":"High performance computing","author":"S Zbinden","year":"2020","unstructured":"Zbinden S, B\u00e4rtschi A, Djidjev H, Eidenbenz S (2020) Embedding algorithms for quantum annealers with chimera and pegasus connection topologies. In: Sadayappan P, Chamberlain BL, Juckeland G, Ltaief H (eds) High performance computing. Springer, Cham, pp 187\u2013206"},{"key":"5502_CR51","doi-asserted-by":"publisher","first-page":"077201","DOI":"10.1103\/PhysRevLett.115.077201","volume":"115","author":"Z Zhu","year":"2015","unstructured":"Zhu Z, Ochoa AJ, Katzgraber HG (2015) Efficient cluster algorithm for spin glasses in any space dimension. Phys Rev Lett 115:077201","journal-title":"Phys Rev Lett"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05502-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-05502-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05502-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T14:18:46Z","timestamp":1613312326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-05502-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,16]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["5502"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05502-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,16]]},"assertion":[{"value":"16 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}