{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:32Z","timestamp":1781305052939,"version":"3.54.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_13","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:28Z","timestamp":1781303608000},"page":"188-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Threshold Phenomenon for\u00a0the\u00a0Shortest Lattice Vector Problem in\u00a0the\u00a0Infinity Norm"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kuhlmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/22M1486959","volume":"54","author":"D Aggarwal","year":"2025","unstructured":"Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding. SIAM J. Comput. 54(2), 233\u2013278 (2025)","journal-title":"SIAM J. Comput."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in $$2^n$$ time using discrete gaussian sampling: extended abstract. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC, pp. 733\u2013742 (2015)","DOI":"10.1145\/2746539.2746606"},{"key":"13_CR3","unstructured":"Aggarwal,D., Mukhopadhyay, P.: Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm. In: 29th International Symposium on Algorithms and Computation, ISAAC, vol. 123, LIPIcs, pp. 35:1\u201335:13 (2018)"},{"key":"13_CR4","unstructured":"Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! an embarrassingly simple $$2^n$$-time algorithm for SVP (and CVP). In: 1st Symposium on Simplicity in Algorithms, SOSA, vol.\u00a061 of OASIcs, pp. 12:1\u201312:19 (2018)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10107-021-01657-8","volume":"192","author":"I Aliev","year":"2022","unstructured":"Aliev, I., Averkov, G., De Loera, J.A., Oertel, T.: Sparse representation of vectors in lattices and semigroups. Math. Prog. Ser. B 192, 519\u2013546 (2022)","journal-title":"Math. Prog. Ser. B"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/23M1561312","volume":"34","author":"I Aliev","year":"2024","unstructured":"Aliev, I., Henk, M., Hogan, M., Kuhlmann, S., Oertel, T.: New bounds for the integer Carath\u00e9odory rank. SIAM J. Optim. 34(1), 190\u2013200 (2024)","journal-title":"SIAM J. Optim."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1137\/17M1162792","volume":"28","author":"I Aliev","year":"2018","unstructured":"Aliev, I., De Loera, J.A., Eisenbrand, F., Oertel, T., Weismantel, R.: The support of integer optimal solutions. SIAM J. Optim. 28, 2152\u20132157 (2018)","journal-title":"SIAM J. Optim."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1137\/16M1083876","volume":"1","author":"I Aliev","year":"2017","unstructured":"Aliev, I., De Loera, J.A., Oertel, T., O\u2019Neill, C.: Sparse solutions of linear Diophantine equations. SIAM J. Appl. Algebra Geom. 1, 239\u2013253 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Aprile, M., et al.: Integer programs with nearly totally unimodular matrices: the cographic case. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2301\u20132312 (2025)","DOI":"10.1137\/1.9781611978322.76"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., \u00a0Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1206\u20131219 (2017)","DOI":"10.1145\/3055399.3055473"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Berndt, S., Jansen, K., Klein, K.-M.: New bounds for the vertices of the integer hull. In: Symposium on Simplicity in Algorithms (SOSA), pp. 25\u201336 (2021)","DOI":"10.1137\/1.9781611976496.3"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Berndt, S., Mnich, M., Stamm, T.: New support size bounds and proximity bounds for integer linear programming. In: International Conference on Current Trends in Theory and Practice of Computer Science, pp. 82\u201395. Springer (2024)","DOI":"10.1007\/978-3-031-52113-3_6"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-73420-8_8","volume-title":"Automata, Languages and Programming","author":"J Bl\u00f6mer","year":"2007","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 65\u201377. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_8"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1287\/moor.2022.0335","volume":"49","author":"M Celaya","year":"2023","unstructured":"Celaya, M., Kuhlmann, S., Paat, J., Weismantel, R.: Proximity and flatness bounds for linear integer optimization. Math. Oper. Res. 49(4), 2446\u20132467 (2023)","journal-title":"Math. Oper. Res."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Celaya, M., Kuhlmann, S., Weismantel, R.: On matrices over a polynomial ring with restricted subdeterminants. In: Integer Programming and Combinatorial Optimization, pp. 43\u201356 (2024)","DOI":"10.1007\/978-3-031-59835-7_4"},{"key":"13_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801518","volume-title":"An Introduction to the Theory of Graph Spectra","author":"D Cvetkovi\u0107","year":"2009","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: An Introduction to the Theory of Graph Spectra. London Mathematical Society Student Texts, Cambridge University Press (2009)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Integer programming and algorithmic geometry of numbers - a tutorial. In: 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art, pp. 505\u2013559. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_14"},{"issue":"5","key":"13_CR19","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett. 34(5), 564\u2013548 (2006)","journal-title":"Oper. Res. Lett."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Joret, G., Weltge, S., Yuditsky, Y.: Integer programs with bounded subdeterminants and two nonzeros per row. J. ACM 72(1), (2025)","DOI":"10.1145\/3695985"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10898-022-01165-9","volume":"88","author":"D Gribanov","year":"2024","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D., Pardalos, P.: On $${\\Delta }$$-modular integer linear problems in the canonical form and equivalent problems. J. Global Optim. 88(3), 591\u2013651 (2024)","journal-title":"J. Global Optim."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-018-0264-z","volume":"35","author":"DV Gribanov","year":"2018","unstructured":"Gribanov, D.V., Malyshev, D.S., Pardalos, P.M., Veselov, S.I.: FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35(4), 1128\u20131146 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0264-z","journal-title":"J. Comb. Optim."},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11590-023-02017-5","volume":"18","author":"DV Gribanov","year":"2024","unstructured":"Gribanov, D.V., Shumilov, I.A., Malyshev, D.S.: Structured (min,+)-convolution and its applications for the shortest\/closest vector and nonlinear knapsack problems. Optimiz.Lett. 18, 73\u2013103 (2024)","journal-title":"Optimiz.Lett."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Hanrot, G., \u00a0Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Advances in Cryptology - Crypto 2007. Proceedings, pp. 170\u2013186 (2007)","DOI":"10.1007\/978-3-540-74143-5_10"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","volume":"41","author":"B Helfrich","year":"1985","unstructured":"Helfrich, B.: Algorithms to construct minkowski reduced an hermite reduced lattice bases. Theor. Comput. Sci. 41, 125\u2013139 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623875","volume-title":"Methods of Algebraic Geometry","author":"WVD Hodge","year":"1994","unstructured":"Hodge, W.V.D., Pedoe, D.: Methods of Algebraic Geometry. Cambridge University Press, Cambridge Mathematical Library (1994)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.J., eds., Linear Inequalities and Related Systems, pp. 223\u2013246 (1956)","DOI":"10.1515\/9781400881987-014"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related problems. In: Proceedings of of STOC, pp. 193 \u2013 206 (1983)","DOI":"10.1145\/800061.808749"},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"13_CR31","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix. SIAM J. Comput. 8(4), 499\u2013507 (1979)","journal-title":"SIAM J. Comput."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Kober,S.: Totally $$\\Delta $$-modular IPs with two non-zeros in most rows. In: Integer Programming and Combinatorial Optimization, pp. 355\u2013370 (2025)","DOI":"10.1007\/978-3-031-93112-3_26"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. In: Combinatorial Optimization: 6th International Symposium ISCO, pp. 115\u2013127 (2020)","DOI":"10.1007\/978-3-030-53262-8_10"},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev,O.: Lattice-based cryptography. In: Post-Quantum Cryptography, pp. 147\u2013191. Springer Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"issue":"3","key":"13_CR37","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. SIAM J. Comput. 42(3), 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"key":"13_CR38","first-page":"276","volume-title":"Fast Lattice Point Enumeration with Minimal Overhead","author":"D Micciancio","year":"2015","unstructured":"Micciancio, D., Walter, M.: Fast Lattice Point Enumeration with Minimal Overhead, pp. 276\u2013294. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2015)"},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10107-024-02148-2","volume":"210","author":"M N\u00e4gele","year":"2025","unstructured":"N\u00e4gele, M., N\u00f6bel, C., Santiago, R., Zenklusen, R.: Advances on strictly $$\\Delta $$-Modular IPs. Math. Prog 210, 731\u2013760 (2025)","journal-title":"Math. Prog"},{"issue":"3","key":"13_CR40","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1287\/moor.2023.1381","volume":"49","author":"M N\u00e4gele","year":"2023","unstructured":"N\u00e4gele, M., Santiago, R., Zenklusen, R.: Congruency-constrained TU problems beyond the bimodular case. Math. Oper. Res. 49(3), 1303\u20131348 (2023)","journal-title":"Math. Oper. Res."},{"key":"13_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"P Nguyen","year":"2008","unstructured":"Nguyen, P., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Crypt. 2, 181\u2013207 (2008)","journal-title":"J. Math. Crypt."},{"issue":"3","key":"13_CR42","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/19M1275954","volume":"4","author":"T Oertel","year":"2020","unstructured":"Oertel, T., Paat, J., Weismantel, R.: The distributions of functions related to parametric integer optimization. SIAM J. Appl. Algeb. Geom. 4(3), 422\u2013440 (2020)","journal-title":"SIAM J. Appl. Algeb. Geom."},{"issue":"2","key":"13_CR43","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/21M1419131","volume":"36","author":"J Oxley","year":"2022","unstructured":"Oxley, J., Walsh, Z.: 2-modular matrices. SIAM J. Discret. Math. 36(2), 1231\u20131248 (2022)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR44","unstructured":"Pujol, X., Stehle,D.: Solving the shortest lattice vector problem in time $$2^{2.465n}$$. Cryptology ePrint Archive, Paper 2009\/605 (2009)"},{"key":"13_CR45","unstructured":"Regev, O.: Lattices in Computer Science. Lecture Notes Tel Aviv University (2004)"},{"key":"13_CR46","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming, Wiley (1986)"},{"key":"13_CR47","unstructured":"van Emde\u00a0Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, Mathematische Instituut, University of Amsterdam (1981)"},{"key":"13_CR48","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"SI Veselov","year":"2009","unstructured":"Veselov, S.I., Chirkov, A.J.: Integer program with bimodular matrix. Discret. Optim. 6, 220\u2013222 (2009)","journal-title":"Discret. Optim."},{"key":"13_CR49","unstructured":"Veselov, S.I., Shevchenko,V.N.: Estimates of minimal distance between point of some integral lattices. Combinat. Algeb. Meth. Appl. Math., pp. 26\u201333 (1980)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:38Z","timestamp":1781303618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}