{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UNC5RGEKSLSFCRBLBYX4AVOMYF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.08205","created_at":"2026-05-20T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"2604.08205v2","created_at":"2026-05-20T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08205","created_at":"2026-05-20T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"UNC5RGEKSLSF","created_at":"2026-05-20T00:03:10Z"},{"alias_kind":"pith_short_16","alias_value":"UNC5RGEKSLSFCRBL","created_at":"2026-05-20T00:03:10Z"},{"alias_kind":"pith_short_8","alias_value":"UNC5RGEK","created_at":"2026-05-20T00:03:10Z"}],"graph_snapshots":[{"event_id":"sha256:e31c8cab9ad8b7c711bdcb1c75fc2768b1f754c3482ca36f7ee5e9053f4c8f87","target":"graph","created_at":"2026-05-20T00:03:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"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."}],"snapshot_sha256":"b2511e6705be14b7e5cfe2f3e1240f99b9ed0a9071b5a11c598f21c1df8525c9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.08205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Payment channel networks (PCNs) are a promising approach to making cryptocurrency transactions faster and more scalable. At their core, PCNs bypass the blockchain by routing transactions through intermediary channels. However, a channel can forward a transaction only if it has the necessary funds: the problem of keeping the channels balanced is a current bottleneck for the PCN's transaction throughput. This paper considers the problem of maximizing the number of transactions accepted by a channel in a PCN. Previous works either considered the associated optimization problem with all transactio","authors_text":"Dominik Danelski, Julien Dallot, Maciej Pacut, Marcin Bienkowski, Stefan Schmid","cross_cats":[],"headline":"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-09T13:06:38Z","title":"Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.08205","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T17:52:37.056262Z","id":"5ba67d13-a987-4d79-b948-6aa12b8a8438","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"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.","strongest_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.","weakest_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."}},"verdict_id":"5ba67d13-a987-4d79-b948-6aa12b8a8438"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad2992f63eca548ea611aa7f74ff0ea6c57808f7ec9b50774efbf501fcb4d255","target":"record","created_at":"2026-05-20T00:03:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502","first_computed_at":"2026-05-20T00:03:10.760972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:10.760972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fu0Cwavdew8CFmqGAil+O0Hcq54KJfBQmf7Kuq4972eia/jfymrfmLeydO5TeTPSEvIqm0h6nyYfdtQXSepuDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:10.761764Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.08205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad2992f63eca548ea611aa7f74ff0ea6c57808f7ec9b50774efbf501fcb4d255","sha256:e31c8cab9ad8b7c711bdcb1c75fc2768b1f754c3482ca36f7ee5e9053f4c8f87"],"state_sha256":"7b9a07d4f943b7a3659c5c912487d6dacad5a425148bd680f26b8ce1b9a63348"}