{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:20Z","timestamp":1773377060894,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195400","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Interactive Oracle Proofs of Proximity to Codes on Graphs"],"prefix":"10.1109","author":[{"given":"Hugo","family":"Delavenne","sequence":"first","affiliation":[{"name":"École Polytechnique, Institut Polytechnique de Paris, INRIA,LIX"}]},{"given":"\u00c9lina","family":"Roussel","sequence":"additional","affiliation":[{"name":"École Polytechnique, Institut Polytechnique de Paris, INRIA,LIX"}]},{"given":"Tanguy","family":"Medevielle","sequence":"additional","affiliation":[{"name":"IRMAR, Université de Rennes, INRIA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"ref2","first-page":"14:1","article-title":"Fast ReedSolomon Interactive Oracle Proofs of Proximity","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","volume":"107","author":"Ben-Sasson"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref6","article-title":"Locally Testable codes with constant rate, distance, and locality","volume":"abs\/2111.04808","author":"Dinur","year":"2021","journal-title":"CoRR"},{"key":"ref7","first-page":"5:1","article-title":"DEEP-FRI: sampling outside the box improves soundness","volume-title":"11th Innovations in Theoretical Computer Science Conference, ITCS 2020","volume":"151","author":"Ben-Sasson","year":"2020"},{"key":"ref8","article-title":"Worst-case to average case reductions for the distance to a code","volume":"TR18-090","author":"Ben-Sasson","year":"2018","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"ref10","article-title":"Interactive oracle proofs of proximity to algebraic geometry codes","volume-title":"Proceedings of the 37th Computational Complexity Conference","author":"Bordage","year":"2020"},{"issue":"2","key":"ref11","doi-asserted-by":"crossref","first-page":"174","DOI":"10.2307\/2369306","article-title":"Desiderata and Suggestions: No. 2. The Theory of Groups: Graphical Representation","volume":"1","author":"Cayley","year":"1878","journal-title":"American Journal of Mathematics"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3191309"},{"key":"ref13","article-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge","author":"Gabizon","year":"2019","journal-title":"Cryptology ePrint Archive"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref15","volume-title":"Computationally efficient error-correcting codes and holographic proofs","author":"Spielman","year":"1995"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195400.pdf?arnumber=11195400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:24Z","timestamp":1773347424000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195400","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}