{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T11:25:54Z","timestamp":1791285954386,"version":"4.1.0"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. High Speed Comp."],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1142\/s0129053389000196","type":"journal-article","created":{"date-parts":[[2004,11,29]],"date-time":"2004-11-29T02:14:37Z","timestamp":1101694477000},"page":"349-365","source":"Crossref","is-referenced-by-count":5,"title":["KANERVA\u2019S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE"],"prefix":"10.1142","volume":"01","author":[{"given":"DAVID","family":"ROGERS","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","container-title":["International Journal of High Speed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129053389000196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T23:31:50Z","timestamp":1480635110000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129053389000196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":0,"journal-issue":{"issue":"02","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["10.1142\/S0129053389000196"],"URL":"https:\/\/doi.org\/10.1142\/s0129053389000196","relation":{},"ISSN":["0129-0533"],"issn-type":[{"value":"0129-0533","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}