{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:44:09Z","timestamp":1767926649166,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,11]]},"DOI":"10.1145\/3573105.3575678","type":"proceedings-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T22:27:08Z","timestamp":1673476028000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Formal Disproof of Hirsch Conjecture"],"prefix":"10.1145","author":[{"given":"Xavier","family":"Allamigeon","sequence":"first","affiliation":[{"name":"Inria, France \/ \u00c9cole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Canu","sequence":"additional","affiliation":[{"name":"Inria, France \/ \u00c9cole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"Strub","sequence":"additional","affiliation":[{"name":"Meta, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9477-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/223\/03132"},{"key":"e_1_3_2_1_3_1","unstructured":"D. Avis. [n. d.]. The lrslib Library. http:\/\/cgm.cs.mcgill.ca\/ avis\/C\/lrs.html"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8438-9_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293050"},{"key":"e_1_3_2_1_6_1","volume-title":"Reflected Decision Procedures in Lean. Master\u2019s thesis","author":"Baek Seul","unstructured":"Seul Baek. 2019. Reflected Decision Procedures in Lean. Master\u2019s thesis. Carnegie Mellon University."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2018.00014"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-008-9101-x"},{"key":"e_1_3_2_1_11_1","volume-title":"Certified programming with dependent types: a pragmatic introduction to the Coq proof assistant","author":"Chlipala Adam","unstructured":"Adam Chlipala. 2013. Certified programming with dependent types: a pragmatic introduction to the Coq proof assistant. MIT Press. isbn:978-0-262-02665-9 http:\/\/adam.chlipala.net\/cpdt\/"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03545-1_10"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of POPL","author":"Cousot P.","year":"1978","unstructured":"P. Cousot and N. Halbwachs. 1978. Automatic discovery of linear restraints among variables of a program. In Proceedings of POPL 1978. ACM Press, Tucson, Arizona."},{"key":"e_1_3_2_1_14_1","volume-title":"Activity Analysis of Production and Allocation","author":"Dantzig G. B.","unstructured":"G. B. Dantzig. 1951. Maximization of a Linear Function of Variables Subject to Linear Inequalities, in Activity Analysis of Production and Allocation. Wiley."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.183"},{"key":"e_1_3_2_1_16_1","volume-title":"Hopp","author":"Disser Yann","year":"2022","unstructured":"Yann Disser, Oliver Friedmann, and Alexander V. Hopp. 2022. An exponential lower bound for Zadeh\u2019s pivot rule. Mathematical Programming."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12154-3_13"},{"key":"e_1_3_2_1_18_1","unstructured":"K. Fukuda. [n. d.]. The CDD Library. https:\/\/github.com\/cddlib\/cddlib"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"K. Fukuda and A. Prodon. 1996. Double Description Method Revisited. In Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science. Springer-Verlag London UK. 91\u2013111. isbn:3-540-61576-8","DOI":"10.1007\/3-540-61576-8_77"},{"key":"e_1_3_2_1_20_1","volume-title":"Polytopes\u2014combinatorics and computation (Oberwolfach","author":"Gawrilow Ewgenij","year":"1997","unstructured":"Ewgenij Gawrilow and Michael Joswig. 2000. polymake: a framework for analyzing convex polytopes. In Polytopes\u2014combinatorics and computation (Oberwolfach, 1997) (DMV Sem., Vol. 29). Birkh\u00e4user, Basel, 43\u201373."},{"key":"e_1_3_2_1_21_1","volume-title":"The Four Colour Theorem: Engineering of a Formal Proof","author":"Gonthier Georges","unstructured":"Georges Gonthier. 2008. The Four Colour Theorem: Engineering of a Formal Proof. In Computer Mathematics, Deepak Kapur (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 333\u2013333. isbn:978-3-540-87827-8"},{"key":"e_1_3_2_1_22_1","first-page":"95","article-title":"An introduction to small scale reflection in Coq","volume":"3","author":"Gonthier Georges","year":"2010","unstructured":"Georges Gonthier and Assia Mahboubi. 2010. An introduction to small scale reflection in Coq. Journal of Formalized Reasoning, 3, 2 (2010), 95\u2013152. https:\/\/hal.inria.fr\/inria-00515548","journal-title":"Journal of Formalized Reasoning"},{"key":"e_1_3_2_1_23_1","unstructured":"Georges Gonthier Assia Mahboubi and Enrico Tassi. 2016. A Small Scale Reflection Extension for the Coq system. Inria Saclay Ile de France."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11541868_7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9301-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021923116629"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the Tenth Symposium on Trends in Functional Programming, TFP 2009","author":"Daniel W.","year":"2009","unstructured":"Daniel W. H. James and Ralf Hinze. 2009. A Reflection-based Proof Tactic for Lattices in Coq. In Proceedings of the Tenth Symposium on Trends in Functional Programming, TFP 2009, Kom\u00e1rno, Slovakia, June 2-4, 2009, Zolt\u00e1n Horv\u00e1th, Vikt\u00f3ria Zs\u00f3k, Peter Achten, and Pieter W. M. Koopman (Eds.) (Trends in Functional Programming, Vol. 10). Intellect, 97\u2013112."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9050-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02395040"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300002850"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"T.S. Motzkin H. Raiffa G.L. Thompson and R.M. Thrall. 1953. The double description method. In Contributions to the Theory of Games H.W. Kuhn and A.W. Tucker (Eds.). II 51\u201373.","DOI":"10.1515\/9781400881970-004"},{"key":"e_1_3_2_1_33_1","volume-title":"A counterexample to the Hirsch conjecture.. Ann. Math., 176, 1","author":"Santos Francisco","year":"2012","unstructured":"Francisco Santos. 2012. A counterexample to the Hirsch conjecture.. Ann. Math., 176, 1 (2012), issn:0003-486X; 1939-8980\/e"},{"key":"e_1_3_2_1_34_1","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver Alexander","unstructured":"Alexander Schrijver. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, Inc., New York, NY, USA. isbn:0-471-90854-1"},{"key":"e_1_3_2_1_35_1","volume-title":"Mathematical Problems for the Next Century. Mathematical Intelligencer, 20","author":"Smale Steve","year":"1998","unstructured":"Steve Smale. 1998. Mathematical Problems for the Next Century. Mathematical Intelligencer, 20 (1998)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32759-9_35"},{"key":"e_1_3_2_1_37_1","unstructured":"William A. Stein. 2020. Sage Mathematics Software (Version 9.0). http:\/\/www.sagemath.org"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41582-1_10"},{"key":"e_1_3_2_1_39_1","volume-title":"Theorem Proving in Higher Order Logics","author":"von Henke Friedrich W.","unstructured":"Friedrich W. von Henke, Stephan Pfab, Holger Pfeifer, and Harald Rue. 1998. Case studies in meta-level theorem proving. In Theorem Proving in Higher Order Logics, Jim Grundy and Malcolm Newey (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 461\u2013478. isbn:978-3-540-49801-8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"G. M. Ziegler. 2012. Who solved the Hirsch conjecture? Documenta Mathematica 75\u2013\u201385. Extra Volume \"Optimization Stories\"","DOI":"10.4171\/dms\/6\/13"}],"event":{"name":"CPP '23: 12th ACM SIGPLAN International Conference on Certified Programs and Proofs","location":"Boston MA USA","acronym":"CPP '23","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573105.3575678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3573105.3575678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:45:38Z","timestamp":1750178738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573105.3575678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,11]]},"references-count":40,"alternative-id":["10.1145\/3573105.3575678","10.1145\/3573105"],"URL":"https:\/\/doi.org\/10.1145\/3573105.3575678","relation":{},"subject":[],"published":{"date-parts":[[2023,1,11]]},"assertion":[{"value":"2023-01-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}