{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VNOCNSPFYCMULGUMTLNBI4IQC7","short_pith_number":"pith:VNOCNSPF","schema_version":"1.0","canonical_sha256":"ab5c26c9e5c099459a8c9ada14711017ea5f59406e25a0c615d97e8a8370a3d3","source":{"kind":"arxiv","id":"1606.00256","version":1},"attestation_state":"computed","paper":{"title":"From Graphs to Keyed Quantum Hash Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mansur Ziatdinov","submitted_at":"2016-05-31T14:00:03Z","abstract_excerpt":"We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model."},"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":"1606.00256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-31T14:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"07a4bc5a9b2823aea6e4124eacba9f8086c2fa88d82526f6ec411e8b62b03550","abstract_canon_sha256":"32ba5de3fb177ce444a24083754596280d93ccfad74c4567584b065d48b84c9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.662731Z","signature_b64":"V3i6lnDTI5xhtQ3cLMTOix3C/L73ubE900tfP6lG9hE1MmWVXllFtXsqA2ebCggyvTRQZsyNRkolXdUc2+3cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5c26c9e5c099459a8c9ada14711017ea5f59406e25a0c615d97e8a8370a3d3","last_reissued_at":"2026-05-18T01:13:05.662364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.662364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Graphs to Keyed Quantum Hash Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mansur Ziatdinov","submitted_at":"2016-05-31T14:00:03Z","abstract_excerpt":"We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00256","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":""},"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":"1606.00256","created_at":"2026-05-18T01:13:05.662421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00256v1","created_at":"2026-05-18T01:13:05.662421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00256","created_at":"2026-05-18T01:13:05.662421+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNOCNSPFYCMU","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNOCNSPFYCMULGUM","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNOCNSPF","created_at":"2026-05-18T12:30:48.956258+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/VNOCNSPFYCMULGUMTLNBI4IQC7","json":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7.json","graph_json":"https://pith.science/api/pith-number/VNOCNSPFYCMULGUMTLNBI4IQC7/graph.json","events_json":"https://pith.science/api/pith-number/VNOCNSPFYCMULGUMTLNBI4IQC7/events.json","paper":"https://pith.science/paper/VNOCNSPF"},"agent_actions":{"view_html":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7","download_json":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7.json","view_paper":"https://pith.science/paper/VNOCNSPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00256&json=true","fetch_graph":"https://pith.science/api/pith-number/VNOCNSPFYCMULGUMTLNBI4IQC7/graph.json","fetch_events":"https://pith.science/api/pith-number/VNOCNSPFYCMULGUMTLNBI4IQC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7/action/storage_attestation","attest_author":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7/action/author_attestation","sign_citation":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7/action/citation_signature","submit_replication":"https://pith.science/pith/VNOCNSPFYCMULGUMTLNBI4IQC7/action/replication_record"}},"created_at":"2026-05-18T01:13:05.662421+00:00","updated_at":"2026-05-18T01:13:05.662421+00:00"}