{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:48Z","timestamp":1750309308441,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T00:00:00Z","timestamp":1697932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,22]]},"DOI":"10.1145\/3618305.3623600","type":"proceedings-article","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T13:36:31Z","timestamp":1697722591000},"page":"40-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards the Formal Verification of Wigderson\u2019s Algorithm"],"prefix":"10.1145","author":[{"given":"Siraphob","family":"Phipathananunth","sequence":"first","affiliation":[{"name":"Yale University, New Haven, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Andrew W. Appel. 2023. Verified Functional Algorithms (Software Foundations Vol. 3). Electronic textbook. \t\t\t\t  Andrew W. Appel. 2023. Verified Functional Algorithms (Software Foundations Vol. 3). Electronic textbook."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45685-6_4"},{"key":"e_1_3_2_1_3_1","unstructured":"Avrim Blum. 1991. Algorithms for approximate graph coloring. Ph. D. Dissertation. \t\t\t\t  Avrim Blum. 1991. Algorithms for approximate graph coloring. Ph. D. Dissertation."},{"key":"e_1_3_2_1_4_1","volume-title":"Information processing letters, 61, 1","author":"Blum Avrim","year":"1997","unstructured":"Avrim Blum and David Karger . 1997. An \u00d5(n^3\/14)-coloring algorithm for 3-colorable graphs. Information processing letters, 61, 1 ( 1997 ), 49\u201353. Avrim Blum and David Karger. 1997. An \u00d5(n^3\/14)-coloring algorithm for 3-colorable graphs. Information processing letters, 61, 1 (1997), 49\u201353."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9458-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-020-09543-2"},{"key":"e_1_3_2_1_7_1","first-page":"1382","article-title":"Formal Proof\u2014The Four-Color Theorem","volume":"55","author":"Gonthier Georges","year":"2008","unstructured":"Georges Gonthier . 2008 . Formal Proof\u2014The Four-Color Theorem . Notices of the AMS , 55 , 11 (2008), 1382 \u2013 1393 . Georges Gonthier. 2008. Formal Proof\u2014The Four-Color Theorem. Notices of the AMS, 55, 11 (2008), 1382\u20131393.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"volume-title":"Mechanized Verification of Graph-Manipulating Programs. Ph. D. Dissertation","author":"Shengyi Wang","key":"e_1_3_2_1_9_1","unstructured":"Wang Shengyi . 2020. Mechanized Verification of Graph-Manipulating Programs. Ph. D. Dissertation . National University of Singapore (Singapore) . Wang Shengyi. 2020. Mechanized Verification of Graph-Manipulating Programs. Ph. D. Dissertation. National University of Singapore (Singapore)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157.2158"}],"event":{"name":"SPLASH '23: 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"],"location":"Cascais Portugal","acronym":"SPLASH '23"},"container-title":["Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618305.3623600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:46Z","timestamp":1750291426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618305.3623600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,22]]},"references-count":10,"alternative-id":["10.1145\/3618305.3623600","10.1145\/3618305"],"URL":"https:\/\/doi.org\/10.1145\/3618305.3623600","relation":{},"subject":[],"published":{"date-parts":[[2023,10,22]]},"assertion":[{"value":"2023-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}