{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DVGNJGGIU3WODEN5NMSRSQGL5C","short_pith_number":"pith:DVGNJGGI","canonical_record":{"source":{"id":"1708.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"2b8bc47320f603abba707286b578b1754ecea5bf358752bffe41f69d5def3e5c","abstract_canon_sha256":"3c57e4a61ef2cb28d41924e150c24a478f13adf7d881d6e5e8c8e91789e09a60"},"schema_version":"1.0"},"canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","source":{"kind":"arxiv","id":"1708.07900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07900","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07900v2","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07900","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"DVGNJGGIU3WO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVGNJGGIU3WODEN5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVGNJGGI","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DVGNJGGIU3WODEN5NMSRSQGL5C","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"2b8bc47320f603abba707286b578b1754ecea5bf358752bffe41f69d5def3e5c","abstract_canon_sha256":"3c57e4a61ef2cb28d41924e150c24a478f13adf7d881d6e5e8c8e91789e09a60"},"schema_version":"1.0"},"canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:04.528299Z","signature_b64":"8XPF3X43yj7iNAdyNiW9mKZd2OdCFZ2dR97dpCJnbkVhZFdtQEJvBLiWYV+o+c2xNNO2+Wb2cG9Aj4wRFLp6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","last_reissued_at":"2026-05-18T00:27:04.527673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:04.527673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07900","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-05-18T00:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAvzE+P3+QvmOm7hN/R54l+oyofCfm1+4WCTJY4vp8GSpBdSN7qyTwClX2RxguwCsLD9FXy2aiZ61je4hIYqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:52:58.826745Z"},"content_sha256":"b0b8ef1e18a2bebf8298fa89a717d51a3097297551563240d7ec70c1e460e37d","schema_version":"1.0","event_id":"sha256:b0b8ef1e18a2bebf8298fa89a717d51a3097297551563240d7ec70c1e460e37d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DVGNJGGIU3WODEN5NMSRSQGL5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization and experimental realization of the quantum permutation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"\\.I. Yal\\c{c}{\\i}nkaya, Z. Gedik","submitted_at":"2017-08-25T21:57:01Z","abstract_excerpt":"The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07900","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":""},"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-18T00:27:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTw9MwdVB4rIJ9UQAHT/2bhZpRbi2nUamcDtZMtS79dH2+CjBkxBlZt6Mni/1tbNawXSBMHTFbkNsynGb3MOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:52:58.827089Z"},"content_sha256":"a510369029ea176c3e1c54914d2e0eaf9ff8ee5d416ef9e2e6b3a457ccb288e7","schema_version":"1.0","event_id":"sha256:a510369029ea176c3e1c54914d2e0eaf9ff8ee5d416ef9e2e6b3a457ccb288e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/bundle.json","state_url":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/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-26T05:52:58Z","links":{"resolver":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C","bundle":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/bundle.json","state":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DVGNJGGIU3WODEN5NMSRSQGL5C","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":"3c57e4a61ef2cb28d41924e150c24a478f13adf7d881d6e5e8c8e91789e09a60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","title_canon_sha256":"2b8bc47320f603abba707286b578b1754ecea5bf358752bffe41f69d5def3e5c"},"schema_version":"1.0","source":{"id":"1708.07900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07900","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07900v2","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07900","created_at":"2026-05-18T00:27:04Z"},{"alias_kind":"pith_short_12","alias_value":"DVGNJGGIU3WO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVGNJGGIU3WODEN5","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVGNJGGI","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a510369029ea176c3e1c54914d2e0eaf9ff8ee5d416ef9e2e6b3a457ccb288e7","target":"graph","created_at":"2026-05-18T00:27:04Z","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":"The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm ","authors_text":"\\.I. Yal\\c{c}{\\i}nkaya, Z. Gedik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","title":"Optimization and experimental realization of the quantum permutation algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07900","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:b0b8ef1e18a2bebf8298fa89a717d51a3097297551563240d7ec70c1e460e37d","target":"record","created_at":"2026-05-18T00:27:04Z","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":"3c57e4a61ef2cb28d41924e150c24a478f13adf7d881d6e5e8c8e91789e09a60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","title_canon_sha256":"2b8bc47320f603abba707286b578b1754ecea5bf358752bffe41f69d5def3e5c"},"schema_version":"1.0","source":{"id":"1708.07900","kind":"arxiv","version":2}},"canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","first_computed_at":"2026-05-18T00:27:04.527673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:04.527673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8XPF3X43yj7iNAdyNiW9mKZd2OdCFZ2dR97dpCJnbkVhZFdtQEJvBLiWYV+o+c2xNNO2+Wb2cG9Aj4wRFLp6Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:04.528299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0b8ef1e18a2bebf8298fa89a717d51a3097297551563240d7ec70c1e460e37d","sha256:a510369029ea176c3e1c54914d2e0eaf9ff8ee5d416ef9e2e6b3a457ccb288e7"],"state_sha256":"7f0322c64dee1320d06cb0d681c9c8727428c2f7b1a3ae4baa7b398feb0e2f71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTlEnvTW61fqK5opo10tvwvg89v8BKY621wQspDcXZEfxrMKyTlrttWivvDAqjBnUzjrv8OqyCM+Q4Cv9K3yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:52:58.829051Z","bundle_sha256":"a99a5ed2d9ff147a9f82c205de561b78e761e926c8ad395c510d21ded16afb4c"}}