{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VRUBSEKE3FDYCDLS2REDDYL2OV","short_pith_number":"pith:VRUBSEKE","schema_version":"1.0","canonical_sha256":"ac68191144d947810d72d44831e17a75489524c5aa56ddbb356940e54dd93172","source":{"kind":"arxiv","id":"2311.06573","version":2},"attestation_state":"computed","paper":{"title":"A Generalized Space-Efficient Algorithm for Quantum Bit String Comparators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.LO","cs.SE"],"primary_cat":"quant-ph","authors_text":"Khuram Shahzad, Omar Usman Khan","submitted_at":"2023-11-11T14:01:35Z","abstract_excerpt":"Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in programming languages. Consequently, QBSCs play a crucial role in various algorithms that can be executed or adapted for quantum computers. The development of efficient and generalized comparators for any $n$-qubit length has long posed a challenge, as they have a high-cost footprint and lead to quantum delays. Comparators that are efficient are associated with"},"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":"2311.06573","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-11T14:01:35Z","cross_cats_sorted":["cs.ET","cs.LO","cs.SE"],"title_canon_sha256":"f6238ed14ce57598ce8590230d1e8ce2e25e4b6340dbcf2f53fd181e2a34db91","abstract_canon_sha256":"a8528e5685893bff995493cc95ce3f0bf97aee271a357fb15bc30ab5d1c982c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:37.707101Z","signature_b64":"Ie3bn08yxapSzqL9WpXDUYEVBVTMEBc28vPLrQ4GCRZVMWqsY1uFqq85OQ3SNNDv44ZUf3t+6Q98NdiAfkNSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac68191144d947810d72d44831e17a75489524c5aa56ddbb356940e54dd93172","last_reissued_at":"2026-07-05T07:15:37.706593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:37.706593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Space-Efficient Algorithm for Quantum Bit String Comparators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.LO","cs.SE"],"primary_cat":"quant-ph","authors_text":"Khuram Shahzad, Omar Usman Khan","submitted_at":"2023-11-11T14:01:35Z","abstract_excerpt":"Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in programming languages. Consequently, QBSCs play a crucial role in various algorithms that can be executed or adapted for quantum computers. The development of efficient and generalized comparators for any $n$-qubit length has long posed a challenge, as they have a high-cost footprint and lead to quantum delays. Comparators that are efficient are associated with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06573","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06573/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":"2311.06573","created_at":"2026-07-05T07:15:37.706642+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06573v2","created_at":"2026-07-05T07:15:37.706642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06573","created_at":"2026-07-05T07:15:37.706642+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRUBSEKE3FDY","created_at":"2026-07-05T07:15:37.706642+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRUBSEKE3FDYCDLS","created_at":"2026-07-05T07:15:37.706642+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRUBSEKE","created_at":"2026-07-05T07:15:37.706642+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/VRUBSEKE3FDYCDLS2REDDYL2OV","json":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV.json","graph_json":"https://pith.science/api/pith-number/VRUBSEKE3FDYCDLS2REDDYL2OV/graph.json","events_json":"https://pith.science/api/pith-number/VRUBSEKE3FDYCDLS2REDDYL2OV/events.json","paper":"https://pith.science/paper/VRUBSEKE"},"agent_actions":{"view_html":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV","download_json":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV.json","view_paper":"https://pith.science/paper/VRUBSEKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06573&json=true","fetch_graph":"https://pith.science/api/pith-number/VRUBSEKE3FDYCDLS2REDDYL2OV/graph.json","fetch_events":"https://pith.science/api/pith-number/VRUBSEKE3FDYCDLS2REDDYL2OV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV/action/storage_attestation","attest_author":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV/action/author_attestation","sign_citation":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV/action/citation_signature","submit_replication":"https://pith.science/pith/VRUBSEKE3FDYCDLS2REDDYL2OV/action/replication_record"}},"created_at":"2026-07-05T07:15:37.706642+00:00","updated_at":"2026-07-05T07:15:37.706642+00:00"}