{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:13Z","timestamp":1740122473772,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/203.272\/2017"],"award-info":[{"award-number":["E-26\/203.272\/2017"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303726\/2017-2"],"award-info":[{"award-number":["303726\/2017-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-020-00618-9","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T08:02:36Z","timestamp":1593417756000},"page":"994-1009","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A general framework for path convexities"],"prefix":"10.1007","volume":"43","author":[{"given":"Jo\u00e3o Vinicius C.","family":"Thompson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loana T.","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raquel S. F.","family":"Bravo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitre C.","family":"Dourado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"618_CR1","first-page":"109","volume":"44","author":"RT Araujo","year":"2013","unstructured":"Araujo RT, Sampaio RM, Szwarcfiter JL (2013) The convexity of induced paths of order three. Discrete Math 44:109\u2013114","journal-title":"Discrete Math"},{"issue":"2","key":"618_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs. J Algorithms 12(2):308\u2013340","journal-title":"J Algorithms"},{"key":"618_CR3","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1080\/00207160210954","volume":"79","author":"M Atici","year":"2002","unstructured":"Atici M (2002) Computational complexity of geodetic set. Int J Comput Math 79:587\u2013591","journal-title":"Int J Comput Math"},{"issue":"1\u20132","key":"618_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender HL (1998) A partial k-arboretum of graphs with bounded treewidth. Theor Comput Sci 209(1\u20132):1\u201345","journal-title":"Theor Comput Sci"},{"key":"618_CR5","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"RB Borie","year":"1992","unstructured":"Borie RB, Parker RG, Tovey CA (1992) Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7:555\u2013581","journal-title":"Algorithmica"},{"key":"618_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt A, Le VB, Spinrad JP (1999) Graph classes: a survey, vol 3. SIAM, Philadelphia"},{"key":"618_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ipl.2018.02.012","volume":"135","author":"LR Bueno","year":"2018","unstructured":"Bueno LR, Penso LD, Protti F, Ramos VR, Rautenbach D, Souza US (2018) On the hardness of finding the geodetic number of a subcubic graph. Inf Process Lett 135:22\u201327","journal-title":"Inf Process Lett"},{"issue":"4","key":"618_CR8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.7151\/dmgt.1638","volume":"32","author":"J C\u00e1ceres","year":"2012","unstructured":"C\u00e1ceres J, Oellermann OR, Puertas ML (2012) Minimal trees and monophonic convexity. Discussiones Mathematicae Graph Theory 32(4):685\u2013704","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"618_CR9","doi-asserted-by":"crossref","unstructured":"Cappelle MR, Coelho EMM, Coelho H, Silva BR, Protti F, Souza US (2019) P3-hull number of graphs with diameter two. In: Latin and American algorithms, graphs and optimization symposium. LAGOS 2019. Electronic notes in theoretical computer science, vol 346, pp 309\u2013320","DOI":"10.1016\/j.entcs.2019.08.028"},{"key":"618_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.endm.2009.02.003","volume":"32","author":"CC Centeno","year":"2009","unstructured":"Centeno CC, Dourado MC, Szwarcfiter JL (2009) On the convexity of paths of length two in undirected graphs. Electron Notes Discrete Math 32:11\u201318","journal-title":"Electron Notes Discrete Math"},{"issue":"5","key":"618_CR11","first-page":"175","volume":"12","author":"CC Centeno","year":"2010","unstructured":"Centeno CC, Dantas S, Dourado MC, Rautenbach D, Szwarcfiter JL (2010) Convex partitions of graphs induced by paths of order three. Discrete Math 12(5):175\u2013184","journal-title":"Discrete Math"},{"key":"618_CR12","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","volume":"412","author":"CC Centeno","year":"2011","unstructured":"Centeno CC, Dourado MC, Penso LD, Rautenbach D, Szwarcfiter JL (2011) Irreversible interval of graphs. Theor Comput Sci 412:3693\u20133700","journal-title":"Theor Comput Sci"},{"key":"618_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0012-365X(98)00394-X","volume":"206","author":"M Changat","year":"1999","unstructured":"Changat M, Mathew J (1999) On triangle path convexity in graphs. Discrete Math 206:91\u201395","journal-title":"Discrete Math"},{"issue":"3","key":"618_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.disc.2004.02.017","volume":"286","author":"M Changat","year":"2004","unstructured":"Changat M, Mathew J (2004) Induced path transit function, monotone and Peano axioms. Discrete Math 286(3):185\u2013194","journal-title":"Discrete Math"},{"issue":"2","key":"618_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1013715518448","volume":"51","author":"M Changat","year":"2001","unstructured":"Changat M, Klavzar S, Mulder HM (2001) The all-paths transit function of a graph. Czechoslovak Math J 51(2):439\u2013448","journal-title":"Czechoslovak Math J"},{"issue":"2\u20133","key":"618_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.disc.2003.07.014","volume":"290","author":"M Changat","year":"2005","unstructured":"Changat M, Mulder HM, Sierksma G (2005) Convexities related to path properties on graphs. Discrete Math 290(2\u20133):117\u2013131","journal-title":"Discrete Math"},{"issue":"6","key":"618_CR17","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1016\/j.disc.2008.02.043","volume":"309","author":"M Changat","year":"2009","unstructured":"Changat M, Narasimha-Shenoi PG, Mathews J (2009) Triangle path transit functions, betweenness and pseudo-modular graphs. Discrete Math 309(6):1575\u20131583","journal-title":"Discrete Math"},{"key":"618_CR18","first-page":"111","volume":"82","author":"M Changat","year":"2010","unstructured":"Changat M, Narasimha-Shenoi PG, Pelayo I (2010) The longest path transit function of a graph and betweenness. Utilitas Math 82:111\u2013127","journal-title":"Utilitas Math"},{"key":"618_CR19","first-page":"97","volume":"64","author":"G Chartrand","year":"2003","unstructured":"Chartrand G, Garry L, Zhang P (2003) The detour number of a graph. Utilitas Math 64:97\u2013113","journal-title":"Utilitas Math"},{"key":"618_CR20","first-page":"75","volume":"52","author":"G Chartrand","year":"2005","unstructured":"Chartrand G, Escuadro H, Zhang P (2005) Detour distance in graphs. J Combin Math Combin Comput 52:75\u201394","journal-title":"J Combin Math Combin Comput"},{"issue":"2","key":"618_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0166-218X(96)00007-8","volume":"73","author":"V Chepoi","year":"1997","unstructured":"Chepoi V (1997) Peakless functions on graphs. Discrete Appl Math 73(2):175\u2013189","journal-title":"Discrete Appl Math"},{"key":"618_CR22","doi-asserted-by":"crossref","unstructured":"Courcelle B (1997) The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of graph grammars and computing by graph transformations, vol 1, pp 313\u2013400","DOI":"10.1142\/9789812384720_0005"},{"issue":"1","key":"618_CR23","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"25","author":"B Courcelle","year":"1990","unstructured":"Courcelle B (1990) The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf Comput 25(1):12\u201375","journal-title":"Inf Comput"},{"key":"618_CR24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle B (1992) The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Informatique Th\u00e9orique et Applications 26:257\u2013286","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"618_CR25","volume-title":"Graph structure and monadic second-order logic","author":"B Courcelle","year":"2011","unstructured":"Courcelle B, Engelfriet J (2011) Graph structure and monadic second-order logic. Cambridge University Press, Cambridge"},{"issue":"1","key":"618_CR26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B Courcelle","year":"1993","unstructured":"Courcelle B, Mosbah M (1993) Monadic second-order evaluations on tree-decomposable graphs. Theor Comput Sci 109(1):49\u201382","journal-title":"Theor Comput Sci"},{"issue":"2","key":"618_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle B, Makowsky JA, Rotics U (2000) Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput Syst 33(2):125\u2013150","journal-title":"Theory Comput Syst"},{"key":"618_CR28","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory, 3rd edn. Springer, Berlin","edition":"3"},{"key":"618_CR29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.dam.2016.01.015","volume":"206","author":"MC Dourado","year":"2016","unstructured":"Dourado MC, Sampaio RM (2016) Complexity aspects of the triangle path convexity. Discrete Appl Math 206:39\u201347","journal-title":"Discrete Appl Math"},{"key":"618_CR30","doi-asserted-by":"crossref","first-page":"5668","DOI":"10.1016\/j.disc.2008.04.020","volume":"309","author":"MC Dourado","year":"2009","unstructured":"Dourado MC, Gimbel JG, Kratochvil J, Protti F, Szwarcfiter JL (2009) On the computation of the hull number of a graph. Discrete Math 309:5668\u20135674","journal-title":"Discrete Math"},{"key":"618_CR31","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1016\/j.dam.2009.11.016","volume":"158","author":"MC Dourado","year":"2010","unstructured":"Dourado MC, Protti F, Szwarcfiter JL (2010) Complexity results related to monophonic convexity. Discrete Math 158:1268\u20131274","journal-title":"Discrete Math"},{"issue":"16","key":"618_CR32","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1016\/j.disc.2012.05.002","volume":"312","author":"MC Dourado","year":"2012","unstructured":"Dourado MC, Rautenbach D, dos Santos VF, Sch\u00e4fer PM, Szwarcfiter JL, Toman A (2012) An upper bound on the $$P_3$$-Radon number. Discrete Math 312(16):2433\u20132437","journal-title":"Discrete Math"},{"key":"618_CR33","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/S0895480195321718","volume":"12","author":"FF Dragan","year":"1999","unstructured":"Dragan FF, Nicolai F, Brandst\u00e4dt A (1999) Convexity and HHD-free graphs. SIAM J Discrete Math 12:119\u2013135","journal-title":"SIAM J Discrete Math"},{"key":"618_CR34","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10878-015-9968-5","volume":"33","author":"MA Duarte","year":"2017","unstructured":"Duarte MA, Penso LD, Rautenbach D, Souza US (2017) Complexity properties of complementary prisms. J Combin Optim 33:365\u2013372","journal-title":"J Combin Optim"},{"key":"618_CR35","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0095-8956(88)90039-1","volume":"44","author":"P Duchet","year":"1988","unstructured":"Duchet P (1988) Convex sets in graphs, II. Minimal path convexity. J Combin Theory Ser B 44:307\u2013316","journal-title":"J Combin Theory Ser B"},{"issue":"3","key":"618_CR36","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M Farber","year":"1986","unstructured":"Farber M, Jamison RE (1986) Convexity in graphs and hypergraphs. SIAM J Algebr Discrete Methods 7(3):433\u2013444","journal-title":"SIAM J Algebr Discrete Methods"},{"key":"618_CR37","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(87)90099-9","volume":"66","author":"M Farber","year":"1987","unstructured":"Farber M, Jamison RE (1987) On local convexity in graphs. Discrete Math 66:231\u2013247","journal-title":"Discrete Math"},{"key":"618_CR38","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00373-002-0518-4","volume":"19","author":"JG Gimbel","year":"2003","unstructured":"Gimbel JG (2003) Some remarks on the convexity number of a graph. Graphs Combin 19:357\u2013361","journal-title":"Graphs Combin"},{"issue":"7","key":"618_CR39","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1016\/j.dam.2008.07.010","volume":"157","author":"G Gutin","year":"2009","unstructured":"Gutin G, Yeo A (2009) On the number of connected convex subgraphs of a connected acyclic digraph. Discrete Appl Math 157(7):1660\u20131662","journal-title":"Discrete Appl Math"},{"key":"618_CR40","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.tcs.2005.10.021","volume":"351","author":"R Haas","year":"2006","unstructured":"Haas R, Hoffmann M (2006) Chordless path through three vertices. Theor Comput Sci 351:360\u2013371","journal-title":"Theor Comput Sci"},{"key":"618_CR41","first-page":"323","volume":"20","author":"F Harary","year":"1984","unstructured":"Harary F (1984) Convexity in graphs: achievement and avoidance games. Ann Discrete Math 20:323","journal-title":"Ann Discrete Math"},{"key":"618_CR42","doi-asserted-by":"crossref","first-page":"185","DOI":"10.4310\/jdg\/1214436096","volume":"16","author":"F Harary","year":"1981","unstructured":"Harary F, Nieminen J (1981) Convexity in graphs. J Differ Geom 16:185\u2013190","journal-title":"J Differ Geom"},{"issue":"11","key":"618_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary F, Loukakis E, Tsouros C (1993) The geodetic number of a graph. Math Comput Model 17(11):89\u201395","journal-title":"Math Comput Model"},{"issue":"3","key":"618_CR44","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlin\u011bn\u1ef3","year":"2008","unstructured":"Hlin\u011bn\u1ef3 P, Oum S, Seese D, Gottlob G (2008) Width parameters beyond tree-width and their applications. Comput J 51(3):326\u2013362","journal-title":"Comput J"},{"key":"618_CR45","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-642-35843-2_24","volume":"7741","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9 MM, Nourine L (2013) Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. Theory and practice of computer science. Lect Notes Comput Sci 7741:268\u2013279","journal-title":"Lect Notes Comput Sci"},{"key":"618_CR46","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10479-017-2666-1","volume":"264","author":"CVGC Lima","year":"2018","unstructured":"Lima CVGC, Protti F, Rautenbach D, Souza US, Szwarcfiter JL (2018) And\/or-convexity: a graph convexity based on processes and deadlock models. Ann Oper Res 264:267\u2013286","journal-title":"Ann Oper Res"},{"issue":"1","key":"618_CR47","doi-asserted-by":"crossref","first-page":"173","DOI":"10.21136\/CMJ.1994.128449","volume":"44","author":"L Nebesk\u00fd","year":"1994","unstructured":"Nebesk\u00fd L (1994) A characterization of the interval function of a connected graph. Czechoslov Math J 44(1):173\u2013178","journal-title":"Czechoslov Math J"},{"issue":"2","key":"618_CR48","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1137\/070691383","volume":"23","author":"MH Nielsen","year":"2011","unstructured":"Nielsen MH, Oellermann OR (2011) Steiner trees and convex geometries. SIAM J Discrete Math 23(2):680\u2013693","journal-title":"SIAM J Discrete Math"},{"key":"618_CR49","first-page":"177","volume":"36","author":"DB Parker","year":"2006","unstructured":"Parker DB, Westhoff RF, Wolf MJ (2006) Two-path convexity in clone-free regular multipartite tournaments. Australas J Combin 36:177\u2013196","journal-title":"Australas J Combin"},{"key":"618_CR50","unstructured":"Parvathy KS (1995) Studies on convex structures with emphasis on convexity in graphs. Ph.D. Thesis, Cochin University, Kochi"},{"key":"618_CR51","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-8699-2","volume-title":"Geodesic convexity in graphs","author":"IM Pelayo","year":"2013","unstructured":"Pelayo IM (2013) Geodesic convexity in graphs. Springer, New York"},{"key":"618_CR52","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2015.10.003","volume":"607","author":"LD Penso","year":"2015","unstructured":"Penso LD, Protti F, Rautenbach D, Souza US (2015) Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor Comput Sci 607:83\u201395","journal-title":"Theor Comput Sci"},{"key":"618_CR53","first-page":"2153","volume":"312","author":"I Peterin","year":"2012","unstructured":"Peterin I (2012) The pre-hull number and lexicographic product. Discrete Appl Math 312:2153\u20132157","journal-title":"Discrete Appl Math"},{"issue":"10","key":"618_CR54","first-page":"1065","volume":"15","author":"E Sampathkumar","year":"1984","unstructured":"Sampathkumar E (1984) Convex sets in a graph. Indian J Pure Appl Math 15(10):1065\u20131071","journal-title":"Indian J Pure Appl Math"},{"key":"618_CR55","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/978-3-030-27195-4_25","volume":"11640","author":"JVC Thompson","year":"2019","unstructured":"Thompson JVC, Nogueira LT, Protti F, Bravo RSF, Dourado MC, Souza US (2019) A general framework for path convexities. Algorithmic aspects in information and management. AAIM 2019. Lect Notes Comput Sci 11640:272\u2013283","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"618_CR56","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M Thorup","year":"1998","unstructured":"Thorup M (1998) All structured programs have small tree width and good register allocation. Inf Comput 142(2):159\u2013181","journal-title":"Inf Comput"},{"key":"618_CR57","volume-title":"Theory of convex structures","author":"MLJ van de Vel","year":"1993","unstructured":"van de Vel MLJ (1993) Theory of convex structures. Elsevier, North Holland"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00618-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00618-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00618-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T19:03:01Z","timestamp":1667156581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00618-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["618"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00618-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}