{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SJX2C3E7GIU2UQMJWO3JAP47MM","short_pith_number":"pith:SJX2C3E7","canonical_record":{"source":{"id":"1201.2250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-11T06:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"7a6c56eaaac739178ac9ce0e64fc27f51bdccfbe26c1a544a3656237fdbea456","abstract_canon_sha256":"9f3637517d5446c1143c5caa3abeb0d3d06b401d08a72a0a7f5fc58c5a052c9b"},"schema_version":"1.0"},"canonical_sha256":"926fa16c9f3229aa4189b3b6903f9f6325ea5fbb0b1a70274dd08c729080dd06","source":{"kind":"arxiv","id":"1201.2250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2250","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2250v1","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2250","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"SJX2C3E7GIU2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJX2C3E7GIU2UQMJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJX2C3E7","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SJX2C3E7GIU2UQMJWO3JAP47MM","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-11T06:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"7a6c56eaaac739178ac9ce0e64fc27f51bdccfbe26c1a544a3656237fdbea456","abstract_canon_sha256":"9f3637517d5446c1143c5caa3abeb0d3d06b401d08a72a0a7f5fc58c5a052c9b"},"schema_version":"1.0"},"canonical_sha256":"926fa16c9f3229aa4189b3b6903f9f6325ea5fbb0b1a70274dd08c729080dd06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:46.262399Z","signature_b64":"GMPV7k7PinZ5GW7HHvcQUmQWW4SNeUeto7Ne7pSXX1Wjw6MX3HIk4NOmFDQ5LzYBQDenTUhaeTFOov9rDZrXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926fa16c9f3229aa4189b3b6903f9f6325ea5fbb0b1a70274dd08c729080dd06","last_reissued_at":"2026-05-18T03:38:46.261609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:46.261609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2250","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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36ECPIraj/NM8VO8/B5KFMTszYbR1aBNnIBgJBMBamOKm10xdM/ZdClp+LL6qslZgqq+/H4OX6/vYHwxj48iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:24.257907Z"},"content_sha256":"ba00a4bf8a93e2d8142f3dee91fa8319270f31546551c437fe989d0473038ba6","schema_version":"1.0","event_id":"sha256:ba00a4bf8a93e2d8142f3dee91fa8319270f31546551c437fe989d0473038ba6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SJX2C3E7GIU2UQMJWO3JAP47MM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Quantum Random Access Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fang-Yu Hong, Liang-neng Wu, Li-zhen Jiang, Yang Xiang, Zhi-Yan Zhu","submitted_at":"2012-01-11T06:32:01Z","abstract_excerpt":"A \"bucket brigade\" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme, in which only average $n/2$ times manipulation is required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme for storing an arbitrary state in a selected memory cell followed by reading it out is discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2250","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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tH/eTgGn0+tswAhmjkY5ZKECkaTGTDWZnTauxFiUaP5Y0HW7SOt8vKxJi4sAk+3+OK0GCDurU3vKPNny7U7uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:24.258252Z"},"content_sha256":"b264b74d05d9ad0e2ddae24dbb56ce73b47e2fe1a8f63f32dc5a228f81991b4d","schema_version":"1.0","event_id":"sha256:b264b74d05d9ad0e2ddae24dbb56ce73b47e2fe1a8f63f32dc5a228f81991b4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/bundle.json","state_url":"https://pith.science/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/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-30T17:48:24Z","links":{"resolver":"https://pith.science/pith/SJX2C3E7GIU2UQMJWO3JAP47MM","bundle":"https://pith.science/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/bundle.json","state":"https://pith.science/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJX2C3E7GIU2UQMJWO3JAP47MM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SJX2C3E7GIU2UQMJWO3JAP47MM","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":"9f3637517d5446c1143c5caa3abeb0d3d06b401d08a72a0a7f5fc58c5a052c9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-11T06:32:01Z","title_canon_sha256":"7a6c56eaaac739178ac9ce0e64fc27f51bdccfbe26c1a544a3656237fdbea456"},"schema_version":"1.0","source":{"id":"1201.2250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2250","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2250v1","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2250","created_at":"2026-05-18T03:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"SJX2C3E7GIU2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SJX2C3E7GIU2UQMJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SJX2C3E7","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:b264b74d05d9ad0e2ddae24dbb56ce73b47e2fe1a8f63f32dc5a228f81991b4d","target":"graph","created_at":"2026-05-18T03:38:46Z","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 \"bucket brigade\" architecture for a quantum random memory of $N=2^n$ memory cells needs $n(n+5)/2$ times of quantum manipulation on control circuit nodes per memory call. Here we propose a scheme, in which only average $n/2$ times manipulation is required to accomplish a memory call. This scheme may significantly decrease the time spent on a memory call and the average overall error rate per memory call. A physical implementation scheme for storing an arbitrary state in a selected memory cell followed by reading it out is discussed.","authors_text":"Fang-Yu Hong, Liang-neng Wu, Li-zhen Jiang, Yang Xiang, Zhi-Yan Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-11T06:32:01Z","title":"A Robust Quantum Random Access Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2250","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:ba00a4bf8a93e2d8142f3dee91fa8319270f31546551c437fe989d0473038ba6","target":"record","created_at":"2026-05-18T03:38:46Z","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":"9f3637517d5446c1143c5caa3abeb0d3d06b401d08a72a0a7f5fc58c5a052c9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-01-11T06:32:01Z","title_canon_sha256":"7a6c56eaaac739178ac9ce0e64fc27f51bdccfbe26c1a544a3656237fdbea456"},"schema_version":"1.0","source":{"id":"1201.2250","kind":"arxiv","version":1}},"canonical_sha256":"926fa16c9f3229aa4189b3b6903f9f6325ea5fbb0b1a70274dd08c729080dd06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926fa16c9f3229aa4189b3b6903f9f6325ea5fbb0b1a70274dd08c729080dd06","first_computed_at":"2026-05-18T03:38:46.261609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:46.261609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMPV7k7PinZ5GW7HHvcQUmQWW4SNeUeto7Ne7pSXX1Wjw6MX3HIk4NOmFDQ5LzYBQDenTUhaeTFOov9rDZrXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:46.262399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba00a4bf8a93e2d8142f3dee91fa8319270f31546551c437fe989d0473038ba6","sha256:b264b74d05d9ad0e2ddae24dbb56ce73b47e2fe1a8f63f32dc5a228f81991b4d"],"state_sha256":"8e63937396a3e50ae58941eb42bb5a3da8082ad46ca9dcb19f778ae41ce9df35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yMWlTy9n10rqLK1eu5TqKWlUjc/er9QO9Xp8iM9txhIzsfEAcHzY5ZB6d67oXY6tVHEZo2K5mUzLw2Cb5rQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:24.260134Z","bundle_sha256":"6304ff1f52c9ca23698030605f0c6c9c0888acb16073719251b04bebd60325d4"}}