{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:37Z","timestamp":1776316837583,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030431198","type":"print"},{"value":"9783030431204","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_29","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"364-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Transport to a Variety"],"prefix":"10.1007","author":[{"given":"T\u00fcrk\u00fc \u00d6zl\u00fcm","family":"\u00c7elik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asgar","family":"Jamneshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Mont\u00fafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Sturmfels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Venturello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.18409\/jas.v10i1.75","volume":"34","author":"E Allman","year":"2019","unstructured":"Allman, E., et al.: Maximum likelihood estimation of the latent class model through model boundary decomposition. J. Algebraic Stat. 34, 51\u201384 (2019)","journal-title":"J. Algebraic Stat."},{"key":"29_CR2","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein GAN. arXiv:1701.07875"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1016\/j.spl.2006.02.001","volume":"76","author":"F Bassetti","year":"2006","unstructured":"Bassetti, F., Bodini, A., Regazzini, E.: On minimum Kantorovich distance estimators. Stat. Probab. Lett. 76, 1298\u20131302 (2006)","journal-title":"Stat. Probab. Lett."},{"issue":"4","key":"29_CR4","first-page":"657","volume":"8","author":"E Bernton","year":"2019","unstructured":"Bernton, E., Jacob, P., Gerber, M., Robert, C.: On parameter estimation with the Wasserstein distance. Inf. Infer. J. IMA 8(4), 657\u2013676 (2019)","journal-title":"Inf. Infer. J. IMA"},{"key":"29_CR5","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in Neural Information Processing Systems, Proceedings NIPS 2013, pp. 2292\u20132300 (2013)"},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics","author":"JA Loera De","year":"2010","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics, vol. 25. Springer-Verlag, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12971-1"},{"key":"29_CR7","unstructured":"Duarte, E., Marigliano, O., Sturmfels, B.: Discrete statistical models with rational maximum likelihood estimator. arXiv:1903.06110"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1515\/advgeom.2010.012","volume":"10","author":"K Kulas","year":"2010","unstructured":"Kulas, K., Joswig, M.: Tropical and ordinary convexity combined. Adv. Geom. 10, 333\u2013352 (2010)","journal-title":"Adv. Geom."},{"key":"29_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-Algebraic Optimization, Texts in Applied Mathematics","author":"J Lasserre","year":"2015","unstructured":"Lasserre, J.: An Introduction to Polynomial and Semi-Algebraic Optimization, Texts in Applied Mathematics. Cambridge University Press, Cambridge (2015)"},{"key":"29_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/b138602","volume-title":"Combinatorial Commutative Algebra","author":"E Miller","year":"2005","unstructured":"Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer-Verlag, New York (2005). https:\/\/doi.org\/10.1007\/b138602"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Pele, O., Werman, M.: Fast and robust earth mover\u2019s distances. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 460\u2013467, September 2009","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyre","year":"2019","unstructured":"Peyre, G., Cuturi, M.: Computational optimal transport. Found. Trends Mach. Learn. 11, 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"29_CR13","first-page":"285","volume":"30","author":"P Rostalski","year":"2010","unstructured":"Rostalski, P., Sturmfels, B.: Dualities in convex algebraic geometry. Rendiconti di Matematica 30, 285\u2013327 (2010)","journal-title":"Rendiconti di Matematica"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18409\/jas.v9i1.90","volume":"9","author":"A Seigal","year":"2018","unstructured":"Seigal, A., Mont\u00fafar, G.: Mixtures and products in two graphical models. J. Alg. Stat. 9, 1\u201320 (2018)","journal-title":"J. Alg. Stat."},{"key":"29_CR15","series-title":"University Lecture Series","volume-title":"Gr\u00f6bner Bases and Convex Polytopes","author":"B Sturmfels","year":"1996","unstructured":"Sturmfels, B.: Gr\u00f6bner Bases and Convex Polytopes. University Lecture Series, vol. 8. American Mathematical Society, Providence (1996)"},{"key":"29_CR16","series-title":"Graduate Studies in Math","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/194","volume-title":"Algebraic Statistics","author":"S Sullivant","year":"2018","unstructured":"Sullivant, S.: Algebraic Statistics. Graduate Studies in Math. American Mathematical Society, Providence (2018)"},{"key":"29_CR17","series-title":"Grundlehren Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport: Old and New. Grundlehren Series, vol. 338. Springer Verlag, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71050-9"},{"key":"29_CR18","unstructured":"Weed, J., Bach, F.: Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. arXiv:1707.00087"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:47:03Z","timestamp":1666140423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}