{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:06:27Z","timestamp":1767139587018,"version":"build-2238731810"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T00:00:00Z","timestamp":1462752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T00:00:00Z","timestamp":1462752000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KA 1616\/4-1"],"award-info":[{"award-number":["KA 1616\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1160915"],"award-info":[{"award-number":["CMMI-1160915"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0315"],"award-info":[{"award-number":["N00014-14-1-0315"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-016-1709-8","type":"journal-article","created":{"date-parts":[[2016,5,8]],"date-time":"2016-05-08T23:45:52Z","timestamp":1462751152000},"page":"1931-1944","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extended Formulations for Independence Polytopes of Regular Matroids"],"prefix":"10.1007","volume":"32","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Walter","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,9]]},"reference":[{"issue":"5","key":"1709_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2015.06.011","volume":"43","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Kaibel, V., Walter, M., Weltge, S.: Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5), 457\u2013460 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1709_CR2","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schoenheim, J ( eds.) Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"1709_CR3","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1), 67\u201383 (2013). \n                    http:\/\/arxiv.org\/abs\/1111.0444","DOI":"10.1016\/j.disc.2012.09.015"},{"key":"1709_CR4","doi-asserted-by":"publisher","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC \u201912, pp. 95\u2013106. ACM, New York, USA (2012). doi:\n                    10.1145\/2213977.2213988","DOI":"10.1145\/2213977.2213988"},{"key":"1709_CR5","unstructured":"Grande, F., Sanyal, R.: Theta rank, levelness, and matroid minors. \n                    arXiv:1408.1262\n                    \n                   (2014)"},{"key":"1709_CR6","doi-asserted-by":"publisher","unstructured":"Iwata, S., Kamiyama, N., Katoh, N., Kijima, S., Okamoto, Y.: Extended formulations for sparsity matroids. Mathematical Programming (2015). doi:\n                    10.1007\/s10107-015-0936-8\n                    \n                   (printed version to appear)","DOI":"10.1007\/s10107-015-0936-8"},{"issue":"2","key":"1709_CR7","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00454-014-9655-9","volume":"53","author":"V Kaibel","year":"2015","unstructured":"Kaibel, V., Weltge, S.: A short proof that the extension complexity of the correlation polytope grows exponentially. Discrete Comput. Geome. 53(2), 396\u2013401 (2015). doi:\n                    10.1007\/s00454-014-9655-9","journal-title":"Discrete Comput. Geome."},{"key":"1709_CR8","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Corporation, New York (1976)"},{"issue":"3","key":"1709_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119\u2013128 (1991). doi:\n                    10.1016\/0167-6377(91)90028-N","journal-title":"Oper. Res. Lett."},{"key":"1709_CR10","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory, vol. 1997. Oxford University Press, Oxford (1992)"},{"key":"1709_CR11","doi-asserted-by":"publisher","unstructured":"Rothvoss, T.: Some 0\/1 polytopes need exponential size extended formulations. Math. Program. Ser. A 1\u201314 (2012). doi:\n                    10.1007\/s10107-012-0574-3","DOI":"10.1007\/s10107-012-0574-3"},{"key":"1709_CR12","doi-asserted-by":"publisher","unstructured":"Rothvoss, T.: The matching polytope has exponential extension complexity. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC \u201914, pp. 263\u2013272. ACM, New York, NY, USA (2014). doi:\n                    10.1145\/2591796.2591834","DOI":"10.1145\/2591796.2591834"},{"key":"1709_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"1709_CR14","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Berlin (2003)"},{"issue":"3","key":"1709_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1709_CR16","unstructured":"Tutte, W.T.: An algorithm for determining whether a given binary matroid is graphic. Proc. Am. Math. Soc. 11(6), 905\u2013917 (1960). \n                    http:\/\/www.jstor.org\/stable\/2034435"},{"issue":"1","key":"1709_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/net.10010","volume":"39","author":"JC Williams","year":"2002","unstructured":"Williams, J.C.: A linear-size zero\u2014one programming model for the minimum spanning tree problem in planar graphs. Networks 39(1), 53\u201360 (2002). doi:\n                    10.1002\/net.10010","journal-title":"Networks"}],"updated-by":[{"DOI":"10.1007\/s00373-019-02122-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T00:00:00Z","timestamp":1576454400000}}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1709-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1709-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1709-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1709-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T18:41:05Z","timestamp":1600281665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1709-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1709"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1709-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,9]]},"assertion":[{"value":"8 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"We report a logical error in our article that turns out to be fatal for the main result. The error lies in Lemma 3 for the case of a 3-sum, that is","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"We report a logical error in our article that turns out to be fatal for the main result. The error lies in Lemma 3 for the case of a 3-sum, that is","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}