{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5SEA3ZLIQVYPPPKNCBZZBNTHS2","short_pith_number":"pith:5SEA3ZLI","canonical_record":{"source":{"id":"2112.10943","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"aad2aab2664a17af11e99ad083049224b81fa34cac6141c15949f5d28c892fc1","abstract_canon_sha256":"5ceaac9543cda86e6dd23b26fe28fc00ab9fb4d4cc93544b90cdcf8855648a27"},"schema_version":"1.0"},"canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","source":{"kind":"arxiv","id":"2112.10943","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.10943","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"2112.10943v3","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10943","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"5SEA3ZLIQVYP","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_16","alias_value":"5SEA3ZLIQVYPPPKN","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_8","alias_value":"5SEA3ZLI","created_at":"2026-07-05T04:17:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5SEA3ZLIQVYPPPKNCBZZBNTHS2","target":"record","payload":{"canonical_record":{"source":{"id":"2112.10943","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"aad2aab2664a17af11e99ad083049224b81fa34cac6141c15949f5d28c892fc1","abstract_canon_sha256":"5ceaac9543cda86e6dd23b26fe28fc00ab9fb4d4cc93544b90cdcf8855648a27"},"schema_version":"1.0"},"canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:19.501569Z","signature_b64":"yKGvWIEDMg9ilvtUvDn902/T94j9EXM+NMsHKhUEOeCY7fgDw5QoyQRzSk6jl8P0FmeH8RQYfY2HLKD8AQQjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","last_reissued_at":"2026-07-05T04:17:19.501062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:19.501062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.10943","source_version":3,"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-05T04:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxvOqLQ1Pt8Db0bYo2DEvVlQfy5COT4A5DefHDDxcyE4Kunaw2H/CN0TYMOtF2tCu2IJ0idUWSvVPKvvKGXSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:40:39.444765Z"},"content_sha256":"945b0b69b1ceafa64144967f99a565edf57e2cd5075e105fd01f8b3ff75b570c","schema_version":"1.0","event_id":"sha256:945b0b69b1ceafa64144967f99a565edf57e2cd5075e105fd01f8b3ff75b570c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5SEA3ZLIQVYPPPKNCBZZBNTHS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortcuts to Quantum Approximate Optimization Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo-Ping Guo, Menghan Dou, Yahui Chai, Ye Li, Yong-Jian Han, Yu-Chun Wu","submitted_at":"2021-12-21T02:24:19Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as \"Shortcuts to QAOA\" (S-QAOA), S-QAOA provides shortcuts to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10943","kind":"arxiv","version":3},"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/2112.10943/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-05T04:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6dVEVBQy8UEbc7STl6idtcsuSG1mhAukjRhKkAVJY7+ycUhA7T7pklHJVcukyqYrUJ8EJHnH61SJGOyRcR7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:40:39.445257Z"},"content_sha256":"5efcdd035d3b5055aac2718fb81793569fc3fdbf921b6cac884e7171849883cc","schema_version":"1.0","event_id":"sha256:5efcdd035d3b5055aac2718fb81793569fc3fdbf921b6cac884e7171849883cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/bundle.json","state_url":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/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-07T07:40:39Z","links":{"resolver":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2","bundle":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/bundle.json","state":"https://pith.science/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SEA3ZLIQVYPPPKNCBZZBNTHS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5SEA3ZLIQVYPPPKNCBZZBNTHS2","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":"5ceaac9543cda86e6dd23b26fe28fc00ab9fb4d4cc93544b90cdcf8855648a27","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","title_canon_sha256":"aad2aab2664a17af11e99ad083049224b81fa34cac6141c15949f5d28c892fc1"},"schema_version":"1.0","source":{"id":"2112.10943","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.10943","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"2112.10943v3","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10943","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"5SEA3ZLIQVYP","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_16","alias_value":"5SEA3ZLIQVYPPPKN","created_at":"2026-07-05T04:17:19Z"},{"alias_kind":"pith_short_8","alias_value":"5SEA3ZLI","created_at":"2026-07-05T04:17:19Z"}],"graph_snapshots":[{"event_id":"sha256:5efcdd035d3b5055aac2718fb81793569fc3fdbf921b6cac884e7171849883cc","target":"graph","created_at":"2026-07-05T04:17:19Z","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/2112.10943/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise-free and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose a new ansatz dubbed as \"Shortcuts to QAOA\" (S-QAOA), S-QAOA provides shortcuts to th","authors_text":"Guo-Ping Guo, Menghan Dou, Yahui Chai, Ye Li, Yong-Jian Han, Yu-Chun Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","title":"Shortcuts to Quantum Approximate Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10943","kind":"arxiv","version":3},"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:945b0b69b1ceafa64144967f99a565edf57e2cd5075e105fd01f8b3ff75b570c","target":"record","created_at":"2026-07-05T04:17:19Z","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":"5ceaac9543cda86e6dd23b26fe28fc00ab9fb4d4cc93544b90cdcf8855648a27","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-21T02:24:19Z","title_canon_sha256":"aad2aab2664a17af11e99ad083049224b81fa34cac6141c15949f5d28c892fc1"},"schema_version":"1.0","source":{"id":"2112.10943","kind":"arxiv","version":3}},"canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec880de5688570f7bd4d107390b66796839dd5097cdf9c5600e6b318d5a750a8","first_computed_at":"2026-07-05T04:17:19.501062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:17:19.501062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKGvWIEDMg9ilvtUvDn902/T94j9EXM+NMsHKhUEOeCY7fgDw5QoyQRzSk6jl8P0FmeH8RQYfY2HLKD8AQQjAw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:17:19.501569Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.10943","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:945b0b69b1ceafa64144967f99a565edf57e2cd5075e105fd01f8b3ff75b570c","sha256:5efcdd035d3b5055aac2718fb81793569fc3fdbf921b6cac884e7171849883cc"],"state_sha256":"74a7e44436e1c805ab29b306d2eabb8b55f7d3e46a98edc9133f4bb725387157"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrPynnmyyDmXT0jP8w3USqw7yrHNf2QXbxbMbtGcBKB26U7vv1p7nmLDvfKE05dzLdQZVft55MbYOIWANoUEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:40:39.450181Z","bundle_sha256":"87552bcbdb9a1c37ac62c8b9d720c5c2550dd1cc4265413d97c310466f48346d"}}