{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5WYU5KUT65I2YW5FWMKF7IVCDY","short_pith_number":"pith:5WYU5KUT","canonical_record":{"source":{"id":"2207.14464","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-29T04:05:46Z","cross_cats_sorted":[],"title_canon_sha256":"f1a3bea25517226ef6c7dd75523b624009a630b145a261ac42180abd75581db6","abstract_canon_sha256":"b317f59c82121a3c901c8d05dc56a4dfb582d0dd632bdfa107f7a31b6aa7b2aa"},"schema_version":"1.0"},"canonical_sha256":"edb14eaa93f751ac5ba5b3145fa2a21e180289bbd07f8b85517e62b42140a51a","source":{"kind":"arxiv","id":"2207.14464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.14464","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2207.14464v2","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14464","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"5WYU5KUT65I2","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"5WYU5KUT65I2YW5F","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"5WYU5KUT","created_at":"2026-07-05T06:38:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5WYU5KUT65I2YW5FWMKF7IVCDY","target":"record","payload":{"canonical_record":{"source":{"id":"2207.14464","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-29T04:05:46Z","cross_cats_sorted":[],"title_canon_sha256":"f1a3bea25517226ef6c7dd75523b624009a630b145a261ac42180abd75581db6","abstract_canon_sha256":"b317f59c82121a3c901c8d05dc56a4dfb582d0dd632bdfa107f7a31b6aa7b2aa"},"schema_version":"1.0"},"canonical_sha256":"edb14eaa93f751ac5ba5b3145fa2a21e180289bbd07f8b85517e62b42140a51a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:38:27.126487Z","signature_b64":"0JSbCzl1kRMeLdm4QJwTWPGGtVZAqGfUKQEQd2P8RdNo2yJLfdZopFsm1AlTR6SKPsewr/UKAFXsL0hNXucWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb14eaa93f751ac5ba5b3145fa2a21e180289bbd07f8b85517e62b42140a51a","last_reissued_at":"2026-07-05T06:38:27.125979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:38:27.125979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.14464","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-05T06:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rVU6Xkr+6CPpqlmUBJBtHtUZO9nRXxAmAGsYJ3OziOOIw4rPsDjrlQUK1vZTV5GZ+cihcuXtLExiVi9Mt7xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:43:46.159055Z"},"content_sha256":"1ebb8d616b8bfd5c102adb6c7dafd04edfcbfa1060cd74276b31af10bf0098c6","schema_version":"1.0","event_id":"sha256:1ebb8d616b8bfd5c102adb6c7dafd04edfcbfa1060cd74276b31af10bf0098c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5WYU5KUT65I2YW5FWMKF7IVCDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum multi-programming for Grover's search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gilchan Park, Kun Zhang, Kwangmin Yu, Vladimir Korepin","submitted_at":"2022-07-29T04:05:46Z","abstract_excerpt":"Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14464","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/2207.14464/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-05T06:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXYQQOuEcJPy/lWY3TEnsnDjSaaOCZNoi3VVnbUvn+EkIYcUbih9WCyLJU0O52OD86uJfz1fRZStah7BqKROCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:43:46.159547Z"},"content_sha256":"41e5ea3f6a4afa6754743c570fd3c2629a201f8ce3320f40c1f984ba0f3865ae","schema_version":"1.0","event_id":"sha256:41e5ea3f6a4afa6754743c570fd3c2629a201f8ce3320f40c1f984ba0f3865ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/bundle.json","state_url":"https://pith.science/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/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-14T17:43:46Z","links":{"resolver":"https://pith.science/pith/5WYU5KUT65I2YW5FWMKF7IVCDY","bundle":"https://pith.science/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/bundle.json","state":"https://pith.science/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WYU5KUT65I2YW5FWMKF7IVCDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5WYU5KUT65I2YW5FWMKF7IVCDY","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":"b317f59c82121a3c901c8d05dc56a4dfb582d0dd632bdfa107f7a31b6aa7b2aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-29T04:05:46Z","title_canon_sha256":"f1a3bea25517226ef6c7dd75523b624009a630b145a261ac42180abd75581db6"},"schema_version":"1.0","source":{"id":"2207.14464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.14464","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2207.14464v2","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14464","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"5WYU5KUT65I2","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"5WYU5KUT65I2YW5F","created_at":"2026-07-05T06:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"5WYU5KUT","created_at":"2026-07-05T06:38:27Z"}],"graph_snapshots":[{"event_id":"sha256:41e5ea3f6a4afa6754743c570fd3c2629a201f8ce3320f40c1f984ba0f3865ae","target":"graph","created_at":"2026-07-05T06:38:27Z","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/2207.14464/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as","authors_text":"Gilchan Park, Kun Zhang, Kwangmin Yu, Vladimir Korepin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-29T04:05:46Z","title":"Quantum multi-programming for Grover's search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14464","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:1ebb8d616b8bfd5c102adb6c7dafd04edfcbfa1060cd74276b31af10bf0098c6","target":"record","created_at":"2026-07-05T06:38:27Z","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":"b317f59c82121a3c901c8d05dc56a4dfb582d0dd632bdfa107f7a31b6aa7b2aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-29T04:05:46Z","title_canon_sha256":"f1a3bea25517226ef6c7dd75523b624009a630b145a261ac42180abd75581db6"},"schema_version":"1.0","source":{"id":"2207.14464","kind":"arxiv","version":2}},"canonical_sha256":"edb14eaa93f751ac5ba5b3145fa2a21e180289bbd07f8b85517e62b42140a51a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb14eaa93f751ac5ba5b3145fa2a21e180289bbd07f8b85517e62b42140a51a","first_computed_at":"2026-07-05T06:38:27.125979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:38:27.125979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JSbCzl1kRMeLdm4QJwTWPGGtVZAqGfUKQEQd2P8RdNo2yJLfdZopFsm1AlTR6SKPsewr/UKAFXsL0hNXucWDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:38:27.126487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.14464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ebb8d616b8bfd5c102adb6c7dafd04edfcbfa1060cd74276b31af10bf0098c6","sha256:41e5ea3f6a4afa6754743c570fd3c2629a201f8ce3320f40c1f984ba0f3865ae"],"state_sha256":"1bbab93272a8cc9a6c22f5ec58935bfbc607920b7dc04c1b6efcceaa29fca48e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTsYIyNGZIa3eSIvH3LlReeXNjFQtRE4Jy0kCUw/GRTsKBD3TUjYZpO7AyU4u7KsFhHkItwQs+ttArXHhFejAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T17:43:46.167470Z","bundle_sha256":"b8dc45f0244421aa106768b135dc0ec76e9d1e54472285df9872526d21975cca"}}