{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:17:24Z","timestamp":1780589844671,"version":"3.54.1"},"reference-count":79,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hightech Agenda Bayern"},{"name":"Federal Ministry for Economic Affairs and Climate Action on the basis of a decision by the German Bundestag through project QuaST"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer programming. State-of-the-art integer programming algorithms can compute strong relaxation bounds even for hard instances, but may have to enumerate a large number of subproblems for determining an optimum solution. If the potential of quantum computing is realized, it can be expected that in particular finding high-quality solutions for hard problems can be done fast. Still, near-future quantum hardware considerably limits the size of treatable problems. In this work, we go one step into integrating the potentials of quantum and classical techniques for combinatorial optimization. We propose a hybrid heuristic for the weighted maximum-cut problem and for quadratic unconstrained binary optimization. The heuristic employs a linear programming relaxation, rendering it well-suited for integration into exact branch-and-cut algorithms. For large instances, we reduce the problem size according to a linear relaxation such that the reduced problem can be handled by quantum machines of limited size. Moreover, we improve the applicability of depth-1 QAOA, a parameterized quantum algorithm, by deriving a parameter estimate for arbitrary instances. We present numerous computational results from real quantum hardware.<\/jats:p>","DOI":"10.1145\/3711935","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T11:34:06Z","timestamp":1736768046000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9031-1870","authenticated-orcid":false,"given":"Friedrich","family":"Wagner","sequence":"first","affiliation":[{"name":"Analytics, Fraunhofer-Institut f\u00fcr Integrierte Schaltungen IIS, Erlangen, Germany and Data Science, Friedrich-Alexander-Universitat Erlangen-Nurnberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6401-9822","authenticated-orcid":false,"given":"Jonas","family":"N\u00fc\u00dflein","sequence":"additional","affiliation":[{"name":"Data Science, Friedrich-Alexander-Universitat Erlangen-Nurnberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1671-0344","authenticated-orcid":false,"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[{"name":"Data Science, Friedrich-Alexander-Universitat Erlangen-Nurnberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","unstructured":"Amira Abbas Andris Ambainis Brandon Augustino Andreas B\u00e4rtschi Harry Buhrman Carleton Coffrin Giorgio Cortiana Vedran Dunjko Daniel J. Egger Bruce G. Elmegreen et al. 2024. Challenges and opportunities in quantum optimization. Nature Reviews Physics 6 12 (2024) 718\u2013735. DOI:10.1038\/s42254-024-00770-9","DOI":"10.1038\/s42254-024-00770-9"},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations Research Proceedings 2011","author":"Achterberg Tobias","year":"2012","unstructured":"Tobias Achterberg, Timo Berthold, and Gregor Hendel. 2012. Rounding and propagation heuristics for mixed integer programming. In Operations Research Proceedings 2011, Diethard Klatte, Hans-Jakob L\u00fcthi, and Karl Schmedders (Eds.). Springer, Berlin, 71\u201376."},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.031016"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0423-5"},{"issue":"3","key":"e_1_3_3_7_2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","article-title":"An application of combinatorial optimization to statistical physics and circuit layout design","volume":"36","author":"Barahona Francisco","year":"1988","unstructured":"Francisco Barahona, Martin Gr\u00f6tschel, Michael J\u00fcnger, and Gerhard Reinelt. 1988. An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 3 (1988), 493\u2013513.","journal-title":"Operations Research"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587084"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592023"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Joao Basso Edward Farhi Kunal Marwaha Benjamin Villalonga and Leo Zhou. 2022. The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-girth Regular Graphs and the Sherrington-kirkpatrick Model. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik. DOI:DOI:10.4230\/LIPICS.TQC.2022.7","DOI":"10.4230\/LIPICS.TQC.2022.7"},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization","author":"Bixby E. Robert","year":"2000","unstructured":"E. Robert Bixby, Mary Fenelon, Zonghao Gu, Ed Rothberg, and Roland Wunderling. 2000. MIP: Theory and practice\u2014closing the gap. In System Modelling and Optimization, M. J. D. Powell and S. Scholtes (Eds.). Springer US, Boston, MA, 19\u201349."},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.1.3.17780"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0688-2"},{"key":"e_1_3_3_14_2","unstructured":"Kelly Boothby Colin Enderud Trevor Lanting Reza Molavi Nicholas Tsai Mark H. Volkmann Fabio Altomare Mohammad H. Amin Michael Babcock Andrew J. Berkley et al.2021. Architectural considerations in the design of a third-generation superconducting quantum annealing processor. arXiv:2108.02322. Retrieved from https:\/\/arxiv.org\/abs\/2108.02322"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"Lucas T. Brady and Stuart Hadfield. 2023. Iterative quantum algorithms for maximum independent set. Physical Review A 110 5 (2024) 052435. arXiv:2309.13110. Retrieved from https:\/\/arxiv.org\/abs\/2309.13110","DOI":"10.1103\/PhysRevA.110.052435"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.125.260505"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-03-30-678"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0377-3"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/1.9781611977042.5","volume-title":"2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201922)","author":"Charfreitag Jonas","year":"2022","unstructured":"Jonas Charfreitag, Michael J\u00fcnger, Sven Mallach, and Petra Mutzel. 2022. McSparse: Exact solutions of sparse maximum cut and sparse unconstrained binary quadratic optimization problems. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201922). SIAM, 54\u201366. DOI:DOI:10.1137\/1.9781611977042.5"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0200-3"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0082-9"},{"issue":"4","key":"e_1_3_3_22_2","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1002\/rsa.20015","article-title":"Random MAX SAT, random MAX CUT, and their phase transitions","volume":"24","author":"Coppersmith Don","year":"2004","unstructured":"Don Coppersmith, David Gamarnik, MohammadTaghi Hajiaghayi, and Gregory B. Sorkin. 2004. Random MAX SAT, random MAX CUT, and their phase transitions. Random Structures and Algorithms 24, 4 (2004), 502\u2013545.","journal-title":"Random Structures and Algorithms"},{"key":"e_1_3_3_23_2","first-page":"53","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907)","author":"Vega Wenceslas Fernandez de la","year":"2007","unstructured":"Wenceslas Fernandez de la Vega and Claire Kenyon-Mathieu. 2007. Linear programming relaxations of maxcut. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907). Society for Industrial and Applied Mathematics, USA, 53\u201361."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90056-N"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"Deza Michel","year":"1997","unstructured":"Michel Deza and Monique Laurent. 1997. Geometry of Cuts and Metrics. Springer."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.adi0487"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.109.012429"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"e_1_3_3_29_2","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028. Retrieved from https:\/\/arxiv.org\/abs\/1411.4028"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-07-07-759"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10036"},{"key":"e_1_3_3_32_2","first-page":"27","volume-title":"2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, Utah, U.S., January 5\u20136, 2020.","author":"Ferizovic Damir","year":"2020","unstructured":"Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, and Darren Strash. 2020. Engineering kernelization for maximum cut. In 2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, Utah, U.S., January 5\u20136, 2020.Society for Industrial and Applied Mathematics (SIAM), 27\u201341. DOI:DOI:10.1137\/1.9781611976007.3"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","unstructured":"Jernej Rudi Fin\u017egar Aron Kerschbaumer Martin J. A. Schuetz Christian B. Mendl and Helmut G. Katzgraber. 2024. Quantum-informed recursive optimization algorithms. PRX Quantum 5 2 (2024) 020327. arXiv:2308.13607. Retrieved from https:\/\/arxiv.org\/abs\/2308.13607","DOI":"10.1103\/PRXQuantum.5.020327"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms0376"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"issue":"1","key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF02591727","article-title":"A polynomial algorithm for the max-cut problem on graphs without long odd cycles","volume":"29","author":"Gr\u00f6tschel Martin","year":"1984","unstructured":"Martin Gr\u00f6tschel and George Nemhauser. 1984. A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Mathematical Programming 29, 1 (1984), 28\u201340.","journal-title":"Mathematical Programming"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43176-9"},{"key":"e_1_3_3_39_2","unstructured":"Gurobi Optimization LLC. 2024. Gurobi Optimizer Reference Manual. Retrieved from https:\/\/www.gurobi.com. Accessed 2024-05-16."},{"key":"e_1_3_3_40_2","unstructured":"Stuart Hadfield. 2018. Quantum Algorithms for Scientific Computing and Approximate Optimization. Ph.D. Dissertation. West Virginia University. arXiv:1805.03265. Retrieved from https:\/\/arxiv.org\/abs\/1805.03265"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1137\/0204019"},{"key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.25080\/TCWV9851","volume-title":"Proceedings of the 7th Python in Science Conference","author":"Hagberg Aric A.","year":"2008","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference, Ga\u00ebl Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11\u201315."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ab85b8"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-34614-w"},{"key":"e_1_3_3_47_2","unstructured":"IBM Quantum. 2021. Retrieved from https:\/\/quantum-computing.ibm.com\/. Accessed 2024-05-18."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.388"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459606"},{"key":"e_1_3_3_50_2","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"63:1\u201363:13","volume-title":"Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019)","volume":"144","author":"J\u00fcnger Michael","year":"2019","unstructured":"Michael J\u00fcnger and Sven Mallach. 2019. Odd-cycle separation for maximum cut and binary quadratic optimization. In Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019), Michael A. Bender, Ola Svensson, and Grzegorz Herman (Eds.). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 144, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 63:1\u201363:13. DOI:DOI:10.4230\/LIPIcs.ESA.2019.63"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.1008"},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department","author":"Karp Richard M.","year":"1972","unstructured":"Richard M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department, Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger (Eds.). Springer US, Boston, MA, 85\u2013103. DOI:DOI:10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100031"},{"key":"e_1_3_3_55_2","unstructured":"Jan-Hendrik Lange Bjoern Andres and Paul Swoboda. 2019. Combinatorial persistency criteria for multicut and max-cut. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. 6093\u20136102. arXiv:1812.01426. Retrieved from https:\/\/arxiv.org\/abs\/1812.01426"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1002\/3527603794.ch4"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.030"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9335-5"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_3_60_2","doi-asserted-by":"crossref","unstructured":"Danylo Lykov Jonathan Wurtz Cody Poole Mark Saffman Tom Noel and Yuri Alexeev. 2023. Sampling frequency thresholds for quantum advantage of quantum approximate optimization algorithm. npj Quantum Information 9 1 (2023) 73. arXiv:2206.03579. Retrieved from https:\/\/arxiv.org\/abs\/2206.03579","DOI":"10.1038\/s41534-023-00718-4"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3625307"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aab822"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac9013"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_28"},{"key":"e_1_3_3_66_2","unstructured":"Moises Ponce Rebekah Herrman Phillip C. Lotshaw Sarah Powers George Siopsis Travis Humble and James Ostrowski. 2023. Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms. arXiv:2306.00494. Retrieved from https:\/\/arxiv.org\/abs\/2306.00494"},{"key":"e_1_3_3_67_2","unstructured":"Qiskit. 2021. An Open-source Framework for Quantum Computing. Retrieved from http:\/\/www.qiskit.org. Accessed 2024-01-03."},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579368"},{"key":"e_1_3_3_69_2","doi-asserted-by":"crossref","unstructured":"Daniel Rehfeldt Thorsten Koch and Yuji Shinano. 2023. Faster exact solution of sparse MaxCut and QUBO problems. Mathematical Programming Computation 15 3 (2023) 445\u2013470. arXiv:2202.02305. Retrieved from https:\/\/arxiv.org\/abs\/2202.02305","DOI":"10.1007\/s12532-023-00236-6"},{"key":"e_1_3_3_70_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"Rendl Franz","year":"2007","unstructured":"Franz Rendl, Giovanni Rinaldi, and Angelika Wiegele. 2007. A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations. In Integer Programming and Combinatorial Optimization, Matteo Fischetti and David P. Williamson (Eds.). Springer, Berlin, 295\u2013309."},{"key":"e_1_3_3_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0235-8"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1252319"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3584706"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3549554"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.119.180509"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.105.032620"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02229-w"},{"key":"e_1_3_3_78_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.022304"},{"key":"e_1_3_3_79_2","unstructured":"Angelika Wiegele. 2007. Biq Mac Library\u2014Binary quadratic and Max cut library. Retrieved from https:\/\/biqmac.aau.at\/biqmaclib.html"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.10.021067"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:10Z","timestamp":1750295890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":79,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3711935"],"URL":"https:\/\/doi.org\/10.1145\/3711935","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]},"assertion":[{"value":"2023-05-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}