{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:34Z","timestamp":1781077714883,"version":"3.54.1"},"reference-count":0,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004334","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"25","source":"Crossref","is-referenced-by-count":47,"title":["On the power of unique 2-prover 1-round games"],"prefix":"10.1109","author":[{"given":"S.","family":"Khot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","event":{"name":"17th IEEE Annual Conference on Computational Complexity","location":"Montreal, Que., Canada","acronym":"CCC-02"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004334.pdf?arnumber=1004334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T00:06:55Z","timestamp":1489190815000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004334\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004334","relation":{},"subject":[]}}