{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6MOVNOGXCT24KOEDRZE4H7JG7C","short_pith_number":"pith:6MOVNOGX","canonical_record":{"source":{"id":"2312.06181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-11T07:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"0bbea5d0ded3d61b5323b0add44328e49e6698f3fb69668b8be0828e0d4a0464","abstract_canon_sha256":"5a1e29a797b00e99b696c2d541c61570b375cf4fd0e6d4c3d766f704b85dd2f8"},"schema_version":"1.0"},"canonical_sha256":"f31d56b8d714f5c538838e49c3fd26f89736ed8fe3e353474fa85de4839ec085","source":{"kind":"arxiv","id":"2312.06181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.06181","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"2312.06181v1","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.06181","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"6MOVNOGXCT24","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_16","alias_value":"6MOVNOGXCT24KOED","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_8","alias_value":"6MOVNOGX","created_at":"2026-07-05T07:22:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6MOVNOGXCT24KOEDRZE4H7JG7C","target":"record","payload":{"canonical_record":{"source":{"id":"2312.06181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-11T07:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"0bbea5d0ded3d61b5323b0add44328e49e6698f3fb69668b8be0828e0d4a0464","abstract_canon_sha256":"5a1e29a797b00e99b696c2d541c61570b375cf4fd0e6d4c3d766f704b85dd2f8"},"schema_version":"1.0"},"canonical_sha256":"f31d56b8d714f5c538838e49c3fd26f89736ed8fe3e353474fa85de4839ec085","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:40.032706Z","signature_b64":"UVSWuL1f+oE1IVKpCqDpFnvNnpoyXjXbeqzqptBJ1KReQyRkoREM43U2c1cyGMQMrTQFv/Bn6Q/PO2F/2x69DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f31d56b8d714f5c538838e49c3fd26f89736ed8fe3e353474fa85de4839ec085","last_reissued_at":"2026-07-05T07:22:40.032223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:40.032223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.06181","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-05T07:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfcKkg7fbJEg/QWqVFt5R2Pl+6YlohxDOtV3HinPVr2gzN/xSV4OMGhJqRPyvKd3oZvKLYuiT+u1fZK2OoNDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:10:09.660651Z"},"content_sha256":"c759d9e6cf718631ee555f2911ccec41fe5874ca2f0a94912e9dbc6aedc8bdbc","schema_version":"1.0","event_id":"sha256:c759d9e6cf718631ee555f2911ccec41fe5874ca2f0a94912e9dbc6aedc8bdbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6MOVNOGXCT24KOEDRZE4H7JG7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiscale Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ping Zou","submitted_at":"2023-12-11T07:47:16Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the canonical algorithms designed to find approximate solutions to combinatorial optimization problems in current noisy intermediate-scale quantum (NISQ) devices. It is an active area of research to exhibit its speedup over classical algorithms. The performance of the QAOA at low depths is limited, while the QAOA at higher depths is constrained by the current techniques. We propose a new version of QAOA that incorporates the capabilities of QAOA and the real-space renormalization group transformation, resulting in enhanced perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.06181","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/2312.06181/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-05T07:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ggeSsuhthP6hQnGU01ic8z0J/imNLQ2KtOhJOXfIKXj1QKDL+cU8DTaz2nz6sObmSFjr7pgabtJrzjb+8JyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:10:09.661161Z"},"content_sha256":"2b1e8b3867f02740a7a0fb3ed3c69067fc5c666f2ac98e9484e38ebbac659d6e","schema_version":"1.0","event_id":"sha256:2b1e8b3867f02740a7a0fb3ed3c69067fc5c666f2ac98e9484e38ebbac659d6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/bundle.json","state_url":"https://pith.science/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/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-14T09:10:09Z","links":{"resolver":"https://pith.science/pith/6MOVNOGXCT24KOEDRZE4H7JG7C","bundle":"https://pith.science/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/bundle.json","state":"https://pith.science/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MOVNOGXCT24KOEDRZE4H7JG7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6MOVNOGXCT24KOEDRZE4H7JG7C","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":"5a1e29a797b00e99b696c2d541c61570b375cf4fd0e6d4c3d766f704b85dd2f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-11T07:47:16Z","title_canon_sha256":"0bbea5d0ded3d61b5323b0add44328e49e6698f3fb69668b8be0828e0d4a0464"},"schema_version":"1.0","source":{"id":"2312.06181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.06181","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"2312.06181v1","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.06181","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"6MOVNOGXCT24","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_16","alias_value":"6MOVNOGXCT24KOED","created_at":"2026-07-05T07:22:40Z"},{"alias_kind":"pith_short_8","alias_value":"6MOVNOGX","created_at":"2026-07-05T07:22:40Z"}],"graph_snapshots":[{"event_id":"sha256:2b1e8b3867f02740a7a0fb3ed3c69067fc5c666f2ac98e9484e38ebbac659d6e","target":"graph","created_at":"2026-07-05T07:22:40Z","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/2312.06181/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 one of the canonical algorithms designed to find approximate solutions to combinatorial optimization problems in current noisy intermediate-scale quantum (NISQ) devices. It is an active area of research to exhibit its speedup over classical algorithms. The performance of the QAOA at low depths is limited, while the QAOA at higher depths is constrained by the current techniques. We propose a new version of QAOA that incorporates the capabilities of QAOA and the real-space renormalization group transformation, resulting in enhanced perform","authors_text":"Ping Zou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-11T07:47:16Z","title":"Multiscale Quantum Approximate Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.06181","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:c759d9e6cf718631ee555f2911ccec41fe5874ca2f0a94912e9dbc6aedc8bdbc","target":"record","created_at":"2026-07-05T07:22:40Z","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":"5a1e29a797b00e99b696c2d541c61570b375cf4fd0e6d4c3d766f704b85dd2f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-11T07:47:16Z","title_canon_sha256":"0bbea5d0ded3d61b5323b0add44328e49e6698f3fb69668b8be0828e0d4a0464"},"schema_version":"1.0","source":{"id":"2312.06181","kind":"arxiv","version":1}},"canonical_sha256":"f31d56b8d714f5c538838e49c3fd26f89736ed8fe3e353474fa85de4839ec085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f31d56b8d714f5c538838e49c3fd26f89736ed8fe3e353474fa85de4839ec085","first_computed_at":"2026-07-05T07:22:40.032223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:22:40.032223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UVSWuL1f+oE1IVKpCqDpFnvNnpoyXjXbeqzqptBJ1KReQyRkoREM43U2c1cyGMQMrTQFv/Bn6Q/PO2F/2x69DA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:22:40.032706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.06181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c759d9e6cf718631ee555f2911ccec41fe5874ca2f0a94912e9dbc6aedc8bdbc","sha256:2b1e8b3867f02740a7a0fb3ed3c69067fc5c666f2ac98e9484e38ebbac659d6e"],"state_sha256":"a7d734b209a67d0f3ca0ace1e91b4034caca34bf3d27f85f95185029e1b4e16e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6l0eoHgrSkuvdT7AyFkCRmbeE9h1coXuIUwMJnj9wt/ZYAk4O1jqnKZ0lilW718yHnGMADVcQqxqCllVA+ACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:10:09.666969Z","bundle_sha256":"a83e376824c12bae28ce272c743ff0e7d63b346b053733f4a887d1ba71618c19"}}