Pith. sign in

REVIEW 3 major objections 3 minor 1 cited by

In an ISAC status-update system, the optimal sensing-vs-communication policy is a monotone threshold curve in the two-dimensional age-of-information state space.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-03 06:19 UTC pith:L4CD4KRW

load-bearing objection Nice ISAC status-updating formulation, but the main monotone-threshold theorem rests on a broken Lemma 4; the theorem is unproven as it stands. the 3 major comments →

arxiv 2601.22901 v2 pith:L4CD4KRW submitted 2026-01-30 cs.IT math.ITmath.OC

Status Updating via Integrated Sensing and Communication: Freshness Optimisation

Touraj Soleymani , Mohamad Assaad , John S. Baras This is my paper
classification cs.IT math.ITmath.OC MSC 90C4093E20
keywords age of informationintegrated sensing and communicationstatus updatingMarkov decision processthreshold policysubmodularityremote navigationfreshness
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper studies a base station that can either sense a remote source's state or communicate previously sensed information back to that source, where both actions are unreliable and costly. Its aim is to characterize the policy that minimizes long-term cost including the source's age of information (AoI) plus sensing/communication overheads. The central result is that an optimal stationary deterministic policy has a monotone switching structure: for each base-station AoI, there is a threshold on the source AoI below which sensing is optimal and above which communication is optimal, and this threshold rises as the base station's AoI grows. If correct, this means a provably optimal scheduler can be implemented as a single interpretable curve rather than a lookup table, which matters for real-time operation.

Core claim

The paper formulates the joint sensing-communication scheduling problem as a discounted infinite-horizon MDP with state (αs, αb) tracking the AoI at the source and at the base station. It proves (Theorem 1) that the optimal stationary deterministic policy is of threshold form: there exists a nondecreasing integer-valued function τ such that the optimal action is 'sense' when αs ≤ τ(αb) and 'communicate' otherwise. The nondecreasing property means that as the base station's information becomes staler, the system optimally favors sensing over communication for a weakly larger set of source-AoI values. The proof proceeds via the Bellman operator preserving coordinatewise monotonicity and submod

What carries the argument

The central object is the action-value difference Δ(αs, αb) = Q_sense(αs, αb) − Q_comm(αs, αb). The paper argues that the Bellman operator preserves the class of coordinatewise nondecreasing submodular value functions, so the optimal value function is in this class; then Δ is nondecreasing in αs and nonincreasing in αb, producing a single-crossing property that yields the nondecreasing threshold curve τ(αb).

Load-bearing premise

The proof of monotonicity in the base-station AoI assumes that for a submodular, coordinatewise nondecreasing value function, the vertical increment at the source coordinate is bounded by the vertical increment at the base-station coordinate, an inequality that submodularity only provides when the source coordinate is at least the base-station coordinate.

What would settle it

Compute the increment inequality used in Lemma 4 with a submodular value function such as V(αs, αb) = −e^{−(αs+αb)} at a state with αs < αb; the inequality reverses, so if value iteration ever produces such a function the claimed monotone threshold structure would not follow from the given proof.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • The optimal policy can be encoded by a single nondecreasing curve, reducing implementation to comparing αs with τ(αb).
  • As the base-station AoI increases, the sense region expands: the system becomes more willing to renew its own observation even though communication is also available.
  • The structure holds for any costs and success probabilities satisfying λc ≥ λs, so the qualitative geometry is robust to the actual reliability and cost values.
  • The result gives a concrete performance guarantee for a freshness-based objective in ISAC, linking semantic metrics to structured decision rules.

Where Pith is reading between the lines

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

  • If the threshold structure is correct, it suggests that in practice only coarse AoI information (e.g., thresholds on age) is needed to implement near-optimal sensing/communication arbitration, which could be encoded in lightweight hardware.
  • The same monotone-structure argument might transfer to other two-state semantic metrics such as value of information or age of incorrect information, as long as the stage cost is coordinatewise nondecreasing and submodular.
  • One testable extension is to allow randomized policies or a third 'idle' action; the threshold form may then become a randomized switching region, and quantifying the loss relative to deterministic thresholds would bound the cost of simplicity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper studies an ISAC-enabled base station that, at each time slot, chooses between sensing the state of a remote source and communicating previously sensed state information back to the source. Sensing and communication are modelled as independent Bernoulli trials with success probabilities λs and λc, and incur costs cs and cc. The state is the AoI pair (αs, αb); the stage cost is αs plus the action cost. The main claim (Theorem 1) is that the optimal stationary deterministic policy for the discounted infinite-horizon MDP has a monotone switching structure: for a nondecreasing function τ(αb), sense when αs ≤ τ(αb) and communicate otherwise. The proof proceeds by showing that the value function lies in the class F of coordinatewise nondecreasing submodular functions and that the action-difference function is increasing in αs and decreasing in αb. A numerical value-iteration experiment illustrates the claimed structure.

Significance. The problem is well motivated and the MDP formulation is clean. A monotone switching curve, if rigorously established, would be an interpretable and implementable scheduling rule and a useful contribution to the ISAC/AoI literature. The paper does not fit parameters or derive predictions from its conclusion, and its numerical study is appropriately presented as illustrative. However, the central proof rests on Lemma 4, and that lemma is false as stated. Because Theorem 1 is not established by any other argument in the manuscript, the main contribution cannot be accepted as proven in the current form.

major comments (3)
  1. [Section III.C, Lemma 4] The proof of Lemma 4 asserts the inequality V(αs+1, αb+2) − V(αs+1, αb+1) ≤ V(αb+1, αb+2) − V(αb+1, αb+1) as a consequence of submodularity. For a submodular V, the vertical increment V(a, b+1) − V(a, b) is nonincreasing in a, so the displayed inequality is valid only when αs+1 ≥ αb+1. When αs < αb, the reverse inequality holds. Since Lemma 4 is stated for all (αs, αb) ∈ N0², the proof fails in the regime αs < αb. This is not a minor gap: for V(x,y) = −e^{−(x+y)} ∈ F with λs=0.6, λc=0.9, cs=cc=0, and (αs, αb)=(0,10), equation (12) gives Db = Δ(αs, αb+1) − Δ(αs, αb) ≈ 1.17×10⁻⁶ > 0. Thus Δ is not nonincreasing in αb for every V ∈ F, and Lemma 4 is false as stated. Section III.E invokes Lemma 4 to prove that τ(αb) is nondecreasing, so the proof of Theorem 1 does not go through.
  2. [Section III.D, Lemma 5] The proof of Lemma 5 is only a one-sentence sketch: the single-crossing property of Δ is said to 'preclude oscillatory action patterns' and thereby preserve submodularity of min{Qsense, Qcomm}. No 2×2-lattice verification is given. Since Lemma 5 is needed for Lemma 6 (V* ∈ F), this is another load-bearing step that requires a rigorous proof even if Lemma 4 were repaired.
  3. [Section III.E and Section IV] The deduction of the monotone threshold relies entirely on Lemma 4, which is false as stated. The numerical experiment in Section IV shows only one parameter set; the claim that 'all results reported below are robust to variations' is not supported by any displayed parameter sweep. The numerics illustrate the desired geometry but cannot substitute for the missing proof.
minor comments (3)
  1. [Section III.A] The phrase 'with truncation at αi ≤ Amax' is introduced parenthetically but the theorem is stated for the infinite state space N0². Please clarify whether Theorem 1 concerns the infinite-state MDP or the truncated one, and explain how truncation affects the optimality argument.
  2. [Section III.D] The term 'single-crossing property' is used without a formal definition. Since this property is central to the switching argument, it should be defined explicitly and stated as a lemma, including the exact sense in which the sign of Δ changes.
  3. [Section IV] Figure 3 reports a single parameter realization (Amax=30, γ=0.95, λs=0.6, λc=0.9, cs=0.2, cc=0.1). The statement that the results are robust to parameter variations should be substantiated with additional runs or tempered to what the displayed data support.

Circularity Check

0 steps flagged

No significant circularity: the structural MDP derivation is self-contained; the main flaw is an invalid submodularity inequality, not circular reasoning.

full rationale

The paper's derivation chain is self-contained rather than circular. Theorem 1 is obtained from the Bellman operator and structural properties (monotonicity, submodularity, single-crossing) developed in Lemmas 1-6 via value iteration; the external inputs are standard MDP facts and a generic Topkis-style closure claim, not author-specific conclusions. The many self-citations (e.g., [14]-[20]) appear in the related-work review of value of information and are not load-bearing for the ISAC threshold theorem. No parameter is fitted to a subset of data and then called a prediction: the numerical section computes the value function by value iteration and illustrates the switching curve for one parameter set, and the paper does not claim Fig. 3 proves the theorem. The central mathematical difficulty is that Lemma 4 applies submodularity's decreasing-differences inequality in the wrong order: the asserted bound V(αs+1,αb+2)−V(αs+1,αb+1) ≤ V(αb+1,αb+2)−V(αb+1,αb+1) requires αs+1 ≥ αb+1, and for αs < αb the inequality reverses. This is a correctness gap in the proof, not a circular reduction: the conclusion is not assumed in the hypotheses, and the derivation is not shown to be equivalent to its inputs by construction. Therefore no self-definition, fitted-input-as-prediction, or self-citation-chain circularity is present.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

No fitted parameters: the costs and success probabilities are given constants from the system model. The paper's central claim depends on the preservation of submodularity under the Bellman operator, which is proven via a flawed argument (see red flags). No new physical entities are introduced.

axioms (3)
  • standard math Standard discounted infinite-horizon MDP convergence and Bellman optimality.
    The paper relies on value iteration convergence and Bellman's optimality principle, which are standard.
  • domain assumption λc ≥ λs (communication link is more reliable than sensing link).
    Stated in Section II-A; used in the proof of Lemma 3 to ensure the forward difference in αs is nonnegative.
  • standard math Transition maps for each action/link outcome are lattice-preserving (order-preserving and meet/join-preserving).
    Used in Lemma 2 to conclude V ∘ F is submodular. The maps do preserve the lattice operations, so this is a valid step.

pith-pipeline@v1.3.0-alltime-deepseek · 9051 in / 16375 out tokens · 143084 ms · 2026-08-03T06:19:00.487754+00:00 · methodology

0 comments
read the original abstract

In this paper, we study how sensing and communication should be jointly coordinated in integrated sensing and communication (ISAC) systems to maintain timely situational awareness under reliability and resource constraints. We consider an ISAC-enabled base station that supports a remote source by dynamically choosing between sensing new state information and communicating previously acquired information, with the two operations semantically intertwined rather than serving separate targets and users. Both sensing and communication are unreliable and costly. The objective is to optimise a long-term cost that captures information freshness at the source, measured by the age of information (AoI), together with sensing and communication overheads. The resulting sequential decision problem is formulated as an infinite-horizon Markov decision process (MDP) with two-dimensional AoI states that capture information freshness at the source and at the base station. We prove that the optimal stationary policy admits a monotone threshold structure characterised by a nondecreasing switching curve in the AoI state space, and show that, as the base-station information becomes staler, the system increasingly favours sensing over communication. Our numerical analysis corroborates the theoretical findings.

Figures

Figures reproduced from arXiv: 2601.22901 by John S. Baras, Mohamad Assaad, Touraj Soleymani.

Figure 1
Figure 1. Figure 1: Illustration of an unmanned ground vehicle leveragi [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Value function as a function of the source and base [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Optimal ISAC switching decision map as a function [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Age of Information Optimization for Status Updates in Integrated Sensing and Communication Systems

    cs.IT 2026-05 unverdicted novelty 5.0

    Formulates AoI minimization in ISAC as MDP with threshold policy for single source and restless bandit with Whittle indices for multi-source, with truncation error bounds.

Reference graph

Works this paper leans on

28 extracted references · 2 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Real-time status: Ho w often should one update?,

    S. Kaul, R. Y ates, and M. Gruteser, “Real-time status: Ho w often should one update?,” in Proc. of IEEE INFOCOM , pp. 2731–2735, 2012

    2012

  2. [2]

    Age of information: An introduction and survey,

    R. D. Y ates, 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

    2021

  3. [3]

    Update or wait: How to keep your data fresh,

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

    2017

  4. [4]

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

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

    2019

  5. [5]

    On the ro le of age of information in the internet of things,

    M. A. Abd-Elmagid, N. Pappas, and H. S. Dhillon, “On the ro le of age of information in the internet of things,” IEEE Communications Magazine , vol. 57, no. 12, pp. 72–77, 2019

    2019

  6. [6]

    Semantics-empowered comm unication for networked intelligent systems,

    M. Kountouris and N. Pappas, “Semantics-empowered comm unication for networked intelligent systems,” IEEE Communications Magazine , vol. 59, no. 6, pp. 96–102, 2021

    2021

  7. [7]

    Age-minimal transmission for energy harvesting sensors with finite batteries: Online policies,

    A. Arafa, J. Y ang, S. Ulukus, and H. V . Poor, “Age-minimal transmission for energy harvesting sensors with finite batteries: Online policies,” IEEE Transactions on Information Theory , vol. 66, no. 1, pp. 534–556, 2019

    2019

  8. [8]

    V ersion age of information in clustered gossip networks,

    B. Buyukates, M. Bastopcu, and S. Ulukus, “V ersion age of information in clustered gossip networks,” IEEE Journal on Selected Areas in Information Theory , vol. 3, no. 1, pp. 85–97, 2022

    2022

  9. [9]

    On the global opt imality of Whittle’s index policy for minimizing the age of informatio n,

    S. Kriouile, M. Assaad, and A. Maatouk, “On the global opt imality of Whittle’s index policy for minimizing the age of informatio n,” IEEE Trans. on Information Theory , vol. 68, no. 1, pp. 572–600, 2021

    2021

  10. [10]

    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. on Networking , vol. 28, no. 5, pp. 2215–2228, 2020

    2020

  11. [11]

    On the age of i nformation in a CSMA environment,

    A. Maatouk, M. Assaad, and A. Ephremides, “On the age of i nformation in a CSMA environment,” IEEE/ACM Trans. on Networking , vol. 28, no. 2, pp. 818–831, 2020

    2020

  12. [12]

    The age of inc orrect in- formation: An enabler of semantics-empowered communicati on,

    A. Maatouk, M. Assaad, and A. Ephremides, “The age of inc orrect in- formation: An enabler of semantics-empowered communicati on,” IEEE Trans. on Wireless Communications, vol. 22, no. 4, pp. 2621–2635, 2022

    2022

  13. [13]

    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

    2022

  14. [14]

    Optimal self- driven sampling for estimation based on value of information,

    T. Soleymani, S. Hirche, and J. S. Baras, “Optimal self- driven sampling for estimation based on value of information,” in Proc. Int. W orkshop on Discrete Event Systems , pp. 183–188, 2016

    2016

  15. [15]

    V alue of infor mation in feedback control: Quantification,

    T. Soleymani, J. S. Baras, and S. Hirche, “V alue of infor mation in feedback control: Quantification,” IEEE Trans. on Automatic Control , vol. 67, no. 7, pp. 3730–3737, 2022

    2022

  16. [16]

    V alue of information in feedback control: Global optimality,

    T. Soleymani, J. S. Baras, S. Hirche, and K. H. Johansson , “V alue of information in feedback control: Global optimality,” IEEE Trans. on Automatic Control, vol. 68, no. 6, pp. 3641–3647, 2023

    2023

  17. [17]

    Soleymani, V alue of Information Analysis in Feedback Control

    T. Soleymani, V alue of Information Analysis in Feedback Control . PhD thesis, Technical University of Munich, 2019

    2019

  18. [18]

    Relatio n between value and age of information in feedback control,

    T. Soleymani, J. S. Baras, and K. H. Johansson, “Relatio n between value and age of information in feedback control,” Age of Information: F oundations and Applications, Cambridge University Press , pp. 286– 296, 2023

    2023

  19. [19]

    Foundations of value of information: A semantic metric for networked con trol systems tasks,

    T. Soleymani, J. S. Baras, S. Hirche, and K. H. Johansson , “Foundations of value of information: A semantic metric for networked con trol systems tasks,” arXiv preprint arXiv:2403.11927 , 2024

    Pith/arXiv arXiv 2024

  20. [20]

    Consistency of value of information: Effects of packe t loss and time delay in networked control systems tasks,

    T. Soleymani, J. S. Baras, S. Wang, S. Hirche, and K. H. Jo hans- son, “Consistency of value of information: Effects of packe t loss and time delay in networked control systems tasks,” arXiv preprint arXiv:2403.11932, 2024

    Pith/arXiv arXiv 2024

  21. [21]

    Joint radar and communication design: Applications, state-of-t he-art, and the road ahead,

    F. Liu, C. Masouros, A. P . Petropulu, H. Griffiths, and L. Hanzo, “Joint radar and communication design: Applications, state-of-t he-art, and the road ahead,” IEEE Trans. on Communications , vol. 68, no. 6, pp. 3834– 3862, 2020

    2020

  22. [22]

    R adio resource management in joint radar and communication: A com prehen- sive survey,

    N. C. Luong, X. Lu, D. T. Hoang, D. Niyato, and D. I. Kim, “R adio resource management in joint radar and communication: A com prehen- sive survey,” IEEE Communications Surveys & Tutorials , vol. 23, no. 2, pp. 780–814, 2021

    2021

  23. [23]

    Waveform design and signal pr ocessing aspects for fusion of wireless communications and radar sen sing,

    C. Sturm and W. Wiesbeck, “Waveform design and signal pr ocessing aspects for fusion of wireless communications and radar sen sing,” Proceedings of the IEEE , vol. 99, no. 7, pp. 1236–1259, 2011

    2011

  24. [24]

    Sign aling strategies for dual-function radar communications: An ove rview,

    A. Hassanien, M. G. Amin, Y . D. Zhang, and F. Ahmad, “Sign aling strategies for dual-function radar communications: An ove rview,” IEEE Aerospace and Electronic Systems Magazine , vol. 31, no. 10, pp. 36–45, 2016

    2016

  25. [25]

    UA V-enabled integrated sensing and commun ication: Opportunities and challenges,

    K. Meng, Q. Wu, J. Xu, W. Chen, Z. Feng, R. Schober, and A. L . Swindlehurst, “UA V-enabled integrated sensing and commun ication: Opportunities and challenges,” IEEE Wireless Communications, vol. 31, no. 2, pp. 97–104, 2023

    2023

  26. [26]

    UA V meets int egrated sensing and communication: Challenges and future directio ns,

    J. Mu, R. Zhang, Y . Cui, N. Gao, and X. Jing, “UA V meets int egrated sensing and communication: Challenges and future directio ns,” IEEE Communications Magazine, vol. 61, no. 5, pp. 62–67, 2023

    2023

  27. [27]

    UA V assisted integrated sensing and communications for Internet of Thin gs: 3D trajectory optimization and resource allocation,

    Z. Liu, X. Liu, Y . Liu, V . C. Leung, and T. S. Durrani, “UA V assisted integrated sensing and communications for Internet of Thin gs: 3D trajectory optimization and resource allocation,” IEEE Trans. on Wireless Communications, vol. 23, no. 8, pp. 8654–8667, 2024

    2024

  28. [28]

    Integrating sensing a nd communi- cations for ubiquitous IoT: Applications, trends, and chal lenges,

    Y . Cui, F. Liu, X. Jing, and J. Mu, “Integrating sensing a nd communi- cations for ubiquitous IoT: Applications, trends, and chal lenges,” IEEE Network, vol. 35, no. 5, pp. 158–167, 2021

    2021