{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6R6F2FRMGO7EGLANHBU3KRR6FN","short_pith_number":"pith:6R6F2FRM","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"},"canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","source":{"kind":"arxiv","id":"1708.02419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02419","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02419v1","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02419","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"6R6F2FRMGO7E","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6R6F2FRMGO7EGLAN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6R6F2FRM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6R6F2FRMGO7EGLANHBU3KRR6FN","target":"record","payload":{"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"},"canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","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"},"source_kind":"arxiv","source_id":"1708.02419","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYCIPFo8JAAAA4tZmgSISS+c79HW4CSVFgV2tOkOADfxSSQeKgbFduflTTFTgKrdo/MIhbagJRKBrvKJl+GIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:50:55.817139Z"},"content_sha256":"dab387aa3b058896355ecbd23291d3ac11cf7896b214f1b5224d1081eb35b423","schema_version":"1.0","event_id":"sha256:dab387aa3b058896355ecbd23291d3ac11cf7896b214f1b5224d1081eb35b423"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6R6F2FRMGO7EGLANHBU3KRR6FN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRnpI48ilExF1E5BDYWWQg0FL9Wyep9Q/Lilf+4BV7kBu2pHqJSKQZrJgrzsLzjSVYgvjpBU0nQKAt1j7b7DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:50:55.817764Z"},"content_sha256":"360855464cccbf3c5d5786155b80b06d152875891a9442bc3434578b558c29ae","schema_version":"1.0","event_id":"sha256:360855464cccbf3c5d5786155b80b06d152875891a9442bc3434578b558c29ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/bundle.json","state_url":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T04:50:55Z","links":{"resolver":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN","bundle":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/bundle.json","state":"https://pith.science/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6R6F2FRMGO7EGLANHBU3KRR6FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6R6F2FRMGO7EGLANHBU3KRR6FN","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":"577be1b73a79d8ca4adad4cbf2432ec4f4c0dca6c9b29429ad4b7fd488c92430","cross_cats_sorted":["cs.CR","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-08T09:27:46Z","title_canon_sha256":"226aeace485d65c75f74432997b86ba4dc4ad3a13cd1d548d24f2ae064c1c856"},"schema_version":"1.0","source":{"id":"1708.02419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02419","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02419v1","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02419","created_at":"2026-05-18T00:34:22Z"},{"alias_kind":"pith_short_12","alias_value":"6R6F2FRMGO7E","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6R6F2FRMGO7EGLAN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6R6F2FRM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:360855464cccbf3c5d5786155b80b06d152875891a9442bc3434578b558c29ae","target":"graph","created_at":"2026-05-18T00:34:22Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Elias Rohrer, Florian Tschorsch, Jann-Frederik La{\\ss}","cross_cats":["cs.CR","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-08T09:27:46Z","title":"Towards a Concurrent and Distributed Route Selection for Payment Channel Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02419","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dab387aa3b058896355ecbd23291d3ac11cf7896b214f1b5224d1081eb35b423","target":"record","created_at":"2026-05-18T00:34:22Z","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":"577be1b73a79d8ca4adad4cbf2432ec4f4c0dca6c9b29429ad4b7fd488c92430","cross_cats_sorted":["cs.CR","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-08T09:27:46Z","title_canon_sha256":"226aeace485d65c75f74432997b86ba4dc4ad3a13cd1d548d24f2ae064c1c856"},"schema_version":"1.0","source":{"id":"1708.02419","kind":"arxiv","version":1}},"canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f47c5d162c33be432c0d3869b5463e2b6001aefd9ec9ba0e5f6a0bf07006844c","first_computed_at":"2026-05-18T00:34:22.363485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:22.363485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8EekJcyygIPwaII2YJnrbazBueen0bwZ/624kTD9fVOyHqnuR9V8ALwfvb9/ydIGfBpVloSDLyi7+ojgDn/iAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:22.363975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dab387aa3b058896355ecbd23291d3ac11cf7896b214f1b5224d1081eb35b423","sha256:360855464cccbf3c5d5786155b80b06d152875891a9442bc3434578b558c29ae"],"state_sha256":"56d6e3dd8e06fe23b9b9266b84b2df45ca55c3f42b4b1d83220d13af24cb9416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCmk19g0bQHDlVLdGXglfoTKHYSeBHfbqVhwb/JFVhbeII2lHXd319x2B12CNje/Pn1v8J5+cvhTOvgeJXnXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:50:55.821779Z","bundle_sha256":"1b911e509313c9a60e0a4403aacb9e743b63bff17d4c2512956a709254ea7ef4"}}