{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:36:20Z","timestamp":1773704180509,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174373","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2837-2842","source":"Crossref","is-referenced-by-count":2,"title":["Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average"],"prefix":"10.1109","author":[{"given":"David","family":"Gamarnik","sequence":"first","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eren C.","family":"K\u0131z\u0131lda\u011f","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"191","article-title":"New directions in testing","volume":"2","author":"lipton","year":"1989","journal-title":"Distributed Computing and Cryptography"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"ref12","article-title":"The average-case complexity of counting cliques in Erdos–Rényi hypergraphs","author":"adser\u00e0","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129775"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90195-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548475"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref18","article-title":"Error correction for algebraic block codes","author":"welch","year":"1986","journal-title":"US Patent"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21955"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2006.163.221"},{"key":"ref27","article-title":"AimPL, Phase transitions in randomized computational problems, available at","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/13\/4\/009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6289-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-002-0773-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/15\/10\/028"},{"key":"ref7","volume":"54","author":"talagrand","year":"2010","journal-title":"Mean Field Models for Spin Glasses Volume I Basic Examples"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7643-9891-0_1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335316"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.35.1792"},{"key":"ref20","author":"blum","year":"2012","journal-title":"Complexity and Real Computation"},{"key":"ref22","article-title":"Computing the partition function of the Sherrington-Kirkpatrick model is hard on average","author":"gamarnik","year":"2018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993682"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref23","first-page":"2012","article-title":"Lecture notes on information theory","author":"polyanskiy","year":"2016","journal-title":"Lecture Notes for ECE563 (UIUC) and 6 441 (MIT)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00087"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.57"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174373.pdf?arnumber=9174373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:15Z","timestamp":1773347715000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174373","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}