Pith Number

pith:L2T4ISZZ

pith:2024:L2T4ISZZZWUSDFTWWQOA7P7P7W

not attested not anchored not stored refs pending

Cost-Aware Distributed Online Learning with Strict Rejection Behavior against Adversarial Agents

Runqi Chai, Senchun Chai, Xudong Zhao, Yuanqing Xia, Yuhan Suo

A cost-aware framework with strict rejection of adversarial agents achieves practical stability and low evolution costs in distributed online learning.

arxiv:2412.01524 v6 · 2024-12-02 · cs.MA · cs.SI · math.OC

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{L2T4ISZZZWUSDFTWWQOA7P7P7W}

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

Based on these properties, closed-loop practical stability is rigorously established via a two-time-scale Lyapunov framework. Simulations demonstrate that the proposed method achieves robust and low-cost convergence under adversarial disturbances.

C2weakest assumption

The well-posedness and regularity of the associated periodic Riccati layer, which is invoked to ensure the outer-layer update ensures feasibility and controlled variation (paragraph on outer-layer update and Riccati layer). If this does not hold under the modeled adversarial interactions, the stability guarantee and feasibility claims would not follow.

C3one line summary

Proposes a cost-aware distributed online learning method with strict adversarial rejection, adaptive state-evolution rate adjustment formulated as constrained optimization, and proves practical stability via two-time-scale Lyapunov analysis, validated in simulations including satellite-assisted IoT.

Cited by

1 paper in Pith

Robust Set Partitioning Strategy for Malicious Information Detection in Large-Scale Internet of Things

Receipt and verification

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

Canonical hash

5ea7c44b39cda9219676b41c0fbfeffd9c55b4f446e895eb1a7b2929f434af2c

Aliases

arxiv: 2412.01524 · arxiv_version: 2412.01524v6 · doi: 10.48550/arxiv.2412.01524 · pith_short_12: L2T4ISZZZWUS · pith_short_16: L2T4ISZZZWUSDFTW · pith_short_8: L2T4ISZZ

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/L2T4ISZZZWUSDFTWWQOA7P7P7W \
  | 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: 5ea7c44b39cda9219676b41c0fbfeffd9c55b4f446e895eb1a7b2929f434af2c

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "ca1a4897c0d00d28d3abdfe5d8071319c58bbba1d62a5a5419ebc6926844d8d2",
    "cross_cats_sorted": [
      "cs.SI",
      "math.OC"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.MA",
    "submitted_at": "2024-12-02T14:16:25Z",
    "title_canon_sha256": "ea43ef5887dfe092269dd6b4cce4063c3ef51e87d08e6ccf97d26380ab59e5bd"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2412.01524",
    "kind": "arxiv",
    "version": 6
  }
}