pith. sign in
Pith Number

pith:NB63KASH

pith:2026:NB63KASHXTWKBUU2S5Z2WK7EC3
not attested not anchored not stored refs resolved

Restoring CFAR Validity for Single-Channel IoT Sensor Streams: A Monte Carlo Comparison of Five Detectors under Cortex-M0+ Constraints

Lars Thomsen, Sergii Makovetskyi

The Temporal Spectral Noise-Floor Adaptation detector achieves high detection rate, 100% precision, and low bandwidth where classical CFAR methods fail in IoT sensor streams.

arxiv:2605.16159 v1 · 2026-05-15 · cs.NI

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NB63KASHXTWKBUU2S5Z2WK7EC3}

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

TSNFA is the only algorithm tested that simultaneously achieves high detection rate, high precision, and low per-node bandwidth.

C2weakest assumption

The factorial Monte Carlo configurations (10/50 nodes, 12/18 dB SNR, 24-hour runs repeated five times) sufficiently represent the statistical properties of real single-channel IoT sensor streams under Cortex-M0+ constraints.

C3one line summary

Monte Carlo evaluation shows TSNFA detector achieves 99.97-100% detection rate, 100% precision, and zero false-positive clusters per node while classical CFAR and CUSUM variants each fail on at least one performance dimension under Cortex-M0+ constraints.

References

23 extracted · 23 resolved · 0 Pith anchors

[1] with the Tartakovsky linear-quadratic instantaneous log- likelihood ratio [6] as the per-sample increment. A third class, TinyML autoencoder anomaly detection [7], is excluded from the present compari 2000
[2] X[k] <- FFT(x) for k in K = {1,...,6}
[3] |X_k| <- sqrt(Re(X_k)^2 + Im(X_k)^2)
[4] for each bin k in K do:
[5] insert |X_k| into B_d,k

Cited by

1 paper in Pith

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

Canonical hash

687db50247bceca0d29a9773ab2be416c847ee9996a92369fc6663ff7c7d65ff

Aliases

arxiv: 2605.16159 · arxiv_version: 2605.16159v1 · doi: 10.48550/arxiv.2605.16159 · pith_short_12: NB63KASHXTWK · pith_short_16: NB63KASHXTWKBUU2 · pith_short_8: NB63KASH
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NB63KASHXTWKBUU2S5Z2WK7EC3 \
  | 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: 687db50247bceca0d29a9773ab2be416c847ee9996a92369fc6663ff7c7d65ff
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "00b82ebdc7b5b86cd6e4b4584d05912b75687149607c3165f5d7134a207035a7",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.NI",
    "submitted_at": "2026-05-15T16:39:30Z",
    "title_canon_sha256": "e18aecf125fefd4b4e5c3bf6d5af5031cc948021a61df26cb48d6ae407f1bffd"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16159",
    "kind": "arxiv",
    "version": 1
  }
}