pith. sign in

arxiv: 2605.15795 · v1 · pith:SYSM6OCKnew · submitted 2026-05-15 · 💻 cs.IT · math.IT

Real-Time Reconstruction and Actuation Error Analysis for Markov Sources over MPR Channels

Pansee S. Elessawy , Nikolaos Pappas This is my paper

Pith reviewed 2026-05-19 19:55 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords real-time reconstructionMarkov sourcesmulti-packet receptionactuation errorrandomized samplingwireless channelserror analysisoptimization
0
0 comments X

The pith

Closed-form expressions for reconstruction and actuation errors in binary Markov sources are derived from transition and update probabilities over multi-packet channels.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes exact formulas for the long-term errors in reconstructing two binary Markov sources and in the cost of wrong actuations when their updates share a wireless channel that allows multiple receptions at once. It connects these errors directly to how often updates succeed and the sources' flip probabilities under stationary randomized sampling. A sympathetic reader would care because this linkage lets designers choose sampling rates that balance the two error types without repeated simulations for each new scenario.

Core claim

We derive closed-form expressions for the steady-state real-time reconstruction error (RTE) and the cost of actuation error (CAE) as functions of the source transition probabilities and the effective update probabilities. These expressions are obtained for two binary Markov sources that share a multi-packet reception channel, with each sensor using a stationary randomized sampling policy and the receiver maintaining estimates from the most recently decoded updates.

What carries the argument

Closed-form expressions for steady-state real-time reconstruction error and cost of actuation error that directly map source transition probabilities and effective update probabilities to task-oriented metrics.

If this is right

  • The effective update probabilities under randomized sampling can be explicitly characterized and linked to the physical-layer MPR model.
  • A sampling-constrained optimization problem with a weighted-error objective can be formulated to allocate resources between the two sources.
  • Source dynamics, semantic weights, and the coupling induced by the shared MPR channel determine the optimal allocation of sampling resources.
  • Numerical evaluation shows that the resulting optimized randomized sampling outperforms random, greedy, and time-sharing policies.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The closed-form expressions could support periodic re-optimization of sampling rates when source transition probabilities change over time.
  • The same mapping between update success rates and error costs might be applied to channels with fading or external interference by adjusting the effective probabilities.
  • For systems with more than two sources the optimization may require scalable approximations while preserving the same error expressions.
  • Hardware experiments measuring actual decoding success rates could directly test whether the derived error formulas match observed performance.

Load-bearing premise

The receiver maintains source estimates using only the most recently decoded updates under stationary randomized sampling policies for each sensor.

What would settle it

A direct simulation that computes the long-term reconstruction and actuation errors from the most recent decoded updates and finds values that differ from those predicted by the closed-form expressions in terms of transition and update probabilities.

Figures

Figures reproduced from arXiv: 2605.15795 by Nikolaos Pappas, Pansee S. Elessawy.

Figure 1
Figure 1. Figure 1: Time is indexed by t ∈ {0, 1, 2, . . .}. The state of source i ∈ {1, 2} at slot t is denoted by Xi(t) ∈ {0, 1} and evolves according to the transition matrix Pi =  1 − αi αi βi 1 − βi  , αi , βi ∈ (0, 1), (1) where αi and βi are the transition probabilities from 0 to 1 and from 1 to 0, respectively. arXiv:2605.15795v1 [cs.IT] 15 May 2026 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 1
Figure 1. Figure 1: The considered system model. qi = a1,ia2,0 p1/1 + a1,0a2,i p2/2 + a1,ia2,ih 1 − (1 − p1/1,2)(1 − p2/2,1) i + a1,ia2,j p1/1,2 + a1,ja2,i p2/2,1. (8) III. ANALYSIS A. Real-Time Reconstruction Error (RTE) We characterize the reconstruction error by studying the joint evolution of the source Xi(t) and its estimate Xˆ i(t). The pair (Xi(t), Xˆ i(t)) takes values in S = {(0, 0),(0, 1),(1, 0),(1, 1)}, with orderi… view at source ↗
Figure 2
Figure 2. Figure 2: illustrates the effect of (αi , βi) on the RTE. B. Cost of Actuation Error We next assign costs to the erroneous reconstruction states. Following [17], the generic cost of actuation error (CAE) is C¯ i ≜ X x̸=ˆx C x,xˆ i πi(x, xˆ), (17) where C x,xˆ i is the cost incurred for source i when the true state is x while the reconstructed state is xˆ ̸= x. Update success probability, q i 0 0.2 0.4 0.6 0.8 1 E r … view at source ↗
Figure 3
Figure 3. Figure 3: Total reconstruction error versus sampling budget [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
read the original abstract

We study real-time reconstruction and actuation for two binary Markov sources that share a wireless multi-packet reception (MPR) channel. Each sensor follows a stationary randomized sampling policy, and the receiver maintains source estimates using the most recently decoded updates. We derive closed-form expressions for the steady-state real-time reconstruction error (RTE) and the cost of actuation error (CAE) as functions of the source transition probabilities and the effective update probabilities. We then characterize these update probabilities under randomized sampling, linking the physical-layer MPR model to task-oriented reconstruction and actuation metrics. Using these expressions, we formulate a sampling-constrained optimization problem with a weighted-error objective. The resulting analysis reveals how source dynamics, semantic weights, and MPR coupling affect the allocation of sampling resources. Numerical results show that optimized randomized sampling outperforms random, greedy, and time-sharing baselines.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper studies real-time reconstruction and actuation for two binary Markov sources sharing a wireless multi-packet reception (MPR) channel. Sensors use stationary randomized sampling policies, and the receiver maintains estimates from the most recent decoded updates. Closed-form expressions are derived for the steady-state real-time reconstruction error (RTE) and cost of actuation error (CAE) in terms of source transition probabilities and effective update probabilities. These probabilities are characterized under the MPR model, an optimization problem is formulated to minimize a weighted error objective subject to sampling constraints, and numerical results show that the optimized policy outperforms random, greedy, and time-sharing baselines.

Significance. If the derivations hold, the closed-form RTE and CAE expressions constitute a clear strength by enabling direct analytical optimization rather than simulation-only approaches. The work usefully connects the physical-layer MPR success probabilities to task-oriented semantic metrics and illustrates the effects of source dynamics and channel coupling on sampling allocation.

minor comments (3)
  1. [Abstract] The abstract and introduction would benefit from an explicit statement of the binary Markov transition matrix (e.g., the probability of state flip) to make the dependence on source dynamics immediately visible.
  2. [Numerical Results] In the numerical evaluation section, reporting the precise ranges or values chosen for the transition probabilities, MPR success probabilities, and weighting factors would improve reproducibility of the optimization results.
  3. Ensure that the effective update probability is defined with a dedicated equation number and that all subsequent expressions reference it consistently rather than repeating the definition inline.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our work and for recognizing the value of the closed-form RTE and CAE expressions in enabling analytical optimization. We are pleased with the recommendation for minor revision and note that no specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper derives closed-form RTE and CAE by averaging a simple time-dependent error expression (obtained directly from the binary Markov transition matrix) over the stationary geometric distribution of the age process. The age distribution follows immediately from the i.i.d. Bernoulli success indicators whose probability is obtained from the separate MPR success model under the given randomized sampling policy. These two steps use only the source Markov chain and the channel success probabilities; neither quantity is defined in terms of the other, and no self-citation or fitted parameter is invoked to close the loop. The subsequent optimization simply plugs the resulting expressions into an objective; it does not retroactively alter the derivations. The analysis therefore reduces to standard stationary Markov-chain averaging and contains no load-bearing self-definition or self-citation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only abstract available so ledger is incomplete; relies on standard Markov chain steady-state assumptions and MPR channel model from prior work.

axioms (1)
  • domain assumption Sources are stationary binary Markov chains
    Invoked for steady-state RTE and CAE analysis.

pith-pipeline@v0.9.0 · 5674 in / 1049 out tokens · 35313 ms · 2026-05-19T19:55:03.668148+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    Industrial wireless networks: The significance of timeliness in communication systems,

    S. Vitturi, F. Tramarin, and L. Seno, “Industrial wireless networks: The significance of timeliness in communication systems,”IEEE Industrial Electronics Magazine, vol. 7, no. 2, pp. 40–51, 2013

    work page 2013

  2. [2]

    A critical review of communi- cations in multi-robot systems,

    J. Gielis, A. Shankar, and A. Prorok, “A critical review of communi- cations in multi-robot systems,”Current robotics reports, vol. 3, no. 4, pp. 213–225, 2022

    work page 2022

  3. [3]

    Goal-oriented communication for real- time tracking in autonomous systems,

    N. Pappas and M. Kountouris, “Goal-oriented communication for real- time tracking in autonomous systems,” inIEEE International Conference on Autonomous Systems (ICAS), 2021

    work page 2021

  4. [4]

    From information freshness to semantics of information and goal-oriented communica- tions,

    J. Luo, E. Delfani, M. Salimnejad, and N. Pappas, “From information freshness to semantics of information and goal-oriented communica- tions,”arXiv preprint arXiv:2512.12758, 2025

    work page arXiv 2025

  5. [5]

    Semantic-effectiveness filtering and control for post-5g wireless con- nectivity,

    P. Popovski, O. Simeone, F. Boccardi, D. Gündüz, and O. Sahin, “Semantic-effectiveness filtering and control for post-5g wireless con- nectivity,”Journal of the Indian Institute of Science, vol. 100, no. 2, pp. 435–443, 2020

    work page 2020

  6. [6]

    6g networks: Beyond shannon towards semantic and goal-oriented communications,

    E. Calvanese Strinati and S. Barbarossa, “6g networks: Beyond shannon towards semantic and goal-oriented communications,”Computer Net- works, vol. 190, p. 107930, 2021

    work page 2021

  7. [7]

    Semantic communications in networked systems: A data significance perspective,

    E. Uysal, O. Kaya, A. Ephremides, J. Gross, M. Codreanu, P. Popovski, M. Assaad, G. Liva, A. Munari, B. Soret, T. Soleymani, and K. H. Johansson, “Semantic communications in networked systems: A data significance perspective,”IEEE Network, vol. 36, no. 4, pp. 233–240, 2022

    work page 2022

  8. [8]

    Real-time status: How often should one update?

    S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?” inIEEE INFOCOM, 2012

    work page 2012

  9. [9]

    Age of information: A new concept, metric, and tool,

    A. Kosta, N. Pappas, and V . Angelakis, “Age of information: A new concept, metric, and tool,”F oundations and Trends in Networking, vol. 12, no. 3, pp. 162–259, 2017

    work page 2017

  10. [10]

    Age of information: An introduction and survey,

    R. D. Yates, Y . Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,”IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1183– 1210, 2021

    work page 2021

  11. [11]

    Update or wait: How to keep your data fresh,

    Y . Sun, E. Uysal-Biyikoglu, R. D. Yates, C. E. Koksal, and N. B. Shroff, “Update or wait: How to keep your data fresh,”IEEE Transactions on Information Theory, vol. 63, no. 11, pp. 7492–7508, 2017

    work page 2017

  12. [12]

    The age of incorrect information: A new performance metric for status updates,

    A. Maatouk, S. Kriouile, M. Assaad, and A. Ephremides, “The age of incorrect information: A new performance metric for status updates,” IEEE/ACM Transactions on Networking, vol. 28, no. 5, pp. 2215–2228, 2020

    work page 2020

  13. [13]

    Multi-threshold aoii-optimum sampling policies for continuous-time markov chain information sources,

    I. Cosandal, N. Akar, and S. Ulukus, “Multi-threshold aoii-optimum sampling policies for continuous-time markov chain information sources,”IEEE Transactions on Information Theory, vol. 71, no. 9, pp. 6968–6988, 2025

    work page 2025

  14. [14]

    The age of incorrect in- formation: An enabler of semantics-empowered communication,

    A. Maatouk, M. Assaad, and A. Ephremides, “The age of incorrect in- formation: An enabler of semantics-empowered communication,”IEEE Transactions on Wireless Communications, vol. 22, no. 4, pp. 2621– 2635, 2023

    work page 2023

  15. [15]

    Age of incorrect information for remote estimation of a binary markov source,

    C. Kam, S. Kompella, and A. Ephremides, “Age of incorrect information for remote estimation of a binary markov source,” inIEEE Conference on Computer Communications Workshops, 2020

    work page 2020

  16. [16]

    Modeling aoii in push- and pull- based sampling of continuous time markov chains,

    I. Cosandal, N. Akar, and S. Ulukus, “Modeling aoii in push- and pull- based sampling of continuous time markov chains,” inIEEE Conference on Computer Communications Workshops, 2024

    work page 2024

  17. [17]

    Real-time reconstruction of markov sources and remote actuation over wireless channels,

    M. Salimnejad, M. Kountouris, and N. Pappas, “Real-time reconstruction of markov sources and remote actuation over wireless channels,”IEEE Transactions on Communications, vol. 72, no. 5, pp. 2701–2715, 2024

    work page 2024

  18. [18]

    Goal-oriented poli- cies for cost of actuation error minimization in wireless autonomous systems,

    E. Fountoulakis, N. Pappas, and M. Kountouris, “Goal-oriented poli- cies for cost of actuation error minimization in wireless autonomous systems,”IEEE Communications Letters, vol. 27, no. 9, 2023

    work page 2023

  19. [19]

    Fundamental limits of remote esti- mation of autoregressive markov processes under communication con- straints,

    J. Chakravorty and A. Mahajan, “Fundamental limits of remote esti- mation of autoregressive markov processes under communication con- straints,”IEEE Transactions on Automatic Control, vol. 62, no. 3, pp. 1109–1124, 2017

    work page 2017

  20. [20]

    Sampling of the wiener process for remote estimation over a channel with random delay,

    Y . Sun, Y . Polyanskiy, and E. Uysal, “Sampling of the wiener process for remote estimation over a channel with random delay,”IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 1118–1135, 2020

    work page 2020

  21. [21]

    Semantic-aware remote estimation of multiple markov sources under constraints,

    J. Luo and N. Pappas, “Semantic-aware remote estimation of multiple markov sources under constraints,”IEEE Transactions on Communica- tions, 2025

    work page 2025

  22. [22]

    Real-time remote monitoring of correlated markovian sources,

    M. Salimnejad, M. Kountouris, and N. Pappas, “Real-time remote monitoring of correlated markovian sources,”IEEE Open Journal of the Communications Society, vol. 7, pp. 2777–2793, 2026

    work page 2026

  23. [23]

    Query-based sampling of heterogeneous ctmcs: Modeling and optimization with binary freshness,

    N. Akar and S. Ulukus, “Query-based sampling of heterogeneous ctmcs: Modeling and optimization with binary freshness,”IEEE Transactions on Communications, vol. 72, no. 12, pp. 7705–7714, 2024

    work page 2024

  24. [24]

    Goal-oriented remote tracking through correlated observations in pull-based communications,

    A. Zakeri, M. Moltafet, and M. Codreanu, “Goal-oriented remote tracking through correlated observations in pull-based communications,” IEEE Communications Letters, vol. 29, no. 12, pp. 2805–2809, 2025

    work page 2025

  25. [25]

    Which sensor to observe? timely tracking of a joint markov source with model predictive control,

    I. Cosandal, S. Ulukus, and N. Akar, “Which sensor to observe? timely tracking of a joint markov source with model predictive control,” in IEEE International Symposium on Information Theory, 2025, pp. 1–6

    work page 2025

  26. [26]

    Query age of information: Freshness in pull-based communication,

    F. Chiariotti, J. Holm, A. E. Kalør, B. Soret, S. K. Jensen, T. B. Pedersen, and P. Popovski, “Query age of information: Freshness in pull-based communication,”IEEE Transactions on Communications, vol. 70, no. 3, pp. 1606–1622, 2022

    work page 2022

  27. [27]

    Status updates over unreliable multiaccess channels,

    R. D. Yates and S. K. Kaul, “Status updates over unreliable multiaccess channels,” inIEEE International Symposium on Information Theory (ISIT), 2017, pp. 331–335

    work page 2017

  28. [28]

    Optimizing information freshness in a multiple access channel with heterogeneous devices,

    Z. Chen, N. Pappas, E. Björnson, and E. G. Larsson, “Optimizing information freshness in a multiple access channel with heterogeneous devices,”IEEE Open Journal of the Communications Society, vol. 2, pp. 456–470, 2021

    work page 2021

  29. [29]

    Scheduling policies for minimizing age of information in broadcast wireless networks,

    I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Scheduling policies for minimizing age of information in broadcast wireless networks,”IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018

    work page 2018

  30. [30]

    Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,

    I. Kadota, A. Sinha, and E. Modiano, “Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,”IEEE/ACM Transactions on Networking, vol. 27, no. 4, pp. 1359–1372, 2019

    work page 2019

  31. [31]

    Modern random access: An age of information perspective on irregular repetition slotted aloha,

    A. Munari, “Modern random access: An age of information perspective on irregular repetition slotted aloha,”IEEE Transactions on Communi- cations, vol. 69, no. 6, pp. 3572–3585, 2021

    work page 2021

  32. [32]

    Age- threshold slotted aloha for optimizing information freshness in mobile networks,

    F. Zhao, N. Pappas, C. Ma, X. Sun, T. Q. S. Quek, and H. H. Yang, “Age- threshold slotted aloha for optimizing information freshness in mobile networks,”IEEE Transactions on Wireless Communications, vol. 23, no. 11, pp. 17 236–17 251, 2024

    work page 2024

  33. [33]

    Remote monitoring of two-state markov sources in random access channels: Joint model and state estimation,

    H. Asgari, A. Munari, G. Liva, and G. Cocco, “Remote monitoring of two-state markov sources in random access channels: Joint model and state estimation,” in14th International ITG Conference on Systems, Communications and Coding (SCC), 2025

    work page 2025

  34. [34]

    Random-access monitoring of markov sources: Analytical characterization of uncertainty,

    H. Asgari, G. Cocco, and A. Munari, “Random-access monitoring of markov sources: Analytical characterization of uncertainty,” inIEEE ISIT, 2026

    work page 2026

  35. [35]

    Stability properties of slotted aloha with multipacket reception capability,

    S. Ghez, S. Verdu, and S. Schwartz, “Stability properties of slotted aloha with multipacket reception capability,”IEEE Transactions on Automatic Control, vol. 33, no. 7, pp. 640–649, 1988

    work page 1988

  36. [36]

    Stability and delay of finite- user slotted aloha with multipacket reception,

    V . Naware, G. Mergen, and L. Tong, “Stability and delay of finite- user slotted aloha with multipacket reception,”IEEE Transactions on Information Theory, vol. 51, no. 7, pp. 2636–2656, 2005

    work page 2005