{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:20:41Z","timestamp":1743042041379,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_33","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"463-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Same Stats, Different Graphs"],"prefix":"10.1007","author":[{"given":"Hang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Utkarsh","family":"Soni","sequence":"additional","affiliation":[]},{"given":"Yafeng","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Ross","family":"Maciejewski","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"1","key":"33_CR1","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, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"6749","key":"33_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Internet: diameter of the world-wide web. Nature 401(6749), 130 (1999)","journal-title":"Nature"},{"issue":"1","key":"33_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00031305.1973.10478966","volume":"27","author":"F. J. Anscombe","year":"1973","unstructured":"Anscombe, F.J.: Graphs in statistical analysis. Am. Stat. 27(1), 17\u201321 (1973). http:\/\/www.jstor.org\/stable\/2682899","journal-title":"The American Statistician"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-36763-2_48","volume-title":"Graph Drawing","author":"B Bach","year":"2013","unstructured":"Bach, B., Spritzer, A., Lutton, E., Fekete, J.-D.: Interactive random graph generation with evolutionary algorithms. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 541\u2013552. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_48"},{"issue":"5439","key":"33_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"4\u20135","key":"33_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: structure and dynamics. Phys. Rep. 424(4\u20135), 175\u2013308 (2006)","journal-title":"Phys. Rep."},{"issue":"4","key":"33_CR7","doi-asserted-by":"publisher","first-page":"047104","DOI":"10.1103\/PhysRevE.66.047104","volume":"66","author":"M Bogun\u00e1","year":"2002","unstructured":"Bogun\u00e1, M., Pastor-Satorras, R.: Epidemic spreading in correlated complex networks. Phys. Rev. E 66(4), 047104 (2002)","journal-title":"Phys. Rev. E"},{"issue":"1\u20136","key":"33_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., et al.: Graph structure in the web. Comput. Netw. 33(1\u20136), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"issue":"5","key":"33_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of Heider\u2019s theory. Psychol. Rev. 63(5), 277 (1956)","journal-title":"Psychol. Rev."},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. (CSUR) 38(1), 2 (2006)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/9780470073049.ch4","volume-title":"Mining Graph Data","author":"Deepayan Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph patterns and the R-MAT generator. In: Mining Graph Data, pp. 65\u201395 (2007)"},{"doi-asserted-by":"crossref","unstructured":"Chen, H., Soni, U., Lu, Y., Maciejewski, R., Kobourov, S.: Same stats, different graphs (graph statistics and why we need graph drawings). ArXiv e-prints arXiv:1808.09913, August 2018","key":"33_CR12","DOI":"10.1007\/978-3-030-04414-5_33"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1177\/14761270030013002","volume":"1","author":"GF Davis","year":"2003","unstructured":"Davis, G.F., Yoo, M., Baker, W.E.: The small world of the American corporate elite, 1982\u20132001. Strateg. Org. 1(3), 301\u2013326 (2003)","journal-title":"Strateg. Org."},{"issue":"21","key":"33_CR14","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"SN Dorogovtsev","year":"2000","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of growing networks with preferential linking. Phys. Rev. Lett. 85(21), 4633 (2000)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"33_CR15","doi-asserted-by":"publisher","first-page":"035103","DOI":"10.1103\/PhysRevE.66.035103","volume":"66","author":"H Ebel","year":"2002","unstructured":"Ebel, H., Mielsch, L.I., Bornholdt, S.: Scale-free topology of e-mail networks. Phys. Rev. E 66(3), 035103 (2002)","journal-title":"Phys. Rev. E"},{"key":"33_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publicationes mathematicae 6, 290\u2013297 (1959)","journal-title":"Publicationes mathematicae"},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507\u2013518 (1975)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1086\/227352","volume":"86","author":"SL Feld","year":"1981","unstructured":"Feld, S.L.: The focused organization of social ties. Am. J. Sociol. 86(5), 1015\u20131035 (1981)","journal-title":"Am. J. Sociol."},{"issue":"380","key":"33_CR19","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1080\/01621459.1982.10477895","volume":"77","author":"O Frank","year":"1982","unstructured":"Frank, O., Harary, F.: Cluster inference by using transitivity indices in empirical graphs. J. Am. Stat. Assoc. 77(380), 835\u2013840 (1982)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"33_CR20","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"12","key":"33_CR21","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6","key":"33_CR22","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68(6), 065103 (2003)","journal-title":"Phys. Rev. E"},{"unstructured":"Hagberg, A., Swart, P., S Chult, D.: Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab. (LANL), Los Alamos, NM, United States (2008)","key":"33_CR23"},{"unstructured":"Hanneman, R.A., Riddle, M.: Introduction to social network methods (2005)","key":"33_CR24"},{"doi-asserted-by":"crossref","unstructured":"Kairam, S., MacLean, D., Savva, M., Heer, J.: GraphPrism: compact visualization of network structure. In: Proceedings of the International Working Conference on Advanced Visual Interfaces, pp. 498\u2013505. ACM (2012)","key":"33_CR25","DOI":"10.1145\/2254556.2254651"},{"issue":"4","key":"33_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0378-8733(97)00001-4","volume":"19","author":"M Karlberg","year":"1997","unstructured":"Karlberg, M.: Testing transitivity in graphs. Soc. Netw. 19(4), 325\u2013343 (1997)","journal-title":"Soc. Netw."},{"unstructured":"Li, G., Semerci, M., Yener, B., Zaki, M.J.: Graph classification via topological and label attributes. In: Proceedings of the 9th International Workshop on Mining and Learning with Graphs (MLG), San Diego, USA, vol. 2 (2011)","key":"33_CR27"},{"issue":"5","key":"33_CR28","doi-asserted-by":"publisher","first-page":"056127","DOI":"10.1103\/PhysRevE.72.056127","volume":"72","author":"PG Lind","year":"2005","unstructured":"Lind, P.G., Gonzalez, M.C., Herrmann, H.J.: Cycles and clustering in bipartite networks. Phys. Rev. E 72(5), 056127 (2005)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 395\u2013406. ACM (2003)","key":"33_CR29","DOI":"10.1145\/863955.863999"},{"key":"33_CR30","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.physa.2003.06.002","volume":"333","author":"S Maslov","year":"2004","unstructured":"Maslov, S., Sneppen, K., Zaliznyak, A.: Detection of topological patterns in complex networks: correlation profile of the internet. Physica A: Stat. Mech. Appl. 333, 529\u2013540 (2004)","journal-title":"Physica A: Stat. Mech. Appl."},{"doi-asserted-by":"crossref","unstructured":"Matejka, J., Fitzmaurice, G.: Same stats, different graphs: generating datasets with varied appearance and identical statistics through simulated annealing. In: Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, pp. 1290\u20131294. ACM (2017)","key":"33_CR31","DOI":"10.1145\/3025453.3025912"},{"key":"33_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-1-4419-8462-3_2","volume-title":"Social Network Data Analytics","author":"M McGlohon","year":"2011","unstructured":"McGlohon, M., Akoglu, L., Faloutsos, C.: Statistical properties of social networks. In: Aggarwal, C. (ed.) Social Network Data Analytics, pp. 17\u201342. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_2"},{"doi-asserted-by":"crossref","unstructured":"Melancon, G.: Just how dense are dense graphs in the real world?: a methodological note. In: Proceedings of the 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization, pp. 1\u20137. ACM (2006)","key":"33_CR33","DOI":"10.1145\/1168149.1168167"},{"doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342. ACM (2007)","key":"33_CR34","DOI":"10.1145\/1298306.1298311"},{"issue":"20","key":"33_CR35","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"ME Newman","year":"2002","unstructured":"Newman, M.E.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"33_CR36","doi-asserted-by":"publisher","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: Mixing patterns in networks. Phys. Rev. E 67(2), 026126 (2003)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"33_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"6","key":"33_CR38","doi-asserted-by":"publisher","first-page":"7332","DOI":"10.1103\/PhysRevE.60.7332","volume":"60","author":"ME Newman","year":"1999","unstructured":"Newman, M.E., Watts, D.J.: Scaling and percolation in the small-world network model. Phys. Rev. E 60(6), 7332 (1999)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"33_CR39","first-page":"292","volume":"27","author":"D de Solla Price","year":"1976","unstructured":"de Solla Price, D.: A general theory of bibliometric and other cumulative advantage processes. J. Assoc Inf. Sci. Technol. 27(5), 292\u2013306 (1976)","journal-title":"J. Assoc Inf. Sci. Technol."},{"issue":"3","key":"33_CR40","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.67.036106","volume":"67","author":"P Sen","year":"2003","unstructured":"Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P., Mukherjee, G., Manna, S.: Small-world properties of the indian railway network. Phys. Rev. E 67(3), 036106 (2003)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Soni, U., Lu, Y., Hansen, B., Purchase, H., Kobourov, S., Maciejewski, R.: The perception of graph properties in graph layouts. In: 20th IEEE Eurographics Conference on Visualization (EuroVis) (2018)","key":"33_CR41","DOI":"10.1111\/cgf.13410"},{"issue":"2","key":"33_CR42","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1086\/432782","volume":"111","author":"B Uzzi","year":"2005","unstructured":"Uzzi, B., Spiro, J.: Collaboration and creativity: the small world problem. Am. J. Sociol. 111(2), 447\u2013504 (2005)","journal-title":"Am. J. Sociol."},{"issue":"3","key":"33_CR43","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1038\/sj.embor.7400090","volume":"5","author":"V Van Noort","year":"2004","unstructured":"Van Noort, V., Snel, B., Huynen, M.A.: The yeast coexpression network has a small-world, scale-free architecture and can be explained by a simple model. EMBO Rep. 5(3), 280\u2013284 (2004)","journal-title":"EMBO Rep."},{"issue":"6684","key":"33_CR44","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"issue":"11","key":"33_CR45","doi-asserted-by":"publisher","first-page":"118901","DOI":"10.1088\/0256-307X\/26\/11\/118901","volume":"26","author":"D Wei-Bing","year":"2009","unstructured":"Wei-Bing, D., Long, G., Wei, L., Xu, C.: Worldwide marine transportation network: efficiency and container throughput. Chin. Phys. Lett. 26(11), 118901 (2009)","journal-title":"Chin. Phys. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04414-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:21:26Z","timestamp":1710249686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_33"}},"subtitle":["(Graph Statistics and Why We Need Graph Drawings)"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - 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 (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The book also contains 1 full invited paper and 1 contest report","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}