{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:45:55Z","timestamp":1742381155670},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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 Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(97)00202-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"125-129","source":"Crossref","is-referenced-by-count":12,"title":["Agreement under faulty interfaces"],"prefix":"10.1016","volume":"65","author":[{"given":"Pallab","family":"Dasgupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00202-0_BIB1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","article-title":"The Byzantine generals strike again","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00202-0_BIB2","first-page":"257","article-title":"An efficient algorithm for Byzantine agreement without authentication","volume":"3","author":"Dolev","year":"1983","journal-title":"Inform. and Control"},{"issue":"4","key":"10.1016\/S0020-0190(97)00202-0_BIB3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithms for Byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0020-0190(97)00202-0_BIB4","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","article-title":"Early stopping in Byzantine agreement","volume":"37","author":"Dolev","year":"1990","journal-title":"J. ACM"},{"issue":"30","key":"10.1016\/S0020-0190(97)00202-0_BIB5","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"4","key":"10.1016\/S0020-0190(97)00202-0_BIB6","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/2402.322398","article-title":"The weak Byzantine generals problem","volume":"30","author":"Lamport","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00202-0_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","author":"Pease","year":"1980","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002020?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002020?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:35Z","timestamp":1556643275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019097002020"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00202-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}