{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:55:51Z","timestamp":1781675751365,"version":"3.54.5"},"reference-count":62,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:00:00Z","timestamp":1777852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:00:00Z","timestamp":1777852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,4]]},"DOI":"10.1109\/icdew71238.2026.00018","type":"proceedings-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T19:42:37Z","timestamp":1781638957000},"page":"97-110","source":"Crossref","is-referenced-by-count":0,"title":["VecAlign: Efficient Vector Sequence Alignment for Similarity Search in the Embedding Space"],"prefix":"10.1109","author":[{"given":"Zhizhi","family":"Wang","sequence":"first","affiliation":[{"name":"Rutgers University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Deng","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/14241277.2019.1695619"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983203"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10593-2_24"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.577"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24027-5_42"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref7","volume-title":"Using Suffix Trees and Suffix Arrays for Duplicate Code Detection","author":"Men","year":"2008"},{"key":"ref8","article-title":"Dynamically adjustable approach through obfuscation type recognition","author":"Sanchez-Perez","year":"2015","journal-title":"CLEF (Working Notes)"},{"key":"ref9","article-title":"Applying the seed-and-extend strategy to text-alignment","author":"Wiegmann"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-020-00882-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457548"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526178"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3589324"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3677136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3115\/1631862.1631865"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.54963\/jic.v3i2.220"},{"key":"ref17","author":"Li","year":"2024","journal-title":"Learning to rewrite: Generalized llm-generated text detection"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1145\/3397271.3401075","article-title":"Colbert: Efficient and effective passage search via contextualized late interaction over bert","author":"Khattab","year":"2020"},{"key":"ref19","article-title":"Simcse: Simple contrastive learning of sentence embeddings","author":"Gao","year":"2022"},{"key":"ref20","author":"Mikolov","year":"2013","journal-title":"Efficient estimation of word representations in vector space"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378337"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856324"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref24","first-page":"271","article-title":"Approximate nearest neighbor queries in fixed dimensions","volume-title":"SODA","volume":"93","author":"Arya"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref26","article-title":"Near optimal hashing algorithms for approximate near (est) neighbor problem","volume-title":"MMDS 2006. Workshop on Algorithms for Modern Massive Data Sets","author":"Indyk"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1016\/S0076-5392(08)62273-0","volume-title":"Priority queues","volume":"50","author":"Jaiswal","year":"1968"},{"key":"ref29","author":"Oguri","year":"2024","journal-title":"Theoretical and empirical analysis of adaptive entry point selection for graph-based approximate nearest neighbor search"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"issue":"CEUR-WS","key":"ref31","first-page":"1","article-title":"Overview of the 3rd international competition on plagiarism detection","volume-title":"CEUR workshop proceedings","volume":"1177","author":"Potthast"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1631272.1631295"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref36","first-page":"950","article-title":"Multi-probe lsh: efficient indexing for high-dimensional similarity search","volume-title":"Proceedings of the 33rd international conference on Very large data bases","author":"Lv"},{"key":"ref37","article-title":"Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips)","volume":"27","author":"Shrivastava","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.225"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424580"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"issue":"1","key":"ref44","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","volume-title":"IJCAI Proceedings-International Joint Conference on Artificial Intelligence","volume":"22","author":"Hajebi"},{"key":"ref45","author":"Fu","year":"2016","journal-title":"Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/5.163414"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3639324"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE65448.2025.00272"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526721"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242592"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-88720-8_64"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/e17-2066"},{"key":"ref55","author":"Xian","year":"2024","journal-title":"Bert-enhanced retrieval tool for homework plagiarism detection system"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s43995-025-00108-1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2025.1504725"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1023\/b:visi.0000029664.99615.94"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.09.014"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126544"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/BF00344251"},{"key":"ref62","author":"Dosovitskiy","year":"2020","journal-title":"An image is worth 16x16 words: Transformers for image recognition at scale"}],"event":{"name":"2026 IEEE 42nd International Conference on Data Engineering Workshops (ICDEW)","location":"Montreal, QC, Canada","start":{"date-parts":[[2026,5,4]]},"end":{"date-parts":[[2026,5,8]]}},"container-title":["2026 IEEE 42nd International Conference on Data Engineering Workshops (ICDEW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11558595\/11558596\/11558717.pdf?arnumber=11558717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:31:12Z","timestamp":1781674272000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11558717\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,4]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/icdew71238.2026.00018","relation":{},"subject":[],"published":{"date-parts":[[2026,5,4]]}}}