{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:13:48Z","timestamp":1780096428458,"version":"3.54.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:00:00Z","timestamp":1569283200000},"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":["SIGACT News"],"published-print":{"date-parts":[[2019,9,24]]},"abstract":"<jats:p>The PCP (i.e., Probabilistically Checkable Proofs) Theorem [8, 7, 22, 5, 4] states that any mathematical proof can be converted to a format that can be checked by a veri er making only a constant number of queries to the proof. The veri er picks the queries in a randomized way and might err with low probability.<\/jats:p>","DOI":"10.1145\/3364626.3364632","type":"journal-article","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T12:57:52Z","timestamp":1569416272000},"page":"25-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Sliding Scale Conjectures in PCP"],"prefix":"10.1145","volume":"50","author":[{"given":"Dana","family":"Moshkovitz","sequence":"first","affiliation":[{"name":", , MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,9,24]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Compu- tational Complexity Conference","author":"Aaronson S.","year":"2014"},{"issue":"67","key":"e_1_2_1_2_1","first-page":"243","article-title":"Random sampling and approx- imation of MAX-CSPs","volume":"2","author":"Alon N.","year":"2003","journal-title":"J. Comput. Sys. Sci."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"issue":"3","key":"e_1_2_1_6_1","first-page":"426","article-title":"Improved low-degree testing and its applications","volume":"23","author":"Arora S.","year":"2003","journal-title":"Combinatorica"},{"key":"e_1_2_1_7_1","first-page":"32","volume-title":"Proc. 23rd ACM Symp. on Theory of Computing","author":"Babai L.","year":"1991"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.41"},{"issue":"3","key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/S0097539796302531","article-title":"Free bits, PCPs, and nonapproximability| towards tight results","volume":"27","author":"Bellare M.","year":"1998","journal-title":"SIAM Journal on Computing"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167174"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746565"},{"key":"e_1_2_1_14_1","volume-title":"Proc. of the 28th Annual ACM- SIAM Symposium on Discrete Algorithms","author":"Chlamtac E.","year":"2017"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502795"},{"key":"e_1_2_1_16_1","volume-title":"ECCC TR16--128","author":"Dinur I.","year":"2016"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0014-4"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.8"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746630"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446962"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225183"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_2_1_27_1","first-page":"473","volume-title":"The LLL Algorithm","author":"Khot S."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.19"},{"key":"e_1_2_1_30_1","volume-title":"Proc. 55th IEEE Symp. on Foun- dations of Computer Science","author":"Moshkovitz D.","year":"2014"},{"issue":"7","key":"e_1_2_1_31_1","first-page":"235","article-title":"The projection games conjecture and the NP-hardness of ln n- approximating set-cover","volume":"11","author":"Moshkovitz D.","year":"2015","journal-title":"Theory of Computing"},{"key":"e_1_2_1_32_1","volume-title":"RANDOM","author":"Moshkovitz D.","year":"2016"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0278-0"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754402"},{"key":"e_1_2_1_35_1","volume-title":"The projection games conjecture and the hardness of approximation of SSAT and related problems. Technical report, arXiv:1907.05548","author":"Mukhopadhyay P.","year":"2019"},{"issue":"6","key":"e_1_2_1_36_1","first-page":"1891","article-title":"Parallel repetition in projection games and a concentration bound","volume":"40","author":"Rao A.","year":"1871","journal-title":"SIAM Journal on Computing"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364626.3364632","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3364626.3364632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:24Z","timestamp":1750202604000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364626.3364632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,24]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9,24]]}},"alternative-id":["10.1145\/3364626.3364632"],"URL":"https:\/\/doi.org\/10.1145\/3364626.3364632","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9,24]]},"assertion":[{"value":"2019-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}