{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:03:51Z","timestamp":1743091431418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":4,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030436612"},{"type":"electronic","value":"9783030436629"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43662-9_2","type":"book-chapter","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T15:05:45Z","timestamp":1585926345000},"page":"9-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bridging a Small Gap in the Gap Amplification of Assignment Testers"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[]},{"given":"Or","family":"Meir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,4]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsham, P., Sudan, M., Vadhan, S.: Robust PCPs of proximity, shorter PCPs and applications to coding. SIAM J. Comput. 36(4), 889\u2013974 (2006). Preliminary version in STOC 2004, pp. 120\u2013134","journal-title":"SIAM J. Comput."},{"key":"2_CR2","unstructured":"Dinur, I.: The PCP theorem by gap amplification. In: ECCC TR05-046"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"12-es","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM 54(3), 12-es (2007). Preliminary version in STOC 2006, pp. 241\u2013250","journal-title":"J. ACM"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/S0097539705446962","volume":"36","author":"I Dinur","year":"2006","unstructured":"Dinur, I., Reingold, O.: Assignment testers: towards combinatorial proofs of the PCP theorem. SIAM J. Comput. 36(4), 975\u20131024 (2006). Preliminary version in FOCS 2004, pp. 155\u2013164","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Complexity and Property Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43662-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T18:14:27Z","timestamp":1585937667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43662-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030436612","9783030436629"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43662-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}