{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:03:05Z","timestamp":1760709785743,"version":"3.37.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108274"},{"type":"electronic","value":"9783030108281"}],"license":[{"start":{"date-parts":[[2018,12,22]],"date-time":"2018-12-22T00:00:00Z","timestamp":1545436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10828-1_5","type":"book-chapter","created":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T06:48:05Z","timestamp":1545374885000},"page":"54-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Gaps and Well-Composed Objects in the Triangular Grid"],"prefix":"10.1007","author":[{"given":"Lidija","family":"\u010comi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,22]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0167-8655(89)90042-1","volume":"9","author":"G Borgefors","year":"1989","unstructured":"Borgefors, G.: Distance transformations on hexagonal grids. Pattern Recognit. Lett. 9(2), 97\u2013105 (1989)","journal-title":"Pattern Recognit. Lett."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Borgefors, G., Sanniti di Baja, G.: Skeletonizing the distance transform on the hexagonal grid. In: 9th International Conference on Pattern Recognition, ICPR, pp. 504\u2013507 (1988)","DOI":"10.1109\/ICPR.1988.28278"},{"key":"5_CR3","unstructured":"Boutry, N.: A study of well-composedness in n-D (Une \u00e9tude du bien-compos\u00e9 en dimension n). Ph.D. thesis, University of Paris-Est, France (2016)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: How to make nD images well-composed without interpolation. In: 2015 IEEE International Conference on Image Processing, ICIP 2015, pp. 2149\u20132153 (2015)","DOI":"10.1109\/ICIP.2015.7351181"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10851-017-0769-6","volume":"60","author":"N Boutry","year":"2018","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: A tutorial on well-composedness. J. Math. Imaging Vis. 60(3), 443\u2013478 (2018)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0031-3203(98)00132-0","volume":"32","author":"Ernesto Bribiesca","year":"1999","unstructured":"Bribiesca, E.: A new chain code. Pattern Recognit. 32(2), 235\u2013251 (1999)","journal-title":"Pattern Recognition"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.dam.2008.05.025","volume":"157","author":"VE Brimkov","year":"2009","unstructured":"Brimkov, V.E.: Formulas for the number of $$(n-2)$$(n-2)-gaps of binary objects in arbitrary dimension. Discret. Appl. Math. 157(3), 452\u2013463 (2009)","journal-title":"Discret. Appl. Math."},{"key":"5_CR8","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G.: An explicit formula for the number of tunnels in digital objects. CoRR abs\/cs\/0505084 (2005). http:\/\/arxiv.org\/abs\/cs\/0505084"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11774938_2","volume-title":"Combinatorial Image Analysis","author":"VE Brimkov","year":"2006","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G.: Counting gaps in binary pictures. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, pp. 16\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11774938_2"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11595755_5","volume-title":"Advances in Visual Computing","author":"VE Brimkov","year":"2005","unstructured":"Brimkov, V.E., Maimone, A., Nordo, G., Barneva, R.P., Klette, R.: The number of gaps in binary pictures. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds.) ISVC 2005. LNCS, vol. 3804, pp. 35\u201342. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11595755_5"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11907350_16","volume-title":"Discrete Geometry for Computer Imagery","author":"VE Brimkov","year":"2006","unstructured":"Brimkov, V.E., Moroni, D., Barneva, R.: Combinatorial relations for digital pictures. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 189\u2013198. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11907350_16"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0218654308001129","volume":"14","author":"VE Brimkov","year":"2008","unstructured":"Brimkov, V.E., Nordo, G., Barneva, R.P., Maimone, A.: Genus and dimension of digital images and their time- and space-efficient computation. Int. J. Shape Model. 14(2), 147\u2013168 (2008)","journal-title":"Int. J. Shape Model."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-05288-1_1","volume-title":"Combinatorial Image Analysis","author":"L \u010comi\u0107","year":"2018","unstructured":"\u010comi\u0107, L.: On gaps in digital objects. In: Barneva, R., Brimkov, V., Tavares, J. (eds.) IWCIA 2018. LNCS, vol. 11255, pp. 3\u201316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05288-1_1"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"\u010comi\u0107, L., Magillo, P.: Repairing 3D binary images using the BCC grid with a 4-valued combinatorial coordinate system. Inf. Sci. (2019, to appear)","DOI":"10.1016\/j.ins.2018.02.049"},{"issue":"10","key":"5_CR15","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1109\/T-C.1970.222808","volume":"19","author":"ES Deutsch","year":"1970","unstructured":"Deutsch, E.S.: On parallel operations on hexagonal arrays. IEEE Trans. Comput. 19(10), 982\u2013983 (1970)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"5_CR16","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1145\/361573.361583","volume":"15","author":"ES Deutsch","year":"1972","unstructured":"Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal, and triangular arrays. Commun. ACM 15(9), 827\u2013837 (1972)","journal-title":"Commun. ACM"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.patrec.2018.01.009","volume":"103","author":"M Dutt","year":"2018","unstructured":"Dutt, M., Andres, E., Largeteau-Skapin, G.: Characterization and generation of straight line segments on triangular cell grid. Pattern Recognit. Lett. 103, 68\u201374 (2018)","journal-title":"Pattern Recognit. Lett."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-26145-4_9","volume-title":"Combinatorial Image Analysis","author":"M Dutt","year":"2015","unstructured":"Dutt, M., Biswas, A., Nagy, B.: Number of shortest paths in triangular grid for 1- and 2-neighborhoods. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 115\u2013124. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26145-4_9"},{"issue":"2\u20133","key":"5_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF00119834","volume":"6","author":"AV Evako","year":"1996","unstructured":"Evako, A.V., Kopperman, R., Mukhin, Y.V.: Dimensional properties of graphs and digital spaces. J. Math. Imaging Vis. 6(2\u20133), 109\u2013119 (1996)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TC.1979.1675305","volume":"28","author":"H Freeman","year":"1979","unstructured":"Freeman, H.: Algorithm for generating a digital straight line on a triangular grid. IEEE Trans. Comput. 28(2), 150\u2013152 (1979)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"5_CR21","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/T-C.1969.222756","volume":"18","author":"MJE Golay","year":"1969","unstructured":"Golay, M.J.E.: Hexagonal parallel pattern transformations. IEEE Trans. Comput. 18(8), 733\u2013740 (1969)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.dam.2014.08.036","volume":"183","author":"R Gonz\u00e1lez-D\u00edaz","year":"2015","unstructured":"Gonz\u00e1lez-D\u00edaz, R., Jim\u00e9nez, M.-J., Medrano, B.: 3D well-composed polyhedral complexes. Discret. Appl. Math. 183, 59\u201377 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10851-017-0722-8","volume":"59","author":"R Gonz\u00e1lez-D\u00edaz","year":"2017","unstructured":"Gonz\u00e1lez-D\u00edaz, R., Jim\u00e9nez, M.-J., Medrano, B.: Efficiently storing well-composed polyhedral complexes computed over 3D binary images. J. Math. Imaging Vis. 59(1), 106\u2013122 (2017)","journal-title":"J. Math. Imaging Vis."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1971.223289","volume":"20","author":"S Gray","year":"1971","unstructured":"Gray, S.: Local properties of binary images in two dimensions. IEEE Trans. Comput. 20, 551\u2013561 (1971)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1109\/83.413166","volume":"4","author":"I Her","year":"1995","unstructured":"Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Process. 4(9), 1213\u20131222 (1995)","journal-title":"IEEE Trans. Image Process."},{"issue":"1\u20132","key":"5_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10472-014-9426-6","volume":"75","author":"P Kardos","year":"2015","unstructured":"Kardos, P., Pal\u00e1gyi, K.: Topology preservation on the triangular grid. Ann. Math. Artif. Intell. 75(1\u20132), 53\u201368 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.dam.2015.10.033","volume":"216","author":"P Kardos","year":"2017","unstructured":"Kardos, P., Pal\u00e1gyi, K.: On topology preservation of mixed operators in triangular, square, and hexagonal grids. Discret. Appl. Math. 216, 441\u2013448 (2017)","journal-title":"Discret. Appl. Math."},{"key":"5_CR28","volume-title":"Digital Geometry: Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann Publishers, San Francisco, Amsterdam (2004)"},{"issue":"3","key":"5_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","volume":"48","author":"TY Kong","year":"1989","unstructured":"Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis., Graph., Image Process. 48(3), 357\u2013393 (1989)","journal-title":"Comput. Vis., Graph., Image Process."},{"key":"5_CR30","volume-title":"Geometry of Locally Finite Spaces: Computer Agreeable Topology and Algorithms for Computer Imagery","author":"VA Kovalevsky","year":"2008","unstructured":"Kovalevsky, V.A.: Geometry of Locally Finite Spaces: Computer Agreeable Topology and Algorithms for Computer Imagery. Editing House Dr. B\u00e4rbel Kovalevski, Berlin (2008)"},{"issue":"3","key":"5_CR31","first-page":"164","volume":"59","author":"LJ Latecki","year":"1997","unstructured":"Latecki, L.J.: 3D well-composed pictures. CVGIP: Graph. Model Image Process. 59(3), 164\u2013172 (1997)","journal-title":"CVGIP: Graph. Model Image Process."},{"issue":"1","key":"5_CR32","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/cviu.1995.1006","volume":"61","author":"LJ Latecki","year":"1995","unstructured":"Latecki, L.J., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Comput. Vis. Image Underst. 61(1), 70\u201383 (1995)","journal-title":"Comput. Vis. Image Underst."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"85","DOI":"10.2298\/FIL1103085M","volume":"22","author":"A Maimone","year":"2011","unstructured":"Maimone, A., Nordo, G.: On 1-gaps in 3d digital objects. Filomat 22(3), 85\u201391 (2011)","journal-title":"Filomat"},{"issue":"4","key":"5_CR34","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2298\/FIL1304547M","volume":"27","author":"A Maimone","year":"2013","unstructured":"Maimone, A., Nordo, G.: A formula for the number of $$(n-2)$$(n-2)-gaps in digital $$n$$n-objects. Filomat 27(4), 547\u2013557 (2013)","journal-title":"Filomat"},{"issue":"1\u20132","key":"5_CR35","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10472-014-9404-z","volume":"75","author":"B Nagy","year":"2015","unstructured":"Nagy, B.: Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. Ann. Math. Artif. Intell. 75(1\u20132), 117\u2013134 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"5_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.3233\/FI-2016-1350","volume":"145","author":"B Nagy","year":"2016","unstructured":"Nagy, B., Lukic, T.: Dense projection tomography on the triangular tiling. Fundam. Inform. 145(2), 125\u2013141 (2016)","journal-title":"Fundam. Inform."},{"issue":"15","key":"5_CR37","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.tcs.2010.10.028","volume":"412","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Strand, R.: Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid. Theor. Comput. Sci. 412(15), 1364\u20131377 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.dam.2016.01.014","volume":"216","author":"A Sarkar","year":"2017","unstructured":"Sarkar, A., Biswas, A., Dutt, M., Bhowmick, P., Bhattacharya, B.B.: A linear-time algorithm to compute the triangular hull of a digital object. Discret. Appl. Math. 216, 408\u2013423 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"5_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.3233\/FI-2018-1666","volume":"159","author":"A Sarkar","year":"2018","unstructured":"Sarkar, A., Biswas, A., Dutt, M., Mondal, S.: Finding shortest triangular path and its family inside a digital object. Fundam. Inform. 159(3), 297\u2013325 (2018)","journal-title":"Fundam. Inform."},{"issue":"3","key":"5_CR40","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10851-007-0054-1","volume":"30","author":"M Siqueira","year":"2008","unstructured":"Siqueira, M., Latecki, L.J., Tustison, N.J., Gallier, J.H., Gee, J.C.: Topological repairing of 3D digital images. J. Math. Imaging Vis. 30(3), 249\u2013274 (2008)","journal-title":"J. Math. Imaging Vis."},{"key":"5_CR41","first-page":"340","volume":"8","author":"JH Sossa-Azuela","year":"2010","unstructured":"Sossa-Azuela, J.H., Cuevas-Jim\u00e9nez, E.V., Zaldivar-Navarro, D.: Computation of the Euler number of a binary image composed of hexagonal cells. J. Appl. Res. Technol. 8, 340\u2013350 (2010)","journal-title":"J. Appl. Res. Technol."},{"issue":"1","key":"5_CR42","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TPAMI.2007.250604","volume":"29","author":"P Stelldinger","year":"2007","unstructured":"Stelldinger, P., Latecki, L.J., Siqueira, M.: Topological equivalence between a 3D object and the reconstruction of its digital image. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 126\u2013140 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-78275-9_2","volume-title":"Combinatorial Image Analysis","author":"P Wiederhold","year":"2008","unstructured":"Wiederhold, P., Morales, S.: Thinning on quadratic, triangular, and hexagonal cell complexes. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 13\u201325. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78275-9_2"}],"container-title":["Lecture Notes in Computer Science","Computational Topology in Image Context"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10828-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T16:59:49Z","timestamp":1573577989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10828-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,22]]},"ISBN":["9783030108274","9783030108281"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10828-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,22]]},"assertion":[{"value":"CTIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computational Topology in Image Context","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e1laga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ctic2019.uma.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"ConfTool","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}