pith. sign in

arxiv: 2605.16176 · v1 · pith:FDMNVY2Nnew · submitted 2026-05-15 · 💻 cs.IT · cs.NI· eess.SP· math.IT

How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness

Ismail Cosandal , Sennur Ulukus This is my paper

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

classification 💻 cs.IT cs.NIeess.SPmath.IT
keywords age of stalenessdigital twin networkMarkov sourceremote estimationsampling rate allocationage of informationpolyblock optimization
0
0 comments X

The pith

Age of staleness measures the time since a remote estimate of a Markov source last matched the true state.

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

The paper introduces the age of staleness metric to quantify how long ago the current estimate of a physical process was accurate. Unlike age of information, which ignores process dynamics, this metric accounts for both sampling freshness and the underlying random source behavior. For a single n-ary symmetric Markov source sampled at constant rate, the authors derive a closed-form expression showing that age of staleness decreases monotonically as the sampling rate increases. For several such sources sharing a fixed total sampling budget, they formulate a non-convex optimization problem whose structure allows a near-optimal solution via the polyblock algorithm. The metric is positioned as especially relevant for digital twin networks that must maintain synchronized representations of multiple physical objects.

Core claim

The central claim is that age of staleness, defined as the time elapsed since the monitor's current estimate was last correct, serves as a semantic-aware performance measure for remote tracking of n-ary symmetric Markov sources; a closed-form expression exists under constant-rate sampling and is monotonically decreasing in the sampling rate, while for multiple sources the total sampling rate can be allocated near-optimally by the polyblock algorithm to minimize a sum of age-of-staleness values.

What carries the argument

Age of staleness (AoS), the time since the last instant when the remote estimate exactly matched the physical source state.

If this is right

  • For any fixed sampling rate the age of staleness admits an exact closed-form value.
  • Increasing the sampling rate always reduces age of staleness for a single source.
  • When a total sampling budget must be divided among several sources, the polyblock algorithm yields a near-optimal allocation that exploits monotonicity of the objective.
  • The metric directly supports resource allocation decisions inside a digital twin network that tracks multiple physical objects.

Where Pith is reading between the lines

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

  • The same definition could be applied to non-Markov sources or to channels with random delays, provided the probability that an estimate remains correct can still be tracked.
  • Age of staleness might be combined with conventional age-of-information objectives in a multi-objective scheduler.
  • Numerical evaluation of the polyblock solution for realistic digital-twin parameter values would reveal how close the near-optimal allocation comes to the true optimum.

Load-bearing premise

The physical objects behave as independent n-ary symmetric Markov sources that are observed through a fixed-rate sampling process with no transmission delays or errors.

What would settle it

Simulate a single n-ary symmetric Markov source at two different constant sampling rates and check whether the measured average age of staleness is strictly lower at the higher rate.

Figures

Figures reproduced from arXiv: 2605.16176 by Ismail Cosandal, Sennur Ulukus.

Figure 1
Figure 1. Figure 1: Comparison of AoI, AoII, BF and the proposed AoS metrics for the [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The evolution of the AoS over a single period. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A monitor samples multiple sources. E.g., a DT monitor observes [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Comparison of average AoS values between the proposed polyblock [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
read the original abstract

The groundbreaking metric age of information (AoI) has been introduced to measure information freshness in communication networks. As transformational as it is, AoI metric falls short in some applications, such as remote monitoring, since it is a semantic-agnostic metric which does not consider the dynamics of the random process. There is a need to quantify the performance of a remote estimator via a metric that combines freshness and semantic aspects. To this end, in this paper, we introduce a novel metric coined age of staleness (AoS) that measures when the last time that the current estimation was correct. First, we analyze a simple scenario where an $n$-ary symmetric Markov source is observed by a monitor via a constant sampling rate, obtain a closed-form expression for the AoS, and show that it is a monotonically decreasing function of the sampling rate. Next, we consider multiple distinct Markov sources, and formulate an optimization problem, where the remote monitor allocates the total sampling rate to tracking the sources. Although the optimization problem is non-convex, its structure is suitable for obtaining a near-optimal solution using the polyblock algorithm, which leverages the monotonicity of the objective function. While the new AoS metric could be applicable in many scenarios, we believe it is particularly well-suited for a digital twin network (DTN) where multiple physical objects (POs) are monitored with a total sampling rate constraint to maintain a digital representation of them, namely, their digital twin (DT).

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

2 major / 2 minor

Summary. The paper introduces a novel metric called age of staleness (AoS) that quantifies the time since the current remote estimate of a physical object's state was last correct, addressing limitations of the age of information metric by incorporating process dynamics. For a single n-ary symmetric Markov source under constant-rate sampling, a closed-form AoS expression is derived and shown to be monotonically decreasing in the sampling rate. For multiple distinct Markov sources under a total sampling rate constraint, a non-convex optimization problem is formulated for rate allocation and solved approximately via the polyblock algorithm, which exploits the monotonicity property. The metric is positioned as particularly suitable for digital twin networks.

Significance. If the derivations hold, AoS provides a semantically aware freshness metric that combines temporal and state-correctness aspects, enabling more informed resource allocation than AoI in remote monitoring and digital twin applications. The closed-form result under the symmetric Markov model and the resulting monotonicity are strengths that directly support the use of the polyblock algorithm for the multi-source problem. This could influence sampling strategies in constrained DTN settings where maintaining accurate digital representations is critical.

major comments (2)
  1. [§3] §3 (analysis of single n-ary symmetric Markov source): The closed-form AoS and its monotonicity in sampling rate are derived under the specific assumption of an n-ary symmetric Markov chain with constant-rate sampling. The step showing that the probability a held sample remains correct leads to a monotonically decreasing AoS (via differentiation or direct comparison) should be verified for its dependence on symmetry; the paper does not include a robustness check or counter-example for asymmetric transition probabilities, which is load-bearing for extending the polyblock justification to general physical objects.
  2. [§4] §4 (multi-source rate allocation): The polyblock algorithm is invoked because AoS is monotonically decreasing in each source's sampling rate. This property is proven only for the symmetric case; if the objective loses monotonicity under more general Markov dynamics typical in DTNs, the near-optimality claim and algorithm applicability require additional justification or a modified proof.
minor comments (2)
  1. [Introduction] The introduction contrasts AoS with AoI but could more explicitly define the new metric in terms of the underlying Markov process before presenting the closed-form result.
  2. [§4] Notation for the sampling rate allocation vector and the total rate constraint should be introduced with a clear equation reference to improve readability of the optimization problem.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable comments on our paper. We address the major comments point by point below. We agree with the referee that the analysis is specific to the symmetric Markov model and will revise the manuscript to better highlight the assumptions and limitations.

read point-by-point responses

  1. Referee: [§3] §3 (analysis of single n-ary symmetric Markov source): The closed-form AoS and its monotonicity in sampling rate are derived under the specific assumption of an n-ary symmetric Markov chain with constant-rate sampling. The step showing that the probability a held sample remains correct leads to a monotonically decreasing AoS (via differentiation or direct comparison) should be verified for its dependence on symmetry; the paper does not include a robustness check or counter-example for asymmetric transition probabilities, which is load-bearing for extending the polyblock justification to general physical objects.

    Authors: The derivation in Section 3 is intentionally for the n-ary symmetric Markov chain because this allows us to obtain a closed-form expression for AoS. The monotonicity is proven by differentiating the AoS expression with respect to the sampling rate, and this step does rely on the symmetric transition probabilities. We do not provide a robustness check for asymmetric cases as the paper focuses on this model as a foundational case for digital twin applications. We will revise the manuscript to explicitly note that the closed-form and monotonicity results are for symmetric sources and discuss that for asymmetric transitions, numerical methods might be needed to check monotonicity. This addresses the concern for extending to general objects. revision: yes

  2. Referee: [§4] §4 (multi-source rate allocation): The polyblock algorithm is invoked because AoS is monotonically decreasing in each source's sampling rate. This property is proven only for the symmetric case; if the objective loses monotonicity under more general Markov dynamics typical in DTNs, the near-optimality claim and algorithm applicability require additional justification or a modified proof.

    Authors: In Section 4, the sources are modeled as distinct but each following the symmetric Markov dynamics as analyzed in Section 3. Therefore, the monotonicity holds for each, justifying the use of the polyblock algorithm for the non-convex optimization. We acknowledge that if the DTN involves sources with asymmetric dynamics, additional justification would be needed. We will add a clarification in the revised version stating the assumption and noting the limitation for general cases, without claiming the result for arbitrary Markov processes. revision: yes

Circularity Check

0 steps flagged

AoS derivation is self-contained from Markov model assumptions with no reductions to inputs or self-citations

full rationale

The paper defines AoS directly as the time since the last correct state estimate for an n-ary symmetric Markov source sampled at constant rate, derives its closed-form expression from the source transition matrix, and proves monotonic decrease in sampling rate from the resulting probability that a held sample remains correct. This property is then applied to justify the polyblock algorithm for rate allocation across multiple sources. No equation reduces to a fitted parameter renamed as prediction, no load-bearing claim rests on self-citation, and the model assumptions are stated explicitly without smuggling ansatzes or uniqueness theorems from prior author work. The chain is independent of the target results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on modeling the monitored objects as n-ary symmetric Markov sources and on the newly introduced AoS definition itself.

axioms (1)
  • domain assumption Physical objects follow n-ary symmetric Markov dynamics
    Enables the closed-form AoS expression under constant sampling rate.
invented entities (1)
  • Age of Staleness (AoS) no independent evidence
    purpose: Quantify the time since the remote estimator's current output was last correct
    Newly defined metric that combines freshness with semantic correctness.

pith-pipeline@v0.9.0 · 5810 in / 1217 out tokens · 43572 ms · 2026-05-19T18:43:25.934253+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

31 extracted references · 31 canonical work pages

  1. [1]

    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, March 2012

    work page 2012

  2. [2]

    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 J. Sel. Areas Commun., vol. 39, no. 5, pp. 1183–1210, May 2021

    work page 2021

  3. [3]

    Age of information in gossip networks: A friendly introduction and literature survey invited paper,

    P. Kaswan, P. Mitra, A. Srivastava, and S. Ulukus, “Age of information in gossip networks: A friendly introduction and literature survey invited paper,”IEEE Transactions on Communications, vol. 73, no. 8, pp. 6200– 6220, February 2025

    work page 2025

  4. [4]

    Age of information in internet of things: A survey,

    I. Kahraman, A. Kose, M. Koca, and E. Anarim, “Age of information in internet of things: A survey,”IEEE Internet of Things Journal, vol. 11, no. 6, pp. 9896–9914, October 2023

    work page 2023

  5. [5]

    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 Trans. Netw., vol. 28, no. 5, pp. 2215–2228, October 2020

    work page 2020

  6. [6]

    On the monotonicity of information aging,

    M. K. C. Shisher and Y . Sun, “On the monotonicity of information aging,” inIEEE Infocom, May 2024

    work page 2024

  7. [7]

    Timely communications for remote inference,

    M. K. C. Shisher, Y . Sun, and I. Hou, “Timely communications for remote inference,”IEEE/ACM Transactions on Networking, vol. 32, no. 5, pp. 3824–3839, June 2024

    work page 2024

  8. [8]

    Context-aware status updating: Wireless scheduling for maximizing situational awareness in safety-critical systems,

    T. Z. Ornee, M. K. C. Shisher, C. Kam, and Y . Sun, “Context-aware status updating: Wireless scheduling for maximizing situational awareness in safety-critical systems,” inIEEE MILCOM, October 2023

    work page 2023

  9. [9]

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

    A. Maatouk, M. Assaad, and A. Ephremides, “The age of incorrect information: An enabler of semantics-empowered communication,”IEEE Trans. Wireless Comm., vol. 22, no. 4, pp. 2621–2635, October 2022

    work page 2022

  10. [10]

    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 of Information Theory, vol. 71, no. 9, pp. 6968–6988, July 2025

    work page 2025

  11. [11]

    Minimizing functions of age of incorrect information for remote estimation,

    I. Cosandal, S. Ulukus, and N. Akar, “Minimizing functions of age of incorrect information for remote estimation,” inIEEE Globecom, December 2025

    work page 2025

  12. [12]

    Timely tracking of infection status of individuals in a population,

    M. Bastopcu and S. Ulukus, “Timely tracking of infection status of individuals in a population,” inIEEE Infocom, May 2021

    work page 2021

  13. [13]

    Timely multi-goal transmissions with an intermittently failing sensor,

    I. Cosandal and S. Ulukus, “Timely multi-goal transmissions with an intermittently failing sensor,” inIEEE MILCOM, October 2023

    work page 2023

  14. [14]

    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 Infocom, July 2020

    work page 2020

  15. [15]

    Age of incorrect information minimization for timely status updates in satellite-based IoT,

    Q. Yan, J. Jiao, T. Yang, L. An, Y . Wang, and Q. Zhang, “Age of incorrect information minimization for timely status updates in satellite-based IoT,” inIEEE ICCC, August 2024

    work page 2024

  16. [16]

    Preempting to minimize age of in- correct information under random delay,

    Y . Chen and A. Ephremides, “Preempting to minimize age of in- correct information under random delay,” 2022, available online at arXiv:2209.14254

    work page arXiv 2022

  17. [17]

    Distribution of age of information in status update systems with heterogeneous information sources: An absorbing Markov chain-based approach,

    N. Akar and E. O. Gamgam, “Distribution of age of information in status update systems with heterogeneous information sources: An absorbing Markov chain-based approach,”IEEE Communications Letters, vol. 27, no. 8, pp. 2024–2028, May 2023

    work page 2024

  18. [18]

    State-aware resource allocation for wireless closed-loop control systems,

    L. Scheuvens, T. H ¨oßler, P. Schulz, N. Franchi, A. N. Barreto, and G. P. Fettweis, “State-aware resource allocation for wireless closed-loop control systems,”IEEE Trans. Comm., vol. 69, no. 10, pp. 6604–6619, July 2021

    work page 2021

  19. [19]

    Monotonic optimization in communi- cation and networking systems,

    Y . J. Zhang, L. Qian, and J. Huang, “Monotonic optimization in communi- cation and networking systems,”Foundations and Trends in Networking, vol. 7, no. 1, pp. 1–75, 2013

    work page 2013

  20. [20]

    Optimal resource allocation in coordinated multi-cell systems,

    E. Bjornson and E. Jorswieck, “Optimal resource allocation in coordinated multi-cell systems,”Foundations and Trends in Communications and Information Theory, vol. 9, no. 2-3, pp. 113–381, 2013

    work page 2013

  21. [21]

    Digital twins: State of the art theory and practice, challenges, and open research questions,

    A. Sharma, E. Kosasih, J. Zhang, A. Brintrup, and A. Calinescu, “Digital twins: State of the art theory and practice, challenges, and open research questions,”Journal of Industrial Information Integration, vol. 30, p. 100383, July 2022

    work page 2022

  22. [22]

    Age- of-information-aware digital twin assisted resource management for dis- tributed energy scheduling,

    Y . Shu, Z. Wang, H. Liao, Z. Zhou, N. Nasser, and M. Imran, “Age- of-information-aware digital twin assisted resource management for dis- tributed energy scheduling,” inIEEE Globecom, December 2022

    work page 2022

  23. [23]

    Age-of-information and energy optimization in digital twin edge networks,

    Y . Guo, Y . Fu, Y . Zhang, and T. Q. Quek, “Age-of-information and energy optimization in digital twin edge networks,” inIEEE Globecom, December 2024

    work page 2024

  24. [24]

    Digital twin placement for minimum application request delay with data age targets,

    M. Vaezi, K. Noroozi, T. D. Todd, D. Zhao, and G. Karakostas, “Digital twin placement for minimum application request delay with data age targets,”IEEE Internet of Things Journal, vol. 10, no. 13, pp. 11 547– 11 557, February 2023

    work page 2023

  25. [25]

    From age of information to age of digital twin: A review on synchronization metrics for IoT networks,

    A. Loubany, M. Itani, and S. Sharafeddine, “From age of information to age of digital twin: A review on synchronization metrics for IoT networks,”IEEE Access, pp. 131 102–131 119, July 2025

    work page 2025

  26. [26]

    Age of twin (AoT): A new digital twin qualifier for 6G ecosystem,

    K. Duran, M. Ozdem, T. Hoang, T. Q. Duong, and B. Canberk, “Age of twin (AoT): A new digital twin qualifier for 6G ecosystem,”IEEE Internet of Things Magazine, vol. 6, no. 4, pp. 138–143, December 2023

    work page 2023

  27. [27]

    Semantic- aware remote state estimation in digital twin with minimizing age of incorrect information,

    H. Tong, S. Wang, Z. Yang, J. Zhao, M. Bennis, and C. Yin, “Semantic- aware remote state estimation in digital twin with minimizing age of incorrect information,” inIEEE GLOBECOM, December 2022

    work page 2022

  28. [28]

    Building delay-tolerant digital twins for cislunar operations using age of synchronization,

    F. D. Quazi, A. Vazquez-Castro, D. Niyato, S. Mao, and Z. Han, “Building delay-tolerant digital twins for cislunar operations using age of synchronization,” inIEEE ICC, May 2024, pp. 153–158

    work page 2024

  29. [29]

    J. G. Kemeny and J. L. Snell,Finite Markov Chains. Springer, 1960

    work page 1960

  30. [30]

    Durrett,Essentials of Stochastic Processes

    R. Durrett,Essentials of Stochastic Processes. Springer, 1999

    work page 1999

  31. [31]

    Serfozo,Basics of applied stochastic processes

    R. Serfozo,Basics of applied stochastic processes. Springer Science & Business Media, 2009

    work page 2009