{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JW6ME47J2DFOYCJB6FLECLBUTE","short_pith_number":"pith:JW6ME47J","schema_version":"1.0","canonical_sha256":"4dbcc273e9d0caec0921f156412c3499278a2fcc0e988a7f7d877110b9b10131","source":{"kind":"arxiv","id":"2608.09134","version":1},"attestation_state":"computed","paper":{"title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aliya Khadieva, Kamil Khadiev, Kamil Khasanov, Mansur Ziatdinov, Vadim Sagitov","submitted_at":"2026-08-10T05:26:52Z","abstract_excerpt":"One of the obstacles to the widespread adoption of quantum computing is the problem of efficient circuit synthesis. Current quantum hardware has limited connections between qubits, with each qubit connected to only a few others. This means that the circuit has to be transformed to accommodate this. In this paper, we present an algorithm that converts a circuit containing a sequence of CNOT gates into a form that is suitable for arbitrary quantum computer architectures. Although we demonstrate the algorithm only in the context of quantum fingerprinting, similar gate sequences are prevalent in q"},"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":"2608.09134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-10T05:26:52Z","cross_cats_sorted":[],"title_canon_sha256":"309e6feccdf3ab3eb4f5b5818f73825702a95b8f2eedb9bdd58880e92f79f945","abstract_canon_sha256":"41ccb2921788c3c92955c7aa7c00810559c98834610f4b14f69f82cfa5a280c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:21:52.843023Z","signature_b64":"sczftq9c0jsywdmTMRYdnXqaaT8eorKIkr1usOJjlTY71qajPYf9p7E2TpqxHUUitmfW/LA67mScw901MqUXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dbcc273e9d0caec0921f156412c3499278a2fcc0e988a7f7d877110b9b10131","last_reissued_at":"2026-08-11T02:21:52.841351Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:21:52.841351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aliya Khadieva, Kamil Khadiev, Kamil Khasanov, Mansur Ziatdinov, Vadim Sagitov","submitted_at":"2026-08-10T05:26:52Z","abstract_excerpt":"One of the obstacles to the widespread adoption of quantum computing is the problem of efficient circuit synthesis. Current quantum hardware has limited connections between qubits, with each qubit connected to only a few others. This means that the circuit has to be transformed to accommodate this. In this paper, we present an algorithm that converts a circuit containing a sequence of CNOT gates into a form that is suitable for arbitrary quantum computer architectures. Although we demonstrate the algorithm only in the context of quantum fingerprinting, similar gate sequences are prevalent in q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09134","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/2608.09134/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":"2608.09134","created_at":"2026-08-11T02:21:52.842064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09134v1","created_at":"2026-08-11T02:21:52.842064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09134","created_at":"2026-08-11T02:21:52.842064+00:00"},{"alias_kind":"pith_short_12","alias_value":"JW6ME47J2DFO","created_at":"2026-08-11T02:21:52.842064+00:00"},{"alias_kind":"pith_short_16","alias_value":"JW6ME47J2DFOYCJB","created_at":"2026-08-11T02:21:52.842064+00:00"},{"alias_kind":"pith_short_8","alias_value":"JW6ME47J","created_at":"2026-08-11T02:21:52.842064+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/JW6ME47J2DFOYCJB6FLECLBUTE","json":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE.json","graph_json":"https://pith.science/api/pith-number/JW6ME47J2DFOYCJB6FLECLBUTE/graph.json","events_json":"https://pith.science/api/pith-number/JW6ME47J2DFOYCJB6FLECLBUTE/events.json","paper":"https://pith.science/paper/JW6ME47J"},"agent_actions":{"view_html":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE","download_json":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE.json","view_paper":"https://pith.science/paper/JW6ME47J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09134&json=true","fetch_graph":"https://pith.science/api/pith-number/JW6ME47J2DFOYCJB6FLECLBUTE/graph.json","fetch_events":"https://pith.science/api/pith-number/JW6ME47J2DFOYCJB6FLECLBUTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE/action/storage_attestation","attest_author":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE/action/author_attestation","sign_citation":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE/action/citation_signature","submit_replication":"https://pith.science/pith/JW6ME47J2DFOYCJB6FLECLBUTE/action/replication_record"}},"created_at":"2026-08-11T02:21:52.842064+00:00","updated_at":"2026-08-11T02:21:52.842064+00:00"}