{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:37Z","timestamp":1773376957327,"version":"3.50.1"},"reference-count":12,"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"}],"funder":[{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-23-1-0057"],"award-info":[{"award-number":["FA9550-23-1-0057"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195234","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 the Lower Bound of Minimax Error for Crowdsourcing"],"prefix":"10.1109","author":[{"given":"Zhuqing","family":"Li","sequence":"first","affiliation":[{"name":"University of California San Diego,Electrical & Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soheil","family":"Mohajer","sequence":"additional","affiliation":[{"name":"University of Minnesota,Electrical & Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behrouz","family":"Touri","sequence":"additional","affiliation":[{"name":"University of California San Diego,Electrical & Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"A minimax optimal algorithm for crowdsourcing","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Bonald","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2346806"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1111\/j.0006-341X.2004.00187.x","article-title":"A cautionary note on the robustness of latent class models for estimating diagnostic error without a gold standard","volume":"60","author":"Albert","year":"2004","journal-title":"Biometrics"},{"key":"ref4","article-title":"Variational inference for crowdsourcing","volume-title":"Advances in Neural Information Processing Systems","volume":"25","author":"Liu","year":"2012"},{"key":"ref5","article-title":"Iterative learning for reliable crowdsourcing systems","volume-title":"Advances in Neural Information Processing Systems","volume":"24","author":"Karger","year":"2011"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/1993574.1993599","article-title":"Who moderates the moderators?: crowdsourcing abuse detection in user-generated content","volume-title":"ACM Conference on Economics and Computation","author":"Ghosh","year":"2011"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1145\/2488388.2488414","article-title":"Aggregating crowdsourced binary ratings","volume-title":"Proceedings of the 22nd international conference on World Wide Web","author":"Dalvi","year":"2013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206599"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton63246.2024.10735320"},{"key":"ref10","first-page":"1260","article-title":"Spectral methods meet em: a provably optimal algorithm for crowdsourcing","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1, ser. NIPS\u201914","author":"Zhang"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X"}],"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\/11195234.pdf?arnumber=11195234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:35Z","timestamp":1773347375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195234\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195234","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}