{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZM2FIEZNBATCFKRVH4QXZ2ZCQI","short_pith_number":"pith:ZM2FIEZN","schema_version":"1.0","canonical_sha256":"cb3454132d082622aa353f217ceb2282205169c8b8d12ddcac769fe5d93ffd80","source":{"kind":"arxiv","id":"1907.02726","version":1},"attestation_state":"computed","paper":{"title":"Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ulrich Seyfarth","submitted_at":"2019-07-05T08:42:16Z","abstract_excerpt":"The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number dimensions is given and related to Wiedemann's conjecture for systems with more than 2048 qubits. The second part of the thesis analyses a quantum public-key encryption scheme."},"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":"1907.02726","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2019-07-05T08:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"a5873b124a1ddec20ec3c301ca1a701bf2c23a8178cd6e958c1dc44c5578f2b0","abstract_canon_sha256":"6d987c00c7a78c86e72cd43462032c9b19edd67eb50bc2a8ccf0c8e9459dc045"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.371326Z","signature_b64":"zbp0LfsDbZa2pIDqh2TVdXEY1zIYA+/ddLqKZ9rEVglzGGANZ9bjEFPDjFumRUG4gdZPdFWhrfWxyELMvronCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb3454132d082622aa353f217ceb2282205169c8b8d12ddcac769fe5d93ffd80","last_reissued_at":"2026-05-17T23:41:23.370691Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.370691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ulrich Seyfarth","submitted_at":"2019-07-05T08:42:16Z","abstract_excerpt":"The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number dimensions is given and related to Wiedemann's conjecture for systems with more than 2048 qubits. The second part of the thesis analyses a quantum public-key encryption scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02726","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":"1907.02726","created_at":"2026-05-17T23:41:23.370805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02726v1","created_at":"2026-05-17T23:41:23.370805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02726","created_at":"2026-05-17T23:41:23.370805+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZM2FIEZNBATC","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZM2FIEZNBATCFKRV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZM2FIEZN","created_at":"2026-05-18T12:33:33.725879+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/ZM2FIEZNBATCFKRVH4QXZ2ZCQI","json":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI.json","graph_json":"https://pith.science/api/pith-number/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/graph.json","events_json":"https://pith.science/api/pith-number/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/events.json","paper":"https://pith.science/paper/ZM2FIEZN"},"agent_actions":{"view_html":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI","download_json":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI.json","view_paper":"https://pith.science/paper/ZM2FIEZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02726&json=true","fetch_graph":"https://pith.science/api/pith-number/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/action/storage_attestation","attest_author":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/action/author_attestation","sign_citation":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/action/citation_signature","submit_replication":"https://pith.science/pith/ZM2FIEZNBATCFKRVH4QXZ2ZCQI/action/replication_record"}},"created_at":"2026-05-17T23:41:23.370805+00:00","updated_at":"2026-05-17T23:41:23.370805+00:00"}