Pith Number

pith:6AB3XUAV

pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS

not attested not anchored not stored refs resolved

Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization

Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus

Multi-threshold preemption policies using both packet age and system age achieve lower age of information than single-threshold or probabilistic policies under random update arrivals.

arxiv:2605.16225 v1 · 2026-05-15 · cs.IT · cs.NI · cs.SY · eess.SY · math.IT

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{6AB3XUAVAVWDGQMHNBCOCLKHPS}

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

we observe that significant gains in terms of AoI can be obtained by utilizing both the age of the packet and the age of the system when designing these preemption policies.

C2weakest assumption

The system follows a random update arrival process for which an analytical framework can accurately evaluate AoI under multi-threshold preemption (abstract: 'we study the effectiveness of threshold-based policies for a system with random update arrivals' and 'introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies').

C3one line summary

Multi-threshold preemption policies that consider both packet age and system age achieve significant AoI reductions compared to probabilistic and single-threshold policies in random-arrival status update systems.

References

17 extracted · 17 resolved · 0 Pith anchors

[1] Kaul, Sanjit and Yates, Roy and Gruteser, Marco , title =. Proc. IEEE INFOCOM , year =

[2] IEEE Transactions on Reliability , volume = 1975

[3] and Dattero, Ronald , title = 1984

[4] and Berlekamp, Elwyn R 1967

[5] Wozencraft, John M. , title =. IRE National Convention Record , volume =

Receipt and verification

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

Canonical hash

f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66

Aliases

arxiv: 2605.16225 · arxiv_version: 2605.16225v1 · doi: 10.48550/arxiv.2605.16225 · pith_short_12: 6AB3XUAVAVWD · pith_short_16: 6AB3XUAVAVWDGQMH · pith_short_8: 6AB3XUAV

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/6AB3XUAVAVWDGQMHNBCOCLKHPS \
  | 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: f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "53a5d4eb933b78f0db094ac9aeab03f66ba2f41f54cc49a93742d04592c92fc1",
    "cross_cats_sorted": [
      "cs.NI",
      "cs.SY",
      "eess.SY",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2026-05-15T17:35:52Z",
    "title_canon_sha256": "4c66831c998ef65d0dabd836a2986ce70e0c855bdb9019d124c2370119f15f0f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16225",
    "kind": "arxiv",
    "version": 1
  }
}