{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:31:38Z","timestamp":1725503498021},"reference-count":3,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004322","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"3","source":"Crossref","is-referenced-by-count":2,"title":["Resolution lower bounds for the weak pigeon hole principle"],"prefix":"10.1109","author":[{"given":"R.","family":"Raz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/258533.258536"},{"key":"ref2","first-page":"310","article-title":"Recognizing more unsatisfiable random 3SAT instances effi-ciently","author":"friedman","year":"2001","journal-title":"Proc 28th ICALP"},{"key":"ref1","first-page":"517","article-title":"Short proofs are narrow – resolution made simple","author":"ben-sasson","year":"1999","journal-title":"Proc 31st STOC"}],"event":{"acronym":"CCC-02","name":"17th IEEE Annual Conference on Computational Complexity","location":"Montreal, Que., Canada"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004322.pdf?arnumber=1004322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T23:46:46Z","timestamp":1489189606000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004322","relation":{},"subject":[]}}