{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NEWQ5UY3FVCZ43Y6YBZU44LXLV","short_pith_number":"pith:NEWQ5UY3","canonical_record":{"source":{"id":"1901.02362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"41c92ee01fc180def4c14d46fa7bee81a7426d97f764924315c6f8715df2cf13","abstract_canon_sha256":"2fcadf61ed8d9432125a919583376fc357265f5fa567fc69f5d6f4b361b90ebe"},"schema_version":"1.0"},"canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","source":{"kind":"arxiv","id":"1901.02362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02362","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02362v1","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02362","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"NEWQ5UY3FVCZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NEWQ5UY3FVCZ43Y6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NEWQ5UY3","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NEWQ5UY3FVCZ43Y6YBZU44LXLV","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"41c92ee01fc180def4c14d46fa7bee81a7426d97f764924315c6f8715df2cf13","abstract_canon_sha256":"2fcadf61ed8d9432125a919583376fc357265f5fa567fc69f5d6f4b361b90ebe"},"schema_version":"1.0"},"canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.092888Z","signature_b64":"G/tl8pBdh/b69aMtX7qyED1W0nrLajN411vu1oczMqKppG1sNOFXHUTygOqwcjq0nZCsZPnooWJHOCtH8naSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","last_reissued_at":"2026-05-17T23:48:22.092362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.092362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02362","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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ec2ti0YTaKuU98zmFEnrorz4EToTdWBJS+aS4x+WjOC6kELt1m5TGtn6DmY5t3+nH0tZZvwcQuDThpjMO8AbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:12:36.420089Z"},"content_sha256":"d06339db77cb8b5bf70d3b89782e725a3312b68619a16c1ae7c06806f3853c7d","schema_version":"1.0","event_id":"sha256:d06339db77cb8b5bf70d3b89782e725a3312b68619a16c1ae7c06806f3853c7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NEWQ5UY3FVCZ43Y6YBZU44LXLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circuit-Based Quantum Random Access Memory for Classical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel K. Park, Francesco Petruccione, June-Koo Kevin Rhee","submitted_at":"2019-01-08T15:26:24Z","abstract_excerpt":"A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of $M$ entries, each represented by $n$ bits, the method requires $O(n)$ qubits and $O(Mn)$ steps. With post-selection at an additional cost, our method can also store continuous data as proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02362","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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOV6SVi1njMVgFRVu93Hb/C98Ciybqobhhu0PAeNwz4qxpbNPHHzjXUSAalTOBA2SY2xIeUmj4O/vxtkl9OoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:12:36.420622Z"},"content_sha256":"40b29babe99df045b19e51038769810058c3d39a4de5edd8ca4aa11f4c849d81","schema_version":"1.0","event_id":"sha256:40b29babe99df045b19e51038769810058c3d39a4de5edd8ca4aa11f4c849d81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/bundle.json","state_url":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/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-09T13:12:36Z","links":{"resolver":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV","bundle":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/bundle.json","state":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NEWQ5UY3FVCZ43Y6YBZU44LXLV","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":"2fcadf61ed8d9432125a919583376fc357265f5fa567fc69f5d6f4b361b90ebe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","title_canon_sha256":"41c92ee01fc180def4c14d46fa7bee81a7426d97f764924315c6f8715df2cf13"},"schema_version":"1.0","source":{"id":"1901.02362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02362","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02362v1","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02362","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"NEWQ5UY3FVCZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NEWQ5UY3FVCZ43Y6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NEWQ5UY3","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:40b29babe99df045b19e51038769810058c3d39a4de5edd8ca4aa11f4c849d81","target":"graph","created_at":"2026-05-17T23:48: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":"A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of $M$ entries, each represented by $n$ bits, the method requires $O(n)$ qubits and $O(Mn)$ steps. With post-selection at an additional cost, our method can also store continuous data as proba","authors_text":"Daniel K. Park, Francesco Petruccione, June-Koo Kevin Rhee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","title":"Circuit-Based Quantum Random Access Memory for Classical Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02362","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:d06339db77cb8b5bf70d3b89782e725a3312b68619a16c1ae7c06806f3853c7d","target":"record","created_at":"2026-05-17T23:48: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":"2fcadf61ed8d9432125a919583376fc357265f5fa567fc69f5d6f4b361b90ebe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","title_canon_sha256":"41c92ee01fc180def4c14d46fa7bee81a7426d97f764924315c6f8715df2cf13"},"schema_version":"1.0","source":{"id":"1901.02362","kind":"arxiv","version":1}},"canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","first_computed_at":"2026-05-17T23:48:22.092362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:22.092362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/tl8pBdh/b69aMtX7qyED1W0nrLajN411vu1oczMqKppG1sNOFXHUTygOqwcjq0nZCsZPnooWJHOCtH8naSBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:22.092888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06339db77cb8b5bf70d3b89782e725a3312b68619a16c1ae7c06806f3853c7d","sha256:40b29babe99df045b19e51038769810058c3d39a4de5edd8ca4aa11f4c849d81"],"state_sha256":"070d7a07d6b430c80d718de38c729a0ec70f74cc465593e5903253096fd4ab36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rujh8C0e1+Dtm4b46gDlAYdtZv498SxW0nK1Zt0KqJF11lTWLJNZvQ1ID0v1K0mLahGc8TozPYq7Kx1iCIi1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:12:36.422970Z","bundle_sha256":"db621961970f529fe1919a078e16bd759c38f1771999135377082fe4d428c29b"}}