{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:07:02Z","timestamp":1774627622914,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CAREER Award CCF-1844855, Grant CCF-1955039"],"award-info":[{"award-number":["CAREER Award CCF-1844855, Grant CCF-1955039"]}],"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":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585136","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"196-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification"],"prefix":"10.1145","author":[{"given":"Arun","family":"Jambulapati","sequence":"first","affiliation":[{"name":"University of Washington, USA"}]},{"given":"Yang P.","family":"Liu","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Aaron","family":"Sidford","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.65"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00059"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772873"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/070705970"},{"key":"e_1_3_2_1_5_1","volume-title":"Approximation of zonoids by zonotopes. Acta mathematica, 162","author":"Bourgain Jean","year":"1989","unstructured":"Jean Bourgain , Joram Lindenstrauss , and Vitali Milman . 1989. Approximation of zonoids by zonotopes. Acta mathematica, 162 ( 1989 ), 73\u2013141. Jean Bourgain, Joram Lindenstrauss, and Vitali Milman. 1989. Approximation of zonoids by zonotopes. Acta mathematica, 162 (1989), 73\u2013141."},{"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\/FOCS46700.2020.00015"},{"key":"e_1_3_2_1_8_1","volume-title":"COLT (Proceedings of Machine Learning Research","volume":"873","author":"Cohen Michael B.","year":"2019","unstructured":"Michael B. Cohen , Ben Cousins , Yin Tat Lee , and Xin Yang . 2019 . A near-optimal algorithm for approximating the John Ellipsoid . In COLT (Proceedings of Machine Learning Research , Vol. 99). PMLR, 849\u2013 873 . Michael B. Cohen, Ben Cousins, Yin Tat Lee, and Xin Yang. 2019. A near-optimal algorithm for approximating the John Ellipsoid. In COLT (Proceedings of Machine Learning Research, Vol. 99). PMLR, 849\u2013873."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688113"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746567"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-1236(67)90017-1"},{"key":"e_1_3_2_1_13_1","volume-title":"IV-1974","author":"Fernique X.","unstructured":"X. Fernique . 1975. Regularit\u00e9 des trajectoires des fonctions al\u00e9atoires gaussiennes. In \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour , IV-1974 . Springer , Berlin , 1\u201396. X. Fernique. 1975. Regularit\u00e9 des trajectoires des fonctions al\u00e9atoires gaussiennes. In \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour, IV-1974. Springer, Berlin, 1\u201396."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519971"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3458064.3458097"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00114"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451061"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488724"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688093"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845914"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.85"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897640"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"e_1_3_2_1_24_1","unstructured":"James R Lee. 2022. Spectral hypergraph sparsification via chaining. arXiv preprint arXiv:2209.04539. \t\t\t\t  James R Lee. 2022. Spectral hypergraph sparsification via chaining. arXiv preprint arXiv:2209.04539."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.22"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00076"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591832"},{"key":"e_1_3_2_1_28_1","first-page":"1996","article-title":"Random vectors in the isotropic position","author":"Rudelson Mark","year":"1996","unstructured":"Mark Rudelson . 1996 . Random vectors in the isotropic position .. MSRI Preprint 1996 - 1060 . Mark Rudelson. 1996. Random vectors in the isotropic position.. MSRI Preprint 1996-060.","journal-title":"MSRI Preprint"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2011-10863-3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/1522-2616(200107)227:1<133::AID-MANA133>3.0.CO;2-8"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.159"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392556"},{"key":"e_1_3_2_1_35_1","first-page":"363","article-title":"Embedding subspaces of L_1 into \u2113 _1^N","volume":"108","author":"Talagrand Michel","year":"1990","unstructured":"Michel Talagrand . 1990 . Embedding subspaces of L_1 into \u2113 _1^N . Proc. Amer. Math. Soc. , 108 , 2 (1990), 363 \u2013 369 . Michel Talagrand. 1990. Embedding subspaces of L_1 into \u2113 _1^N. Proc. Amer. Math. Soc., 108, 2 (1990), 363\u2013369.","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_3_2_1_36_1","volume-title":"Geometric aspects of functional analysis (Israel","author":"Talagrand M.","year":"1992","unstructured":"M. Talagrand . 1995. Embedding subspaces of L_p in l^N_p . In Geometric aspects of functional analysis (Israel , 1992 \u20131994) (Oper. Theory Adv. Appl ., Vol. 77). Birkh\u00e4user, Basel, 311\u2013 325 . M. Talagrand. 1995. Embedding subspaces of L_p in l^N_p. In Geometric aspects of functional analysis (Israel, 1992\u20131994) (Oper. Theory Adv. Appl., Vol. 77). Birkh\u00e4user, Basel, 311\u2013325."},{"key":"e_1_3_2_1_37_1","volume-title":"Upper and lower bounds for stochastic processes. 60","author":"Talagrand Michel","unstructured":"Michel Talagrand . 2014. Upper and lower bounds for stochastic processes. 60 , Springer . Michel Talagrand. 2014. Upper and lower bounds for stochastic processes. 60, Springer."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01046996"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585136","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":38,"alternative-id":["10.1145\/3564246.3585136","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585136","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}