{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6R6F2FRMGO7EGLANHBU3KRR6FN","short_pith_number":"pith:6R6F2FRM","schema_version":"1.0","canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","source":{"kind":"arxiv","id":"1708.02419","version":1},"attestation_state":"computed","paper":{"title":"Towards a Concurrent and Distributed Route Selection for Payment Channel Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.NI","authors_text":"Elias Rohrer, Florian Tschorsch, Jann-Frederik La{\\ss}","submitted_at":"2017-08-08T09:27:46Z","abstract_excerpt":"Payment channel networks use off-chain transactions to provide virtually arbitrary transaction rates. In this paper, we provide a new perspective on payment channels and consider them as a flow network. We propose an extended push-relabel algorithm to find payment flows in a payment channel network. Our algorithm enables a distributed and concurrent execution without violating capacity constraints. To this end, we introduce the concept of capacity locking. We prove that flows are valid and present first results."},"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":"1708.02419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-08T09:27:46Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"226aeace485d65c75f74432997b86ba4dc4ad3a13cd1d548d24f2ae064c1c856","abstract_canon_sha256":"577be1b73a79d8ca4adad4cbf2432ec4f4c0dca6c9b29429ad4b7fd488c92430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:22.363975Z","signature_b64":"8EekJcyygIPwaII2YJnrbazBueen0bwZ/624kTD9fVOyHqnuR9V8ALwfvb9/ydIGfBpVloSDLyi7+ojgDn/iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","last_reissued_at":"2026-05-18T00:34:22.363485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:22.363485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Concurrent and Distributed Route Selection for Payment Channel Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.NI","authors_text":"Elias Rohrer, Florian Tschorsch, Jann-Frederik La{\\ss}","submitted_at":"2017-08-08T09:27:46Z","abstract_excerpt":"Payment channel networks use off-chain transactions to provide virtually arbitrary transaction rates. In this paper, we provide a new perspective on payment channels and consider them as a flow network. We propose an extended push-relabel algorithm to find payment flows in a payment channel network. Our algorithm enables a distributed and concurrent execution without violating capacity constraints. To this end, we introduce the concept of capacity locking. We prove that flows are valid and present first results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02419","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1708.02419","created_at":"2026-05-18T00:34:22.363577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02419v1","created_at":"2026-05-18T00:34:22.363577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02419","created_at":"2026-05-18T00:34:22.363577+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R6F2FRMGO7E","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R6F2FRMGO7EGLAN","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R6F2FRM","created_at":"2026-05-18T12:31:03.183658+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/6R6F2FRMGO7EGLANHBU3KRR6FN","json":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN.json","graph_json":"https://pith.science/api/pith-number/6R6F2FRMGO7EGLANHBU3KRR6FN/graph.json","events_json":"https://pith.science/api/pith-number/6R6F2FRMGO7EGLANHBU3KRR6FN/events.json","paper":"https://pith.science/paper/6R6F2FRM"},"agent_actions":{"view_html":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN","download_json":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN.json","view_paper":"https://pith.science/paper/6R6F2FRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02419&json=true","fetch_graph":"https://pith.science/api/pith-number/6R6F2FRMGO7EGLANHBU3KRR6FN/graph.json","fetch_events":"https://pith.science/api/pith-number/6R6F2FRMGO7EGLANHBU3KRR6FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/action/storage_attestation","attest_author":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/action/author_attestation","sign_citation":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/action/citation_signature","submit_replication":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/action/replication_record"}},"created_at":"2026-05-18T00:34:22.363577+00:00","updated_at":"2026-05-18T00:34:22.363577+00:00"}