{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:16Z","timestamp":1781031436659,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":77,"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-2211972"],"award-info":[{"award-number":["CCF-2211972"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2503280"],"award-info":[{"award-number":["DMS-2503280"]}],"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-2236931"],"award-info":[{"award-number":["CCF-2236931"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["CCF-2440926"],"award-info":[{"award-number":["CCF-2440926"]}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Simons Investigator award"],"award-info":[{"award-number":["Simons Investigator award"]}],"id":[{"id":"10.13039\/100000893","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.3800778","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"619-630","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["From Random to Explicit via Subspace Designs with Applications to Local Properties and Matroids"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7298","authenticated-orcid":false,"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5696-4628","authenticated-orcid":false,"given":"Yeyuan","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5570-7116","authenticated-orcid":false,"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-514X","authenticated-orcid":false,"given":"Zihan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, 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.4007\/annals.2018.188.2.1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492581"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Omar Alrabiah Zeyu Guo Venkatesan Guruswami Ray Li and Zihan Zhang. 2025. Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets. Advances in Combinatorics oct 3 https:\/\/doi.org\/10.19086\/aic.2025.8 10.19086\/aic.2025.8","DOI":"10.19086\/aic.2025.8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/16724"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718152"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.07.016"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2258343"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2510.13775"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2510.13777"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Joshua Brakensiek Manik Dhar Jiyang Gao Sivakanth Gopi and Matt Larson. 2024. Rigidity Matroids and Linear Algebraic Matroids with Applications to Matrix Completion and Tensor Codes. May arxiv:2405.00778. https:\/\/doi.org\/10.48550\/arXiv.2405.00778 10.48550\/arXiv.2405.00778","DOI":"10.48550\/arXiv.2405.00778"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3449030"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Joshua Brakensiek Manik Dhar and Sivakanth Gopi. 2025. Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes. arXiv preprint arXiv:2509.15013 https:\/\/doi.org\/10.48550\/arXiv.2509.15013 10.48550\/arXiv.2509.15013","DOI":"10.48550\/arXiv.2509.15013"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2020.192.3.4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Yeyuan Chen Mahdi Cheraghchi and Nikhil Shagrithaya. 2025. Optimal Erasure Codes and Codes on Graphs. arXiv preprint arXiv:2504.03090 https:\/\/doi.org\/10.48550\/2504.03090","DOI":"10.48550\/2504.03090"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718114"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"James Cruickshank Bill Jackson Tibor Jord\u00e1n and Shin-ichi Tanigawa. 2025. Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach. arXiv preprint arXiv:2508.11636 https:\/\/doi.org\/10.48550\/arXiv:2508.11636","DOI":"10.48550\/arXiv:2508.11636"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206554"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520024"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"S Dzhenzher T Garaev O Nikitenko A Petukhov A Skopenkov and A Voropaev. 2025. Low rank matrix completion and realization of graphs: results and problems. arXiv preprint arXiv:2501.13935 https:\/\/doi.org\/10.48550\/arXiv:2501.13935","DOI":"10.48550\/arXiv:2501.13935"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.136"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Jack E Graver Brigitte Servatius and Herman Servatius. 1993. Combinatorial rigidity. American Mathematical Soc.. https:\/\/doi.org\/10.1090\/gsm\/002 10.1090\/gsm\/002","DOI":"10.1090\/gsm\/002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123497"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-020-4360-1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132518"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3506668"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/7369"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518208"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"Jun-Ting Hsieh Alexander Lubotzky Sidhanth Mohanty Assaf Reiner and Rachel Yun Zhang. 2025. Explicit Lossless Vertex Expanders. arXiv preprint arXiv:2504.15087 https:\/\/doi.org\/10.48550\/arXiv:2504.15087","DOI":"10.48550\/arXiv:2504.15087"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the international congress of mathematicians. 1, 212\u2013239","author":"Huh June","year":"2022","unstructured":"June Huh. 2022. Combinatorics and Hodge theory. In Proceedings of the international congress of mathematicians. 1, 212\u2013239."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/1119"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2023.10.012"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718302"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","unstructured":"Fernando Granha Jeronimo and Nikhil Shagrithaya. 2025. Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes. arXiv preprint arXiv:2510.06185 https:\/\/doi.org\/10.48550\/arXiv:2510.06185","DOI":"10.48550\/arXiv:2510.06185"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Gleb Kalachev and Pavel Panteleev. 2025. Maximally Extendable Product Codes Are Good Coboundary Expanders. Jan. arxiv:2501.01411. https:\/\/doi.org\/10.48550\/arXiv.2501.01411 10.48550\/arXiv.2501.01411","DOI":"10.48550\/arXiv.2501.01411"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/6512"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1205856"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-021-01013-1"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.4086\/TOC.2015.V011A005"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-3082-1"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01534980"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Matan Levi Jonathan Mosheiff and Nikhil Shagrithaya. 2025. Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. arxiv:2406.02238. https:\/\/doi.org\/10.48550\/arXiv.2406.02238 10.48550\/arXiv.2406.02238","DOI":"10.48550\/arXiv.2406.02238"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"e_1_3_2_1_61_1","volume-title":"Glueing matroids together: a study of Dilworth truncations and matroid analogues of exterior and symmetric powers. Algebraic methods in graph theory, 1","author":"Mason John H","year":"1981","unstructured":"John H Mason. 1981. Glueing matroids together: a study of Dilworth truncations and matroid analogues of exterior and symmetric powers. Algebraic methods in graph theory, 1 (1981), 519\u2013561."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786446408643668"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"e_1_3_2_1_65_1","volume-title":"Matroid theory. 3","author":"Oxley James G","unstructured":"James G Oxley. 2006. Matroid theory. 3, Oxford University Press, USA."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520017"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19270070107"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","unstructured":"Chandrasekaran Ramya. 2020. Recent Progress on Matrix Rigidity\u2013A Survey. arXiv preprint arXiv:2009.09460 https:\/\/doi.org\/10.48550\/arXiv:2009.09460","DOI":"10.48550\/arXiv:2009.09460"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892006"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.4171\/EMSS\/77"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","unstructured":"Maheswaran Sathiamoorthy Megasthenis Asteris Dimitris Papailiopoulos Alexandros G Dimakis Ramkumar Vadali Scott Chen and Dhruba Borthakur. 2013. Xoring elephants: Novel erasure codes for big data. arXiv preprint arXiv:1301.3791 https:\/\/doi.org\/10.48550\/arXiv:1301.3791","DOI":"10.48550\/arXiv:1301.3791"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M138795X"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187716"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"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.3800778","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:01:48Z","timestamp":1781028108000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":77,"alternative-id":["10.1145\/3798129.3800778","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800778","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"}}]}}