{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UNC5RGEKSLSFCRBLBYX4AVOMYF","short_pith_number":"pith:UNC5RGEK","schema_version":"1.0","canonical_sha256":"a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502","source":{"kind":"arxiv","id":"2604.08205","version":2},"attestation_state":"computed","paper":{"title":"Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik Danelski, Julien Dallot, Maciej Pacut, Marcin Bienkowski, Stefan Schmid","submitted_at":"2026-04-09T13:06:38Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2604.08205","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-09T13:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"ce93d43557307288d94031e3ac20c98d2989a25c6560edcb630900ce86a2476b","abstract_canon_sha256":"9997a8c330d62e4d411c6ca9074b24e3d69f140b51702548ad8854d07c2ad899"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:10.761764Z","signature_b64":"Fu0Cwavdew8CFmqGAil+O0Hcq54KJfBQmf7Kuq4972eia/jfymrfmLeydO5TeTPSEvIqm0h6nyYfdtQXSepuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a345d8988a92e451442b0e2fc055ccc17b7c1e5d900b573fe3b7ec58ea50e502","last_reissued_at":"2026-05-20T00:03:10.760972Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:10.760972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik Danelski, Julien Dallot, Maciej Pacut, Marcin Bienkowski, Stefan Schmid","submitted_at":"2026-04-09T13:06:38Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b2511e6705be14b7e5cfe2f3e1240f99b9ed0a9071b5a11c598f21c1df8525c9"},"source":{"id":"2604.08205","kind":"arxiv","version":2},"verdict":{"id":"5ba67d13-a987-4d79-b948-6aa12b8a8438","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:52:37.056262Z","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.","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","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.","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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2604.08205","created_at":"2026-05-20T00:03:10.761107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.08205v2","created_at":"2026-05-20T00:03:10.761107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08205","created_at":"2026-05-20T00:03:10.761107+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNC5RGEKSLSF","created_at":"2026-05-20T00:03:10.761107+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNC5RGEKSLSFCRBL","created_at":"2026-05-20T00:03:10.761107+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNC5RGEK","created_at":"2026-05-20T00:03:10.761107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF","json":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF.json","graph_json":"https://pith.science/api/pith-number/UNC5RGEKSLSFCRBLBYX4AVOMYF/graph.json","events_json":"https://pith.science/api/pith-number/UNC5RGEKSLSFCRBLBYX4AVOMYF/events.json","paper":"https://pith.science/paper/UNC5RGEK"},"agent_actions":{"view_html":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF","download_json":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF.json","view_paper":"https://pith.science/paper/UNC5RGEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.08205&json=true","fetch_graph":"https://pith.science/api/pith-number/UNC5RGEKSLSFCRBLBYX4AVOMYF/graph.json","fetch_events":"https://pith.science/api/pith-number/UNC5RGEKSLSFCRBLBYX4AVOMYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF/action/storage_attestation","attest_author":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF/action/author_attestation","sign_citation":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF/action/citation_signature","submit_replication":"https://pith.science/pith/UNC5RGEKSLSFCRBLBYX4AVOMYF/action/replication_record"}},"created_at":"2026-05-20T00:03:10.761107+00:00","updated_at":"2026-05-20T00:03:10.761107+00:00"}