{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T16:46:16Z","timestamp":1747673176607},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049439"},{"type":"electronic","value":"9783642049446"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04944-6_10","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T22:09:36Z","timestamp":1253052576000},"page":"117-126","source":"Crossref","is-referenced-by-count":3,"title":["Propagation Connectivity of Random Hypergraphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Berke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Onsj\u00f6","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"298","volume-title":"Proc. FOCS 2003","author":"M. Alekhnovich","year":"2003","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. FOCS 2003, pp. 298\u2013307. IEEE, Los Alamitos (2003)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Cooper, C., Frieze, A.M.: An efficient sparse regularity concept. In: Proc. SODA 2009, pp. 207\u2013216 (2009)","DOI":"10.1137\/1.9781611973068.24"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/49.661103","volume":"16","author":"R. McEliece","year":"1998","unstructured":"McEliece, R., MacKay, D., Cheng, J.: Turbo decoding as an instance of Pearl\u2019s \u201cBelief Propagation\u201d algorithm. IEEE Journal on Selected Areas in Communications\u00a016(2), 140\u2013152 (1998)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10_CR4","first-page":"343","volume":"38","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Bull. Inst. Internat. Statist.\u00a038, 343\u2013347 (1961)","journal-title":"Bull. Inst. Internat. Statist."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048, 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Onsj\u00f6, M., Watanabe, O.: Finding most likely solutions. In: Theory of Computing Systems. On-Line Version (2009)","DOI":"10.1007\/s00224-009-9218-2"},{"key":"10_CR7","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/11940128_59","volume-title":"Algorithms and Computation","author":"S. Shannigrahi","year":"2006","unstructured":"Shannigrahi, S., Pal, S.: Efficient Pr\u00fcfer-like coding and counting labelled hypertrees. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 588\u2013597. Springer, Heidelberg (2006)"},{"key":"10_CR9","unstructured":"Yamamoto, M., Watanabe, O.: Belief propagation and spectral methods. Research Report C-248, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech. (2007)"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04944-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:47:26Z","timestamp":1552157246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04944-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049439","9783642049446"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04944-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}