{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6V3XACF5LS6TBOHI5LYEGL7R4K","short_pith_number":"pith:6V3XACF5","canonical_record":{"source":{"id":"1309.6557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-25T16:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"e8fdd876fa50c4cd6c0fd12f882d89ba37592c423dbdd71acbf4a425e8a8bd37","abstract_canon_sha256":"4687c08883ed8b6ee87223514ac6137e5f29d58774588ffc887f0d28291096e0"},"schema_version":"1.0"},"canonical_sha256":"f5777008bd5cbd30b8e8eaf0432ff1e2956cdec89553c003eadbfc5e0ae4d5a5","source":{"kind":"arxiv","id":"1309.6557","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6557","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6557v2","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6557","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"6V3XACF5LS6T","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6V3XACF5LS6TBOHI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6V3XACF5","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6V3XACF5LS6TBOHI5LYEGL7R4K","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-25T16:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"e8fdd876fa50c4cd6c0fd12f882d89ba37592c423dbdd71acbf4a425e8a8bd37","abstract_canon_sha256":"4687c08883ed8b6ee87223514ac6137e5f29d58774588ffc887f0d28291096e0"},"schema_version":"1.0"},"canonical_sha256":"f5777008bd5cbd30b8e8eaf0432ff1e2956cdec89553c003eadbfc5e0ae4d5a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.817682Z","signature_b64":"D01+llUQ/9D/NRoM1zP4khbbLl76QIVTYABWPztRHkFvqCKR32ZfjUCtb/m9ExYXDl8zqeDCVVNwWWdQf8a6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5777008bd5cbd30b8e8eaf0432ff1e2956cdec89553c003eadbfc5e0ae4d5a5","last_reissued_at":"2026-05-18T03:06:12.817241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.817241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6557","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8evUtp2YDsRkhTAoP854ihMgjzfU6iYeITadcN4mq9TLvHF9E88mSoPouttIrdFBH13UQjNUlYXy0k9pZbMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:51:41.382575Z"},"content_sha256":"7522325a1f51055366b1e30b411ae612fa50a52c5880dddceb7c2e0f41cf11d3","schema_version":"1.0","event_id":"sha256:7522325a1f51055366b1e30b411ae612fa50a52c5880dddceb7c2e0f41cf11d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6V3XACF5LS6TBOHI5LYEGL7R4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-state formalism for mutually unbiased bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara Kraus, Christoph Spengler","submitted_at":"2013-09-25T16:16:30Z","abstract_excerpt":"A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of a prime number, complete sets of $d+1$ mutually unbiased bases (MUBs) exist. Here, we present a novel method based on the graph-state formalism to construct such sets of MUBs. We show that for $n$ $p$-level systems, with $p$ being prime, one particular graph suffices to easily construct a set of $p^n+1$ MUBs. In fact, we show that a single $n$-dimensional v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6557","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ymk1UgNXHG3uLxt185gg7w97O0gMqx72N3Wza3yZ2UPO+LVomWDNeNM5xauJJR3xDukn614B0/qjFOdcW1qpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:51:41.382902Z"},"content_sha256":"5c0de6f5201bf2b23ed4215dc128eb34d9ac808a349aa09e29d8b731efabb065","schema_version":"1.0","event_id":"sha256:5c0de6f5201bf2b23ed4215dc128eb34d9ac808a349aa09e29d8b731efabb065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/bundle.json","state_url":"https://pith.science/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T05:51:41Z","links":{"resolver":"https://pith.science/pith/6V3XACF5LS6TBOHI5LYEGL7R4K","bundle":"https://pith.science/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/bundle.json","state":"https://pith.science/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6V3XACF5LS6TBOHI5LYEGL7R4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6V3XACF5LS6TBOHI5LYEGL7R4K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4687c08883ed8b6ee87223514ac6137e5f29d58774588ffc887f0d28291096e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-25T16:16:30Z","title_canon_sha256":"e8fdd876fa50c4cd6c0fd12f882d89ba37592c423dbdd71acbf4a425e8a8bd37"},"schema_version":"1.0","source":{"id":"1309.6557","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6557","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6557v2","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6557","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"6V3XACF5LS6T","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6V3XACF5LS6TBOHI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6V3XACF5","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:5c0de6f5201bf2b23ed4215dc128eb34d9ac808a349aa09e29d8b731efabb065","target":"graph","created_at":"2026-05-18T03:06:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of a prime number, complete sets of $d+1$ mutually unbiased bases (MUBs) exist. Here, we present a novel method based on the graph-state formalism to construct such sets of MUBs. We show that for $n$ $p$-level systems, with $p$ being prime, one particular graph suffices to easily construct a set of $p^n+1$ MUBs. In fact, we show that a single $n$-dimensional v","authors_text":"Barbara Kraus, Christoph Spengler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-25T16:16:30Z","title":"Graph-state formalism for mutually unbiased bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6557","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7522325a1f51055366b1e30b411ae612fa50a52c5880dddceb7c2e0f41cf11d3","target":"record","created_at":"2026-05-18T03:06:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4687c08883ed8b6ee87223514ac6137e5f29d58774588ffc887f0d28291096e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-25T16:16:30Z","title_canon_sha256":"e8fdd876fa50c4cd6c0fd12f882d89ba37592c423dbdd71acbf4a425e8a8bd37"},"schema_version":"1.0","source":{"id":"1309.6557","kind":"arxiv","version":2}},"canonical_sha256":"f5777008bd5cbd30b8e8eaf0432ff1e2956cdec89553c003eadbfc5e0ae4d5a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5777008bd5cbd30b8e8eaf0432ff1e2956cdec89553c003eadbfc5e0ae4d5a5","first_computed_at":"2026-05-18T03:06:12.817241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:12.817241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D01+llUQ/9D/NRoM1zP4khbbLl76QIVTYABWPztRHkFvqCKR32ZfjUCtb/m9ExYXDl8zqeDCVVNwWWdQf8a6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:12.817682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6557","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7522325a1f51055366b1e30b411ae612fa50a52c5880dddceb7c2e0f41cf11d3","sha256:5c0de6f5201bf2b23ed4215dc128eb34d9ac808a349aa09e29d8b731efabb065"],"state_sha256":"a24fd076590e6cd37945ef1f4951ef72fdafb40d1936466dedcb35f39159804f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byfXlCXKHKVioGEI9S+MhSN0Y11qssYKCY7IWKhCqr4uYB438sVNqTNeIL1a8lJnvGN1ZHgFHZKghIu6+pJHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:51:41.384776Z","bundle_sha256":"1bd6ea9777216e65490d68d7f3b70f3d0c49139da6c39cb24d1c54a8c21fc4a7"}}