{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:WJF2LXCEPMCAU7J4NCKG5PXO4H","short_pith_number":"pith:WJF2LXCE","canonical_record":{"source":{"id":"quant-ph/0607065","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-07-11T06:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"e947be59b69ae996941f128c3310306aaab256ad6d2635d1d3cd86c705f4a7cd","abstract_canon_sha256":"e50e92ceee4720a01eb0da2a5d8e685a1b47aa90aab7465442f85b52023559be"},"schema_version":"1.0"},"canonical_sha256":"b24ba5dc447b040a7d3c68946ebeeee1fecb8892d9cb9261a0532989de438fdd","source":{"kind":"arxiv","id":"quant-ph/0607065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0607065","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0607065v1","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0607065","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"WJF2LXCEPMCA","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"WJF2LXCEPMCAU7J4","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"WJF2LXCE","created_at":"2026-07-04T14:56:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:WJF2LXCEPMCAU7J4NCKG5PXO4H","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0607065","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-07-11T06:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"e947be59b69ae996941f128c3310306aaab256ad6d2635d1d3cd86c705f4a7cd","abstract_canon_sha256":"e50e92ceee4720a01eb0da2a5d8e685a1b47aa90aab7465442f85b52023559be"},"schema_version":"1.0"},"canonical_sha256":"b24ba5dc447b040a7d3c68946ebeeee1fecb8892d9cb9261a0532989de438fdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:56:14.114929Z","signature_b64":"N7VeAPMZI3rJjH/rREldFBVVvON7SAtNoQ/hFNW0rcIUmqBArsbTOD//nZQVQhQjCzZ1wtlnTqFpOtSlba6MDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b24ba5dc447b040a7d3c68946ebeeee1fecb8892d9cb9261a0532989de438fdd","last_reissued_at":"2026-07-04T14:56:14.114525Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:56:14.114525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0607065","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-07-04T14:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5QjE3dhad9x24PegjG9yr9PqfvWMs1hc5ZypvV+EKxocuaRhlN6ERky7QB5rALSrwsmgEET+x21pkBDNEOAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:02:06.510976Z"},"content_sha256":"8a3e12a7ac1ff99aa5bab8f962254c422a46ce72cc854297f077aee4ade16899","schema_version":"1.0","event_id":"sha256:8a3e12a7ac1ff99aa5bab8f962254c422a46ce72cc854297f077aee4ade16899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:WJF2LXCEPMCAU7J4NCKG5PXO4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Architecture of a Quantum Multicomputer Optimized for Shor's Factoring Algorithm","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rodney Doyle Van Meter III","submitted_at":"2006-07-11T06:26:36Z","abstract_excerpt":"The quantum multicomputer consists of a large number of small nodes and a qubus interconnect for creating entangled state between the nodes. The primary metric chosen is the performance of such a system on Shor's algorithm for factoring large numbers: specifically, the quantum modular exponentiation step that is the computational bottleneck. This dissertation introduces a number of optimizations for the modular exponentiation. My algorithms reduce the latency, or circuit depth, to complete the modular exponentiation of an n-bit number from O(n^3) to O(n log^2 n) or O(n^2 log n), depending on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0607065","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0607065/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-04T14:56:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yj9QtfPqGeohfWMeOcGKs6pn3Y+OGxxoky8qCmD3CXYUkCh3ASs+MeZecFzwqBy8YHI7hpq/wFKP5sGFSp7uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:02:06.511477Z"},"content_sha256":"afab5e03e6be2d5a05821e71f5148ae3d61ef33ada1b1a8e43460dffd4f064eb","schema_version":"1.0","event_id":"sha256:afab5e03e6be2d5a05821e71f5148ae3d61ef33ada1b1a8e43460dffd4f064eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/bundle.json","state_url":"https://pith.science/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/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-09T11:02:06Z","links":{"resolver":"https://pith.science/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H","bundle":"https://pith.science/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/bundle.json","state":"https://pith.science/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJF2LXCEPMCAU7J4NCKG5PXO4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:WJF2LXCEPMCAU7J4NCKG5PXO4H","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":"e50e92ceee4720a01eb0da2a5d8e685a1b47aa90aab7465442f85b52023559be","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-07-11T06:26:36Z","title_canon_sha256":"e947be59b69ae996941f128c3310306aaab256ad6d2635d1d3cd86c705f4a7cd"},"schema_version":"1.0","source":{"id":"quant-ph/0607065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0607065","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0607065v1","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0607065","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_12","alias_value":"WJF2LXCEPMCA","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_16","alias_value":"WJF2LXCEPMCAU7J4","created_at":"2026-07-04T14:56:14Z"},{"alias_kind":"pith_short_8","alias_value":"WJF2LXCE","created_at":"2026-07-04T14:56:14Z"}],"graph_snapshots":[{"event_id":"sha256:afab5e03e6be2d5a05821e71f5148ae3d61ef33ada1b1a8e43460dffd4f064eb","target":"graph","created_at":"2026-07-04T14:56:14Z","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/quant-ph/0607065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum multicomputer consists of a large number of small nodes and a qubus interconnect for creating entangled state between the nodes. The primary metric chosen is the performance of such a system on Shor's algorithm for factoring large numbers: specifically, the quantum modular exponentiation step that is the computational bottleneck. This dissertation introduces a number of optimizations for the modular exponentiation. My algorithms reduce the latency, or circuit depth, to complete the modular exponentiation of an n-bit number from O(n^3) to O(n log^2 n) or O(n^2 log n), depending on a","authors_text":"Rodney Doyle Van Meter III","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-07-11T06:26:36Z","title":"Architecture of a Quantum Multicomputer Optimized for Shor's Factoring Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0607065","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:8a3e12a7ac1ff99aa5bab8f962254c422a46ce72cc854297f077aee4ade16899","target":"record","created_at":"2026-07-04T14:56:14Z","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":"e50e92ceee4720a01eb0da2a5d8e685a1b47aa90aab7465442f85b52023559be","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-07-11T06:26:36Z","title_canon_sha256":"e947be59b69ae996941f128c3310306aaab256ad6d2635d1d3cd86c705f4a7cd"},"schema_version":"1.0","source":{"id":"quant-ph/0607065","kind":"arxiv","version":1}},"canonical_sha256":"b24ba5dc447b040a7d3c68946ebeeee1fecb8892d9cb9261a0532989de438fdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b24ba5dc447b040a7d3c68946ebeeee1fecb8892d9cb9261a0532989de438fdd","first_computed_at":"2026-07-04T14:56:14.114525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:56:14.114525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7VeAPMZI3rJjH/rREldFBVVvON7SAtNoQ/hFNW0rcIUmqBArsbTOD//nZQVQhQjCzZ1wtlnTqFpOtSlba6MDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:56:14.114929Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0607065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a3e12a7ac1ff99aa5bab8f962254c422a46ce72cc854297f077aee4ade16899","sha256:afab5e03e6be2d5a05821e71f5148ae3d61ef33ada1b1a8e43460dffd4f064eb"],"state_sha256":"e6272b39970f64f19d02c0d4799e1557d49161eb9101a7175b11e1e0f8d924fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIOZ1XBiDfHLZtnrGZmJyleTGOtO+4VdaYYelToO6JdChhr5UbE5DKAgkgXWuyAsigga023EKX8y5trkZEvrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:02:06.515428Z","bundle_sha256":"3f413aab3e7bb0ef48195f71ff32e255fd07af000dafc33991b10a1188a24564"}}