Pith Number

pith:NU3GWIO7

pith:2026:NU3GWIO7NA5LCVEOX2NAYTWQTB

not attested not anchored not stored refs pending

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions

Youngmin Oh

A linear dueling bandit algorithm achieves regret that adds the separate costs of delays and corruptions rather than multiplying them together.

arxiv:2605.01752 v2 · 2026-05-03 · cs.LG

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{NU3GWIO7NA5LCVEOX2NAYTWQTB}

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 standard regularity conditions and a parametric post-serving mapping, we rigorously establish that our algorithm is delay-regime-agnostic, achieving a regret upper bound of O~(d(sqrt(T) + C + D)), ... our analysis reveals an additive cost structure between corruption and delay, avoiding the multiplicative degradation typical of prior works. We further establish lower bounds that nearly match our upper bounds up to a sqrt(d) factor for adversarial delays in the absence of post-serving contexts.

C2weakest assumption

standard regularity conditions and a parametric post-serving mapping (assumed to enable the learned approximator for post-serving contexts)

C3one line summary

The algorithm achieves a delay-regime-agnostic regret bound of O~(d(sqrt(T) + C + D)) with additive costs for corruption and delay under parametric post-serving context assumptions.

Receipt and verification

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

Canonical hash

6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59

Aliases

arxiv: 2605.01752 · arxiv_version: 2605.01752v2 · doi: 10.48550/arxiv.2605.01752 · pith_short_12: NU3GWIO7NA5L · pith_short_16: NU3GWIO7NA5LCVEO · pith_short_8: NU3GWIO7

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/NU3GWIO7NA5LCVEOX2NAYTWQTB \
  | 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: 6d366b21df683ab1548ebe9a0c4ed09876491163d43136670d66d9aab803fc59

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "678b254aa307c22f2f49a45d49015fe6aceccda3605d253d81ae9caf4e24b033",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-05-03T07:19:05Z",
    "title_canon_sha256": "b1ef50732ac4c9dbc12b51998f2b3ab1febc61d8fcb8a55cc84ba14bf02d1fa4"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.01752",
    "kind": "arxiv",
    "version": 2
  }
}