{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VGQJ5DUIRFRNKSNC4QGOB52RQK","short_pith_number":"pith:VGQJ5DUI","canonical_record":{"source":{"id":"2003.03514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-03-07T04:21:39Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"01e3cea887fe939429c9baa6151f22af0c622eb9b30eabf43adc25d5e89e094a","abstract_canon_sha256":"0e707b65b5d0a49e9a041bf7d0b2529d7d27011aabf2b491b3b6268cef9bbb39"},"schema_version":"1.0"},"canonical_sha256":"a9a09e8e888962d549a2e40ce0f751828e056ba54847e17a6d2e8787e926ae92","source":{"kind":"arxiv","id":"2003.03514","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.03514","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"2003.03514v2","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03514","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"VGQJ5DUIRFRN","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGQJ5DUIRFRNKSNC","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGQJ5DUI","created_at":"2026-07-05T04:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VGQJ5DUIRFRNKSNC4QGOB52RQK","target":"record","payload":{"canonical_record":{"source":{"id":"2003.03514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-03-07T04:21:39Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"01e3cea887fe939429c9baa6151f22af0c622eb9b30eabf43adc25d5e89e094a","abstract_canon_sha256":"0e707b65b5d0a49e9a041bf7d0b2529d7d27011aabf2b491b3b6268cef9bbb39"},"schema_version":"1.0"},"canonical_sha256":"a9a09e8e888962d549a2e40ce0f751828e056ba54847e17a6d2e8787e926ae92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:59.774932Z","signature_b64":"zaki2WOXf9MzBTwBd9Ee6+fx8hvJspXVjI/u4k4RPnKiIxWOmbmTyVr5VmjdyHyGNaVn68arKt5KLmSDQp6CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a09e8e888962d549a2e40ce0f751828e056ba54847e17a6d2e8787e926ae92","last_reissued_at":"2026-07-05T04:55:59.774555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:59.774555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.03514","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-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9elHMTvk/Si8Ukuh/db6BaZT4xST/LUuqdmh1WfRXKs+VCudvtrqk0S1t6vZsRJ9lPysACPlajeSn5lrAqCvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:33:47.705948Z"},"content_sha256":"fea231c7a9f2a94191824a1dda3340ad024dd4776f62be150aebad44dc5848ab","schema_version":"1.0","event_id":"sha256:fea231c7a9f2a94191824a1dda3340ad024dd4776f62be150aebad44dc5848ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VGQJ5DUIRFRNKSNC4QGOB52RQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Random Access Stored-Program Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Mingsheng Ying, Qisheng Wang","submitted_at":"2020-03-07T04:21:39Z","abstract_excerpt":"Random access machines (RAMs) and random access stored-program machines (RASPs) are models of computing that are closer to the architecture of real-world computers than Turing machines (TMs). They are also convenient in complexity analysis of algorithms. The relationships between RAMs, RASPs and TMs are well-studied. However, clear relationships between their quantum counterparts are still missing in the literature. We fill in this gap by formally defining the models of quantum random access machines (QRAMs) and quantum random access stored-program machines (QRASPs) and clarifying the relation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.03514","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/2003.03514/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-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EF9y975IQ6oN6S4tLM1i4/ney5AxZgZsMWRNFjltpxcQYNoWC0cQMNBe6MArF76jdZ5hbWAaQ7znkvKaWw76BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:33:47.706442Z"},"content_sha256":"74f6ec4f2db1894d79edfc5a62ba16ef62897134ed3598b95e5dc71db314f12b","schema_version":"1.0","event_id":"sha256:74f6ec4f2db1894d79edfc5a62ba16ef62897134ed3598b95e5dc71db314f12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/bundle.json","state_url":"https://pith.science/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/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-04T23:33:47Z","links":{"resolver":"https://pith.science/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK","bundle":"https://pith.science/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/bundle.json","state":"https://pith.science/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGQJ5DUIRFRNKSNC4QGOB52RQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VGQJ5DUIRFRNKSNC4QGOB52RQK","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":"0e707b65b5d0a49e9a041bf7d0b2529d7d27011aabf2b491b3b6268cef9bbb39","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-03-07T04:21:39Z","title_canon_sha256":"01e3cea887fe939429c9baa6151f22af0c622eb9b30eabf43adc25d5e89e094a"},"schema_version":"1.0","source":{"id":"2003.03514","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.03514","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"2003.03514v2","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.03514","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"VGQJ5DUIRFRN","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGQJ5DUIRFRNKSNC","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGQJ5DUI","created_at":"2026-07-05T04:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:74f6ec4f2db1894d79edfc5a62ba16ef62897134ed3598b95e5dc71db314f12b","target":"graph","created_at":"2026-07-05T04:55:59Z","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/2003.03514/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random access machines (RAMs) and random access stored-program machines (RASPs) are models of computing that are closer to the architecture of real-world computers than Turing machines (TMs). They are also convenient in complexity analysis of algorithms. The relationships between RAMs, RASPs and TMs are well-studied. However, clear relationships between their quantum counterparts are still missing in the literature. We fill in this gap by formally defining the models of quantum random access machines (QRAMs) and quantum random access stored-program machines (QRASPs) and clarifying the relation","authors_text":"Mingsheng Ying, Qisheng Wang","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-03-07T04:21:39Z","title":"Quantum Random Access Stored-Program Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.03514","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:fea231c7a9f2a94191824a1dda3340ad024dd4776f62be150aebad44dc5848ab","target":"record","created_at":"2026-07-05T04:55:59Z","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":"0e707b65b5d0a49e9a041bf7d0b2529d7d27011aabf2b491b3b6268cef9bbb39","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-03-07T04:21:39Z","title_canon_sha256":"01e3cea887fe939429c9baa6151f22af0c622eb9b30eabf43adc25d5e89e094a"},"schema_version":"1.0","source":{"id":"2003.03514","kind":"arxiv","version":2}},"canonical_sha256":"a9a09e8e888962d549a2e40ce0f751828e056ba54847e17a6d2e8787e926ae92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9a09e8e888962d549a2e40ce0f751828e056ba54847e17a6d2e8787e926ae92","first_computed_at":"2026-07-05T04:55:59.774555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:59.774555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zaki2WOXf9MzBTwBd9Ee6+fx8hvJspXVjI/u4k4RPnKiIxWOmbmTyVr5VmjdyHyGNaVn68arKt5KLmSDQp6CAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:59.774932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.03514","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fea231c7a9f2a94191824a1dda3340ad024dd4776f62be150aebad44dc5848ab","sha256:74f6ec4f2db1894d79edfc5a62ba16ef62897134ed3598b95e5dc71db314f12b"],"state_sha256":"905670bd82f34167be4875d21ffb90dd64183478f08b4a1e0b49f10432533e73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"torqbMHUfYhvZ0yoJo7hPOJj1Pqnh57torhZSRgC5RvetUKpFs86P0WqtsWwXrMrVu02Jee6WTkFfT0pVI+/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:33:47.712171Z","bundle_sha256":"397aaa76302f3e7cc9502576898e561a454d13233819264475c6ce5a6d065a10"}}