{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:INWE6TZP773IPKLYFBZILULZON","short_pith_number":"pith:INWE6TZP","canonical_record":{"source":{"id":"1312.2517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T17:09:26Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"e146d9e05507cb0057243cc4b632b87c1ec4acd2d4bfb4f2864f7fb1fce4b7f6","abstract_canon_sha256":"1c1cd7ca2dabd75df9db6222397c65482da976f718bd902d8cb28ac9cb674908"},"schema_version":"1.0"},"canonical_sha256":"436c4f4f2ffff687a978287285d17973498a4683780fba4a2b2ec6c3967d1e66","source":{"kind":"arxiv","id":"1312.2517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2517","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2517v1","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2517","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"INWE6TZP773I","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"INWE6TZP773IPKLY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"INWE6TZP","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:INWE6TZP773IPKLYFBZILULZON","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T17:09:26Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"e146d9e05507cb0057243cc4b632b87c1ec4acd2d4bfb4f2864f7fb1fce4b7f6","abstract_canon_sha256":"1c1cd7ca2dabd75df9db6222397c65482da976f718bd902d8cb28ac9cb674908"},"schema_version":"1.0"},"canonical_sha256":"436c4f4f2ffff687a978287285d17973498a4683780fba4a2b2ec6c3967d1e66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:22.591129Z","signature_b64":"Wt2URJVaWZCjSW28sty+MYqPgJYEGdlN1dJwFgtkryHWcUpqrOhfULVt2A0ftif04bs2KkuZBVnFs5YzcHsGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"436c4f4f2ffff687a978287285d17973498a4683780fba4a2b2ec6c3967d1e66","last_reissued_at":"2026-05-18T03:03:22.590584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:22.590584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2517","source_version":1,"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:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vgHBieO/Gb/9gM4mg8K+LPcAQkIq6C1/jeM+eCV5Sq8IvYzupONKPI0fKmp0tMzLDfctZVmD2X5JvNU81bHIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:52:35.690846Z"},"content_sha256":"891fd9df158a9839b91d6c43b59cedb49745c5d8a444fe86353bcaf58b22fe41","schema_version":"1.0","event_id":"sha256:891fd9df158a9839b91d6c43b59cedb49745c5d8a444fe86353bcaf58b22fe41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:INWE6TZP773IPKLYFBZILULZON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new method of construction of all sets of mutually unbiased bases for two-qubit systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Iulia Ghiu","submitted_at":"2013-12-09T17:09:26Z","abstract_excerpt":"Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois field GF(4) and show that the solutions of this system are sufficient for obtaining the most general set of mutually unbiased bases. Further, our algorithm is applied to an example and we show that there are three possible solutions of the system of four equations, each solution leading to a different set of mutually unbiased bases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2517","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"},"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:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LuMggH29PtEBWI9hmV3hq/4xHt9xRJbT73eWCSLuxSSE7S0hqJ9dFUSVhE4Ha3kOCN5H5iYg7OtS4RVBOlsSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:52:35.691479Z"},"content_sha256":"3ccc74e75ad1b25af8af1706421aea7dd83857e3644c9115a8afc50e364e38eb","schema_version":"1.0","event_id":"sha256:3ccc74e75ad1b25af8af1706421aea7dd83857e3644c9115a8afc50e364e38eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INWE6TZP773IPKLYFBZILULZON/bundle.json","state_url":"https://pith.science/pith/INWE6TZP773IPKLYFBZILULZON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INWE6TZP773IPKLYFBZILULZON/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-05-27T05:52:35Z","links":{"resolver":"https://pith.science/pith/INWE6TZP773IPKLYFBZILULZON","bundle":"https://pith.science/pith/INWE6TZP773IPKLYFBZILULZON/bundle.json","state":"https://pith.science/pith/INWE6TZP773IPKLYFBZILULZON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INWE6TZP773IPKLYFBZILULZON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:INWE6TZP773IPKLYFBZILULZON","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":"1c1cd7ca2dabd75df9db6222397c65482da976f718bd902d8cb28ac9cb674908","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T17:09:26Z","title_canon_sha256":"e146d9e05507cb0057243cc4b632b87c1ec4acd2d4bfb4f2864f7fb1fce4b7f6"},"schema_version":"1.0","source":{"id":"1312.2517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2517","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2517v1","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2517","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"INWE6TZP773I","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"INWE6TZP773IPKLY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"INWE6TZP","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:3ccc74e75ad1b25af8af1706421aea7dd83857e3644c9115a8afc50e364e38eb","target":"graph","created_at":"2026-05-18T03:03:22Z","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":"Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois field GF(4) and show that the solutions of this system are sufficient for obtaining the most general set of mutually unbiased bases. Further, our algorithm is applied to an example and we show that there are three possible solutions of the system of four equations, each solution leading to a different set of mutually unbiased bases.","authors_text":"Iulia Ghiu","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T17:09:26Z","title":"A new method of construction of all sets of mutually unbiased bases for two-qubit systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2517","kind":"arxiv","version":1},"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:891fd9df158a9839b91d6c43b59cedb49745c5d8a444fe86353bcaf58b22fe41","target":"record","created_at":"2026-05-18T03:03:22Z","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":"1c1cd7ca2dabd75df9db6222397c65482da976f718bd902d8cb28ac9cb674908","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-09T17:09:26Z","title_canon_sha256":"e146d9e05507cb0057243cc4b632b87c1ec4acd2d4bfb4f2864f7fb1fce4b7f6"},"schema_version":"1.0","source":{"id":"1312.2517","kind":"arxiv","version":1}},"canonical_sha256":"436c4f4f2ffff687a978287285d17973498a4683780fba4a2b2ec6c3967d1e66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"436c4f4f2ffff687a978287285d17973498a4683780fba4a2b2ec6c3967d1e66","first_computed_at":"2026-05-18T03:03:22.590584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:22.590584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wt2URJVaWZCjSW28sty+MYqPgJYEGdlN1dJwFgtkryHWcUpqrOhfULVt2A0ftif04bs2KkuZBVnFs5YzcHsGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:22.591129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:891fd9df158a9839b91d6c43b59cedb49745c5d8a444fe86353bcaf58b22fe41","sha256:3ccc74e75ad1b25af8af1706421aea7dd83857e3644c9115a8afc50e364e38eb"],"state_sha256":"c908626bb4df60aba72482f0a6bacdba47b1c91dead2d74980596e8b1a7d2742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8ULQ2XqVYT4rmYQH7j4g64hglEByga2Mq8X0uknbW0Ud2ZUtF1r5l3XKLvSSqUK9qSwZDyx7dq2TY4zleyzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:52:35.694276Z","bundle_sha256":"29b9584dab5fa622be48f423f105290fcfc05b0cfc0667caab74ebd33a806cc8"}}