{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:30Z","timestamp":1773377010190,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195600","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On List Decoding With Importance Sampling"],"prefix":"10.1109","author":[{"given":"Buu","family":"Phan","sequence":"first","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1387","article-title":"Importance matching lemma for lossy compression with side information","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Phan","year":"2024"},{"key":"ref2","article-title":"A* sampling","volume":"27","author":"Maddison","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058842"},{"key":"ref5","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","volume-title":"7th International Conference on Learning Representations, ICLR 2019","author":"Havasi","year":"2019"},{"key":"ref6","first-page":"21308","article-title":"Algorithms for the communication of samples","volume-title":"International Conference on Machine Learning","author":"Theis","year":"2022"},{"key":"ref7","first-page":"1938","article-title":"Compression with bayesian implicit neural representations","volume":"36","author":"Guo","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/0-8176-4487-3_11"},{"key":"ref9","first-page":"604","article-title":"Reducing of test duration for censored samples","volume":"36","author":"Tikhov","year":"1991","journal-title":"Theory of Probability and Applications"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195600.pdf?arnumber=11195600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:00Z","timestamp":1773347400000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195600","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}