{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T11:31:36Z","timestamp":1769945496220,"version":"3.49.0"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2013,6,1]]},"DOI":"10.1093\/comjnl\/bxs148","type":"journal-article","created":{"date-parts":[[2012,11,10]],"date-time":"2012-11-10T03:17:25Z","timestamp":1352517445000},"page":"693-715","source":"Crossref","is-referenced-by-count":21,"title":["BFT-TO: Intrusion Tolerance with Less Replicas"],"prefix":"10.1093","volume":"56","author":[{"given":"M.","family":"Correia","sequence":"first","affiliation":[]},{"given":"N. F.","family":"Neves","sequence":"additional","affiliation":[]},{"given":"P.","family":"Verissimo","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2012,11,9]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/56\/6\/693\/1355149\/bxs148.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T10:11:29Z","timestamp":1503483089000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxs148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,9]]},"references-count":0,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2013,5,30]]},"published-print":{"date-parts":[[2013,6,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxs148","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,9]]}}}