{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7ISDVCARDDLWY773T7GWQNWHYL","short_pith_number":"pith:7ISDVCAR","canonical_record":{"source":{"id":"1911.00789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-02T21:52:42Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"50bcefc34b00eb75eee1948cb51b93137e06b74edd61769e285c51498caf4dc3","abstract_canon_sha256":"29e33fef33e78efe3b6b64987826c364f21e2ab8318721abdfd9bf04be4b105c"},"schema_version":"1.0"},"canonical_sha256":"fa243a881118d76c7ffb9fcd6836c7c2fe11d167b1acbad331cb310789fee9ad","source":{"kind":"arxiv","id":"1911.00789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.00789","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"1911.00789v1","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.00789","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"7ISDVCARDDLW","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_16","alias_value":"7ISDVCARDDLWY773","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_8","alias_value":"7ISDVCAR","created_at":"2026-07-05T00:16:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7ISDVCARDDLWY773T7GWQNWHYL","target":"record","payload":{"canonical_record":{"source":{"id":"1911.00789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-02T21:52:42Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"50bcefc34b00eb75eee1948cb51b93137e06b74edd61769e285c51498caf4dc3","abstract_canon_sha256":"29e33fef33e78efe3b6b64987826c364f21e2ab8318721abdfd9bf04be4b105c"},"schema_version":"1.0"},"canonical_sha256":"fa243a881118d76c7ffb9fcd6836c7c2fe11d167b1acbad331cb310789fee9ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:42.892122Z","signature_b64":"GZ9eqio+wCjEPwQ6hKE8Ej5fDMuCHCKYhzsx8GTo4/4K3SxvtTZzxFns4rIcE3t4fG5smCpI4Wy2wDKsQCzxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa243a881118d76c7ffb9fcd6836c7c2fe11d167b1acbad331cb310789fee9ad","last_reissued_at":"2026-07-05T00:16:42.891734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:42.891734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.00789","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-05T00:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Fz6KVVIW0M/YID1o5NPoxBhg71oMtOjMU042D8kdPd+DZexx6YX2827kP9D0ORR0Wwouq3hmUhM+Crac5FbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:12:22.491483Z"},"content_sha256":"b862b0cd041f27be95533d6a50239048f037e04b33bafa009d409b80d228d97b","schema_version":"1.0","event_id":"sha256:b862b0cd041f27be95533d6a50239048f037e04b33bafa009d409b80d228d97b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7ISDVCARDDLWY773T7GWQNWHYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Control Optimization for Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"K. Birgitta Whaley, Lin Lin, Robert Kosut, Xiang Meng, Yulong Dong","submitted_at":"2019-11-02T21:52:42Z","abstract_excerpt":"Quantum variational algorithms have garnered significant interest recently, due to their feasibility of being implemented and tested on noisy intermediate scale quantum (NISQ) devices. We examine the robustness of the quantum approximate optimization algorithm (QAOA), which can be used to solve certain quantum control problems, state preparation problems, and combinatorial optimization problems. We demonstrate that the error of QAOA simulation can be significantly reduced by robust control optimization techniques, specifically, by sequential convex programming (SCP), to ensure error suppressio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.00789","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/1911.00789/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-05T00:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjJgemyzhIAwwwGxwnU1LIvyI+hR3OTmNxtPMkE0aK/8K4nOPAHVVAwu+Is4L6sPx6uTqbobDFHIKDj6MwkSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:12:22.491876Z"},"content_sha256":"a665ac4d2e5a9592fd67e7a2f1b345a643f4674f991c53b91cd1fabf7d361f14","schema_version":"1.0","event_id":"sha256:a665ac4d2e5a9592fd67e7a2f1b345a643f4674f991c53b91cd1fabf7d361f14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ISDVCARDDLWY773T7GWQNWHYL/bundle.json","state_url":"https://pith.science/pith/7ISDVCARDDLWY773T7GWQNWHYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ISDVCARDDLWY773T7GWQNWHYL/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-07-06T18:12:22Z","links":{"resolver":"https://pith.science/pith/7ISDVCARDDLWY773T7GWQNWHYL","bundle":"https://pith.science/pith/7ISDVCARDDLWY773T7GWQNWHYL/bundle.json","state":"https://pith.science/pith/7ISDVCARDDLWY773T7GWQNWHYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ISDVCARDDLWY773T7GWQNWHYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7ISDVCARDDLWY773T7GWQNWHYL","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":"29e33fef33e78efe3b6b64987826c364f21e2ab8318721abdfd9bf04be4b105c","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-02T21:52:42Z","title_canon_sha256":"50bcefc34b00eb75eee1948cb51b93137e06b74edd61769e285c51498caf4dc3"},"schema_version":"1.0","source":{"id":"1911.00789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.00789","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"1911.00789v1","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.00789","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"7ISDVCARDDLW","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_16","alias_value":"7ISDVCARDDLWY773","created_at":"2026-07-05T00:16:42Z"},{"alias_kind":"pith_short_8","alias_value":"7ISDVCAR","created_at":"2026-07-05T00:16:42Z"}],"graph_snapshots":[{"event_id":"sha256:a665ac4d2e5a9592fd67e7a2f1b345a643f4674f991c53b91cd1fabf7d361f14","target":"graph","created_at":"2026-07-05T00:16:42Z","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/1911.00789/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum variational algorithms have garnered significant interest recently, due to their feasibility of being implemented and tested on noisy intermediate scale quantum (NISQ) devices. We examine the robustness of the quantum approximate optimization algorithm (QAOA), which can be used to solve certain quantum control problems, state preparation problems, and combinatorial optimization problems. We demonstrate that the error of QAOA simulation can be significantly reduced by robust control optimization techniques, specifically, by sequential convex programming (SCP), to ensure error suppressio","authors_text":"K. Birgitta Whaley, Lin Lin, Robert Kosut, Xiang Meng, Yulong Dong","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-02T21:52:42Z","title":"Robust Control Optimization for Quantum Approximate Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.00789","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:b862b0cd041f27be95533d6a50239048f037e04b33bafa009d409b80d228d97b","target":"record","created_at":"2026-07-05T00:16:42Z","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":"29e33fef33e78efe3b6b64987826c364f21e2ab8318721abdfd9bf04be4b105c","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-11-02T21:52:42Z","title_canon_sha256":"50bcefc34b00eb75eee1948cb51b93137e06b74edd61769e285c51498caf4dc3"},"schema_version":"1.0","source":{"id":"1911.00789","kind":"arxiv","version":1}},"canonical_sha256":"fa243a881118d76c7ffb9fcd6836c7c2fe11d167b1acbad331cb310789fee9ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa243a881118d76c7ffb9fcd6836c7c2fe11d167b1acbad331cb310789fee9ad","first_computed_at":"2026-07-05T00:16:42.891734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:42.891734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GZ9eqio+wCjEPwQ6hKE8Ej5fDMuCHCKYhzsx8GTo4/4K3SxvtTZzxFns4rIcE3t4fG5smCpI4Wy2wDKsQCzxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:42.892122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.00789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b862b0cd041f27be95533d6a50239048f037e04b33bafa009d409b80d228d97b","sha256:a665ac4d2e5a9592fd67e7a2f1b345a643f4674f991c53b91cd1fabf7d361f14"],"state_sha256":"2cbd6ae06af9de4979223011481f881de8210ba66d88272b823d5bfccb119d13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaywBFw6UfppiYuQTxcofJQhZ9LFY0b9fsy4d3hIGaZ9Myj3VJSpkNkLhT6nxSMUviQsQcEQgsYxRgAZ4F6tDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:12:22.494030Z","bundle_sha256":"44ed1c2cbb6c2282d3f3ece049b4d5ffc9d4e1506f771a62b60caa9b3627d7f6"}}