{"id":"https://openalex.org/W7128519726","doi":"https://doi.org/10.1109/tcomm.2026.3663231","title":"Exploiting Data Significance in Remote Estimation of Discrete-State Markov Sources","display_name":"Exploiting Data Significance in Remote Estimation of Discrete-State Markov Sources","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7128519726","doi":"https://doi.org/10.1109/tcomm.2026.3663231"},"language":null,"primary_location":{"id":"doi:10.1109/tcomm.2026.3663231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3663231","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007334592","display_name":"Jiping Luo","orcid":"https://orcid.org/0000-0003-0113-5460"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jiping Luo","raw_affiliation_strings":["Department of Computer and Information Science, Linköping University, Linköping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0113-5460","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Linköping University, Linköping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123744475","display_name":"Nikolaos Pappas","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Nikolaos Pappas","raw_affiliation_strings":["Department of Computer and Information Science, Linköping University, Linköping, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4416-7702","affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Linköping University, Linköping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12151933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":null,"first_page":"4569","last_page":"4582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13248","display_name":"Healthcare Technology and Patient Monitoring","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10444","display_name":"Context-Aware Activity Recognition Systems","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6611999869346619},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.6471999883651733},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.6362000107765198},{"id":"https://openalex.org/keywords/estimation","display_name":"Estimation","score":0.5569999814033508},{"id":"https://openalex.org/keywords/false-alarm","display_name":"False alarm","score":0.5407000184059143},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5375000238418579},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5126000046730042},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5076000094413757}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6611999869346619},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.6471999883651733},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.6362000107765198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6186000108718872},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.5569999814033508},{"id":"https://openalex.org/C2776836416","wikidata":"https://www.wikidata.org/wiki/Q1364844","display_name":"False alarm","level":2,"score":0.5407000184059143},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5375000238418579},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5126000046730042},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5076000094413757},{"id":"https://openalex.org/C2779119184","wikidata":"https://www.wikidata.org/wiki/Q294350","display_name":"ALARM","level":2,"score":0.47679999470710754},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4684999883174896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46709999442100525},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C77052588","wikidata":"https://www.wikidata.org/wiki/Q644307","display_name":"Constant false alarm rate","level":2,"score":0.40959998965263367},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.4077000021934509},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38519999384880066},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.36340001225471497},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.35690000653266907},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C55350006","wikidata":"https://www.wikidata.org/wiki/Q237193","display_name":"Exponential distribution","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2773999869823456},{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.27219998836517334},{"id":"https://openalex.org/C23725684","wikidata":"https://www.wikidata.org/wiki/Q616377","display_name":"Maintenance engineering","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2026.3663231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3663231","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7203851342201233,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,155],"consider":[1],"semantics-aware":[2],"remote":[3],"estimation":[4,62,104],"of":[5,85,92,159],"a":[6,20,39,54,124,143,160,191,202],"discrete-state":[7],"Markov":[8,146],"source":[9,28,51],"with":[10,150,164,194,239],"both":[11],"normal":[12,21,55],"(low-priority)":[13],"and":[14,73,89,113,135,171,180,206,234],"alarm":[15,33,47],"(high-priority)":[16],"states.":[17],"Erroneously":[18],"announcing":[19,45],"state":[22,34,48,56],"at":[23],"the":[24,27,50,83,90,98,157,186,214,218,230],"destination":[25],"when":[26,49],"is":[29,52,121,140],"actually":[30],"in":[31,53,217],"an":[32,46,129,151,224],"(i.e.,":[35,57],"missed":[36],"alarm)":[37],"incurs":[38],"significantly":[40],"higher":[41],"cost":[42,153],"than":[43],"falsely":[44],"false":[58],"alarm).":[59],"Moreover,":[60],"consecutive":[61],"errors":[63],"may":[64],"cause":[65],"significant":[66],"lasting":[67,99,133],"impacts,":[68],"such":[69],"as":[70,142],"maintenance":[71],"costs":[72],"misoperations.":[74],"Motivated":[75],"by":[76,102],"this,":[77],"we":[78,183,200,222],"introduce":[79],"two":[80,108],"new":[81],"metrics,":[82],"Age":[84,91],"Missed":[86],"Alarm":[87,94],"(AoMA)":[88],"False":[93],"(AoFA),":[95],"to":[96,122,190,213,228],"capture":[97],"impacts":[100],"incurred":[101],"different":[103,116],"errors.":[105],"Notably,":[106],"these":[107],"age":[109,169],"processes":[110],"evolve":[111],"interdependently":[112],"distinguish":[114],"between":[115,132],"error":[117],"types.":[118],"Our":[119],"goal":[120],"design":[123],"transmission":[125],"policy":[126,163,188,193,233],"that":[127,185,208],"achieves":[128],"optimized":[130],"trade-off":[131],"impact":[134],"communication":[136],"cost.":[137],"The":[138],"problem":[139],"formulated":[141],"countably":[144],"infinite-state":[145],"decision":[147],"process":[148,170],"(MDP)":[149],"unbounded":[152],"function.":[154],"show":[156,184],"existence":[158],"simple":[161],"switching":[162,232],"distinct":[165],"thresholds":[166],"for":[167,175],"each":[168],"derive":[172],"closed-form":[173],"expressions":[174],"its":[176],"performance.":[177],"For":[178,197],"symmetric":[179],"non-prioritized":[181],"sources,":[182],"optimal":[187,231],"reduces":[189],"threshold":[192],"identical":[195],"thresholds.":[196],"numerical":[198,240],"tractability,":[199],"propose":[201],"finite-state":[203],"approximate":[204],"MDP":[205,216],"prove":[207],"it":[209],"converges":[210],"exponentially":[211],"fast":[212],"original":[215],"truncation":[219],"size.":[220],"Finally,":[221],"develop":[223],"efficient":[225],"search":[226],"algorithm":[227],"compute":[229],"validate":[235],"our":[236],"theoretical":[237],"findings":[238],"results.":[241]},"counts_by_year":[],"updated_date":"2026-02-26T06:29:33.603293","created_date":"2026-02-06T00:00:00"}