{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T22:49:54Z","timestamp":1776552594962,"version":"3.51.2"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070203","type":"print"},{"value":"9783032070210","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-07021-0_3","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T13:43:45Z","timestamp":1759844625000},"page":"29-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automated Symmetric Constructions in Discrete Geometry"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2295-1299","authenticated-orcid":false,"given":"Bernardo","family":"Subercaseaux","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9130-6797","authenticated-orcid":false,"given":"Ethan","family":"Mackey","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1567-3948","authenticated-orcid":false,"given":"Long","family":"Qian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5587-8801","authenticated-orcid":false,"given":"Marijn","family":"Heule","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating Order Types for Small Point Sets with Applications. Order 19(3), 265\u2013281 (Sep 2002). https:\/\/doi.org\/10.1023\/A:1021231927255","journal-title":"Order"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/S0012-365X(02)00619-2","volume":"257","author":"N Alon","year":"2002","unstructured":"Alon, N.: Research problems. Kleitman and Combinatorics: A Celebration 257(2), 599\u2013624 (Nov 2002). https:\/\/doi.org\/10.1016\/S0012-365X(02)00619-2","journal-title":"Kleitman and Combinatorics: A Celebration"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Biere, A., Faller, T., Fazekas, K., Fleury, M., Froleyks, N., Pollitt, F.: CaDiCaL 2.0. In: Gurfinkel, A., Ganesh, V. (eds.) Computer Aided Verification - 36th International Conference, CAV 2024, Montreal, QC, Canada, July 24-27, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14681, pp. 133\u2013152. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65627-9_7","DOI":"10.1007\/978-3-031-65627-9_7"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Conlon, D., Lim, J.: Everywhere unbalanced configurations (2025), https:\/\/arxiv.org\/abs\/2308.02466","DOI":"10.1016\/j.aim.2025.110445"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(00)00232-8","volume":"109","author":"S Felsner","year":"2001","unstructured":"Felsner, S., Weil, H.: Sweeps, arrangements and signotopes. Discrete Applied Mathematics 109(1), 67\u201394 (Apr 2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00232-8","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR6","unstructured":"Giora, Goldstein, B.R.: From summetria to symmetry: The making of a revolutionary scientific concept. Archimedes: New Studies in the History and Philosophy of Science and Technology, Springer, New York, NY, 2008 edn. (Jul 2008)"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1609\/aaai.v24i1.7549","volume":"24","author":"M Heule","year":"2010","unstructured":"Heule, M., Walsh, T.: Symmetry in Solutions. Proceedings of the AAAI Conference on Artificial Intelligence 24(1), 77\u201382 (Jul 2010). https:\/\/doi.org\/10.1609\/aaai.v24i1.7549","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H.: Avoiding triples in arithmetic progression. Journal of Combinatorics 8(3), 391\u2013422 (Jun 2017). https:\/\/doi.org\/10.4310\/JOC.2017.v8.n3.a1","DOI":"10.4310\/JOC.2017.v8.n3.a1"},{"key":"3_CR9","unstructured":"Heule, M.J.H.: Schur number five. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence. pp. 6598\u20136606. AAAI\u201918\/IAAI\u201918\/EAAI\u201918, AAAI Press, New Orleans, Louisiana, USA (Feb 2018)"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H., Scheucher, M.: Happy Ending: An Empty Hexagon in\u00a0Every\u00a0Set\u00a0of\u00a030\u00a0Points. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 61\u201380. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57246-3_5","DOI":"10.1007\/978-3-031-57246-3_5"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Knuth, D.E.: Axioms and Hulls. In: Knuth, D.E. (ed.) Axioms and Hulls, pp. 1\u201398. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (1992).https:\/\/doi.org\/10.1007\/3-540-55611-7_1","DOI":"10.1007\/3-540-55611-7_1"},{"key":"3_CR12","unstructured":"Kupitz, Y.S.: Extremal problems in combinatorial geometry. Lecture notes series, Aarhus Universitet, Matematisk Institut (1979), https:\/\/cir.nii.ac.jp\/crid\/1130000794692453120"},{"key":"3_CR13","unstructured":"Mackey, E.: Pinwheels and Polygons: Symmetric Realizations of Polygon-Free Point Placements via SAT. Master\u2019s thesis, Carnegie Mellon University (2025), http:\/\/reports-archive.adm.cs.cmu.edu\/anon\/2025\/CMU-CS-25-108.pdf"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Morris, W., Soltan, V.: The Erdos-Szekeres problem on points in convex position \u2013 a survey. Bulletin of the American Mathematical Society 37(4), 437\u2013458 (2000).https:\/\/doi.org\/10.1090\/S0273-0979-00-00877-6","DOI":"10.1090\/S0273-0979-00-00877-6"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Perlis, A.J.: Special feature: Epigrams on programming. SIGPLAN Not. 17(9), 7\u201313 (1982). https:\/\/doi.org\/10.1145\/947955.1083808, https:\/\/doi.org\/10.1145\/947955.1083808","DOI":"10.1145\/947955.1083808"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00454-003-2826-8","volume":"30","author":"R Pinchasi","year":"2003","unstructured":"Pinchasi, R.: Lines With Many Points On Both Sides. Discrete & Computational Geometry 30(3), 415\u2013435 (Sep 2003). https:\/\/doi.org\/10.1007\/s00454-003-2826-8","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Complexity of Some Geometric and Topological Problems. In: Eppstein, D., Gansner, E.R. (eds.) Graph Drawing. pp. 334\u2013344. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32","DOI":"10.1007\/978-3-642-11805-0_32"},{"key":"3_CR18","unstructured":"Scheucher, M.: On Order Types, Projective Classes, and Realizations. Bachelor\u2019s thesis, Graz University of Technology (2014)"},{"key":"3_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101670","volume":"91","author":"M Scheucher","year":"2020","unstructured":"Scheucher, M.: Two disjoint 5-holes in point sets. Computational Geometry 91, 101670 (2020).https:\/\/doi.org\/10.1016\/j.comgeo.2020.101670","journal-title":"Computational Geometry"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Scheucher, M.: A SAT Attack on Erd\u0151s-Szekeres Numbers in R\u2303d and the Empty Hexagon Theorem. Computing in Geometry and Topology 2(1), 2:1\u20132:13 (Mar 2023). https:\/\/doi.org\/10.57717\/cgt.v2i1.12","DOI":"10.57717\/cgt.v2i1.12"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03709, pp. 827\u2013831. Springer (2005). https:\/\/doi.org\/10.1007\/11564751_73, https:\/\/doi.org\/10.1007\/11564751_73","DOI":"10.1007\/11564751_73"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Subercaseaux, B., Mackey, E., Qian, L., Heule, M.J.H.: Automated symmetric constructions in discrete geometry (2025), https:\/\/arxiv.org\/abs\/2506.00224","DOI":"10.1007\/978-3-032-07021-0_3"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Subercaseaux, B., Mackey, J., Heule, M.J.H., Martins, R.: Automated mathematical discovery and verification: Minimizing pentagons in the plane (2024), https:\/\/arxiv.org\/abs\/2311.03645","DOI":"10.1007\/978-3-031-66997-2_2"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Subercaseaux, B., Nawrocki, W., Gallicchio, J., Codel, C., Carneiro, M., Heule, M.J.H.: Formal Verification of the Empty Hexagon Number. In: Bertot, Y., Kutsia, T., Norrish, M. (eds.) 15th International Conference on Interactive Theorem Proving (ITP 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0309, pp. 35:1\u201335:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2024.35","DOI":"10.4230\/LIPIcs.ITP.2024.35"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1017\/S144618110000300X","volume":"48","author":"G Szekeres","year":"2006","unstructured":"Szekeres, G., Peters, L.: Computer solution to the 17-point Erd\u0151s-Szekeres problem. The ANZIAM Journal 48(2), 151\u2013164 (2006). https:\/\/doi.org\/10.1017\/S144618110000300X","journal-title":"The ANZIAM Journal"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E. (eds.): Handbook of Discrete and Computational Geometry. Chapman and Hall\/CRC, New York, 3 edn. (Nov 2017). https:\/\/doi.org\/10.1201\/9781315119601","DOI":"10.1201\/9781315119601"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, \u0130., Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P., SciPy 1.0 Contributors: SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Walsh, T.: Symmetry within and between Solutions. In: Zhang, B.T., Orgun, M.A. (eds.) PRICAI 2010: Trends in Artificial Intelligence. pp. 11\u201313. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15246-7_4","DOI":"10.1007\/978-3-642-15246-7_4"},{"key":"3_CR29","unstructured":"Weyl, H.: Symmetry. Princeton Science Library, Princeton University Press, Princeton, NJ (Dec 2016)"},{"key":"3_CR30","unstructured":"Wikipedia: Happy ending problem \u2014 Wikipedia, the free encyclopedia. http:\/\/en.wikipedia.org\/w\/index.php?title=Happy%20ending%20problem&oldid=1282669476 (2025), [Online; accessed 12-May-2025]"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07021-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T10:21:18Z","timestamp":1776507678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07021-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070203","9783032070210"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07021-0_3","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":"8 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brasilia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2025\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}