{"as_of":"2026-08-16T18:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b0acce01613184c27b22f63152f39a041f8cc4482737cea9134bbb894cd3882","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:25:57.013349Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.11419/citation-record","integrity":"/paper/2501.11419/integrity","json":"/paper/2501.11419/citation-record.json","paper":"/paper/2501.11419"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.463644Z","title":"Bitcoin: A peer-to-peer electronic cash system.Decentralized business review, page 21260, 2008","venue":null,"work_id":"eed246f1-c230-4415-b211-710e84be2310","year":2008},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.874608Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:3f28a05b3df3dc3af60e0db4b32a0f82b7210c8a5d20562c02042ee220e95e79","observation_id":"3c354f37-5e14-4260-afae-60765c27a842","resolution":{"observed_at":"2026-08-10T18:25:57.467261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.453276Z","title":"A survey of distributed consensus protocols for blockchain networks.IEEE Communications Surveys & Tutorials, 22(2):1432– 1465, 2020","venue":null,"work_id":"b293e4bc-9b02-40bc-98e1-2468937c861c","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.878612Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:3355117705cc08cee8bfc9f2ce598a5ae67bcaad3a0f4786c231a8251e6d28ed","observation_id":"b3499ef5-0cc4-4950-916c-71dbec3dc389","resolution":{"observed_at":"2026-08-10T18:25:57.457094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.442348Z","title":"Scaling blockchains: A comprehensive survey.IEEE Access, 8:125244–125262, 2020","venue":null,"work_id":"756c3720-8616-4e06-b006-3223c7315164","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.882285Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:1b96884c6fb8277c00bde17fea5d0deac5f894f167996ff5104aaa68eccbd7b1","observation_id":"43cb10b5-eca6-4139-ad09-2a066f8729c8","resolution":{"observed_at":"2026-08-10T18:25:57.446124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.432318Z","title":"O’Reilly Media, Inc., 2021","venue":null,"work_id":"13426480-54c7-4f66-8e79-76e7e2f3147b","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.885898Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:c7ac9f63d231ae6c3d8120470f3f8859d2f9534f371e59cf83ac08d09c264cc8","observation_id":"05d95d67-bb86-42d8-8512-f67c71f29236","resolution":{"observed_at":"2026-08-10T18:25:57.435738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.422400Z","title":"Eltoo: A simple layer2 protocol for bitcoin","venue":null,"work_id":"182bb2f7-8894-4ea6-99d8-0976b4864112","year":2018},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.889640Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:491379d683610ecf06fc9e469e2e92fc3f5e7113d5f357be8fca7f76f9bcbe77","observation_id":"df626dcf-3f9d-4875-a67b-b4f31454a713","resolution":{"observed_at":"2026-08-10T18:25:57.425865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.412164Z","title":"A survey onblockchainscalability:Fromhardwaretolayer-twoprotocols","venue":null,"work_id":"1d7831b9-2a79-47bd-b2fa-edaf603d1251","year":2024},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.893334Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:d9114c899092a687a9f8146f9f45c3122ce3b201446b7e1b2a93642475624605","observation_id":"e22c7b24-78f6-4cb0-9ec8-3797e8fe6db8","resolution":{"observed_at":"2026-08-10T18:25:57.415684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.402079Z","title":"High throughput cryptocur- 22 An Analysis of the Correctness and Computational Complexity rency routing in payment channel networks","venue":null,"work_id":"908367de-d48b-4cd3-9010-13fa144c4a73","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.897503Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:5a31c8e147000ddbfce2f7d6685987237ef6c90e32fe010ed674166462baa707","observation_id":"4a4e9793-95ac-4aeb-9068-8977a2eba662","resolution":{"observed_at":"2026-08-10T18:25:57.405713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.391906Z","title":"Boomerang: Redundancy improves latency and throughput in payment-channel networks","venue":null,"work_id":"63feb77e-cba9-40b5-a787-f3ccaed4dbfb","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.901024Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:b1c686ee256f14d6b1c9e3897d6fcd000753cc9251e66947706396bd05e9337f","observation_id":"12f80c5e-ab8f-469c-a8d3-299487e6fac5","resolution":{"observed_at":"2026-08-10T18:25:57.395611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.05322","last_updated":"2021-07-12T11:19:31Z","snapshot_observed_at":"2026-08-11T02:04:58.834250Z","submitted_at":"2021-07-12T11:19:31Z","title":"Optimally Reliable & Cheap Payment Flows on the Lightning Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.05322","snapshot_observed_at":"2026-08-10T18:25:56.904261Z","title":"Optimally reliable & cheap payment flows on the lightning network","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.904261Z"},"links":{"cited_paper":"/paper/2107.05322","citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:ae1f96ed8d3d57275dce38f7aa0846d55a3379f287c05869a88b555442b5fde0","observation_id":"5c4c9b01-ba18-479a-a2a7-ccaf9c827342","resolution":{"observed_at":"2026-08-10T18:25:56.904261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.05748","last_updated":"2017-12-13T23:44:37Z","snapshot_observed_at":"2026-08-14T20:32:20.988448Z","submitted_at":"2017-09-18T02:30:18Z","title":"Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.05748","snapshot_observed_at":"2026-08-10T18:25:56.907982Z","title":"Settling payments fast and private: Efficient decentralized routing for path-based transactions.arXiv preprint arXiv:1709.05748, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.907982Z"},"links":{"cited_paper":"/paper/1709.05748","citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:70b97e5a871e33fce7b8a45dc0994bfd2b9d1c03485984baa8a4521e4cf40ce2","observation_id":"3f3c2645-bd16-4ed4-9a33-f2b358dd093c","resolution":{"observed_at":"2026-08-10T18:25:56.907982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.381900Z","title":"Flare: An approach to routing in lightning network.White Paper, 144, 2016","venue":null,"work_id":"32de83fb-8be7-42c6-b3ad-d8d291f4201e","year":2016},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.911655Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:ac25a476772ac7779562d50e0e650ae9a6c6a97c9f08f176669750a49b87784d","observation_id":"08146718-f63e-482b-9a7c-41f3292f02c6","resolution":{"observed_at":"2026-08-10T18:25:57.385650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.371269Z","title":"Rapido: Scaling blockchain with multi-path payment channels.Neurocomputing, 406:322–332, 2020","venue":null,"work_id":"6aa7e94d-6edf-4abb-9a89-83d11e258a65","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.915119Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:b053717b79dd440e0d74a89b6ae3373e2c57c94375cd24f3727c02d59b56b55e","observation_id":"5f5ec7a2-3dcd-4085-aa41-fa0a7d29bb85","resolution":{"observed_at":"2026-08-10T18:25:57.375220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.360886Z","title":"InIEEE International Conference on Blockchain and Cryptocurrency, pages 1–5, 2020","venue":null,"work_id":"b28986f6-33f3-4181-856c-7c62dd2de449","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.918595Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:5d66e695cad188e02aa9e06292eb1dfe7abc143e5370a99b23b49afe350d5512","observation_id":"dfdd78b3-b05e-4de0-acea-25178a4cc186","resolution":{"observed_at":"2026-08-10T18:25:57.364684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.350534Z","title":"Privacy-utility tradeoffs in routing cryptocurrency over payment channel networks.Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4(2):1–39, 2020","venue":null,"work_id":"dd069865-a8ac-4b8c-a1e6-a1105ff83239","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.921710Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:1b165c10c47fe5655a890ef9c9b62ad36232d17b9de4c463eeabdc51393eddb7","observation_id":"5f3aaac7-7e97-4ee3-b9c4-ea359f1b1849","resolution":{"observed_at":"2026-08-10T18:25:57.354279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.340381Z","title":"Twilight: A differentially private payment channel network","venue":null,"work_id":"8dd7f85d-aa32-42f6-8ab5-b59c98ebe4c2","year":2022},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.925302Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:a479b0a0f776d653f1699832390e0460ba0039f43063d29042dfcd52866e05aa","observation_id":"fe0ae3eb-938d-4ecb-8c7a-48dff8962a0f","resolution":{"observed_at":"2026-08-10T18:25:57.344077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.329738Z","title":"Routing payments onthelightningnetwork","venue":null,"work_id":"231cdd24-dac5-4778-b6ac-a887ca56cbee","year":2018},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.928733Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:2e9c66cbe0c6492a0ab7bf9cf66223ce3a3051da4a64e57195d80e697febf793","observation_id":"92c58035-749e-44ad-bd91-ef9c3972e81d","resolution":{"observed_at":"2026-08-10T18:25:57.333266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.319742Z","title":"How to profit from payments channels","venue":null,"work_id":"4fbcfc6a-a896-4223-841b-5529df949c72","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.932011Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:39a197e77bd92427c784c3e5f35628c7ec3f6465024e86d6a0c43b9f7ecd4396","observation_id":"08084f0b-a8f9-4416-b339-c5f4c6371ae3","resolution":{"observed_at":"2026-08-10T18:25:57.323271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.309651Z","title":"The merchant: Avoiding payment channel depletion through incentives","venue":null,"work_id":"3e63ab6c-596d-4a6e-ab1d-229434be2589","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.935446Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:2f5237f2a03f3a01f4d90aaf816db485e6d787064dabb539c94406eb12edf499","observation_id":"1d39324e-5f40-40d5-b910-944cf5b527a2","resolution":{"observed_at":"2026-08-10T18:25:57.313476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06890","last_updated":"2019-09-15T21:34:59Z","snapshot_observed_at":"2026-07-06T08:21:53.714643Z","submitted_at":"2019-09-15T21:34:59Z","title":"Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff","version":1},"cited_work":{"arxiv_id":"1909.06890","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.06890","snapshot_observed_at":"2026-08-10T18:25:57.043143Z","title":"Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff","venue":"cs.CR","work_id":"265f5ca4-35c9-4d24-b1ac-145547282906","year":2019},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.938711Z"},"links":{"cited_paper":"/paper/1909.06890","citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:b435d8eb79fe7d132ce000ab543927a9b3198a6a39578ac1543cba25fe1930d6","observation_id":"d1ee445b-3fbd-42e0-9bcb-c4352d599b0b","resolution":{"observed_at":"2026-08-10T18:25:57.049581Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.300154Z","title":"The evolving topology of the lightning network: Central- ization, efficiency, robustness, synchronization, and anonymity.PlOS ONE, 15(1):e0225966, 2020","venue":null,"work_id":"ae2d2a0f-86b0-4d5e-bf18-c358934ea761","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.942452Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:72ba244a12580b2e08645273ac8501a248ce36757ce20daedcad299909f57921","observation_id":"14838a50-81c4-4ad2-ba68-4a93f14ee0ee","resolution":{"observed_at":"2026-08-10T18:25:57.303757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.290321Z","title":"Topological analysis of bitcoin’s lightning network","venue":null,"work_id":"d11f5348-5595-410a-918b-e9babb832371","year":2020},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.946082Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:a51b42b517a7ac5d2d3217773bf4e8509b631110051eb3f8f0d5bea1d6a1a8d5","observation_id":"04ea7e0f-94a5-40c6-b1b8-f709196e4a08","resolution":{"observed_at":"2026-08-10T18:25:57.293811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.280007Z","title":"Dischargedpaymentchannels:Quantifying the lightning network’s resilience to topology-based attacks","venue":null,"work_id":"f320abaf-fa93-404e-a5ca-e70f5168dad7","year":2019},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.949500Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:e08acfc93d8afe896154258b7620e2a945ff8c09b0e9f79352f755c8f3ff7c18","observation_id":"02947c4e-4761-415e-8303-0a21616fde88","resolution":{"observed_at":"2026-08-10T18:25:57.283646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.269876Z","title":"A centrality analysis of the lightning network.Telecommunications Policy, 48(2):102696, 2024","venue":null,"work_id":"74bd5df2-b35d-42b8-8b13-85a6df0a0c16","year":2024},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.952933Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:ea9229c2a2f3e130a802718bbbe4221a339396310d7ac4eead40c3ff1bb630a7","observation_id":"a5e708bc-55ca-4a55-b354-379d5a3a6dbb","resolution":{"observed_at":"2026-08-10T18:25:57.273474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.259641Z","title":"Braess paradox in layer-2 blockchain payment networks","venue":null,"work_id":"4c871fe9-c60e-45ac-828d-a0d54a2a8fe6","year":2023},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.956260Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:89c4b434726ca032925d06c093946f62d9d118c2c429f1b2bc02e3c1e8d81c59","observation_id":"2b519ba6-2cb0-4d68-b335-5ea682487471","resolution":{"observed_at":"2026-08-10T18:25:57.263162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.249935Z","title":"CRC Press, 2002","venue":null,"work_id":"95b44f7c-c329-47e8-8ab0-92e5a8e9fbd3","year":2002},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.959734Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:862f102e192c2710a0cc31b9f1651c551cdf83599b7ac466083bed5bcc36af64","observation_id":"ec3a3a1e-109f-41a8-b572-55a4b5a8d54b","resolution":{"observed_at":"2026-08-10T18:25:57.253249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.240224Z","title":"How lightning’s routing diminishes its anonymity","venue":null,"work_id":"f7614814-4dc0-4f88-9e8b-d9881cfcb217","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.962921Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:82e7a52d9347b95f927fb253863bcb555a5cca0ac0a21d949b84c0cb85278565","observation_id":"c5aac677-c479-44b0-804e-13b8953128b7","resolution":{"observed_at":"2026-08-10T18:25:57.243799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.229777Z","title":"Comparing lightning routing protocols to routing protocols with splitting","venue":null,"work_id":"893eedfd-fa6f-4422-89e4-7eb8fad26f42","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.966366Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:9b41a9a8f53fd51256a2c2df755df2b8843a1240168e46a593e384f80ba10017","observation_id":"5b9fd61d-6574-43c4-80dd-90418e4b6709","resolution":{"observed_at":"2026-08-10T18:25:57.233777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.219719Z","title":"Springer, 2019","venue":null,"work_id":"cd884010-906b-4b3f-967f-8603d34df628","year":2019},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.970020Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:fdb0acd6aecada57a7ff84ecf50974b24adf7d288dbc503cf39001a4808a439f","observation_id":"485966ee-37df-4d2c-9c9a-14dce3a40ec5","resolution":{"observed_at":"2026-08-10T18:25:57.223196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.209501Z","title":"Fastest paths in time-dependent networks for intelligent vehicle-highway systems application.Journal of Intelligent Transportation Systems, 1(1):1–11, 1993","venue":null,"work_id":"e1ad3028-1cf4-4f82-8791-a101f33b100c","year":1993},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.973648Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:865cfff620e687c831b60227b748a319f61600b206ac456e61b4f8a8e06f13bc","observation_id":"5e08c051-a16b-4ed8-839b-2a4afad64f7b","resolution":{"observed_at":"2026-08-10T18:25:57.213281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.199045Z","title":"Nonlinear equations.Numerical Optimization, pages 270–302, 2006","venue":null,"work_id":"5e41d7b9-7ea1-48db-ae29-199b58182209","year":2006},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.977123Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:847b097031762a0122a3f7cf71251e3a077e7d7b044d23c1a4fb5cc3a2462ab4","observation_id":"4adb5bc9-d0eb-463d-bf34-e6656b4365e6","resolution":{"observed_at":"2026-08-10T18:25:57.202773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.188941Z","title":"Time-dependent routing prob- lems: A review.Computers & operations research, 64:189–197, 2015","venue":null,"work_id":"97984a67-78b3-4d03-b218-60f3c6c05351","year":2015},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.980290Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:99631f9cc8197e315339b8b1824368899dcf16d9a3af60ecba5fa3465ca869cb","observation_id":"9514fb9a-0f39-40cb-90c8-a53cc258706d","resolution":{"observed_at":"2026-08-10T18:25:57.192438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.178109Z","title":"Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length.Journal of the ACM, 37(3):607–625, 1990","venue":null,"work_id":"48d017ee-d660-44e4-b250-bb29b7145782","year":1990},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.983565Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:c880f2c4b098c9d6f1815cbba3a9e3615694f15b9bb53fb2e4004f16d3a80ae1","observation_id":"976d27f1-c46a-46d4-983a-1cb662ee1d96","resolution":{"observed_at":"2026-08-10T18:25:57.181978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.167212Z","title":"NP-hardness of shortest path problems in networks with non-fifo time-dependent travel times.Information Processing Letters, 179:106287, 2023","venue":null,"work_id":"ca2069de-a4e3-485c-8063-24f9198f9685","year":2023},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.986752Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:9ca82f5d6cab76c597e3aa10ec9201e574b4efd99f984e407635a3008d13efd1","observation_id":"dec79acd-6483-4fff-8d46-b70e563fc49a","resolution":{"observed_at":"2026-08-10T18:25:57.171006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.156876Z","title":"ArtificialIntelligence:amodernapproach","venue":null,"work_id":"27e0a54d-16b9-4209-8371-9eb5ab467209","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.989818Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:ad6a7c9a34fec1a7284171fb82297773a82f2bf0c23e894154dbb4c99e3c6d48","observation_id":"724e91d6-6ba0-46be-94dd-2f8a2280f679","resolution":{"observed_at":"2026-08-10T18:25:57.160329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.146383Z","title":"Route planning in transportation networks","venue":null,"work_id":"1bc21838-6b5f-4993-92c5-55a0947c7bbf","year":2016},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.992952Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:f4cb5fa2974e9744dd0643a1b326b2782618519c8f95dea7434c57d9b51ea3bd","observation_id":"efa95dc7-0cc0-437b-87ff-56002387c5bb","resolution":{"observed_at":"2026-08-10T18:25:57.150353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.135394Z","title":"Research report: The lightning network grew by 1212% in 2 years, why it’s important to pay attention","venue":null,"work_id":"4992109d-3723-4860-a204-c25666704031","year":2023},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.996017Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:502498bf359fe63f8f3310b75eb765720a9ab9a2e29d06208907d0f38bad3bb8","observation_id":"916cb471-9ece-4f0a-bf5c-9481994401ad","resolution":{"observed_at":"2026-08-10T18:25:57.139478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.124229Z","title":"Survey on blockchain networking: Context, state-of-the-art, challenges.ACM Computing Surveys, 54(5):1–34, 2021","venue":null,"work_id":"0096abac-2183-4a0c-860b-0c45b16a6cdf","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:56.999466Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:3f8f64914aa25c7d2334a133f28e1fa57a5aa1ea16141d00a4d6353acf5c340e","observation_id":"4c8e44be-e49b-4864-8279-57bf93941d0e","resolution":{"observed_at":"2026-08-10T18:25:57.128026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.112856Z","title":"Unjamming lightning: A systematic approach.Cryp- tology ePrint Archive, 2022","venue":null,"work_id":"9cd0aee9-7dc7-4857-9e6d-8ed71468664e","year":2022},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:57.002863Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:f76760944ee7083255cbf1a3f10ff5e651326e8c5e818e8971597d0486b173c7","observation_id":"e3f0cf25-8598-4e64-9596-b59d9c9d276d","resolution":{"observed_at":"2026-08-10T18:25:57.116802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.101396Z","title":"Strategic analysis of griefing attack in lightning network.IEEE Transactions on Network and Service Management, 2022","venue":null,"work_id":"5682dfd1-a3c5-41f0-9144-5e5545b8ff72","year":2022},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:57.006634Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:406cd74b0ef6a204c8ecd53a980a597917d114cb16a216a7d878c04953f822fc","observation_id":"0cf7a683-13af-4f0f-891e-a0c0348dd29c","resolution":{"observed_at":"2026-08-10T18:25:57.105423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.090359Z","title":"Anempiricalanalysisofprivacyinthelightningnetwork","venue":null,"work_id":"044a7ed5-7a6f-428e-93a0-220704bc26fb","year":2021},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:57.009887Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:fdeeb24a85353f9a0b35bab80cbde4485c401738bf212ed1eda9cb6ad7972ef7","observation_id":"1e4fb0ae-195c-463b-bbe8-1f8ebc8d1ae7","resolution":{"observed_at":"2026-08-10T18:25:57.093989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:25:57.079308Z","title":"a [ \" , n +1 ,","venue":null,"work_id":"6444e60b-a2a9-49f1-9340-bf9e7b1a193d","year":2023},"citing_paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T18:25:57.013349Z"},"links":{"citing_paper":"/paper/2501.11419"},"observation_digest":"sha256:2997a814e61ce394fc53c1aef10907ec7deb113bb080712ab86840e25200dc91","observation_id":"1b43eaae-bf62-49da-9f64-885a6e9e42cf","resolution":{"observed_at":"2026-08-10T18:25:57.082843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11419","last_updated":"2025-01-20T11:36:45Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-13T17:42:28.854622Z","submitted_at":"2025-01-20T11:36:45Z","title":"An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2501.11419."}