{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:17:12Z","timestamp":1672255032364},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxh101","type":"journal-article","created":{"date-parts":[[2005,5,14]],"date-time":"2005-05-14T00:13:45Z","timestamp":1116029625000},"page":"437-442","source":"Crossref","is-referenced-by-count":4,"title":["Java Memory Allocation with Lazy Worst Fit for Small Objects"],"prefix":"10.1093","volume":"48","author":[{"given":"H.-K.","family":"Choi","sequence":"first","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2005,5,3]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/48\/4\/437\/985984\/bxh101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T20:52:52Z","timestamp":1503435172000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxh101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,3]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2005,5,3]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxh101","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5,3]]}}}