{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:D2GYDVYU4MWURFGGR34QTOTZNJ","short_pith_number":"pith:D2GYDVYU","canonical_record":{"source":{"id":"0807.4994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-31T07:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"7f76e67e97603bb61e636a48b0777be0dcdf8177db48837274a40e4c4684d48c","abstract_canon_sha256":"c9cf02f3602d3f0a0607d8a1248e0577f263922314cacd341997fce8aa37c32e"},"schema_version":"1.0"},"canonical_sha256":"1e8d81d714e32d4894c68ef909ba796a796a2b4f5c6daee07727a29788d330b7","source":{"kind":"arxiv","id":"0807.4994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.4994","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"0807.4994v2","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4994","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"D2GYDVYU4MWU","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"D2GYDVYU4MWURFGG","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"D2GYDVYU","created_at":"2026-07-04T17:12:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:D2GYDVYU4MWURFGGR34QTOTZNJ","target":"record","payload":{"canonical_record":{"source":{"id":"0807.4994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-31T07:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"7f76e67e97603bb61e636a48b0777be0dcdf8177db48837274a40e4c4684d48c","abstract_canon_sha256":"c9cf02f3602d3f0a0607d8a1248e0577f263922314cacd341997fce8aa37c32e"},"schema_version":"1.0"},"canonical_sha256":"1e8d81d714e32d4894c68ef909ba796a796a2b4f5c6daee07727a29788d330b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:12:03.743019Z","signature_b64":"ieP0zIX0MI9BRdwYhpsEXF4LYEWGIc2g0Yc3St0I3ZAUaZFavrBU9KkRCHJd5XQjZV+HvnF8AwPGxsJvzAKlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e8d81d714e32d4894c68ef909ba796a796a2b4f5c6daee07727a29788d330b7","last_reissued_at":"2026-07-04T17:12:03.742536Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:12:03.742536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.4994","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-07-04T17:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1wCf79+YTZMUNINahuDuEuu07wY9UbY4lr+MH8ZIZzcuqrb+uhVjUCzpvtsIzO+Pt58qLyB5w5Fnmrq36/DCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:36:15.338839Z"},"content_sha256":"9d90e0f84eb28beaa8f323598e9dfbd61fa26ef2a9af8faaabcb78fd3ab7e291","schema_version":"1.0","event_id":"sha256:9d90e0f84eb28beaa8f323598e9dfbd61fa26ef2a9af8faaabcb78fd3ab7e291"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:D2GYDVYU4MWURFGGR34QTOTZNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Architectures for a quantum random access memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lorenzo Maccone, Seth Lloyd, Vittorio Giovannetti","submitted_at":"2008-07-31T07:10:21Z","abstract_excerpt":"A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum or classical information. RAMs and qRAMs with n-bit addresses can access 2^n memory sites. Any design for a RAM or qRAM then requires O(2^n) two-bit logic gates. At first sight this requirement might seem to make large scale quantum versions of such devices impractical, due to the difficulty of constructing and operating coherent devices with large numbers of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.4994","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0807.4994/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"},"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-07-04T17:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyLnRVapjCmmnYfHVyI16+TOkfSlZJPYNa7+MPwbhnmKJR/LG8qB4ABUclYhTAkB45hC662YMMDGd8yi8FqaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:36:15.339409Z"},"content_sha256":"57b6e1a974d8065c93c4d34cd77fc1143e796a2ae4aaec6d52f6029291c88b7a","schema_version":"1.0","event_id":"sha256:57b6e1a974d8065c93c4d34cd77fc1143e796a2ae4aaec6d52f6029291c88b7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/bundle.json","state_url":"https://pith.science/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/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-08-10T09:36:15Z","links":{"resolver":"https://pith.science/pith/D2GYDVYU4MWURFGGR34QTOTZNJ","bundle":"https://pith.science/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/bundle.json","state":"https://pith.science/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2GYDVYU4MWURFGGR34QTOTZNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:D2GYDVYU4MWURFGGR34QTOTZNJ","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":"c9cf02f3602d3f0a0607d8a1248e0577f263922314cacd341997fce8aa37c32e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-31T07:10:21Z","title_canon_sha256":"7f76e67e97603bb61e636a48b0777be0dcdf8177db48837274a40e4c4684d48c"},"schema_version":"1.0","source":{"id":"0807.4994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.4994","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"0807.4994v2","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4994","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"D2GYDVYU4MWU","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_16","alias_value":"D2GYDVYU4MWURFGG","created_at":"2026-07-04T17:12:03Z"},{"alias_kind":"pith_short_8","alias_value":"D2GYDVYU","created_at":"2026-07-04T17:12:03Z"}],"graph_snapshots":[{"event_id":"sha256:57b6e1a974d8065c93c4d34cd77fc1143e796a2ae4aaec6d52f6029291c88b7a","target":"graph","created_at":"2026-07-04T17:12:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0807.4994/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum or classical information. RAMs and qRAMs with n-bit addresses can access 2^n memory sites. Any design for a RAM or qRAM then requires O(2^n) two-bit logic gates. At first sight this requirement might seem to make large scale quantum versions of such devices impractical, due to the difficulty of constructing and operating coherent devices with large numbers of","authors_text":"Lorenzo Maccone, Seth Lloyd, Vittorio Giovannetti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-31T07:10:21Z","title":"Architectures for a quantum random access memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.4994","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:9d90e0f84eb28beaa8f323598e9dfbd61fa26ef2a9af8faaabcb78fd3ab7e291","target":"record","created_at":"2026-07-04T17:12:03Z","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":"c9cf02f3602d3f0a0607d8a1248e0577f263922314cacd341997fce8aa37c32e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-31T07:10:21Z","title_canon_sha256":"7f76e67e97603bb61e636a48b0777be0dcdf8177db48837274a40e4c4684d48c"},"schema_version":"1.0","source":{"id":"0807.4994","kind":"arxiv","version":2}},"canonical_sha256":"1e8d81d714e32d4894c68ef909ba796a796a2b4f5c6daee07727a29788d330b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e8d81d714e32d4894c68ef909ba796a796a2b4f5c6daee07727a29788d330b7","first_computed_at":"2026-07-04T17:12:03.742536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:12:03.742536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ieP0zIX0MI9BRdwYhpsEXF4LYEWGIc2g0Yc3St0I3ZAUaZFavrBU9KkRCHJd5XQjZV+HvnF8AwPGxsJvzAKlDg==","signature_status":"signed_v1","signed_at":"2026-07-04T17:12:03.743019Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.4994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d90e0f84eb28beaa8f323598e9dfbd61fa26ef2a9af8faaabcb78fd3ab7e291","sha256:57b6e1a974d8065c93c4d34cd77fc1143e796a2ae4aaec6d52f6029291c88b7a"],"state_sha256":"e91e898b54e195a2d36af99ce9227f50674316ebc68d78682b625b12165c4bdb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kkn8WRWdKDWKg6qWVmMPeth+t5aK4VBJPJ+fxwSOhfvVdDl48eaicHA5yccUTsUAB/3041qVSst4jlqy2gcjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:36:15.343374Z","bundle_sha256":"92a4c4935eb78b8ffa15b78a3f0f30fe2edc23e87edb4baa3666edfe99f5cfd8"}}