{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:52:45Z","timestamp":1777614765568,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031469930","type":"print"},{"value":"9783031469947","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46994-7_21","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"255-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Overview of\u00a0the\u00a0SISAP 2023 Indexing Challenge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5804-9868","authenticated-orcid":false,"given":"Eric S.","family":"Tellez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7212-6476","authenticated-orcid":false,"given":"Martin","family":"Aum\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0148-695X","authenticated-orcid":false,"given":"Edgar","family":"Chavez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.J.: Ann-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020)","journal-title":"Inf. Syst."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660. ACM (2005)","DOI":"10.1145\/1060745.1060840"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001). https:\/\/doi.org\/10.1145\/502807.502808","journal-title":"ACM Comput. Surv."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cherti, M., et al.: Reproducible scaling laws for contrastive language-image learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 2818\u20132829 (2023)","DOI":"10.1109\/CVPR52729.2023.00276"},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Foster, C., Kimia, B.: Computational enhancements of HNSW targeted to very large datasets. In: Similarity Search and Applications: 16th International Conference, SISAP 2023, A Coru\u00f1a Spain, 9\u201311 October 2023, Proceedings. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-46994-7_25"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. Proc. VLDB Endow. 12(5), 461\u2013474 (2019). https:\/\/doi.org\/10.14778\/3303753.3303754","DOI":"10.14778\/3303753.3303754"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/tpami.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018). https:\/\/doi.org\/10.1109\/tpami.2018.2889473","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Mic, V., Sedmidubsky, J., Zezula, P.: CRANBERRY: memory-effective search in 100M high-dimensional CLIP vectors. In: Similarity Search and Applications - 16th International Conference, SISAP 2023, Spain, Proceedings (2023)","DOI":"10.1007\/978-3-031-46994-7_26"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11, 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Oguri, Y., Matsui, Y.: General and practical tuning method for off-the-shelf graph-based index: Sisap indexing challenge report by team utokyo. In: Similarity Search and Applications: 16th International Conference, SISAP 2023, A Coru\u00f1a Spain, 9\u201311 October 2023, Proceedings. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-46994-7_23"},{"key":"21_CR12","unstructured":"Radford, A., et al.: Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning, pp. 8748\u20138763. PMLR (2021)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Rombach, R., Blattmann, A., Lorenz, D., Esser, P., Ommer, B.: High-resolution image synthesis with latent diffusion models. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 10684\u201310695 (2022)","DOI":"10.1109\/CVPR52688.2022.01042"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Romild, C.J., Schauser, T.H., Alexander Borup, J.: Enhancing approximate nearest neighbor search with binary-indexed lsh-tries, trie rebuilding & batch extraction. In: Proceedings of the 16th International Conference on Similarity Search and Applications (2023)","DOI":"10.1007\/978-3-031-46994-7_22"},{"key":"21_CR15","first-page":"25278","volume":"35","author":"C Schuhmann","year":"2022","unstructured":"Schuhmann, C., et al.: Laion-5b: an open large-scale dataset for training next generation image-text models. Adv. Neural. Inf. Process. Syst. 35, 25278\u201325294 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"21_CR16","unstructured":"Tellez, E.S., Ruiz, G.: Similarity search on neighbor\u2019s graphs with automatic pareto optimal performance and minimum expected quality setups based on hyperparameter optimization. CoRR abs\/2201.07917 (2022). https:\/\/arxiv.org\/abs\/2201.07917"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Tellez, E.S., Ruiz, G.: Similaritysearch.jl: autotuned nearest neighbor indexes for Julia. J. Open Source Softw. 7(75), 4442 (2022)","DOI":"10.21105\/joss.04442"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Tellez, E.S., Chavez, E.: On locality sensitive hashing in metric spaces. In: Proceedings of the Third International Conference on Similarity Search and Applications, pp. 67\u201374 (2010)","DOI":"10.1145\/1862344.1862355"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Thordsen, E., Schubert, E.: An alternating optimization scheme for binary sketches for cosine similarity search. In: Similarity Search and Applications: 16th International Conference, SISAP 2023, A Coru\u00f1a Spain, 9\u201311 October 2023, Proceedings. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-46994-7_4"},{"key":"21_CR20","unstructured":"Webster, R., Rabin, J., Simon, L., Jurie, F.: On the de-duplication of laion-2b. arXiv preprint arXiv:2303.12733 (2023)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46994-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T19:31:16Z","timestamp":1703446276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coruna","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2023\/","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":"33","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":"16","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":"4","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","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":"2","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":"Familiarity, LaTeX and LNCS friendly, steering committee has subscription","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)"}}]}}