{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:36Z","timestamp":1773376776835,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206686","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"513-518","source":"Crossref","is-referenced-by-count":3,"title":["Efficiently Computing Sparse Fourier Transforms of q-ary Functions"],"prefix":"10.1109","author":[{"given":"Yigit Efe","family":"Erginbas","sequence":"first","affiliation":[{"name":"The University of California, Berkeley,Department of EECS,Berkeley,CA"}]},{"given":"Justin","family":"Kang","sequence":"additional","affiliation":[{"name":"The University of California, Berkeley,Department of EECS,Berkeley,CA"}]},{"given":"Amirali","family":"Aghazadeh","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering,The Georgia Institute of Technology,Atlanta,GA"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[{"name":"The University of California, Berkeley,Department of EECS,Berkeley,CA"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Efficiently learning Fourier sparse set functions","volume":"32","author":"amrollahi","year":"2019","journal-title":"Adv Neural Inf Proc Sys (NeurIPS)"},{"key":"ref12","article-title":"SPRIGHT: A fast and robust framework for sparse Walsh-Hadamard transform","author":"li","year":"2015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2104878118"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-03819-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/1267352"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2404441"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1126\/science.ade2574"},{"key":"ref10","first-page":"1125","article-title":"Learning Fourier sparse set functions","author":"stobbe","year":"2012","journal-title":"Artific Intell and Statist (AISTATS)"},{"key":"ref2","article-title":"Logic programming with pseudo-Boolean constraints","author":"bockmayr","year":"1991","journal-title":"Max-Planck-Institut für Informatik"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206686"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2109649118"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.08.011"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849424"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/0100000099"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","article-title":"Message-passing algorithms for compressed sensing","volume":"106","author":"donoho","year":"2009","journal-title":"Proc Nat Acad Sci"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2679053"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-6-26"},{"key":"ref27","author":"blahut","year":"1983","journal-title":"Theory and Practice of Error Control Codes"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref8","first-page":"391","author":"mansour","year":"1994","journal-title":"Learning Boolean functions via the Fourier transform"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/pnasnexus\/pgad015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00264-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1162\/10636560151075112"},{"key":"ref6","article-title":"Adaptive wavelet distillation from neural networks through interpretations","volume":"34","author":"ha","year":"2021","journal-title":"Adv Neural Inf Proc Sys (NeurIPS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25371-3"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206686.pdf?arnumber=10206686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:16Z","timestamp":1773347296000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206686\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206686","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}