{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:52:30Z","timestamp":1648507950034},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,1]]},"DOI":"10.1515\/gcc-2013-0004","type":"journal-article","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T14:52:32Z","timestamp":1366037552000},"source":"Crossref","is-referenced-by-count":2,"title":["Generic complexity of the Diophantine problem"],"prefix":"10.1515","volume":"5","author":[{"given":"Alexander","family":"Rybalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","container-title":["Groups - Complexity - Cryptology"],"original-title":[],"link":[{"URL":"https:\/\/www.degruyter.com\/view\/j\/gcc.2013.5.issue-1\/gcc-2013-0004\/gcc-2013-0004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T03:08:03Z","timestamp":1614395283000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/gcc-2013-0004\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":0,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1515\/gcc-2013-0004","relation":{},"ISSN":["1867-1144","1869-6104"],"issn-type":[{"value":"1867-1144","type":"print"},{"value":"1869-6104","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}