{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:45Z","timestamp":1763468265940},"reference-count":0,"publisher":"RFC Editor","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.17487\/rfc3517","type":"report","created":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T00:48:11Z","timestamp":1428713291000},"source":"Crossref","is-referenced-by-count":48,"title":["A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP"],"prefix":"10.17487","author":[{"given":"E.","family":"Blanton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Allman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Fall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7045","published-online":{"date-parts":[[2003,4]]},"container-title":[],"original-title":[],"deposited":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T00:50:11Z","timestamp":1428713411000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rfc-editor.org\/info\/rfc3517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":0,"URL":"https:\/\/doi.org\/10.17487\/rfc3517","relation":{},"subject":[],"published":{"date-parts":[[2003,4]]}}}