{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XH56UTHAFUXUEYH2TDUJGJYQWL","short_pith_number":"pith:XH56UTHA","schema_version":"1.0","canonical_sha256":"b9fbea4ce02d2f4260fa98e8932710b2c110c3b0d4a5f9298c6124383d1ad62e","source":{"kind":"arxiv","id":"2412.18823","version":1},"attestation_state":"computed","paper":{"title":"Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL"],"primary_cat":"quant-ph","authors_text":"Aliya Khadieva, Kamil Khadiev, Mansur Ziiatdinov","submitted_at":"2024-12-25T08:26:06Z","abstract_excerpt":"Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses less resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum fingerprinting is quantum automata algorithm for \\(MOD_{p}=\\{a^{i\\cdot p} \\mid i \\geq 0\\}\\) languages, where $p$ is a prime number.\n  However, implementing such an automaton on the current quantum hardware is not efficient.\n  Quantum fingerprinting maps a word \\(x \\in \\{0,1\\}^{n}\\) of length \\(n\\) t"},"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":"2412.18823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-25T08:26:06Z","cross_cats_sorted":["cs.CR","cs.FL"],"title_canon_sha256":"cbc0bdffb2a0fcadc095ff9b703fd906c5fc5c1ab2edbb09c6124c3af1fbc815","abstract_canon_sha256":"6c17c1ee3617f8c5b5870d296992b51b875b48d79760fb9e2affbae8cf6b982c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:43.315917Z","signature_b64":"3nXcXNjUNpms0g7eBxAuqlRdt1PRa1OdzpQfNNH8k77MrU5A9gEQQAM2Z2RbXvi9znKzuTppzMd1yNknn976Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9fbea4ce02d2f4260fa98e8932710b2c110c3b0d4a5f9298c6124383d1ad62e","last_reissued_at":"2026-07-05T11:04:43.315387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:43.315387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL"],"primary_cat":"quant-ph","authors_text":"Aliya Khadieva, Kamil Khadiev, Mansur Ziiatdinov","submitted_at":"2024-12-25T08:26:06Z","abstract_excerpt":"Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses less resources, making it useful in quantum algorithms, communication, and cryptography. One of the examples of quantum fingerprinting is quantum automata algorithm for \\(MOD_{p}=\\{a^{i\\cdot p} \\mid i \\geq 0\\}\\) languages, where $p$ is a prime number.\n  However, implementing such an automaton on the current quantum hardware is not efficient.\n  Quantum fingerprinting maps a word \\(x \\in \\{0,1\\}^{n}\\) of length \\(n\\) t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18823","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/2412.18823/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":"2412.18823","created_at":"2026-07-05T11:04:43.315448+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18823v1","created_at":"2026-07-05T11:04:43.315448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18823","created_at":"2026-07-05T11:04:43.315448+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH56UTHAFUXU","created_at":"2026-07-05T11:04:43.315448+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH56UTHAFUXUEYH2","created_at":"2026-07-05T11:04:43.315448+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH56UTHA","created_at":"2026-07-05T11:04:43.315448+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/XH56UTHAFUXUEYH2TDUJGJYQWL","json":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL.json","graph_json":"https://pith.science/api/pith-number/XH56UTHAFUXUEYH2TDUJGJYQWL/graph.json","events_json":"https://pith.science/api/pith-number/XH56UTHAFUXUEYH2TDUJGJYQWL/events.json","paper":"https://pith.science/paper/XH56UTHA"},"agent_actions":{"view_html":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL","download_json":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL.json","view_paper":"https://pith.science/paper/XH56UTHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18823&json=true","fetch_graph":"https://pith.science/api/pith-number/XH56UTHAFUXUEYH2TDUJGJYQWL/graph.json","fetch_events":"https://pith.science/api/pith-number/XH56UTHAFUXUEYH2TDUJGJYQWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL/action/storage_attestation","attest_author":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL/action/author_attestation","sign_citation":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL/action/citation_signature","submit_replication":"https://pith.science/pith/XH56UTHAFUXUEYH2TDUJGJYQWL/action/replication_record"}},"created_at":"2026-07-05T11:04:43.315448+00:00","updated_at":"2026-07-05T11:04:43.315448+00:00"}