{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G7P7ESF4UNNLB3ZSRNLWRORJAP","short_pith_number":"pith:G7P7ESF4","schema_version":"1.0","canonical_sha256":"37dff248bca35ab0ef328b5768ba2903de6665526317410a14e770770c0c1975","source":{"kind":"arxiv","id":"2504.11315","version":1},"attestation_state":"computed","paper":{"title":"New Key Rate Bound for High-Dimensional BB84 with Multiple Basis Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Trevor N. Thomas, Walter O. Krawec","submitted_at":"2025-04-15T15:55:24Z","abstract_excerpt":"In this paper we derive a new bound on the secret key-rate of the High Dimensional BB84 protocol operating with multiple mutually unbiased bases (MUBs). To our knowledge, our proof is the first for this protocol that is both general (in that it can handle arbitrary, asymmetric channels), and also the first that derives a bound on the quantum min entropy for general attacks, without relying on post selection techniques or the asymptotic equipartition property. Because of this, our new result shows that far more optimistic key-rates are possible for a low number of signals, even in general chann"},"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":"2504.11315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-15T15:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"d3487c61eef42546a1c926d7c04c45bd4a85b59b867011da23f64aea9d0e61ee","abstract_canon_sha256":"f8bdd47ec8e9d64386235a37e9ef0a57bfe67512a778af8647bc8a7d9133aaef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:32.127740Z","signature_b64":"OmeYDVJFkNkJFZxqgE1XKvsx5aAbXLuXQPrigXK+jpGMpLo1DUydXduVj7pvfV4Qlai2qlGc6CO0CaCN6fwLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37dff248bca35ab0ef328b5768ba2903de6665526317410a14e770770c0c1975","last_reissued_at":"2026-07-05T10:49:32.127301Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:32.127301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Key Rate Bound for High-Dimensional BB84 with Multiple Basis Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Trevor N. Thomas, Walter O. Krawec","submitted_at":"2025-04-15T15:55:24Z","abstract_excerpt":"In this paper we derive a new bound on the secret key-rate of the High Dimensional BB84 protocol operating with multiple mutually unbiased bases (MUBs). To our knowledge, our proof is the first for this protocol that is both general (in that it can handle arbitrary, asymmetric channels), and also the first that derives a bound on the quantum min entropy for general attacks, without relying on post selection techniques or the asymptotic equipartition property. Because of this, our new result shows that far more optimistic key-rates are possible for a low number of signals, even in general chann"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11315","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/2504.11315/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":"2504.11315","created_at":"2026-07-05T10:49:32.127370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.11315v1","created_at":"2026-07-05T10:49:32.127370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11315","created_at":"2026-07-05T10:49:32.127370+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7P7ESF4UNNL","created_at":"2026-07-05T10:49:32.127370+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7P7ESF4UNNLB3ZS","created_at":"2026-07-05T10:49:32.127370+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7P7ESF4","created_at":"2026-07-05T10:49:32.127370+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.17194","citing_title":"Security of deterministic key distribution with higher-dimensional systems","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2510.11488","citing_title":"Finite Key Security of the Extended B92 Protocol","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP","json":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP.json","graph_json":"https://pith.science/api/pith-number/G7P7ESF4UNNLB3ZSRNLWRORJAP/graph.json","events_json":"https://pith.science/api/pith-number/G7P7ESF4UNNLB3ZSRNLWRORJAP/events.json","paper":"https://pith.science/paper/G7P7ESF4"},"agent_actions":{"view_html":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP","download_json":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP.json","view_paper":"https://pith.science/paper/G7P7ESF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.11315&json=true","fetch_graph":"https://pith.science/api/pith-number/G7P7ESF4UNNLB3ZSRNLWRORJAP/graph.json","fetch_events":"https://pith.science/api/pith-number/G7P7ESF4UNNLB3ZSRNLWRORJAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP/action/storage_attestation","attest_author":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP/action/author_attestation","sign_citation":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP/action/citation_signature","submit_replication":"https://pith.science/pith/G7P7ESF4UNNLB3ZSRNLWRORJAP/action/replication_record"}},"created_at":"2026-07-05T10:49:32.127370+00:00","updated_at":"2026-07-05T10:49:32.127370+00:00"}