{"id":"https://openalex.org/W1978478346","doi":"https://doi.org/10.1145/1007352.1007361","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":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W1978478346","doi":"https://doi.org/10.1145/1007352.1007361","mag":"1978478346"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007361","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Ben-Sasson","raw_affiliation_strings":["Radcliffe Institute for Advanced Study, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radcliffe Institute for Advanced Study, Cambridge, MA","institution_ids":["https://openalex.org/I40036882"]}]},{"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":["Weizmann Institute of Science, Rehovot, ISRAEL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"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":["Massachusetts Institute of Technology, Cambridge, MA","Massachusetts Institute of Technology, Cambridge, MA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","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":["Massachusetts Institute of Technology, Cambridge, MA","Massachusetts Institute of Technology, Cambridge, MA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","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"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["Harvard University, Cambridge, MA","Harvard University, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.7296,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.98738952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/satisfiability","display_name":"Satisfiability","score":0.645410418510437},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5906643867492676},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.570401668548584},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5292987823486328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.491266667842865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.486128568649292},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.47414514422416687},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4608331322669983},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44733768701553345},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44199028611183167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4248265027999878},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4083046317100525}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.645410418510437},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5906643867492676},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.570401668548584},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5292987823486328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.491266667842865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.486128568649292},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.47414514422416687},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4608331322669983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44733768701553345},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44199028611183167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4248265027999878},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4083046317100525},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":1,"locations":[{"id":"doi:10.1145/1007352.1007361","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W48569142","https://openalex.org/W1483094817","https://openalex.org/W1555946936","https://openalex.org/W1579088726","https://openalex.org/W1591344124","https://openalex.org/W1907666253","https://openalex.org/W1967703498","https://openalex.org/W1970259241","https://openalex.org/W1970630090","https://openalex.org/W1970808997","https://openalex.org/W1980816908","https://openalex.org/W1999032440","https://openalex.org/W2000179324","https://openalex.org/W2000211775","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/W2029859729","https://openalex.org/W2034154168","https://openalex.org/W2045717693","https://openalex.org/W2049697554","https://openalex.org/W2051880745","https://openalex.org/W2053086236","https://openalex.org/W2056168287","https://openalex.org/W2061662395","https://openalex.org/W2066465093","https://openalex.org/W2067596507","https://openalex.org/W2082647621","https://openalex.org/W2082846050","https://openalex.org/W2083368929","https://openalex.org/W2086653003","https://openalex.org/W2087207261","https://openalex.org/W2091921997","https://openalex.org/W2107342895","https://openalex.org/W2108959208","https://openalex.org/W2111385661","https://openalex.org/W2117427692","https://openalex.org/W2126661026","https://openalex.org/W2133344054","https://openalex.org/W2135393523","https://openalex.org/W2136616826","https://openalex.org/W2140797111","https://openalex.org/W2143112402","https://openalex.org/W2143391442","https://openalex.org/W2144675047","https://openalex.org/W2146261818","https://openalex.org/W2148352980","https://openalex.org/W2152221184","https://openalex.org/W2152688060","https://openalex.org/W2163137752","https://openalex.org/W2165947532","https://openalex.org/W2167550450","https://openalex.org/W2622192510","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672"],"abstract_inverted_index":{"We":[0,32,258],"continue":[1],"the":[2,5,8,17,95,98,114,128,146,159,216,222,242],"study":[3],"of":[4,10,24,26,28,35,55,69,97,161,165,185,210,221,245,255,275,289],"trade-off":[6],"between":[7],"length":[9,36,56,96,290],"PCP":[11,186],"sand":[12],"their":[13],"query":[14,133,151],"complexity,":[15],"establishing":[16],"following":[18],"main":[19,204],"results(which":[20],"refer":[21],"to":[22,85,89,149,286],"proofs":[23],"satisfiability":[25],"circuits":[27],"size":[29],"n):":[30],"1":[31],"present":[33,53,279],"PCPs":[34,54,166,174],"exp(\u00d5(log":[37],"log":[38],"n)2)\u2022n":[39],"that":[40,60,167],"can":[41,61],"be":[42,62,83,86,254],"verified":[43,63],"by":[44,64,101,198],"making":[45,65],"o(log":[46,119],"logn)":[47],"Boolean":[48,70],"queries.For":[49],"every":[50],"\u03b5>0,":[51,126],"we":[52,168,270],"exp(log\u03b5":[57],"n)\u2022":[58],"n":[59],"a":[66,103,106,162,180,208,211,272],"constant":[67,132],"number":[68],"queries.":[71],"In":[72,135,268],"both":[73],"cases,":[74],"false":[75],"assertions":[76],"are":[77],"rejected":[78],"withconstant":[79],"probability":[80],"(which":[81],"may":[82,253],"set":[84],"arbitrarily":[87],"close":[88],"1).":[90],"The":[91,250],"multiplicative":[92],"overhead":[93,144],"on":[94],"proof,":[99],"introduced":[100],"transforming":[102],"proof":[104,176],"into":[105],"probabilistically":[107],"checkable":[108],"one,":[109],"is":[110,179,207],"just":[111],"quasi-polylogarithmic":[112],"in":[113,127,145,183,225,233,237],"first":[115],"case":[116,130],"(ofquery":[117],"complexity":[118,152],"logn)),":[120],"and":[121,191,200,236],"2(log":[122],"n)\u03b5,":[123],"for":[124,264,292],"any":[125,293],"second":[129],"(of":[131],"complexity).":[134],"contrast,":[136],"previous":[137,231],"results":[138,263],"required":[139],"at":[140],"least":[141],"2":[142,153],"\u221alogn":[143],"length,":[147],"even":[148],"get":[150],"\u221alog":[154],"n.":[155],"Our":[156,203],"techniques":[157,224],"include":[158],"introduction":[160],"new":[163,173,217],"variant":[164],"call":[169],"\"Robust":[170],"PCPs\".":[171],"These":[172],"facilitate":[175],"composition,":[177],"which":[178],"central":[181],"ingredient":[182],"construction":[184,209,218],"systems.":[187],"(A":[188],"related":[189],"notion":[190,274],"its":[192],"composition":[193],"properties":[194],"were":[195],"discovered":[196],"independently":[197],"Dinur":[199],"Reingold.":[201],")":[202],"technical":[205],"contribution":[206],"\"length-efficient\"":[212],"Robust":[213],"PCP.":[214],"While":[215],"uses":[219],"many":[220],"standard":[223],"PCPs,":[226],"it":[227],"does":[228,239],"differ":[229],"from":[230],"constructions":[232],"fundamental":[234],"ways,":[235],"particular":[238],"not":[240],"use":[241],"\"parallelization\"":[243],"step":[244],"Arora":[246],"et":[247],"al.":[248],".":[249],"alternative":[251],"approach":[252],"independent":[256],"interest.":[257],"also":[259],"obtain":[260],"analogous":[261],"quantitative":[262],"locally":[265,276],"testable":[266],"codes.":[267],"addition,":[269],"introduce":[271],"relaxed":[273],"decodable":[277],"codes,and":[278],"such":[280],"codes":[281],"mapping":[282],"k":[283],"information":[284],"bits":[285],"code":[287],"words":[288],"\u03ba1+\u03b5,":[291],"\u03b5>0.":[294]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}