{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:30:28Z","timestamp":1756992628308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031560590"},{"type":"electronic","value":"9783031560606"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56060-6_3","type":"book-chapter","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:02:17Z","timestamp":1710514937000},"page":"34-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Utilizing Low-Dimensional Molecular Embeddings for\u00a0Rapid Chemical Similarity Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9191-4032","authenticated-orcid":false,"given":"Kathryn E.","family":"Kirchoff","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9181-3431","authenticated-orcid":false,"given":"James","family":"Wellnitz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4487-3228","authenticated-orcid":false,"given":"Joshua E.","family":"Hochuli","sequence":"additional","affiliation":[]},{"given":"Travis","family":"Maxfield","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9394-972X","authenticated-orcid":false,"given":"Konstantin I.","family":"Popov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-4552","authenticated-orcid":false,"given":"Shawn","family":"Gomez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3802-8896","authenticated-orcid":false,"given":"Alexander","family":"Tropsha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,16]]},"reference":[{"key":"3_CR1","unstructured":"ANNOY library. https:\/\/github.com\/spotify\/annoy. Accessed 01 Aug 2017"},{"key":"3_CR2","unstructured":"NextMove software | Arthor. https:\/\/www.nextmovesoftware.com\/arthor.html"},{"key":"3_CR3","unstructured":"NextMove software | Arthor. https:\/\/www.nextmovesoftware.com\/talks\/Sayle_EvolutionVsRevolution_ICCS_201805.pdf"},{"key":"3_CR4","unstructured":"NextMove software | SmallWorld. https:\/\/www.nextmovesoftware.com\/smallworld.html"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins 66(4), 671\u2013687. https:\/\/doi.org\/10.1016\/S0022-0000(03)00025-4","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases, pp. 69\u201384. https:\/\/doi.org\/10.1007\/3-540-57301-1_5","DOI":"10.1007\/3-540-57301-1_5"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search, pp. 651\u2013660. https:\/\/doi.org\/10.1145\/1060745.1060840","DOI":"10.1145\/1060745.1060840"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bellmann, L., Penner, P., Rarey, M.: Topological similarity search in large combinatorial fragment spaces 61(1), 238\u2013251. https:\/\/doi.org\/10.1021\/acs.jcim.0c00850, publisher: American Chemical Society","DOI":"10.1021\/acs.jcim.0c00850"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Bentley, J.: Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng. SE-5(4), 333\u2013340 (1979). https:\/\/doi.org\/10.1109\/TSE.1979.234200","DOI":"10.1109\/TSE.1979.234200"},{"issue":"9","key":"3_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975). https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun. ACM"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Birchall, K., Gillet, V.J., Harper, G., Pickett, S.D.: Training similarity measures for specific activities: Application to reduced graphs 46(2), 577\u2013586. https:\/\/doi.org\/10.1021\/ci050465e, publisher: American Chemical Society","DOI":"10.1021\/ci050465e"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Cao, Y., Jiang, T., Girke, T.: Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing. Bioinformatics 26(7), 953\u2013959 (2010). https:\/\/doi.org\/10.1093\/bioinformatics\/btq067","DOI":"10.1093\/bioinformatics\/btq067"},{"issue":"1968\u20131969","key":"3_CR13","first-page":"257","volume":"25","author":"A Crum-Brown","year":"1865","unstructured":"Crum-Brown, A., Fraser, T.R.: The connection of chemical constitution and physiological action. Trans. R. Soc. Edinb. 25(1968\u20131969), 257 (1865)","journal-title":"Trans. R. Soc. Edinb."},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Deng, Z., Zhu, X., Cheng, D., Zong, M., Zhang, S.: Efficient kNN classification algorithm for big data 195, 143\u2013148. https:\/\/doi.org\/10.1016\/j.neucom.2015.08.112,https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925231216001132","DOI":"10.1016\/j.neucom.2015.08.112"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"F\u00e9lix, E., Dalke, A., Landrum, G., Bushuiev, R.: chembl\/FPSim2: 0.5.0 (2023). https:\/\/doi.org\/10.5281\/ZENODO.10041218, https:\/\/zenodo.org\/doi\/10.5281\/zenodo.10041218","DOI":"10.5281\/ZENODO.10041218"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Gahbauer, S., et al.: Iterative computational design and crystallographic screening identifies potent inhibitors targeting the Nsp3 macrodomain of SARS-CoV-2. Proc. Nat. Acad. Sci. 120(2), e2212931120 (2023). https:\/\/doi.org\/10.1073\/pnas.2212931120, https:\/\/www.pnas.org\/doi\/abs\/10.1073\/pnas.2212931120","DOI":"10.1073\/pnas.2212931120"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Grygorenko, O.O.: Enamine Ltd.: the science and business of organic chemistry and beyond. Eur. J. Org. Chem. 2021(47), 6474\u20136477 (2021). https:\/\/doi.org\/10.1002\/ejoc.202101210, https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ejoc.202101210","DOI":"10.1002\/ejoc.202101210"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Gupta, D., Loane, R., Gayen, S., Demner-Fushman, D.: Medical image retrieval via nearest neighbor search on pre-trained image features (arXiv:2210.02401). https:\/\/doi.org\/10.48550\/arXiv.2210.02401, http:\/\/arxiv.org\/abs\/2210.02401, version: 1","DOI":"10.48550\/arXiv.2210.02401"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2019","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(3), 535\u2013547 (2019)","journal-title":"IEEE Trans. Big Data"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Johnson, W.B., Lindenstrauss, J., Schechtman, G.: Extensions of lipschitz maps into banach spaces 54(2), 129\u2013138. https:\/\/doi.org\/10.1007\/BF02764938","DOI":"10.1007\/BF02764938"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Jolliffe, I.: Principal Component Analysis. In: Balakrishnan, N., Colton, T., Everitt, B., Piegorsch, W., Ruggeri, F., Teugels, J.L. (eds.) Wiley StatsRef: Statistics Reference Online. Wiley, first edn. (2014). https:\/\/doi.org\/10.1002\/9781118445112.stat06472","DOI":"10.1002\/9781118445112.stat06472"},{"key":"3_CR22","unstructured":"Karlova, A., Dehaen, W., Svozil, D.: Molecular Fingerprint VAE p. 6"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases 3(3), 263\u2013286. https:\/\/doi.org\/10.1007\/PL00011669","DOI":"10.1007\/PL00011669"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Kirchoff, K.E., Maxfield, T., Tropsha, A., Gomez, S.M.: SALSA: Semantically-aware latent space autoencoder (2023)","DOI":"10.1609\/aaai.v38i12.29221"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Korn, P., Sidiropoulos, N.D., Faloutsos, C., Siegel, E.L., Protopapas, Z.: Fast and effective similarity search in medical tumor databases using morphology: Multimedia storage and archiving systems 2916, 116\u2013129. https:\/\/doi.org\/10.1117\/12.257282","DOI":"10.1117\/12.257282"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Lavecchia, A., Giovanni, C.D.: Virtual screening strategies in drug discovery: A critical review 20(23), 2839\u20132860. https:\/\/www.eurekaselect.com\/article\/53238","DOI":"10.2174\/09298673113209990001"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Lyu, J., Irwin, J.J., Shoichet, B.K.: Modeling the expansion of virtual screening libraries 19(6), 712\u2013718. https:\/\/doi.org\/10.1038\/s41589-022-01234-w, https:\/\/www.nature.com\/articles\/s41589-022-01234-w, number: 6 Publisher: Nature Publishing Group","DOI":"10.1038\/s41589-022-01234-w"},{"issue":"8","key":"3_CR28","doi-asserted-by":"publisher","first-page":"3186","DOI":"10.1021\/jm401411z","volume":"57","author":"G Maggiora","year":"2014","unstructured":"Maggiora, G., Vogt, M., Stumpfe, D., Bajorath, J.: Molecular similarity in medicinal chemistry: Miniperspective. J. Med. Chem. 57(8), 3186\u20133204 (2014). https:\/\/doi.org\/10.1021\/jm401411z","journal-title":"J. Med. Chem."},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Mahdi, M.A., Hosny, K.M., Elhenawy, I.: Scalable clustering algorithms for big data: A review 9, 80015\u201380027. https:\/\/doi.org\/10.1109\/ACCESS.2021.3084057, conference Name: IEEE Access","DOI":"10.1109\/ACCESS.2021.3084057"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"McInnes, L., Healy, J., Melville, J.: UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction (2018). https:\/\/doi.org\/10.48550\/ARXIV.1802.03426","DOI":"10.48550\/ARXIV.1802.03426"},{"issue":"4","key":"3_CR31","doi-asserted-by":"publisher","first-page":"508","DOI":"10.3390\/biom12040508","volume":"12","author":"M Nasser","year":"2022","unstructured":"Nasser, M., et al.: Feature reduction for molecular similarity searching based on autoencoder deep learning. Biomolecules 12(4), 508 (2022). https:\/\/doi.org\/10.3390\/biom12040508","journal-title":"Biomolecules"},{"issue":"9\u201310","key":"3_CR32","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1002\/qsar.200330831","volume":"22","author":"N Nikolova","year":"2003","unstructured":"Nikolova, N., Jaworska, J.: Approaches to measure chemical similarity - a Review. QSAR Comb. Sci. 22(9\u201310), 1006\u20131026 (2003). https:\/\/doi.org\/10.1002\/qsar.200330831","journal-title":"QSAR Comb. Sci."},{"key":"3_CR33","unstructured":"Omohundro, S.: Five Balltree Construction Algorithms. Tech. Rep. TR-89-063, International Computer Science Institute (1989)"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching 27(7), 950\u2013959. https:\/\/doi.org\/10.1016\/j.imavis.2008.04.004, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S026288560800084X","DOI":"10.1016\/j.imavis.2008.04.004"},{"issue":"1","key":"3_CR35","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1186\/1758-2946-5-26","volume":"5","author":"S Riniker","year":"2013","unstructured":"Riniker, S., Landrum, G.A.: Open-source platform to benchmark fingerprints for ligand-based virtual screening. J. Cheminform. 5(1), 26 (2013)","journal-title":"J. Cheminform."},{"issue":"5","key":"3_CR36","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1021\/ci100050t","volume":"50","author":"D Rogers","year":"2010","unstructured":"Rogers, D., Hahn, M.: Extended-Connectivity Fingerprints. J. Chem. Inf. Model. 50(5), 742\u2013754 (2010). https:\/\/doi.org\/10.1021\/ci100050t","journal-title":"J. Chem. Inf. Model."},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition SMC-13(3), 353\u2013362. https:\/\/doi.org\/10.1109\/TSMC.1983.6313167, conference Name: IEEE Transactions on Systems, Man, and Cybernetics","DOI":"10.1109\/TSMC.1983.6313167"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","volume":"31","author":"J Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, J., Samet, H., Varshney, A.: A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput. Graph. 31(2), 157\u2013174 (2007). https:\/\/doi.org\/10.1016\/j.cag.2006.11.011","journal-title":"Comput. Graph."},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Swamidass, S.J., Baldi, P.: Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sublinear time 47(2), 302\u2013317. https:\/\/doi.org\/10.1021\/ci600358f","DOI":"10.1021\/ci600358f"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Swamidass, S.J., Baldi, P.: Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sublinear time. J. Chem. Inf. Model. 47(2), 302\u2013317 (2007). https:\/\/doi.org\/10.1021\/ci600358f, pMID: 17326616","DOI":"10.1021\/ci600358f"},{"key":"3_CR41","unstructured":"Tanimoto, T.T.: An elementary mathematical theory of classification and prediction by T.T. Tanimoto. International Business Machines Corporation New York (1958)"},{"issue":"4","key":"3_CR42","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1021\/acs.jcim.2c01253","volume":"63","author":"BI Tingle","year":"2023","unstructured":"Tingle, B.I., et al.: ZINC-22-A free multi-billion-scale database of tangible compounds for ligand discovery. J. Chem. Inf. Model. 63(4), 1166\u20131176 (2023). https:\/\/doi.org\/10.1021\/acs.jcim.2c01253","journal-title":"J. Chem. Inf. Model."},{"key":"3_CR43","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. CRC Press, google-Books-ID: 9mlQDwAAQBAJ"},{"issue":"86","key":"3_CR44","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(86), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Wald, I., Havran, V.: On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N). In: 2006 IEEE Symposium on Interactive Ray Tracing, pp. 61\u201369. IEEE, Salt Lake City, UT, USA (2006). https:\/\/doi.org\/10.1109\/RT.2006.280216","DOI":"10.1109\/RT.2006.280216"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: A survey (arXiv:1408.2927). https:\/\/doi.org\/10.48550\/arXiv.1408.2927, http:\/\/arxiv.org\/abs\/1408.2927","DOI":"10.48550\/arXiv.1408.2927"},{"key":"3_CR47","unstructured":"Wang, Y., Wang, J., Cao, Z., Farimani, A.B.: MolCLR: Molecular contrastive learning of representations via graph neural networks. CoRR abs\/2102.10056 (2021). https:\/\/arxiv.org\/abs\/2102.10056"},{"key":"3_CR48","unstructured":"Weber, R., Schek, H.J., Blott, S.: Analysis and Performance Study for Methods in High-Dimensional Spaces p. 12"},{"key":"3_CR49","doi-asserted-by":"publisher","unstructured":"Weininger, D.: SMILES, a chemical language and information system. 1. introduction to methodology and encoding rules 28(1), 31\u201336. https:\/\/doi.org\/10.1021\/ci00057a005, https:\/\/doi.org\/10.1021\/ci00057a005, publisher: American Chemical Society","DOI":"10.1021\/ci00057a005"},{"key":"3_CR50","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing 21"},{"key":"3_CR51","doi-asserted-by":"publisher","unstructured":"Wigh, D.S., Goodman, J.M., Lapkin, A.A.: A review of molecular representation in the age of machine learning. WIREs Comput. Mol. Sci. 12(5), e1603 (2022). https:\/\/doi.org\/10.1002\/wcms.1603","DOI":"10.1002\/wcms.1603"},{"key":"3_CR52","doi-asserted-by":"publisher","unstructured":"Yang, J., Cai, Y., Zhao, K., Xie, H., Chen, X.: Concepts and applications of chemical fingerprint for hit and lead screening 27(11), 103356. https:\/\/doi.org\/10.1016\/j.drudis.2022.103356","DOI":"10.1016\/j.drudis.2022.103356"},{"key":"3_CR53","doi-asserted-by":"publisher","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance 2(1), 25\u201336. https:\/\/doi.org\/10.14778\/1687627.1687631","DOI":"10.14778\/1687627.1687631"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56060-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T11:10:34Z","timestamp":1731582634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56060-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031560590","9783031560606"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56060-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ecir2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"578","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":"110","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":"69","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":"19% - 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","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31 (Tracks: Workshop, Tutorial, Industry, Doctoral Consortium)","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)"}}]}}