{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T07:33:59Z","timestamp":1698824039676},"reference-count":0,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,25]],"date-time":"2002-05-25T00:00:00Z","timestamp":1022284800000},"content-version":"vor","delay-in-days":2123,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1006\/jcss.1996.0055","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T11:33:37Z","timestamp":1033990417000},"page":"148-152","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets"],"prefix":"10.1006","volume":"53","author":[{"given":"Paul F.","family":"Dietz","sequence":"first","affiliation":[]}],"member":"78","container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000096900550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000096900550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T06:40:23Z","timestamp":1698734423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000096900550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["S0022000096900550"],"URL":"https:\/\/doi.org\/10.1006\/jcss.1996.0055","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/jcss.1996.0055","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}