{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:E53H5HE6SPZS2GWQI3HB6G364T","short_pith_number":"pith:E53H5HE6","canonical_record":{"source":{"id":"2405.18143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-28T13:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"bf6a07a93bd0f60b4e1dbaef63c3a8873a348c73bb86187068cd97b1e8a47e88","abstract_canon_sha256":"33302799d9827ece83940adb594f2aeb73a2348e5aa8cb38e6b103000fe67d80"},"schema_version":"1.0"},"canonical_sha256":"27767e9c9e93f32d1ad046ce1f1b7ee4fcd25c1f5dfaf2e13136580dd752f1f2","source":{"kind":"arxiv","id":"2405.18143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18143","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18143v1","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18143","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"E53H5HE6SPZS","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_16","alias_value":"E53H5HE6SPZS2GWQ","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_8","alias_value":"E53H5HE6","created_at":"2026-07-05T08:24:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:E53H5HE6SPZS2GWQI3HB6G364T","target":"record","payload":{"canonical_record":{"source":{"id":"2405.18143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-28T13:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"bf6a07a93bd0f60b4e1dbaef63c3a8873a348c73bb86187068cd97b1e8a47e88","abstract_canon_sha256":"33302799d9827ece83940adb594f2aeb73a2348e5aa8cb38e6b103000fe67d80"},"schema_version":"1.0"},"canonical_sha256":"27767e9c9e93f32d1ad046ce1f1b7ee4fcd25c1f5dfaf2e13136580dd752f1f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:16.198950Z","signature_b64":"RgkeoM4xf7f7pMN8BUA8DrkYwPYazCqhw1mLjDFKRIt3YvjBWWcYgLVvbi/pCmjtffamSCf6f/UOlX6vdTYBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27767e9c9e93f32d1ad046ce1f1b7ee4fcd25c1f5dfaf2e13136580dd752f1f2","last_reissued_at":"2026-07-05T08:24:16.198545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:16.198545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.18143","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-05T08:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/l/O1UyXH1sndm3FNt26rw6y/dYsO9w1pja6Xjwa3PgGQzh7kCbfzzuoZRVF62m/ahU4+TMNo5lmfJydFhGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:35:51.337022Z"},"content_sha256":"7f591787374fed2104b6371f113b1e3806ec519ce7cb1f51a46cdf799039bd64","schema_version":"1.0","event_id":"sha256:7f591787374fed2104b6371f113b1e3806ec519ce7cb1f51a46cdf799039bd64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:E53H5HE6SPZS2GWQI3HB6G364T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simon algorithm in measurement-based quantum computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Maximilian Schwetz, Reinhard M. Noack","submitted_at":"2024-05-28T13:02:54Z","abstract_excerpt":"Simon's hidden subgroup algorithm was the first quantum algorithm to prove the superiority of quantum computing over classical computing in terms of complexity. Measurement-based quantum computing (MBQC) is a formulation of quantum computing that, while equivalent in terms of computational power, can be advantageous in experiments and in displaying the core mechanics of quantum algorithms. We present a reformulation of the Simon algorithm into the language of MBQC -- in detail for two qubits and schematically for $n$ qubits. We utilize the framework of ZX-calculus, a graphical tensor descripti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18143","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/2405.18143/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-05T08:24:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ma3f8OwoQVaH+JlumZgnRVMC8S65mK/n6nsSSbnCgbS46jL24xKqC9e0p4pQoo36EYdx0YEcG6hCm2sPqXsrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:35:51.337574Z"},"content_sha256":"763860d6547b4e68c672659587304031b8a5fecbc8627664946bad28c5097524","schema_version":"1.0","event_id":"sha256:763860d6547b4e68c672659587304031b8a5fecbc8627664946bad28c5097524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E53H5HE6SPZS2GWQI3HB6G364T/bundle.json","state_url":"https://pith.science/pith/E53H5HE6SPZS2GWQI3HB6G364T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E53H5HE6SPZS2GWQI3HB6G364T/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-20T05:35:51Z","links":{"resolver":"https://pith.science/pith/E53H5HE6SPZS2GWQI3HB6G364T","bundle":"https://pith.science/pith/E53H5HE6SPZS2GWQI3HB6G364T/bundle.json","state":"https://pith.science/pith/E53H5HE6SPZS2GWQI3HB6G364T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E53H5HE6SPZS2GWQI3HB6G364T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:E53H5HE6SPZS2GWQI3HB6G364T","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":"33302799d9827ece83940adb594f2aeb73a2348e5aa8cb38e6b103000fe67d80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-28T13:02:54Z","title_canon_sha256":"bf6a07a93bd0f60b4e1dbaef63c3a8873a348c73bb86187068cd97b1e8a47e88"},"schema_version":"1.0","source":{"id":"2405.18143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18143","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18143v1","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18143","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"E53H5HE6SPZS","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_16","alias_value":"E53H5HE6SPZS2GWQ","created_at":"2026-07-05T08:24:16Z"},{"alias_kind":"pith_short_8","alias_value":"E53H5HE6","created_at":"2026-07-05T08:24:16Z"}],"graph_snapshots":[{"event_id":"sha256:763860d6547b4e68c672659587304031b8a5fecbc8627664946bad28c5097524","target":"graph","created_at":"2026-07-05T08:24:16Z","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/2405.18143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Simon's hidden subgroup algorithm was the first quantum algorithm to prove the superiority of quantum computing over classical computing in terms of complexity. Measurement-based quantum computing (MBQC) is a formulation of quantum computing that, while equivalent in terms of computational power, can be advantageous in experiments and in displaying the core mechanics of quantum algorithms. We present a reformulation of the Simon algorithm into the language of MBQC -- in detail for two qubits and schematically for $n$ qubits. We utilize the framework of ZX-calculus, a graphical tensor descripti","authors_text":"Maximilian Schwetz, Reinhard M. Noack","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-28T13:02:54Z","title":"Simon algorithm in measurement-based quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18143","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:7f591787374fed2104b6371f113b1e3806ec519ce7cb1f51a46cdf799039bd64","target":"record","created_at":"2026-07-05T08:24:16Z","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":"33302799d9827ece83940adb594f2aeb73a2348e5aa8cb38e6b103000fe67d80","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-28T13:02:54Z","title_canon_sha256":"bf6a07a93bd0f60b4e1dbaef63c3a8873a348c73bb86187068cd97b1e8a47e88"},"schema_version":"1.0","source":{"id":"2405.18143","kind":"arxiv","version":1}},"canonical_sha256":"27767e9c9e93f32d1ad046ce1f1b7ee4fcd25c1f5dfaf2e13136580dd752f1f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27767e9c9e93f32d1ad046ce1f1b7ee4fcd25c1f5dfaf2e13136580dd752f1f2","first_computed_at":"2026-07-05T08:24:16.198545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:16.198545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RgkeoM4xf7f7pMN8BUA8DrkYwPYazCqhw1mLjDFKRIt3YvjBWWcYgLVvbi/pCmjtffamSCf6f/UOlX6vdTYBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:16.198950Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.18143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f591787374fed2104b6371f113b1e3806ec519ce7cb1f51a46cdf799039bd64","sha256:763860d6547b4e68c672659587304031b8a5fecbc8627664946bad28c5097524"],"state_sha256":"b2eb1877394901343dcd169eacce3b2cda0748fbae197d613bcf5247af6c0a77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYGzfFxELSkUeFNeb3KvmhIT3Vy7K291rvpjSvEBiownmg2nvJ8qtGTNYKgPI24G9tXBE+48UKhuHBfBdxB2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T05:35:51.342547Z","bundle_sha256":"9cfced34115c3ec75a7f373a0e9309b130388548d36edfd4f2e76d4702e3f451"}}