{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:07:05Z","timestamp":1750694825613,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF (National Science Foundation)","award":["CCF-1750140 (CAREER), CCF-1955703, CCF-2329230"],"award-info":[{"award-number":["CCF-1750140 (CAREER), CCF-1955703, CCF-2329230"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649753","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1700-1711","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraph Unreliability in Quasi-Polynomial Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3900-2344","authenticated-orcid":false,"given":"Ruoxu","family":"Cen","sequence":"first","affiliation":[{"name":"Duke University, Durham, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3644-0879","authenticated-orcid":false,"given":"Jason","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1799-6660","authenticated-orcid":false,"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Duke University, Durham, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1943709.1943718"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1414024"},{"key":"e_1_3_2_1_3_1","volume-title":"Beyond the Quadratic Time Barrier for Network Unreliability. In 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA). 1542\u20131567","author":"Cen Ruoxu","year":"2024","unstructured":"Ruoxu Cen, William He, Jason Li, and Debmalya Panigrahi. 2024. Beyond the Quadratic Time Barrier for Network Unreliability. In 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA). 1542\u20131567."},{"volume-title":"Network reliability: measures and evaluation","author":"Chaturvedi Sanjay Kumar","key":"e_1_3_2_1_4_1","unstructured":"Sanjay Kumar Chaturvedi. 2016. Network reliability: measures and evaluation. John Wiley & Sons."},{"key":"e_1_3_2_1_5_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP). 50:1\u201350:20","author":"Chekuri Chandra","year":"2021","unstructured":"Chandra Chekuri and Kent Quanrud. 2021. Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. In 48th International Colloquium on Automata, Languages, and Programming (ICALP). 50:1\u201350:20."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1163865"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"volume-title":"The combinatorics of network reliability","author":"Colbourn Charles J","key":"e_1_3_2_1_8_1","unstructured":"Charles J Colbourn. 1987. The combinatorics of network reliability. Oxford University Press, Inc.."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579341"},{"key":"e_1_3_2_1_10_1","unstructured":"E.A. Dinitz A.V. Karzanov and M.V. Lomonosov. 1976. On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization (in Russian) (ed. A.A. Fridman) Nauka Moscow 290\u2013306."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.71"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.066118"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20724"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313605"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/333115.333124"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.96"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.75"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384336"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"e_1_3_2_1_20_1","volume-title":"Sketching Cuts in Graphs and Hypergraphs. In 2015 Conference on Innovations in Theoretical Computer Science (ITCS). 367\u2013376","author":"Kogan Dmitry","year":"2015","unstructured":"Dmitry Kogan and Robert Krauthgamer. 2015. Sketching Cuts in Graphs and Hypergraphs. In 2015 Conference on Innovations in Theoretical Computer Science (ITCS). 367\u2013376."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":21,"alternative-id":["10.1145\/3618260.3649753","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649753","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}