{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:A7MNZJUJIQOWX4YDGJWFNUERR2","short_pith_number":"pith:A7MNZJUJ","canonical_record":{"source":{"id":"2212.02806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T07:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"668aeaab4b0522ecc8dfcced4b30794c418280df2472ae79c0f265857fea9099","abstract_canon_sha256":"b061ad1eca8d0bf224cf3722a1538b424cffcbc0c4b1a8ecddffa853e5c90556"},"schema_version":"1.0"},"canonical_sha256":"07d8dca689441d6bf303326c56d0918e931cb6c38a4452f2ffa747d5df501efe","source":{"kind":"arxiv","id":"2212.02806","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02806","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02806v2","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02806","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"A7MNZJUJIQOW","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_16","alias_value":"A7MNZJUJIQOWX4YD","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_8","alias_value":"A7MNZJUJ","created_at":"2026-07-05T05:23:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:A7MNZJUJIQOWX4YDGJWFNUERR2","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T07:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"668aeaab4b0522ecc8dfcced4b30794c418280df2472ae79c0f265857fea9099","abstract_canon_sha256":"b061ad1eca8d0bf224cf3722a1538b424cffcbc0c4b1a8ecddffa853e5c90556"},"schema_version":"1.0"},"canonical_sha256":"07d8dca689441d6bf303326c56d0918e931cb6c38a4452f2ffa747d5df501efe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:34.907384Z","signature_b64":"dcZFFhHjn/YOooxzOUFlnIR4+8yq0FkbyocoKo62lGz1LZbctpyzuXOqCSAm8dhHkFoI1nQ1ZlAbhY8glb6HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d8dca689441d6bf303326c56d0918e931cb6c38a4452f2ffa747d5df501efe","last_reissued_at":"2026-07-05T05:23:34.906813Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:34.906813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02806","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-05T05:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocmMKKODOsXcBOPPai0W0QV2yvj40YMg1p6tUpRs451PyPYZtyLVeZ53/lUkd+t+tFt/+r/VC7EozhpuDYk3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:34:59.529720Z"},"content_sha256":"6a06d1f26d2218c66f6c1ed3c43a985ad78884a0c8d44fb9df4493b2f424b390","schema_version":"1.0","event_id":"sha256:6a06d1f26d2218c66f6c1ed3c43a985ad78884a0c8d44fb9df4493b2f424b390"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:A7MNZJUJIQOWX4YDGJWFNUERR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Gradient Ascent Pulse Engineering algorithm for quantum optimal control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bi-Ying Wang, Jiangyu Cui, Man-Hong Yung, Ran Liu, Xinhua Peng, Yajie Hao, Yanjun Hou, Yuquan Chen, Ze Wu","submitted_at":"2022-12-06T07:55:25Z","abstract_excerpt":"Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits, which is a barrier for its application in large-qubit systems. To mitigate this issue, we propose an iterative GRAPE algorithm (iGRAPE) for preparing a desired quantum state, where the large-scale, resource-consuming optimization problem is decomposed into a set of lower-dimensional optimization subproblems by disentanglement operations. Consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02806","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/2212.02806/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-05T05:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyNBF+0TiZ+oA8ug+bi4qM1Ff5OABljaTpWaPZuX58rtr20Y1ljLTmASICxTNlDJvli6ff+U+S6dG5Kkj3VbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:34:59.530265Z"},"content_sha256":"9a7700029fce1766c7e7d4dab5faabfcacd441a2bcc28cf00364840d5d8094d2","schema_version":"1.0","event_id":"sha256:9a7700029fce1766c7e7d4dab5faabfcacd441a2bcc28cf00364840d5d8094d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/bundle.json","state_url":"https://pith.science/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/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-14T10:34:59Z","links":{"resolver":"https://pith.science/pith/A7MNZJUJIQOWX4YDGJWFNUERR2","bundle":"https://pith.science/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/bundle.json","state":"https://pith.science/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7MNZJUJIQOWX4YDGJWFNUERR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:A7MNZJUJIQOWX4YDGJWFNUERR2","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":"b061ad1eca8d0bf224cf3722a1538b424cffcbc0c4b1a8ecddffa853e5c90556","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T07:55:25Z","title_canon_sha256":"668aeaab4b0522ecc8dfcced4b30794c418280df2472ae79c0f265857fea9099"},"schema_version":"1.0","source":{"id":"2212.02806","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02806","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02806v2","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02806","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"A7MNZJUJIQOW","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_16","alias_value":"A7MNZJUJIQOWX4YD","created_at":"2026-07-05T05:23:34Z"},{"alias_kind":"pith_short_8","alias_value":"A7MNZJUJ","created_at":"2026-07-05T05:23:34Z"}],"graph_snapshots":[{"event_id":"sha256:9a7700029fce1766c7e7d4dab5faabfcacd441a2bcc28cf00364840d5d8094d2","target":"graph","created_at":"2026-07-05T05:23:34Z","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/2212.02806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits, which is a barrier for its application in large-qubit systems. To mitigate this issue, we propose an iterative GRAPE algorithm (iGRAPE) for preparing a desired quantum state, where the large-scale, resource-consuming optimization problem is decomposed into a set of lower-dimensional optimization subproblems by disentanglement operations. Consequ","authors_text":"Bi-Ying Wang, Jiangyu Cui, Man-Hong Yung, Ran Liu, Xinhua Peng, Yajie Hao, Yanjun Hou, Yuquan Chen, Ze Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T07:55:25Z","title":"Iterative Gradient Ascent Pulse Engineering algorithm for quantum optimal control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02806","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:6a06d1f26d2218c66f6c1ed3c43a985ad78884a0c8d44fb9df4493b2f424b390","target":"record","created_at":"2026-07-05T05:23:34Z","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":"b061ad1eca8d0bf224cf3722a1538b424cffcbc0c4b1a8ecddffa853e5c90556","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-06T07:55:25Z","title_canon_sha256":"668aeaab4b0522ecc8dfcced4b30794c418280df2472ae79c0f265857fea9099"},"schema_version":"1.0","source":{"id":"2212.02806","kind":"arxiv","version":2}},"canonical_sha256":"07d8dca689441d6bf303326c56d0918e931cb6c38a4452f2ffa747d5df501efe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d8dca689441d6bf303326c56d0918e931cb6c38a4452f2ffa747d5df501efe","first_computed_at":"2026-07-05T05:23:34.906813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:34.906813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dcZFFhHjn/YOooxzOUFlnIR4+8yq0FkbyocoKo62lGz1LZbctpyzuXOqCSAm8dhHkFoI1nQ1ZlAbhY8glb6HCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:34.907384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02806","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a06d1f26d2218c66f6c1ed3c43a985ad78884a0c8d44fb9df4493b2f424b390","sha256:9a7700029fce1766c7e7d4dab5faabfcacd441a2bcc28cf00364840d5d8094d2"],"state_sha256":"1255e8291e3d6c468da7d16d1bf2a4101f58f770f0a95c97b614c6db34426b21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOn5lT+Scwnhia9XoAcjWWN20Z2n0DZD3yzqzQiU87TTebtUe6GOxNRSGlc3mrFvLlz4UWfXvb/CniVKr/CpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T10:34:59.535793Z","bundle_sha256":"1661bf33b96b4c65654a327550400f031c4efc206a2de9f59418a1085e053f8f"}}