{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PVAPER4YLAKV3QCDFTA4SKHQUW","short_pith_number":"pith:PVAPER4Y","canonical_record":{"source":{"id":"2304.12100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"0f32c9793aacfdad99dd3cc4bc9bd2048926a8383c67464784f504b8ff86c971","abstract_canon_sha256":"a7858c47145bceb621e7abdf2202e4b8a8d118868428c9ab8d74d783c17a36c2"},"schema_version":"1.0"},"canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","source":{"kind":"arxiv","id":"2304.12100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.12100","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"2304.12100v2","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12100","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"PVAPER4YLAKV","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_16","alias_value":"PVAPER4YLAKV3QCD","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_8","alias_value":"PVAPER4Y","created_at":"2026-07-05T09:48:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PVAPER4YLAKV3QCDFTA4SKHQUW","target":"record","payload":{"canonical_record":{"source":{"id":"2304.12100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"0f32c9793aacfdad99dd3cc4bc9bd2048926a8383c67464784f504b8ff86c971","abstract_canon_sha256":"a7858c47145bceb621e7abdf2202e4b8a8d118868428c9ab8d74d783c17a36c2"},"schema_version":"1.0"},"canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:29.111794Z","signature_b64":"ITIKrSWj6/T0hsu25vSD0jWCpzL6v9nqxcTcqH+6utWENZFfwLE+30jqlla35Uxq9YInWut8RpPZjQwvgiqJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","last_reissued_at":"2026-07-05T09:48:29.111309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:29.111309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.12100","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-05T09:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNcBESleU8En6g1SbZU4skvq7u4bhQRiRwR7/IGAvAVkNtP2LiQP/M4n+ldeyezMRK9vhtSUoXaLSlJ7/P0MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:37.702545Z"},"content_sha256":"dc0c486977435c2cf0d52d558f20ef1c280cc089d6ccb20ff4b8df8b4ac0505d","schema_version":"1.0","event_id":"sha256:dc0c486977435c2cf0d52d558f20ef1c280cc089d6ccb20ff4b8df8b4ac0505d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PVAPER4YLAKV3QCDFTA4SKHQUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Le Luo, Ligang Xiao, Paulo Mateus","submitted_at":"2023-04-24T13:52:05Z","abstract_excerpt":"Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12100","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/2304.12100/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-05T09:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"td76w3uggAE9KpumWo9jhbZcqVLRv6dnR0P+x3dxcjmXsNU1vruYIj0yGC/oxv/932J3Yhdf6HKmsTYgr6AqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:12:37.703105Z"},"content_sha256":"22e8fa58aa2ff2568462bb6a549f8446b782d8be8edfaff5b0c7442898d82cb9","schema_version":"1.0","event_id":"sha256:22e8fa58aa2ff2568462bb6a549f8446b782d8be8edfaff5b0c7442898d82cb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/bundle.json","state_url":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/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-10T03:12:37Z","links":{"resolver":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW","bundle":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/bundle.json","state":"https://pith.science/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVAPER4YLAKV3QCDFTA4SKHQUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PVAPER4YLAKV3QCDFTA4SKHQUW","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":"a7858c47145bceb621e7abdf2202e4b8a8d118868428c9ab8d74d783c17a36c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","title_canon_sha256":"0f32c9793aacfdad99dd3cc4bc9bd2048926a8383c67464784f504b8ff86c971"},"schema_version":"1.0","source":{"id":"2304.12100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.12100","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"2304.12100v2","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.12100","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"PVAPER4YLAKV","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_16","alias_value":"PVAPER4YLAKV3QCD","created_at":"2026-07-05T09:48:29Z"},{"alias_kind":"pith_short_8","alias_value":"PVAPER4Y","created_at":"2026-07-05T09:48:29Z"}],"graph_snapshots":[{"event_id":"sha256:22e8fa58aa2ff2568462bb6a549f8446b782d8be8edfaff5b0c7442898d82cb9","target":"graph","created_at":"2026-07-05T09:48:29Z","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/2304.12100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the NISQ (Noisy Intermediate-scale Quantum) era. To reduce the resources required for Shor's algorithm, in this paper we first propose a new distributed phase estimation algorithm. Our distributed phase estimation algorithm does not require quantum communication and it reduces the number of qubits of a single node compared to the traditional phase estimation algo","authors_text":"Daowen Qiu, Le Luo, Ligang Xiao, Paulo Mateus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","title":"Distributed Phase Estimation Algorithm and Distributed Shor's Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.12100","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:dc0c486977435c2cf0d52d558f20ef1c280cc089d6ccb20ff4b8df8b4ac0505d","target":"record","created_at":"2026-07-05T09:48:29Z","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":"a7858c47145bceb621e7abdf2202e4b8a8d118868428c9ab8d74d783c17a36c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-24T13:52:05Z","title_canon_sha256":"0f32c9793aacfdad99dd3cc4bc9bd2048926a8383c67464784f504b8ff86c971"},"schema_version":"1.0","source":{"id":"2304.12100","kind":"arxiv","version":2}},"canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d40f2479858155dc0432cc1c928f0a5beaa882cf3e77d3c68b24cb2851d0ae3","first_computed_at":"2026-07-05T09:48:29.111309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:48:29.111309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ITIKrSWj6/T0hsu25vSD0jWCpzL6v9nqxcTcqH+6utWENZFfwLE+30jqlla35Uxq9YInWut8RpPZjQwvgiqJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:48:29.111794Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.12100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0c486977435c2cf0d52d558f20ef1c280cc089d6ccb20ff4b8df8b4ac0505d","sha256:22e8fa58aa2ff2568462bb6a549f8446b782d8be8edfaff5b0c7442898d82cb9"],"state_sha256":"1b669491777f90c3d5bb652475a203796ad578b5217508ece6dd15ef0a558857"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFiEJ69+7rooqaeoTMxscW3+NgJVdQjv5lwZ+T8DBuewcu/pe4dEktCDDcadkHthlZHVWbiSJeFia43L6h/xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:12:37.707871Z","bundle_sha256":"d09664572a031464f00bbb73b484f6c44421a2f125e5539fd0645532df03ee86"}}