{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HVVX6SR54KY3VX5ATDDDTOQ575","short_pith_number":"pith:HVVX6SR5","schema_version":"1.0","canonical_sha256":"3d6b7f4a3de2b1badfa098c639ba1dff464a3c46abb5babfd017d6f726555f52","source":{"kind":"arxiv","id":"2107.05322","version":1},"attestation_state":"computed","paper":{"title":"Optimally Reliable & Cheap Payment Flows on the Lightning Network","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Rene Pickhardt, Stefan Richter","submitted_at":"2021-07-12T11:19:31Z","abstract_excerpt":"Today, payment paths in Bitcoin's Lightning Network are found by searching for shortest paths on the fee graph. We enhance this approach in two dimensions. Firstly, we take into account the probability of a payment actually being possible due to the unknown balance distributions in the channels. Secondly, we use minimum cost flows as a proper generalization of shortest paths to multi-part payments (MPP). In particular we show that under plausible assumptions about the balance distributions we can find the most likely MPP for any given set of senders, recipients and amounts by solving for a (ge"},"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":"2107.05322","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2021-07-12T11:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"c3abfc3aecb5341261343d169d9a4db31b5c87942950817e4a9851a93e983b2e","abstract_canon_sha256":"1f8b670d59505d14f27963a0bc2708b9537498c1e21939c2d07a56f9c83c38ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:01.589486Z","signature_b64":"0kXLoU6Ue2xlEqKZWXtVC0iA8j7wQbA4TCCLwyxV/ImAvhvmbMbOnFTK0q77rn62d0TRw/Ry/F1g36BFHewJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d6b7f4a3de2b1badfa098c639ba1dff464a3c46abb5babfd017d6f726555f52","last_reissued_at":"2026-07-05T02:57:01.589071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:01.589071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Reliable & Cheap Payment Flows on the Lightning Network","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Rene Pickhardt, Stefan Richter","submitted_at":"2021-07-12T11:19:31Z","abstract_excerpt":"Today, payment paths in Bitcoin's Lightning Network are found by searching for shortest paths on the fee graph. We enhance this approach in two dimensions. Firstly, we take into account the probability of a payment actually being possible due to the unknown balance distributions in the channels. Secondly, we use minimum cost flows as a proper generalization of shortest paths to multi-part payments (MPP). In particular we show that under plausible assumptions about the balance distributions we can find the most likely MPP for any given set of senders, recipients and amounts by solving for a (ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.05322","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.05322/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":"2107.05322","created_at":"2026-07-05T02:57:01.589129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.05322v1","created_at":"2026-07-05T02:57:01.589129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.05322","created_at":"2026-07-05T02:57:01.589129+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVVX6SR54KY3","created_at":"2026-07-05T02:57:01.589129+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVVX6SR54KY3VX5A","created_at":"2026-07-05T02:57:01.589129+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVVX6SR5","created_at":"2026-07-05T02:57:01.589129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08703","citing_title":"MPFlow: Learning Budgeted Max-Flow Optimization on the Lightning Network with Deep Graph Reinforcement Learning","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575","json":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575.json","graph_json":"https://pith.science/api/pith-number/HVVX6SR54KY3VX5ATDDDTOQ575/graph.json","events_json":"https://pith.science/api/pith-number/HVVX6SR54KY3VX5ATDDDTOQ575/events.json","paper":"https://pith.science/paper/HVVX6SR5"},"agent_actions":{"view_html":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575","download_json":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575.json","view_paper":"https://pith.science/paper/HVVX6SR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.05322&json=true","fetch_graph":"https://pith.science/api/pith-number/HVVX6SR54KY3VX5ATDDDTOQ575/graph.json","fetch_events":"https://pith.science/api/pith-number/HVVX6SR54KY3VX5ATDDDTOQ575/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575/action/storage_attestation","attest_author":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575/action/author_attestation","sign_citation":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575/action/citation_signature","submit_replication":"https://pith.science/pith/HVVX6SR54KY3VX5ATDDDTOQ575/action/replication_record"}},"created_at":"2026-07-05T02:57:01.589129+00:00","updated_at":"2026-07-05T02:57:01.589129+00:00"}