{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T16:41:51Z","timestamp":1719938511738},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1017\/s0963548306007620","type":"journal-article","created":{"date-parts":[[2006,8,16]],"date-time":"2006-08-16T09:26:04Z","timestamp":1155720364000},"page":"855","source":"Crossref","is-referenced-by-count":29,"title":["On Graph Complexity"],"prefix":"10.1017","volume":"15","author":[{"given":"S.","family":"JUKNA","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2006,8,16]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548306007620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,23]],"date-time":"2017-04-23T13:45:12Z","timestamp":1492955112000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.journals.cambridge.org\/abstract_S0963548306007620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,16]]},"references-count":0,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2006,11]]}},"URL":"https:\/\/doi.org\/10.1017\/s0963548306007620","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,16]]}}}