{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:14:36Z","timestamp":1648649676664},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1973,1,1]],"date-time":"1973-01-01T00:00:00Z","timestamp":94694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Storage and Retrieval"],"published-print":{"date-parts":[[1973,1]]},"DOI":"10.1016\/0020-0271(73)90006-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"43-59","source":"Crossref","is-referenced-by-count":4,"title":["Optimal trees for a class of information retrieval problems"],"prefix":"10.1016","volume":"9","author":[{"given":"Larry E.","family":"Stanfel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0271(73)90006-5_BIB1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/366552.366600","article-title":"Use of tree structures for processing files","volume":"6","author":"Sussenguth","year":"1963","journal-title":"Communs A.C.M."},{"key":"10.1016\/0020-0271(73)90006-5_BIB2","first-page":"508","article-title":"Tree structures for optimal searching","volume":"17","author":"Stanfel","year":"1970","journal-title":"J.A.C.M."},{"key":"10.1016\/0020-0271(73)90006-5_BIB3","first-page":"2","article-title":"Variable length tree structures having minimum average search time","volume":"12","author":"Patt","year":"1965","journal-title":"Communs A.C.M."},{"key":"10.1016\/0020-0271(73)90006-5_BIB4","article-title":"A brief note on optimal trees","author":"Stanfel","year":"1972","journal-title":"J.A.C.M."},{"key":"10.1016\/0020-0271(73)90006-5_BIB5","first-page":"27","article-title":"Minimum redundancy coding for the discrete, noiseless channel","volume":"IT-7","author":"Karp","year":"1961","journal-title":"IRE Trans."}],"container-title":["Information Storage and Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020027173900065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020027173900065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:55:53Z","timestamp":1554886553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020027173900065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1973,1]]}},"alternative-id":["0020027173900065"],"URL":"https:\/\/doi.org\/10.1016\/0020-0271(73)90006-5","relation":{},"ISSN":["0020-0271"],"issn-type":[{"value":"0020-0271","type":"print"}],"subject":[],"published":{"date-parts":[[1973,1]]}}}