{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WGUKDO34CUSSUPAE4DZ7XNBXVZ","short_pith_number":"pith:WGUKDO34","canonical_record":{"source":{"id":"2501.11419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-20T11:36:45Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"1c253403aa154ec9acb8a5b2a1923873b69c042006899a8eac9c232750c7589f","abstract_canon_sha256":"53282e522a34c47333766fd05ccd787fe7381fc6994d43ba7134832d1d88193a"},"schema_version":"1.0"},"canonical_sha256":"b1a8a1bb7c15252a3c04e0f3fbb437ae4f708c0f25359b7f583732d36a889524","source":{"kind":"arxiv","id":"2501.11419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11419","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11419v1","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11419","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"WGUKDO34CUSS","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_16","alias_value":"WGUKDO34CUSSUPAE","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_8","alias_value":"WGUKDO34","created_at":"2026-07-05T10:03:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WGUKDO34CUSSUPAE4DZ7XNBXVZ","target":"record","payload":{"canonical_record":{"source":{"id":"2501.11419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-20T11:36:45Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"1c253403aa154ec9acb8a5b2a1923873b69c042006899a8eac9c232750c7589f","abstract_canon_sha256":"53282e522a34c47333766fd05ccd787fe7381fc6994d43ba7134832d1d88193a"},"schema_version":"1.0"},"canonical_sha256":"b1a8a1bb7c15252a3c04e0f3fbb437ae4f708c0f25359b7f583732d36a889524","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:08.405113Z","signature_b64":"YivpAD6Og2ojcgV7/wszfB2nRyfTWaE9Wb9bh9WlALjRQ3c0POdrq27voABZjHikBNIcYesvposO2dsqu1NhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1a8a1bb7c15252a3c04e0f3fbb437ae4f708c0f25359b7f583732d36a889524","last_reissued_at":"2026-07-05T10:03:08.404634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:08.404634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.11419","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-07-05T10:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUGD9AanvUS2Kd46Wtrp4ndFtQ8P/wGXSAfN7D/4fCFqUf09WmauxLfSvznYnXbRssF+0sBXPceJs0UXJ0lFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:04:01.560519Z"},"content_sha256":"8e2a8f80cdaef743c31b73b9cd564387c19bb637b456737f5e3a4529eb5954c8","schema_version":"1.0","event_id":"sha256:8e2a8f80cdaef743c31b73b9cd564387c19bb637b456737f5e3a4529eb5954c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WGUKDO34CUSSUPAE4DZ7XNBXVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DM","authors_text":"Padraig Corcoran, Rhyd Lewis","submitted_at":"2025-01-20T11:36:45Z","abstract_excerpt":"Payment Channel Networks (PCNs) are a method for improving the scaling and latency of cryptocurrency transactions. For a payment to be made between two peers in a PCN, a feasible low-fee path in the network must be planned. Many PCN path planning algorithms use a search algorithm that is a variant of Dijkstra's algorithm. In this article, we prove the correctness and computational complexity of this algorithm. Specifically, we show that, if the PCN satisfies a consistency property relating to the fees charged by payment channels, the algorithm is correct and has polynomial computational comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11419","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/2501.11419/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"},"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-07-05T10:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVKhWZdkBHy9oIRxsaWTKggGNAByNU75HByixi1LGlkv99LhLbtU0uurxHjtY+r5kcpT0Qqd28qDPs5+XXoSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:04:01.561124Z"},"content_sha256":"c37d0298e305cf2b2472b90135fb68380b5b249b03107348a9d33df3b218b7b9","schema_version":"1.0","event_id":"sha256:c37d0298e305cf2b2472b90135fb68380b5b249b03107348a9d33df3b218b7b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/bundle.json","state_url":"https://pith.science/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/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-08-16T17:04:01Z","links":{"resolver":"https://pith.science/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ","bundle":"https://pith.science/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/bundle.json","state":"https://pith.science/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGUKDO34CUSSUPAE4DZ7XNBXVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WGUKDO34CUSSUPAE4DZ7XNBXVZ","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":"53282e522a34c47333766fd05ccd787fe7381fc6994d43ba7134832d1d88193a","cross_cats_sorted":["cs.CE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-20T11:36:45Z","title_canon_sha256":"1c253403aa154ec9acb8a5b2a1923873b69c042006899a8eac9c232750c7589f"},"schema_version":"1.0","source":{"id":"2501.11419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11419","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11419v1","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11419","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"WGUKDO34CUSS","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_16","alias_value":"WGUKDO34CUSSUPAE","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_8","alias_value":"WGUKDO34","created_at":"2026-07-05T10:03:08Z"}],"graph_snapshots":[{"event_id":"sha256:c37d0298e305cf2b2472b90135fb68380b5b249b03107348a9d33df3b218b7b9","target":"graph","created_at":"2026-07-05T10:03:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.11419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Payment Channel Networks (PCNs) are a method for improving the scaling and latency of cryptocurrency transactions. For a payment to be made between two peers in a PCN, a feasible low-fee path in the network must be planned. Many PCN path planning algorithms use a search algorithm that is a variant of Dijkstra's algorithm. In this article, we prove the correctness and computational complexity of this algorithm. Specifically, we show that, if the PCN satisfies a consistency property relating to the fees charged by payment channels, the algorithm is correct and has polynomial computational comple","authors_text":"Padraig Corcoran, Rhyd Lewis","cross_cats":["cs.CE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11419","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:8e2a8f80cdaef743c31b73b9cd564387c19bb637b456737f5e3a4529eb5954c8","target":"record","created_at":"2026-07-05T10:03:08Z","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":"53282e522a34c47333766fd05ccd787fe7381fc6994d43ba7134832d1d88193a","cross_cats_sorted":["cs.CE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-01-20T11:36:45Z","title_canon_sha256":"1c253403aa154ec9acb8a5b2a1923873b69c042006899a8eac9c232750c7589f"},"schema_version":"1.0","source":{"id":"2501.11419","kind":"arxiv","version":1}},"canonical_sha256":"b1a8a1bb7c15252a3c04e0f3fbb437ae4f708c0f25359b7f583732d36a889524","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1a8a1bb7c15252a3c04e0f3fbb437ae4f708c0f25359b7f583732d36a889524","first_computed_at":"2026-07-05T10:03:08.404634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:08.404634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YivpAD6Og2ojcgV7/wszfB2nRyfTWaE9Wb9bh9WlALjRQ3c0POdrq27voABZjHikBNIcYesvposO2dsqu1NhCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:08.405113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e2a8f80cdaef743c31b73b9cd564387c19bb637b456737f5e3a4529eb5954c8","sha256:c37d0298e305cf2b2472b90135fb68380b5b249b03107348a9d33df3b218b7b9"],"state_sha256":"a8c9db354ef064f54c81a9077052710b25d77ab78440612138d98d4c07209278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZRcl86F64U1Za4Z+kfQxgYNMnn6OvcTz6/0X+AczZKNitaoud4W5K4iVIS1bueA6gCBGAwTnqlBMHdogHYeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:04:01.566453Z","bundle_sha256":"165749ff2b48bb5263a6a10c107cfcd0ca894aacfc43c1e90eb7b8727c3e1755"}}