Pith Number

pith:TPL4NIRT

pith:2026:TPL4NIRTJUP3PM4TOXXPATGLXM

not attested not anchored not stored refs resolved

Covert Bayesian Quickest Change Detection

Matthieu R. Bloch, Yun-Feng Lo

Under joint false-alarm and expected covertness budget constraints, the average detection delay in Bayesian quickest change detection admits a tight second-order asymptotic characterization as the false-alarm probability tends to zero.

arxiv:2605.16140 v1 · 2026-05-15 · cs.IT · cs.SY · eess.SY · math.IT · math.ST · stat.TH

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{TPL4NIRTJUP3PM4TOXXPATGLXM}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Under constraints on both the probability of false alarm (PFA) and the ECB, we establish a second-order asymptotic converse bound on the average detection delay as the PFA constraint approaches zero, for any positive ECB constraint, explicitly quantifying the maximum square-root-order covert sensing gain possible.

C2weakest assumption

The expected covertness budget (ECB) is an analytically tractable metric that upper-bounds the relative entropy between observation sequences induced by active versus passive sensing; this premise is used to formulate the constrained optimization and to obtain the second-order asymptotic characterization.

C3one line summary

Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.

References

35 extracted · 35 resolved · 0 Pith anchors

[1] Information-theoretic an alysis of information hiding, 2003

[2] A capacity result for batch steganography, 2007

[3] Perfectly secure steganography: Capacity, error exponents, and code constructions, 2008

[4] Limits of reliable c ommunication with low probability of detection on AWGN channels, 1921

[5] Covert communication over noisy channels: A resolvability perspective, 2016

Receipt and verification

First computed	2026-05-20T00:01:54.715659Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

9bd7c6a2334d1fb7b39375eef04ccbbb3dd21658e7292aeb51819e70f27728e9

Aliases

arxiv: 2605.16140 · arxiv_version: 2605.16140v1 · doi: 10.48550/arxiv.2605.16140 · pith_short_12: TPL4NIRTJUP3 · pith_short_16: TPL4NIRTJUP3PM4T · pith_short_8: TPL4NIRT

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 9bd7c6a2334d1fb7b39375eef04ccbbb3dd21658e7292aeb51819e70f27728e9

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "64fd857e625b085de4ef59541fe4315f24bb68c771455366bcf7739a71577274",
    "cross_cats_sorted": [
      "cs.SY",
      "eess.SY",
      "math.IT",
      "math.ST",
      "stat.TH"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2026-05-15T16:19:29Z",
    "title_canon_sha256": "4971d8d6126e871fdb1bbe1b07c46a85e8acf566a9e6493a9c474fc260c42160"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16140",
    "kind": "arxiv",
    "version": 1
  }
}