Pith Number

pith:UNC5RGEK

pith:2026:UNC5RGEKSLSFCRBLBYX4AVOMYF

not attested not anchored not stored refs pending

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items

Dominik Danelski, Julien Dallot, Maciej Pacut, Marcin Bienkowski, Stefan Schmid

A deterministic online algorithm achieves O(log B)-competitive transaction admission in payment channels by modeling the problem as an online knapsack variant with positive and negative items.

arxiv:2604.08205 v2 · 2026-04-09 · cs.DS

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{UNC5RGEKSLSFCRBLBYX4AVOMYF}

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

The main contribution of this paper is a deterministic online algorithm that is O(log B)-competitive, where B is the knapsack capacity (initially allocated funds). We complement this result with an asymptotically matching lower bound of Ω(log B) which holds for any randomized algorithm, demonstrating our algorithm's optimality.

C2weakest assumption

That the transaction-admission problem in a PCN channel can be exactly captured by the online knapsack model with positive and negative items, without extra constraints from the wider network topology or multi-hop routing.

C3one line summary

A deterministic O(log B)-competitive algorithm for the online knapsack problem with positive and negative items, with a matching Ω(log B) lower bound for any algorithm, applied to transaction admission in payment channel networks.

Receipt and verification

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

Canonical hash

a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502

Aliases

arxiv: 2604.08205 · arxiv_version: 2604.08205v2 · doi: 10.48550/arxiv.2604.08205 · pith_short_12: UNC5RGEKSLSF · pith_short_16: UNC5RGEKSLSFCRBL · pith_short_8: UNC5RGEK

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/UNC5RGEKSLSFCRBLBYX4AVOMYF \
  | 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: a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "9997a8c330d62e4d411c6ca9074b24e3d69f140b51702548ad8854d07c2ad899",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-04-09T13:06:38Z",
    "title_canon_sha256": "ce93d43557307288d94031e3ac20c98d2989a25c6560edcb630900ce86a2476b"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.08205",
    "kind": "arxiv",
    "version": 2
  }
}