{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T18:41:23Z","timestamp":1767292883789,"version":"3.48.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3605656","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:33:18Z","timestamp":1758043998000},"page":"668-680","source":"Crossref","is-referenced-by-count":0,"title":["Preempting to Minimize Age of Incorrect Information Under Transmission Delay"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3992-5468","authenticated-orcid":false,"given":"Yutao","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0172-8944","authenticated-orcid":false,"given":"Anthony","family":"Ephremides","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.106.2100636"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3065072"},{"volume-title":"Age of Information: A New Metric for Information Freshness","year":"2019","author":"Sun","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3509475"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3474052"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3436712"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735804"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174306"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3111495"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095823"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533395"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437907"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437904"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2019.000036"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937336"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3005549"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3213227"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9686027"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/e23121572"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518209"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt52861.2021.9589182"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162726"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS57453.2023.10225853"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3389964"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406891"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.4.626"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3511935"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3641512.3690161"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01194247"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00011-O"},{"key":"ref34","first-page":"1","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Sutton"},{"volume-title":"Dynamic Programming and Markov Processes","year":"1960","author":"Howard","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006506"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11165199.pdf?arnumber=11165199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T18:36:28Z","timestamp":1767292588000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11165199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3605656","relation":{},"ISSN":["2998-4157"],"issn-type":[{"type":"electronic","value":"2998-4157"}],"subject":[],"published":{"date-parts":[[2026]]}}}