{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:03Z","timestamp":1781031423075,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":60,"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":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2327011"],"award-info":[{"award-number":["CCF-2327011"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2504995"],"award-info":[{"award-number":["CCF-2504995"]}],"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.3800762","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"432-442","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Decoupling via Affine Spectral-Independence: Beck-Fiala and Koml\u00f3s Bounds beyond Banaszczyk"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6290-0894","authenticated-orcid":false,"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7501-2247","authenticated-orcid":false,"given":"Haotian","family":"Jiang","sequence":"additional","affiliation":[{"name":"University of 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.1002\/rsa.21054"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3450994"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00125"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199807)12:4<351::AID-RSA3>3.0.CO;2-S"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316313"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4171\/icm2022-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126795"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188850"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055490"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00015"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.65"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Nikhil Bansal Haotian Jiang Raghu Meka Sahil Singla and Makrand Sinha. 2022. Smoothed analysis of the Koml\u00f3s conjecture. In Intl. Colloquium on Automata Languages and Programming (ICALP). 14\u20131. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.14 10.4230\/LIPIcs.ICALP.2022.14","DOI":"10.4230\/LIPIcs.ICALP.2022.14"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Nikhil Bansal Aditi Laddha and Santosh Vempala. 2022. A Unified Approach to Discrepancy Minimization. In APPROX\/RANDOM. 1\u20131. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2022.1 10.4230\/LIPIcs.APPROX\/RANDOM.2022.1","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2022.1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20935"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520077"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9728-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579452"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01196138"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/110856332"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000140"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1515\/advgeom-2019-0030"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/507108"},{"key":"e_1_3_2_1_26_1","volume-title":"A panorama of discrepancy theory. 2107","author":"Chen William","unstructured":"William Chen, Anand Srivastav, and Giancarlo Travaglini. 2014. A panorama of discrepancy theory. 2107, Springer."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX-RANDOM.2016.28"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20763"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20810"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20909"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1989v064n01ABEH003295"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80024-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2023.2285474"},{"key":"e_1_3_2_1_34_1","unstructured":"Nicholas Harvey Roy Schwartz and Mohit Singh. 2014. Discrepancy without partial colorings. In APPROX\/RANDOM."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.11.020"},{"key":"e_1_3_2_1_36_1","volume-title":"On the Beck-Fiala theorem. Discrete mathematics, 207, 1-3","author":"Helm Martin","year":"1999","unstructured":"Martin Helm. 1999. On the Beck-Fiala theorem. Discrete mathematics, 207, 1-3 (1999), 73\u201387."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.156"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH152"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.186"},{"key":"e_1_3_2_1_40_1","unstructured":"Jeff Kahn. [n. d.]. Personal Communication"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M149819X"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978315.24"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Avi Levy Harishchandra Ramadas and Thomas Rothvoss. 2017. Deterministic discrepancy minimization via the multiplicative weight update method. In Integer Programming and Combinatorial Optimization (IPCO). 380\u2013391.","DOI":"10.1007\/978-3-319-59250-3_31"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929400"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3"},{"key":"e_1_3_2_1_46_1","volume-title":"Symposium on Computational Geometry, SoCG. 1\u201315","author":"Matousek Jir\u00ed","year":"2015","unstructured":"Jir\u00ed Matousek and Aleksandar Nikolov. 2015. Combinatorial Discrepancy for Boxes via the \u03b3 _2 Norm. In Symposium on Computational Geometry, SoCG. 1\u201315."},{"key":"e_1_3_2_1_47_1","volume-title":"Symposium on Foundations of Computer Science, FOCS. 253\u2013262","author":"Newman Alantha","year":"2012","unstructured":"Alantha Newman, Ofer Neiman, and Aleksandar Nikolov. 2012. Beck\u2019s three permutations conjecture: A counterexample and some consequences. In Symposium on Foundations of Computer Science, FOCS. 253\u2013262."},{"key":"e_1_3_2_1_48_1","unstructured":"Aleksandar Nikolov. 2013. The Koml\u00f3s conjecture holds for vector colorings. arXiv preprint arXiv:1301.4039."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579317000250"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH66"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-019-00134-6"},{"key":"e_1_3_2_1_53_1","first-page":"1","article-title":"A Spectral Bound on Hypergraph Discrepancy","volume":"93","author":"Potukuchi Aditya","year":"2020","unstructured":"Aditya Potukuchi. 2020. A Spectral Bound on Hypergraph Discrepancy. In International Colloquium on Automata, Languages, and Programming (ICALP). 93:1\u201393:14.","journal-title":"International Colloquium on Automata, Languages, and Programming (ICALP)."},{"key":"e_1_3_2_1_54_1","volume-title":"Linear Size Sparsifier and the Geometry of the Operator Norm Ball. In Symposium on Discrete Algorithms, SODA.","author":"Reis Victor","year":"2020","unstructured":"Victor Reis and Thomas Rothvoss. 2020. Linear Size Sparsifier and the Geometry of the Operator Norm Ball. In Symposium on Discrete Algorithms, SODA."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/140955367"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000282"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1985-0784009-0"},{"key":"e_1_3_2_1_58_1","volume-title":"Symposium on Discrete algorithms (SODA). 692\u2013701","author":"Srinivasan Aravind","year":"1997","unstructured":"Aravind Srinivasan. 1997. Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems. In Symposium on Discrete algorithms (SODA). 692\u2013701."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Terence Tao. 2016. The Erd\u00f6s discrepancy problem. Discrete Analysis feb 28 https:\/\/doi.org\/10.19086\/da.609 10.19086\/da.609","DOI":"10.19086\/da.609"},{"key":"e_1_3_2_1_60_1","volume-title":"Conference on Learning Theory. 3455\u20133486","author":"Turner Paxton","year":"2020","unstructured":"Paxton Turner, Raghu Meka, and Philippe Rigollet. 2020. Balancing Gaussian vectors in high dimension. In Conference on Learning Theory. 3455\u20133486."}],"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.3800762","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:00:07Z","timestamp":1781028007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":60,"alternative-id":["10.1145\/3798129.3800762","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800762","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"}}]}}