{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2IEOJB7JCWDS2S77DWMN5XMOG2","short_pith_number":"pith:2IEOJB7J","schema_version":"1.0","canonical_sha256":"d208e487e915872d4bff1d98dedd8e36866ea8ec9f67ada1433624dc76b90cbe","source":{"kind":"arxiv","id":"1909.06890","version":1},"attestation_state":"computed","paper":{"title":"Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.NI"],"primary_cat":"cs.CR","authors_text":"Aviv Zohar, Saar Tochner, Stefan Schmid","submitted_at":"2019-09-15T21:34:59Z","abstract_excerpt":"Off-chain transaction networks can mitigate the scalability issues of today's trustless electronic cash systems such as Bitcoin. However, these peer-to-peer networks also introduce a new attack surface which is not well-understood today. This paper identifies and analyzes, a novel Denial-of-Service attack which is based on route hijacking, i.e., which exploits the way transactions are routed and executed along the created channels of the network. This attack is conceptually interesting as even a limited attacker that manipulates the topology through the creation of new channels can navigate tr"},"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":"1909.06890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-09-15T21:34:59Z","cross_cats_sorted":["cs.GT","cs.MA","cs.NI"],"title_canon_sha256":"197f10424d4ba6bc171a18778f03b13a21be26308830c696ea7bc5f144afb896","abstract_canon_sha256":"b205617b9767ba6134144b48afa769f970ffa6e7f6db6e0b8a5ad64e575bad1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:51.197447Z","signature_b64":"DHjd/ZXqLSn7rFEDWHXSnB0BL7inchjHqQY2Ud59ErckWPEK7RbxpjTsN3nL7MKDj1928gHl3qxkD32kFKkGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d208e487e915872d4bff1d98dedd8e36866ea8ec9f67ada1433624dc76b90cbe","last_reissued_at":"2026-07-05T00:04:51.197078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:51.197078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.NI"],"primary_cat":"cs.CR","authors_text":"Aviv Zohar, Saar Tochner, Stefan Schmid","submitted_at":"2019-09-15T21:34:59Z","abstract_excerpt":"Off-chain transaction networks can mitigate the scalability issues of today's trustless electronic cash systems such as Bitcoin. However, these peer-to-peer networks also introduce a new attack surface which is not well-understood today. This paper identifies and analyzes, a novel Denial-of-Service attack which is based on route hijacking, i.e., which exploits the way transactions are routed and executed along the created channels of the network. This attack is conceptually interesting as even a limited attacker that manipulates the topology through the creation of new channels can navigate tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06890","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/1909.06890/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":"1909.06890","created_at":"2026-07-05T00:04:51.197131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06890v1","created_at":"2026-07-05T00:04:51.197131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06890","created_at":"2026-07-05T00:04:51.197131+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IEOJB7JCWDS","created_at":"2026-07-05T00:04:51.197131+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IEOJB7JCWDS2S77","created_at":"2026-07-05T00:04:51.197131+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IEOJB7J","created_at":"2026-07-05T00:04:51.197131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11419","citing_title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2","json":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2.json","graph_json":"https://pith.science/api/pith-number/2IEOJB7JCWDS2S77DWMN5XMOG2/graph.json","events_json":"https://pith.science/api/pith-number/2IEOJB7JCWDS2S77DWMN5XMOG2/events.json","paper":"https://pith.science/paper/2IEOJB7J"},"agent_actions":{"view_html":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2","download_json":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2.json","view_paper":"https://pith.science/paper/2IEOJB7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06890&json=true","fetch_graph":"https://pith.science/api/pith-number/2IEOJB7JCWDS2S77DWMN5XMOG2/graph.json","fetch_events":"https://pith.science/api/pith-number/2IEOJB7JCWDS2S77DWMN5XMOG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2/action/storage_attestation","attest_author":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2/action/author_attestation","sign_citation":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2/action/citation_signature","submit_replication":"https://pith.science/pith/2IEOJB7JCWDS2S77DWMN5XMOG2/action/replication_record"}},"created_at":"2026-07-05T00:04:51.197131+00:00","updated_at":"2026-07-05T00:04:51.197131+00:00"}