{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HWOIHN7PQLIPCSL2VNWGAJJNFS","short_pith_number":"pith:HWOIHN7P","schema_version":"1.0","canonical_sha256":"3d9c83b7ef82d0f1497aab6c60252d2c906b9812184ea18272fa0d79af0c49d8","source":{"kind":"arxiv","id":"1902.05260","version":2},"attestation_state":"computed","paper":{"title":"Flash: Efficient Dynamic Routing for Offchain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hong Xu, Peng Wang, Tao Wang, Xin Jin","submitted_at":"2019-02-14T08:36:57Z","abstract_excerpt":"Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through a network of payment channels without the overhead of committing onchain transactions. Routing is critical to the performance of offchain networks. Existing solutions use either static routing with poor performance or dynamic routing with high overhead to obtain the dynamic channel balance information. In this paper, we propose Flash, a new dynamic routing solution that leverages the unique characteristics of transactions in offchain networks to strik"},"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":"1902.05260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-14T08:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"f25c28f21a04520eb101f27754b18dad2edd97ea3b58de6557d4b289b79f08c9","abstract_canon_sha256":"9e40b20eec4383a53dd5208c740feb097f6ea501956570414d8ff13e8f4cffc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:42.574738Z","signature_b64":"VaRtiOZiXE1YawXhvZgtPDLfT7mn/ZnUtLFnw8xPe439VCFXdUWsMr3uWQ84ZhikibIk+4vOnfYnHptRb720BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d9c83b7ef82d0f1497aab6c60252d2c906b9812184ea18272fa0d79af0c49d8","last_reissued_at":"2026-05-17T23:43:42.574069Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:42.574069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flash: Efficient Dynamic Routing for Offchain Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hong Xu, Peng Wang, Tao Wang, Xin Jin","submitted_at":"2019-02-14T08:36:57Z","abstract_excerpt":"Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through a network of payment channels without the overhead of committing onchain transactions. Routing is critical to the performance of offchain networks. Existing solutions use either static routing with poor performance or dynamic routing with high overhead to obtain the dynamic channel balance information. In this paper, we propose Flash, a new dynamic routing solution that leverages the unique characteristics of transactions in offchain networks to strik"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05260","kind":"arxiv","version":2},"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":"1902.05260","created_at":"2026-05-17T23:43:42.574164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05260v2","created_at":"2026-05-17T23:43:42.574164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05260","created_at":"2026-05-17T23:43:42.574164+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWOIHN7PQLIP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWOIHN7PQLIPCSL2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWOIHN7P","created_at":"2026-05-18T12:33:18.533446+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":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS","json":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS.json","graph_json":"https://pith.science/api/pith-number/HWOIHN7PQLIPCSL2VNWGAJJNFS/graph.json","events_json":"https://pith.science/api/pith-number/HWOIHN7PQLIPCSL2VNWGAJJNFS/events.json","paper":"https://pith.science/paper/HWOIHN7P"},"agent_actions":{"view_html":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS","download_json":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS.json","view_paper":"https://pith.science/paper/HWOIHN7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05260&json=true","fetch_graph":"https://pith.science/api/pith-number/HWOIHN7PQLIPCSL2VNWGAJJNFS/graph.json","fetch_events":"https://pith.science/api/pith-number/HWOIHN7PQLIPCSL2VNWGAJJNFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS/action/storage_attestation","attest_author":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS/action/author_attestation","sign_citation":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS/action/citation_signature","submit_replication":"https://pith.science/pith/HWOIHN7PQLIPCSL2VNWGAJJNFS/action/replication_record"}},"created_at":"2026-05-17T23:43:42.574164+00:00","updated_at":"2026-05-17T23:43:42.574164+00:00"}