{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T08:37:49Z","timestamp":1785487069594,"version":"3.56.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:p>Can a proof be checked without reading it?<\/jats:p>","DOI":"10.1145\/1467247.1467267","type":"journal-article","created":{"date-parts":[[2009,2,25]],"date-time":"2009-02-25T14:44:30Z","timestamp":1235573070000},"page":"76-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Probabilistically checkable proofs"],"prefix":"10.1145","volume":"52","author":[{"given":"Madhu","family":"Sudan","sequence":"first","affiliation":[{"name":"MIT's Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,3]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_2_2_2_1","volume-title":"PWS","author":"Arora S.","year":"1995"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060631"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63449"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132553"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.16"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90251-8"},{"key":"e_1_2_2_17_1","volume-title":"Computers and Intractability","author":"Garey M.A.","year":"1979"},{"key":"e_1_2_2_18_1","series-title":"Algorithms and Combinatorics","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","author":"Goldreich O.","year":"1998"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796364"},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations. R. Miller and J. Thatcher eds.1972 85--103.  Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations . R. Miller and J. Thatcher eds.1972 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067309.1067318"},{"key":"e_1_2_2_27_1","first-page":"3","article-title":"Universal search problems","volume":"9","author":"Levin L.A","year":"1973","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"e_1_2_2_31_1","first-page":"1","article-title":"proof of the PCP theorem. Bulletin (New Series) Amer","volume":"44","author":"Radhakrishnan J.","year":"2007","journal-title":"Math. Soc."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1467247.1467267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1467247.1467267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:41Z","timestamp":1750253381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1467247.1467267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["10.1145\/1467247.1467267"],"URL":"https:\/\/doi.org\/10.1145\/1467247.1467267","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]},"assertion":[{"value":"2009-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}