{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:25:59Z","timestamp":1743099959674,"version":"3.40.3"},"publisher-location":"Cham","reference-count":2,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218366"},{"type":"electronic","value":"9783319218373"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21837-3_64","type":"book-chapter","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T13:40:31Z","timestamp":1438350031000},"page":"654-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Network Reachability Analysis on Temporally Varying Interaction Networks"],"prefix":"10.1007","author":[{"given":"Zhonghu","family":"Xu","sequence":"first","affiliation":[]},{"given":"Kai","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"issue":"12","key":"64_CR1","first-page":"2694","volume":"E81\u2013A","author":"Y Uno","year":"1998","unstructured":"Uno, Y., Ibaraki, T.: Reachability problems of random digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E81\u2013A(12), 2694\u20132702 (1998)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Whitbeck, J., de Amorim, M.D., Conan, V., Guillaume, J-L. : Temporal reachability graphs. In: Proceedings of the 18th Annual International Conference on Mobile Computing and Networking (2012)","key":"64_CR2","DOI":"10.1145\/2348543.2348589"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21837-3_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:57:52Z","timestamp":1676973472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21837-3_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218366","9783319218373"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21837-3_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}