{"id":"https://openalex.org/W2044199052","doi":"https://doi.org/10.1137/s0097539705446810","title":"Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding","display_name":"Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2044199052","doi":"https://doi.org/10.1137/s0097539705446810","mag":"2044199052"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539705446810","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705446810","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467483","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483"},"institutions":[{"id":"https://openalex.org/I4210137766","display_name":"Institute for Advanced Study","ror":"https://ror.org/03xg85719","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210137766"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eli Ben\u2010Sasson","raw_affiliation_strings":["Radcliffe Institute for Advanced Study, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radcliffe Institute for Advanced Study, Cambridge, MA 02139","institution_ids":["https://openalex.org/I4210137766"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013698877","display_name":"Oded Goldreich","orcid":"https://orcid.org/0000-0002-4329-135X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oded Goldreich","raw_affiliation_strings":["Department of Computer Science, Weizmann Institute of Science, Rehovot, ISRAEL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Weizmann Institute of Science, Rehovot, ISRAEL","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019248097","display_name":"Prahladh Harsha","orcid":"https://orcid.org/0000-0002-2739-5642"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prahladh Harsha","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA 02138"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA 02138","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.083,"has_fulltext":false,"cited_by_count":240,"citation_normalized_percentile":{"value":0.97468522,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"36","issue":"4","first_page":"889","last_page":"974"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6521823406219482},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6421664953231812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6277457475662231},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6105754375457764},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.589372992515564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5648829340934753},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4817904829978943},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4290394186973572},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.41766783595085144},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4154786765575409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3069320321083069}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6521823406219482},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6421664953231812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6277457475662231},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6105754375457764},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.589372992515564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5648829340934753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4817904829978943},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4290394186973572},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.41766783595085144},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4154786765575409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3069320321083069},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539705446810","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705446810","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dash.harvard.edu:1/41467483","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467483","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/41467483","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467483","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1907666253","https://openalex.org/W1970259241","https://openalex.org/W1970630090","https://openalex.org/W1970808997","https://openalex.org/W1980816908","https://openalex.org/W1999032440","https://openalex.org/W2004471951","https://openalex.org/W2017899870","https://openalex.org/W2018925011","https://openalex.org/W2019578639","https://openalex.org/W2019807548","https://openalex.org/W2021413381","https://openalex.org/W2045717693","https://openalex.org/W2051880745","https://openalex.org/W2061662395","https://openalex.org/W2082647621","https://openalex.org/W2082846050","https://openalex.org/W2083368929","https://openalex.org/W2086653003","https://openalex.org/W2111385661","https://openalex.org/W2117427692","https://openalex.org/W2128057004","https://openalex.org/W2135393523","https://openalex.org/W2136616826","https://openalex.org/W2148352980","https://openalex.org/W2152688060","https://openalex.org/W2156867528","https://openalex.org/W2163137752","https://openalex.org/W3004537778","https://openalex.org/W4230909286"],"related_works":["https://openalex.org/W319001346","https://openalex.org/W1992470151","https://openalex.org/W1578250865","https://openalex.org/W2144579822","https://openalex.org/W2399816245","https://openalex.org/W2038272454","https://openalex.org/W1997643965","https://openalex.org/W1980074516","https://openalex.org/W1996760375","https://openalex.org/W2395487291"],"abstract_inverted_index":{"We":[0,36,260],"continue":[1],"the":[2,5,8,20,102,105,122,140,150,177,211,217,239],"study":[3],"of":[4,10,28,30,32,39,61,75,104,152,156,163,179,203,208,216,242,257,277,291],"trade\u2010off":[6],"between":[7],"length":[9,40,62,103,292],"probabilistically":[11,114],"checkable":[12,115],"proofs":[13,27],"(PCPs)":[14],"and":[15,130,185,194,233,281],"their":[16],"query":[17,126,145],"complexity,":[18],"establishing":[19],"following":[21],"main":[22,197],"results":[23,265],"(which":[24,88],"refer":[25],"to":[26,92,96,289],"satisfiability":[29],"circuits":[31],"size":[33],"n):":[34],"1.":[35],"present":[37,59,282],"PCPs":[38,60,157,162,167],"$\\exp(o(\\log\\log":[41],"n)^2)\\cdot":[42],"n$":[43,65],"that":[44,66,158],"can":[45,67],"be":[46,68,90,93,256],"verified":[47,69],"by":[48,70,108,192],"making":[49,71],"$o(\\log\\log":[50,128],"n)$":[51],"Boolean":[52,76],"queries.":[53,77],"2.":[54],"For":[55],"every":[56],"\\epsilon>0,":[57],"we":[58,159,272],"$\\exp(\\log^\\epsilon":[63],"n)\\cdot":[64],"a":[72,110,113,153,173,201,204,274],"constant":[73,86,144],"number":[74],"In":[78,270],"both":[79],"cases,":[80],"false":[81],"assertions":[82],"are":[83],"rejected":[84],"with":[85],"probability":[87],"may":[89,255],"set":[91],"arbitrarily":[94],"close":[95],"1).":[97],"The":[98,252],"multiplicative":[99],"overhead":[100],"on":[101],"proof,":[106],"introduced":[107],"transforming":[109],"proof":[111,169],"into":[112],"one,":[116],"is":[117,131,172,200],"just":[118],"quasi":[119],"polylogarithmic":[120],"in":[121,139,176,221,230,234],"first":[123],"case":[124,142],"(of":[125,143],"complexity":[127],"n)$),":[129],"$2^{(\\log":[132],"n)^\\epsilon}$,":[133],"for":[134,266,294],"any":[135,295],"$\\epsilon":[136],">":[137],"0$,":[138],"second":[141],"complexity).":[146],"Our":[147,196],"techniques":[148,219],"include":[149],"introduction":[151],"new":[154,166,212],"variant":[155],"call":[160],"\u201crobust":[161],"proximity.\u201d":[164],"These":[165],"facilitate":[168],"composition,":[170],"which":[171],"central":[174],"ingredient":[175],"construction":[178,202,213],"PCP":[180,207,222],"systems.":[181],"(A":[182],"related":[183],"notion":[184,276],"its":[186],"composition":[187],"properties":[188],"were":[189],"discovered":[190],"independently":[191],"Dinur":[193],"Reingold.)":[195],"technical":[198],"contribution":[199],"\u201clength\u2010efficient\u201d":[205],"robust":[206],"proximity.":[209],"While":[210],"uses":[214],"many":[215],"standard":[218],"used":[220],"constructions,":[223],"it":[224],"does":[225,236],"differ":[226],"from":[227],"previous":[228],"constructions":[229],"fundamental":[231],"ways,":[232],"particular":[235],"not":[237],"use":[238],"\u201cparallelization\u201d":[240],"step":[241],"Arora":[243],"et":[244],"al.":[245],"[J.":[246],"ACM,":[247],"45":[248],"(1998),":[249],"pp.":[250],"501\u2013555].":[251],"alternative":[253],"approach":[254],"independent":[258],"interest.":[259],"also":[261],"obtain":[262],"analogous":[263],"quantitative":[264],"locally":[267,278],"testable":[268],"codes.":[269],"addition,":[271],"introduce":[273],"relaxed":[275],"decodable":[279],"codes":[280,284],"such":[283],"mapping":[285],"k":[286],"information":[287],"bits":[288],"codewords":[290],"$k^{1+\\epsilon}$":[293],"$\\epsilon>0$.":[296]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":34},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":17}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}