{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KZ52DWPWWPLO7SIOVPXSU2NPUF","short_pith_number":"pith:KZ52DWPW","schema_version":"1.0","canonical_sha256":"567ba1d9f6b3d6efc90eabef2a69afa15ad301e7fb38ce73a02eb7cb3ead8b1e","source":{"kind":"arxiv","id":"2209.15392","version":3},"attestation_state":"computed","paper":{"title":"Improving the Efficiency of Payments Systems Using Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","cs.ET","math.QA"],"primary_cat":"quant-ph","authors_text":"Ajit Desai, Christopher McMahon, Danica Marsden, Donald McGillivray, Francisco Rivadeneyra, Jean-Paul Lam, Thomas Lo, Vladimir Skavysh","submitted_at":"2022-09-19T11:13:04Z","abstract_excerpt":"High-value payment systems (HVPSs) are typically liquidity-intensive as the payment requests are indivisible and settled on a gross basis. Finding the right order in which payments should be processed to maximize the liquidity efficiency of these systems is an $NP$-hard combinatorial optimization problem, which quantum algorithms may be able to tackle at meaningful scales. We developed an algorithm and ran it on a hybrid quantum annealing solver to find an ordering of payments that reduced the amount of system liquidity necessary without substantially increasing payment delays. Despite the lim"},"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":"2209.15392","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-19T11:13:04Z","cross_cats_sorted":["cs.CE","cs.ET","math.QA"],"title_canon_sha256":"1edc6b04a62762111dfded407457c6a917d078ba1b752babe4761407991b5804","abstract_canon_sha256":"ec4d6d7ebdedc9e4acbc7e79324df5b69a9eaf58f761a2c48f6b70802e8fb35e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:18.650919Z","signature_b64":"I1H/hFc8o9l14KTFkjXP148O+fVKeEtPEVumCjlsIFXuBRC83V9qToFxGEQnmhPLh4Qqamg3YRYm3uzJHw+lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"567ba1d9f6b3d6efc90eabef2a69afa15ad301e7fb38ce73a02eb7cb3ead8b1e","last_reissued_at":"2026-07-05T05:33:18.650432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:18.650432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Efficiency of Payments Systems Using Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","cs.ET","math.QA"],"primary_cat":"quant-ph","authors_text":"Ajit Desai, Christopher McMahon, Danica Marsden, Donald McGillivray, Francisco Rivadeneyra, Jean-Paul Lam, Thomas Lo, Vladimir Skavysh","submitted_at":"2022-09-19T11:13:04Z","abstract_excerpt":"High-value payment systems (HVPSs) are typically liquidity-intensive as the payment requests are indivisible and settled on a gross basis. Finding the right order in which payments should be processed to maximize the liquidity efficiency of these systems is an $NP$-hard combinatorial optimization problem, which quantum algorithms may be able to tackle at meaningful scales. We developed an algorithm and ran it on a hybrid quantum annealing solver to find an ordering of payments that reduced the amount of system liquidity necessary without substantially increasing payment delays. Despite the lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15392","kind":"arxiv","version":3},"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/2209.15392/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":"2209.15392","created_at":"2026-07-05T05:33:18.650493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15392v3","created_at":"2026-07-05T05:33:18.650493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15392","created_at":"2026-07-05T05:33:18.650493+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ52DWPWWPLO","created_at":"2026-07-05T05:33:18.650493+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ52DWPWWPLO7SIO","created_at":"2026-07-05T05:33:18.650493+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ52DWPW","created_at":"2026-07-05T05:33:18.650493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF","json":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF.json","graph_json":"https://pith.science/api/pith-number/KZ52DWPWWPLO7SIOVPXSU2NPUF/graph.json","events_json":"https://pith.science/api/pith-number/KZ52DWPWWPLO7SIOVPXSU2NPUF/events.json","paper":"https://pith.science/paper/KZ52DWPW"},"agent_actions":{"view_html":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF","download_json":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF.json","view_paper":"https://pith.science/paper/KZ52DWPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15392&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ52DWPWWPLO7SIOVPXSU2NPUF/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ52DWPWWPLO7SIOVPXSU2NPUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF/action/storage_attestation","attest_author":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF/action/author_attestation","sign_citation":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF/action/citation_signature","submit_replication":"https://pith.science/pith/KZ52DWPWWPLO7SIOVPXSU2NPUF/action/replication_record"}},"created_at":"2026-07-05T05:33:18.650493+00:00","updated_at":"2026-07-05T05:33:18.650493+00:00"}