{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401806,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"P.G. Demidov Yaroslavl State University","award":["Project VIP-016"],"award-info":[{"award-number":["Project VIP-016"]}]},{"name":"Yaroslavl Oblast","award":["4-np\/2023"],"award-info":[{"award-number":["4-np\/2023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01184-0","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T18:02:22Z","timestamp":1720029742000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4705-2409","authenticated-orcid":false,"given":"Andrei V.","family":"Nikolaev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9250-5115","authenticated-orcid":false,"given":"Egor V.","family":"Klimov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"1184_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.dam.2016.10.024","volume":"218","author":"NE Aguilera","year":"2017","unstructured":"Aguilera NE, Katz RD, Tolomei PB (2017) Vertex adjacencies in the set covering polyhedron. Discret Appl Math 218:40\u201356. https:\/\/doi.org\/10.1016\/j.dam.2016.10.024","journal-title":"Discret Appl Math"},{"issue":"1","key":"1184_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(98)00063-8","volume":"87","author":"AY Alfakih","year":"1998","unstructured":"Alfakih AY, Murty KG (1998) Adjacency on the constrained assignment problem. Discret Appl Math 87(1):269\u2013274. https:\/\/doi.org\/10.1016\/S0166-218X(98)00063-8","journal-title":"Discret Appl Math"},{"issue":"52","key":"1184_CR3","first-page":"7","volume":"52","author":"B Alspach","year":"2008","unstructured":"Alspach B (2008) The wonderful walecki construction. Bull Inst Combin Appl 52(52):7\u201320","journal-title":"Bull Inst Combin Appl"},{"key":"1184_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-94-009-0517-7_2","volume-title":"Decomposition into cycles i: hamilton decompositions","author":"B Alspach","year":"1990","unstructured":"Alspach B, Bermond JC, Sotteau D (1990) Decomposition into cycles i: hamilton decompositions. Springer, Netherlands, Dordrecht, pp 9\u201318. https:\/\/doi.org\/10.1007\/978-94-009-0517-7_2"},{"key":"1184_CR5","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chvat\u00e1l V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, New Jersey"},{"issue":"14","key":"1184_CR6","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1016\/j.disc.2005.11.030","volume":"306","author":"TS Arthanari","year":"2006","unstructured":"Arthanari TS (2006) On pedigree polytopes and hamiltonian cycles. Discret Math 306(14):1474\u20131492. https:\/\/doi.org\/10.1016\/j.disc.2005.11.030","journal-title":"Discret Math"},{"issue":"3","key":"1184_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.disopt.2013.07.001","volume":"10","author":"TS Arthanari","year":"2013","unstructured":"Arthanari TS (2013) Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope. Discret Optim 10(3):224\u2013232. https:\/\/doi.org\/10.1016\/j.disopt.2013.07.001","journal-title":"Discret Optim"},{"issue":"13","key":"1184_CR8","doi-asserted-by":"publisher","first-page":"4253","DOI":"10.1016\/j.disc.2008.12.027","volume":"309","author":"RF Bailey","year":"2009","unstructured":"Bailey RF (2009) Error-correcting codes from permutation groups. Discret Math 309(13):4253\u20134265. https:\/\/doi.org\/10.1016\/j.disc.2008.12.027","journal-title":"Discret Math"},{"issue":"1","key":"1184_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E Balas","year":"1975","unstructured":"Balas E, Padberg M (1975) On the set-covering problem: Ii an algorithm for set partitioning. Op Res 23(1):74\u201390. https:\/\/doi.org\/10.1287\/opre.23.1.74","journal-title":"Op Res"},{"issue":"3","key":"1184_CR10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"ML Balinski","year":"1985","unstructured":"Balinski ML (1985) Signature methods for the assignment problem. Oper Res 33(3):527\u2013536. https:\/\/doi.org\/10.1287\/opre.33.3.527","journal-title":"Oper Res"},{"issue":"9","key":"1184_CR11","first-page":"1137","volume":"44","author":"VA Bondarenko","year":"1983","unstructured":"Bondarenko VA (1983) Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms. Autom Remote Control 44(9):1137\u20131142","journal-title":"Autom Remote Control"},{"issue":"2","key":"1184_CR12","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1134\/S1064562413050062","volume":"88","author":"VA Bondarenko","year":"2013","unstructured":"Bondarenko VA, Nikolaev AV (2013) Combinatorial and geometric properties of the max-cut and min-cut problems. Dokl Math 88(2):516\u2013517. https:\/\/doi.org\/10.1134\/S1064562413050062","journal-title":"Dokl Math"},{"issue":"1","key":"1184_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1134\/S1990478918010027","volume":"12","author":"VA Bondarenko","year":"2018","unstructured":"Bondarenko VA, Nikolaev AV (2018) On the skeleton of the polytope of pyramidal tours. J Appl Ind Math 12(1):9\u201318. https:\/\/doi.org\/10.1134\/S1990478918010027","journal-title":"J Appl Ind Math"},{"issue":"2","key":"1184_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor Newsl 4(2):28\u201334. https:\/\/doi.org\/10.1145\/772862.772867","journal-title":"SIGKDD Explor Newsl"},{"doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Bounded Search Trees, Springer International Publishing, Cham, pp 51\u201376. https:\/\/doi.org\/10.1007\/978-3-319-21275-3_3","key":"1184_CR15","DOI":"10.1007\/978-3-319-21275-3_3"},{"key":"1184_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7249\/R366","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig GB (1963) Linear Programming and Extensions. RAND Corporation, Santa Monica, CA, pp 3\u20135. https:\/\/doi.org\/10.7249\/R366"},{"issue":"4","key":"1184_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig GB, Fulkerson DR, Johnson SM (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410. https:\/\/doi.org\/10.1287\/opre.2.4.393","journal-title":"J Oper Res Soc Am"},{"issue":"2","key":"1184_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0377-2217(93)90041-K","volume":"70","author":"JB De Kort","year":"1993","unstructured":"De Kort JB (1993) A branch and bound algorithm for symmetric 2-peripatetic salesman problems. Eur J Oper Res 70(2):229\u2013243. https:\/\/doi.org\/10.1016\/0377-2217(93)90041-K","journal-title":"Eur J Oper Res"},{"doi-asserted-by":"publisher","unstructured":"Dong R, Kresman R (2010) Notes on privacy-preserving distributed mining and hamiltonian cycles. In: J.A.M. Cordeiro, M.\u00a0Virvou, B.\u00a0Shishkov (eds.) ICSOFT 2010 - Proceedings of the Fifth International Conference on Software and Data Technologies, Volume 1, Athens, Greece, July 22\u201324, 2010, pp 103\u2013107. SciTePress. https:\/\/doi.org\/10.5220\/0002922001030107","key":"1184_CR19","DOI":"10.5220\/0002922001030107"},{"key":"1184_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Variable neighborhood descent","author":"A Duarte","year":"2018","unstructured":"Duarte A, S\u00e1nchez-Oro J, Mladenovi\u0107 N, Todosijevi\u0107 R (2018) Variable neighborhood descent. Springer International Publishing, Cham, pp 341\u2013367. https:\/\/doi.org\/10.1007\/978-3-319-07124-4_9"},{"key":"1184_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449\u2013467. https:\/\/doi.org\/10.4153\/CJM-1965-045-4","journal-title":"Can J Math"},{"key":"1184_CR22","first-page":"87","volume-title":"Well-solved special cases","author":"P Gilmore","year":"1985","unstructured":"Gilmore P, Lawler E, Shmoys D (1985) Well-solved special cases. Wiley, New Jersey, pp 87\u2013143"},{"issue":"1","key":"1184_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11856-017-1583-y","volume":"222","author":"R Glebov","year":"2017","unstructured":"Glebov R, Luria Z, Sudakov B (2017) The number of hamiltonian decompositions of regular graphs. Israel J Math 222(1):91\u2013108. https:\/\/doi.org\/10.1007\/s11856-017-1583-y","journal-title":"Israel J Math"},{"key":"1184_CR24","first-page":"251","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel M, Padberg M (1985) Polyhedral theory. The traveling salesman problem: a guided tour of combinatorial optimization. John Wiley, Chichester, pp 251\u2013305"},{"unstructured":"Gurobi Optimization, LLC: Gurobi 9.1.2 (2022). https:\/\/www.gurobi.com","key":"1184_CR25"},{"key":"1184_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Variable neighborhood search","author":"P Hansen","year":"2019","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J, P\u00e9rez JAM (2019) Variable neighborhood search. Springer International Publishing, Cham, pp 57\u201397. https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"issue":"3","key":"1184_CR27","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen P, Mladenovi\u0107 N, Todosijevi\u0107 R, Hanafi S (2017) Variable neighborhood search: basics and variants. EURO J Comput Optim 5(3):423\u2013454. https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J Comput Optim"},{"key":"1184_CR28","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0121197","volume-title":"Colouring criteria for adjacency on 0-1-polyhedra","author":"D Hausmann","year":"1978","unstructured":"Hausmann D, Korte B (1978) Colouring criteria for adjacency on 0-1-polyhedra. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 106\u2013127. https:\/\/doi.org\/10.1007\/BFb0121197"},{"issue":"35","key":"1184_CR29","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2011.05.004","volume":"412","author":"RW Hung","year":"2011","unstructured":"Hung RW (2011) Embedding two edge-disjoint hamiltonian cycles into locally twisted cubes. Theoret Comput Sci 412(35):4747\u20134753. https:\/\/doi.org\/10.1016\/j.tcs.2011.05.004","journal-title":"Theoret Comput Sci"},{"key":"1184_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01582240","volume":"33","author":"Y Ikura","year":"1985","unstructured":"Ikura Y, Nemhauser GL (1985) Simplex pivots on the set packing polytope. Math Program 33:123\u2013138. https:\/\/doi.org\/10.1007\/BF01582240","journal-title":"Math Program"},{"key":"1184_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Springer US, Boston, MA, pp 85\u2013103. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"1184_CR32","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jctb.2000.1991","volume":"81","author":"JH Kim","year":"2001","unstructured":"Kim JH, Wormald NC (2001) Random matchings which induce hamilton cycles and hamiltonian decompositions of random regular graphs. J Comb Theory Ser B 81(1):20\u201344. https:\/\/doi.org\/10.1006\/jctb.2000.1991","journal-title":"J Comb Theory Ser B"},{"doi-asserted-by":"publisher","unstructured":"Knuth DE (1997) The art of computer programming, Volume 2 (3rd Ed.): Seminumerical Algorithms. Addison-Wesley Longman Publishing Co., Inc., USA. https:\/\/doi.org\/10.5555\/270146","key":"1184_CR33","DOI":"10.5555\/270146"},{"key":"1184_CR34","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-86433-0_15","volume-title":"Mathematical optimization theory and operations research: recent trends","author":"A Kostenko","year":"2021","unstructured":"Kostenko A, Nikolaev A (2021) An iterative ilp approach for constructing a hamiltonian decomposition of a regular multigraph. In: Strekalovsky A, Kochetov Y, Gruzdeva T, Orlov A (eds) Mathematical optimization theory and operations research: recent trends. Springer International Publishing, Cham, pp 216\u2013232. https:\/\/doi.org\/10.1007\/978-3-030-86433-0_15"},{"doi-asserted-by":"publisher","unstructured":"Kozlova A, Nikolaev A (2019) Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope. In: Mathematical Optimization Theory and Operations Research. MOTOR 2019, LNCS, vol. 11548, pp. 374\u2013389. Springer.https:\/\/doi.org\/10.1007\/978-3-030-22629-9_26","key":"1184_CR35","DOI":"10.1007\/978-3-030-22629-9_26"},{"key":"1184_CR36","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-94-011-7557-9_8","volume-title":"Combinatorial programming: methods and applications","author":"J Krarup","year":"1995","unstructured":"Krarup J (1995) The peripatetic salesman and some related unsolved problems. In: Roy B (ed) Combinatorial programming: methods and applications, vol 19. Springer, Netherlands, Dordrecht, pp 173\u2013178. https:\/\/doi.org\/10.1007\/978-94-011-7557-9_8"},{"issue":"1","key":"1184_CR37","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10107-013-0723-3","volume":"147","author":"C Michini","year":"2014","unstructured":"Michini C, Sassano A (2014) The hirsch conjecture for the fractional stable set polytope. Math Program 147(1):309\u2013330. https:\/\/doi.org\/10.1007\/s10107-013-0723-3","journal-title":"Math Program"},{"issue":"4","key":"1184_CR38","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J ACM"},{"issue":"11","key":"1184_CR39","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput Oper Res"},{"doi-asserted-by":"publisher","unstructured":"Nikolaev A (2019) On vertex adjacencies in the polytope of pyramidal tours with step-backs. In: Mathematical Optimization Theory and Operations Research. MOTOR 2019, LNCS, vol. 11548, pp. 247\u2013263. Springer. https:\/\/doi.org\/10.1007\/978-3-030-22629-9_18","key":"1184_CR40","DOI":"10.1007\/978-3-030-22629-9_18"},{"doi-asserted-by":"publisher","unstructured":"Nikolaev A (2022) Dataset of 4-regular multigraphs for the second Hamiltonian decomposition problem.https:\/\/doi.org\/10.17632\/5ky8z86f5b.1","key":"1184_CR41","DOI":"10.17632\/5ky8z86f5b.1"},{"key":"1184_CR42","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/s10878-020-00652-7","volume":"42","author":"A Nikolaev","year":"2021","unstructured":"Nikolaev A, Kozlova A (2021) Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search. J Comb Optim 42:212\u2013230. https:\/\/doi.org\/10.1007\/s10878-020-00652-7","journal-title":"J Comb Optim"},{"key":"1184_CR43","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-36626-1_5","volume-title":"Optimisation, Econometric and Financial Analysis","author":"A Orman","year":"2007","unstructured":"Orman A, Williams H (2007) A survey of different integer programming formulations of the travelling salesman problem. In: Kontoghiorghes EJ, Gatu C (eds) Optimisation, Econometric and Financial Analysis. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 91\u2013104. https:\/\/doi.org\/10.1007\/3-540-36626-1_5"},{"issue":"1","key":"1184_CR44","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg M, Rinaldi G (1990) An efficient algorithm for the minimum capacity cut problem. Math Program 47(1):19\u201336. https:\/\/doi.org\/10.1007\/BF01580850","journal-title":"Math Program"},{"issue":"1","key":"1184_CR45","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01588973","volume":"14","author":"CH Papadimitriou","year":"1978","unstructured":"Papadimitriou CH (1978) The adjacency relation on the traveling salesman polytope is np-complete. Math Program 14(1):312\u2013324. https:\/\/doi.org\/10.1007\/BF01588973","journal-title":"Math Program"},{"issue":"2","key":"1184_CR46","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(84)90101-X","volume":"8","author":"B P\u00e9roche","year":"1984","unstructured":"P\u00e9roche B (1984) NP-completeness of some problems of partitioning and covering in graphs. Discret Appl Math 8(2):195\u2013208. https:\/\/doi.org\/10.1016\/0166-218X(84)90101-X","journal-title":"Discret Appl Math"},{"issue":"1","key":"1184_CR47","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10100-016-0437-8","volume":"25","author":"U Pferschy","year":"2017","unstructured":"Pferschy U, Stan\u011bk R (2017) Generating subtour elimination constraints for the TSP from pure integer solutions. CEJOR 25(1):231\u2013260. https:\/\/doi.org\/10.1007\/s10100-016-0437-8","journal-title":"CEJOR"},{"issue":"2","key":"1184_CR48","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0130021","volume":"30","author":"MR Rao","year":"1976","unstructured":"Rao MR (1976) Adjacency of the traveling salesman tours and 0\u20131 vertices. SIAM J Appl Math 30(2):191\u2013198. https:\/\/doi.org\/10.1137\/0130021","journal-title":"SIAM J Appl Math"},{"doi-asserted-by":"publisher","unstructured":"Rowley R, Bose B (1991) Edge-disjoint hamiltonian cycles in de bruijn networks. https:\/\/doi.org\/10.1109\/DMCC.1991.633359","key":"1184_CR49","DOI":"10.1109\/DMCC.1991.633359"},{"key":"1184_CR50","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte WT (1954) A short proof of the factor theorem for finite graphs. Can J Math 6:347\u2013352. https:\/\/doi.org\/10.4153\/CJM-1954-033-3","journal-title":"Can J Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01184-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01184-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01184-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:42:20Z","timestamp":1721659340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01184-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1184"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01184-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"24 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"89"}}