{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:36Z","timestamp":1781031456246,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2402283"],"award-info":[{"award-number":["CCF-2402283"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800732","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"106-117","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7775-0653","authenticated-orcid":false,"given":"Ron","family":"Mosenzon","sequence":"first","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00113"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.49"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.199"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718185"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978964.33"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.126"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103436"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Yonggang Jiang Yaowei Long Thatchaphol Saranurak and Benyu Wang. 2025. Crude Approximation of Directed Minimum Cut and Arborescence Packing in Almost Linear Time. arXiv preprint arXiv:2512.05300 https:\/\/doi.org\/10.48550\/arXiv.2512.05300 10.48550\/arXiv.2512.05300","DOI":"10.48550\/arXiv.2512.05300"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718304"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3743670"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Danupon Nanongkai Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai. 2019. Computing and testing small vertex connectivity in near-linear time and queries. arXiv preprint arXiv:1905.05329 https:\/\/doi.org\/10.48550\/arXiv.1905.05329 10.48550\/arXiv.1905.05329","DOI":"10.48550\/arXiv.1905.05329"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Kent Quanrud. 2025. Approximating Directed Connectivity in Almost-Linear Time. arXiv preprint arXiv:2512.00176 https:\/\/doi.org\/10.48550\/arXiv.2512.00176 10.48550\/arXiv.2512.00176","DOI":"10.48550\/arXiv.2512.00176"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00037"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800732","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:30Z","timestamp":1781028330000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":15,"alternative-id":["10.1145\/3798129.3800732","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800732","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}