{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:19:52Z","timestamp":1709831992787},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0168-0072(95)00065-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T16:11:55Z","timestamp":1049731915000},"page":"139-152","source":"Crossref","is-referenced-by-count":2,"title":["Automorphisms in the PTIME-Turing degrees of recursive sets"],"prefix":"10.1016","volume":"84","author":[{"given":"Christine Ann","family":"Haught","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore A.","family":"Slaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(95)00065-8_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(86)90054-2","article-title":"Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets","volume":"22","author":"Ambos-Spies","year":"1986","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0168-0072(95)00065-8_BIB2","series-title":"Proc. 3rd Ann. ACM Symp. on Theory of Comp.","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0168-0072(95)00065-8_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial-time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/S0168-0072(95)00065-8_BIB4","unstructured":"J. Shinoda and T.A. Slaman, On the theory of the PTIME degrees of recursive sets, to appear."},{"key":"10.1016\/S0168-0072(95)00065-8_BIB5","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007295000658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007295000658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:54:33Z","timestamp":1555066473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007295000658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0168007295000658"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(95)00065-8","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}