{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T18:08:49Z","timestamp":1784138929556,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T00:00:00Z","timestamp":1784419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,20]]},"DOI":"10.1145\/3805712.3809596","type":"proceedings-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T14:28:19Z","timestamp":1783693699000},"page":"1869-1879","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["OPS: An Order-Preserving Sorting Network for Information Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5241-8317","authenticated-orcid":false,"given":"Chao","family":"Wang","sequence":"first","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1614-2444","authenticated-orcid":false,"given":"Yongxiang","family":"Tang","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3730-6566","authenticated-orcid":false,"given":"Guikai","family":"Luan","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4702-9754","authenticated-orcid":false,"given":"Kaiyuan","family":"Li","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8926-8605","authenticated-orcid":false,"given":"Yanhua","family":"Cheng","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7253-0674","authenticated-orcid":false,"given":"Xialong","family":"Liu","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2164-3577","authenticated-orcid":false,"given":"Shu","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Automation, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9266-0780","authenticated-orcid":false,"given":"Peng","family":"Jiang","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Christopher Burges Robert Ragno and Quoc Le. 2006. Learning to rank with nonsmooth cost functions. Advances in neural information processing systems 19.","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599892"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133199"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Koby Crammer and Yoram Singer. 2001. Pranking with ranking. Advances in neural information processing systems 14.","DOI":"10.7551\/mitpress\/1120.003.0087"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/65943.65944"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the fourteenth international conference on artificial intelligence and statistics. JMLR Workshop and Conference Proceedings, 315--323","author":"Glorot Xavier","year":"2011","unstructured":"Xavier Glorot, Antoine Bordes, and Yoshua Bengio. 2011. Deep sparse rectifier neural networks. In Proceedings of the fourteenth international conference on artificial intelligence and statistics. JMLR Workshop and Conference Proceedings, 315--323."},{"key":"e_1_3_2_1_11_1","unstructured":"Google. 2025. Tensorflow ranking. https:\/\/www.tensorflow.org\/ranking. Accessed: 2025--12--19. (2025)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.01.004"},{"key":"e_1_3_2_1_13_1","unstructured":"Aditya Grover Eric Wang Aaron Zweig and Stefano Ermon. 2019. Stochastic optimization of sorting networks via continuous relaxations. arXiv preprint arXiv:1903.08850."},{"key":"e_1_3_2_1_14_1","unstructured":"A Nico Habermann. 1972. Parallel neighbor-sort (or the glory of the induction principle)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_17_1","unstructured":"Jungtaek Kim Jeongbeen Yoon and Minsu Cho. 2023. Generalized neural sorting networks with error-free differentiable swap functions. arXiv preprint arXiv:2310.07174."},{"key":"e_1_3_2_1_18_1","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E94.D.1854"},{"key":"e_1_3_2_1_20_1","volume-title":"Learning to rank for information retrieval and natural language processing","author":"Hang Li.","unstructured":"Hang Li. 2014. Learning to rank for information retrieval and natural language processing. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Tie-Yan Liu. 2009. Learning to rank for information retrieval. Foundations and trends\u00ae in information retrieval 3 3 225--331.","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning. PMLR, 8546--8555","author":"Petersen Felix","year":"2021","unstructured":"Felix Petersen, Christian Borgelt, Hilde Kuehne, and Oliver Deussen. 2021. Differentiable sorting networks for scalable sorting and ranking supervision. In International Conference on Machine Learning. PMLR, 8546--8555."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Felix Petersen Christian Borgelt Hilde Kuehne and Oliver Deussen. 2022. Monotonic differentiable sorting networks. arXiv preprint arXiv:2203.09630.","DOI":"10.52202\/068431-0146"},{"key":"e_1_3_2_1_24_1","unstructured":"Przemys?aw Pobrotyn and Rados?aw Bia?obrzeski. 2021. Neuralndcg: direct optimisation of a ranking metric via differentiable relaxation of sorting. arXiv preprint arXiv:2102.07831."},{"key":"e_1_3_2_1_25_1","volume-title":"International Conference on Machine Learning. PMLR, 7793--7802","author":"Prillo Sebastian","year":"2020","unstructured":"Sebastian Prillo and Julian Eisenschlos. 2020. Softsort: a continuous relaxation for the argsort operator. In International Conference on Machine Learning. PMLR, 7793--7802."},{"key":"e_1_3_2_1_26_1","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. CoRR abs\/1306.2597. http:\/\/arxiv.org\/abs\/1306.2597."},{"key":"e_1_3_2_1_27_1","first-page":"21644","article-title":"Pirank: scalable learning to rank via differentiable sorting","volume":"34","author":"Swezey Robin","year":"2021","unstructured":"Robin Swezey, Aditya Grover, Bruno Charron, and Stefano Ermon. 2021. Pirank: scalable learning to rank via differentiable sorting. Advances in Neural Information Processing Systems, 34, 21644--21654.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557274"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"e_1_3_2_1_30_1","volume-title":"Krysta M Svore, and Jianfeng Gao.","author":"Wu Qiang","year":"2008","unstructured":"Qiang Wu, Chris JC Burges, Krysta M Svore, and Jianfeng Gao. 2008. Ranking, boosting, and model adaptation. Tech. rep. Citeseer."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346996"},{"key":"e_1_3_2_1_33_1","unstructured":"Penghang Yin Jiancheng Lyu Shuai Zhang Stanley Osher Yingyong Qi and Jack Xin. 2019. Understanding straight-through estimator in training activation quantized neural nets. arXiv preprint arXiv:1903.05662."}],"event":{"name":"SIGIR '26: The 49th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Melbourne VIC Australia","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:25:06Z","timestamp":1784136306000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3805712.3809596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,19]]},"references-count":33,"alternative-id":["10.1145\/3805712.3809596","10.1145\/3805712"],"URL":"https:\/\/doi.org\/10.1145\/3805712.3809596","relation":{},"subject":[],"published":{"date-parts":[[2026,7,19]]},"assertion":[{"value":"2026-07-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}