{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:00:53Z","timestamp":1774990853493,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541441","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"960-964","source":"Crossref","is-referenced-by-count":0,"title":["Minimax structured normal means inference"],"prefix":"10.1109","author":[{"given":"Akshay","family":"Krishnamurthy","sequence":"first","affiliation":[{"name":"Microsoft Research, New York, 10011, United States"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9278-4"},{"key":"ref12","author":"mackay","year":"2003","journal-title":"Information Theory Inference and Learning Algorithms"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019796","author":"sason","year":"2006","journal-title":"Performance Analysis of Linear Codes Under Maximum-Likelihood Decoding A Tutorial"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.335901"},{"key":"ref16","article-title":"Minimaxity in Structured Normal Means Inference","author":"krishnamurthy","year":"0","journal-title":"arXiv 1506 07902 2015"},{"key":"ref17","article-title":"Noise Thresholds for Spectral Clustering","author":"balakrishnan","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref18","article-title":"Efficient active algorithms for hierarchical clustering","author":"krishnamurthy","year":"2012","journal-title":"International Conference on Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref3","article-title":"Minimax Localization of Structural Information in Large Noisy Matrices","author":"kolar","year":"0","journal-title":"Advances in Neural Information Processing Systems 2011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2396917"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ470"},{"key":"ref8","article-title":"Searching for a trail of evidence $\\mathrm{in}$ a maze","author":"arias-castro","year":"0","journal-title":"The Annals of Statistics 2008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS817"},{"key":"ref2","article-title":"Minimax risk of matrix denoising by singularvalue thresholding","author":"donoho","year":"0","journal-title":"Annals of Statistics 2014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162269"},{"key":"ref9","article-title":"Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic","author":"sharpnack","year":"0","journal-title":"Advances in Neural Information Processing Systems 2013"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541441.pdf?arnumber=7541441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:59Z","timestamp":1774986719000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541441\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541441","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}