{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:56:31Z","timestamp":1770270991371,"version":"3.49.0"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1109\/tit.1983.1056620","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"23-35","source":"Crossref","is-referenced-by-count":318,"title":["Distributed network protocols"],"prefix":"10.1109","volume":"29","author":[{"given":"A.","family":"Segall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094552"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094473"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094274"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094323"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1095017"},{"key":"ref2","article-title":"A recoverable protocol for loop-free distributed routing","author":"segall","year":"1978","journal-title":"Proc ICC"},{"key":"ref1","author":"gallager","year":"1976","journal-title":"A Shortest path Routing Algorithm with Automatic Resynch"},{"key":"ref8a","author":"segall","year":"1981","journal-title":"Distributed network protocol"},{"key":"ref8b","year":"0","journal-title":"MIT Report"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22730\/01056620.pdf?arnumber=1056620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:30Z","timestamp":1753121250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056620\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":9,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056620","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}