{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T14:33:02Z","timestamp":1785249182799,"version":"3.55.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"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. on Mobile Comput."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tmc.2024.3471391","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T17:32:05Z","timestamp":1727717525000},"page":"1043-1054","source":"Crossref","is-referenced-by-count":18,"title":["Monitoring Correlated Sources: AoI-Based Scheduling is Nearly Optimal"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1881-3195","authenticated-orcid":false,"given":"Rudrapatna Vallabh","family":"Ramakanth","sequence":"first","affiliation":[{"name":"Laboratory of Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9892-1366","authenticated-orcid":false,"given":"Vishrant","family":"Tripathi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8238-8130","authenticated-orcid":false,"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[{"name":"Laboratory of Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845114"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937336"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919842"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3078137"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3565287.3610263"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488702"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3492866.3549719"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406914"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2936759"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2014.02.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2183130"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2717193"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394819"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.02.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.06.092"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2314222"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2341-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2019.2900864"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1115\/1.3662552"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3363294"},{"key":"ref24","article-title":"Block elimination and Schur complements","volume-title":"Convex Optimization","author":"Boyd"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2200\/s00954ed2v01y201909cnt023"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919842"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817.008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002828"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1201\/b11838-15"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/10836120\/10700668.pdf?arnumber=10700668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:58:38Z","timestamp":1736488718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10700668\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2024.3471391","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}