{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RLLP3OMQWFOGCBSW4BEFMCTC6R","short_pith_number":"pith:RLLP3OMQ","canonical_record":{"source":{"id":"2410.01161","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-02T01:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"5b1a05e3000edbe551ee95dfefc0c13c7efe00cbd84e4f6845fb6c289ff1a881","abstract_canon_sha256":"a94e584f735e52aa332ae495b2b7cd1752ea7800a4a3afb7383c15a39ae7b77f"},"schema_version":"1.0"},"canonical_sha256":"8ad6fdb990b15c610656e048560a62f4702601d96b62edd88443593aef3431cd","source":{"kind":"arxiv","id":"2410.01161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01161","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01161v2","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01161","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"RLLP3OMQWFOG","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_16","alias_value":"RLLP3OMQWFOGCBSW","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_8","alias_value":"RLLP3OMQ","created_at":"2026-07-05T10:30:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RLLP3OMQWFOGCBSW4BEFMCTC6R","target":"record","payload":{"canonical_record":{"source":{"id":"2410.01161","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-02T01:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"5b1a05e3000edbe551ee95dfefc0c13c7efe00cbd84e4f6845fb6c289ff1a881","abstract_canon_sha256":"a94e584f735e52aa332ae495b2b7cd1752ea7800a4a3afb7383c15a39ae7b77f"},"schema_version":"1.0"},"canonical_sha256":"8ad6fdb990b15c610656e048560a62f4702601d96b62edd88443593aef3431cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:56.795003Z","signature_b64":"JYU1NThV1yj+YEzVeXLQXky0XdfTrViysHNIAvy0h988DMAskjmycBwPBrbc71HWitjHh3HHGsaJY5WZr9zvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad6fdb990b15c610656e048560a62f4702601d96b62edd88443593aef3431cd","last_reissued_at":"2026-07-05T10:30:56.793996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:56.793996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.01161","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-05T10:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWeuURSPp8oEz4c8eDcZnblJwDMrh6+7cV8iTtnIrCLruJCyWbGayZvuYoSq8DS7gwqdBcndq8hUUw86xFATAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T09:49:28.546590Z"},"content_sha256":"202d78a306da0a48c01aa4f52324f21732bf7b98ee07506fec1c6e849e52cefe","schema_version":"1.0","event_id":"sha256:202d78a306da0a48c01aa4f52324f21732bf7b98ee07506fec1c6e849e52cefe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RLLP3OMQWFOGCBSW4BEFMCTC6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Quantum Gate Preparation in Open Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoly Zlotnik, Andrei Piryatinski, Luke S. Baker, Syed A. Shah","submitted_at":"2024-10-02T01:31:19Z","abstract_excerpt":"We develop an optimal control algorithm for robust quantum gate preparation in open environments with the state of the quantum system represented using the Lindblad master equation. The algorithm is based on adaptive linearization and iterative quadratic programming to progressively shape the control signal into an optimal form. Robustness is achieved with exponential rates of convergence by introducing uncertain parameters into the master equation and expanding the parameterized state over the basis of Legendre polynomials. We prove that the proposed control algorithm reduces to GRadient Asce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01161","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/2410.01161/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-05T10:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWjiyBvJ5CJ6m/St7H/L0DIxMdKj/SmgDHY5aeQHD1/3RWgiKDGSKZXadW+3COfZTFNHVvhqxpSF5AypoXaxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T09:49:28.546970Z"},"content_sha256":"02a958a4c0335ffcb7b0e473faaa1a52249df15ce03de64198c67641180149b0","schema_version":"1.0","event_id":"sha256:02a958a4c0335ffcb7b0e473faaa1a52249df15ce03de64198c67641180149b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/bundle.json","state_url":"https://pith.science/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/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-11T09:49:28Z","links":{"resolver":"https://pith.science/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R","bundle":"https://pith.science/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/bundle.json","state":"https://pith.science/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLLP3OMQWFOGCBSW4BEFMCTC6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RLLP3OMQWFOGCBSW4BEFMCTC6R","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":"a94e584f735e52aa332ae495b2b7cd1752ea7800a4a3afb7383c15a39ae7b77f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-02T01:31:19Z","title_canon_sha256":"5b1a05e3000edbe551ee95dfefc0c13c7efe00cbd84e4f6845fb6c289ff1a881"},"schema_version":"1.0","source":{"id":"2410.01161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.01161","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.01161v2","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01161","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"RLLP3OMQWFOG","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_16","alias_value":"RLLP3OMQWFOGCBSW","created_at":"2026-07-05T10:30:56Z"},{"alias_kind":"pith_short_8","alias_value":"RLLP3OMQ","created_at":"2026-07-05T10:30:56Z"}],"graph_snapshots":[{"event_id":"sha256:02a958a4c0335ffcb7b0e473faaa1a52249df15ce03de64198c67641180149b0","target":"graph","created_at":"2026-07-05T10:30:56Z","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/2410.01161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an optimal control algorithm for robust quantum gate preparation in open environments with the state of the quantum system represented using the Lindblad master equation. The algorithm is based on adaptive linearization and iterative quadratic programming to progressively shape the control signal into an optimal form. Robustness is achieved with exponential rates of convergence by introducing uncertain parameters into the master equation and expanding the parameterized state over the basis of Legendre polynomials. We prove that the proposed control algorithm reduces to GRadient Asce","authors_text":"Anatoly Zlotnik, Andrei Piryatinski, Luke S. Baker, Syed A. Shah","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-02T01:31:19Z","title":"Robust Quantum Gate Preparation in Open Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01161","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:202d78a306da0a48c01aa4f52324f21732bf7b98ee07506fec1c6e849e52cefe","target":"record","created_at":"2026-07-05T10:30:56Z","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":"a94e584f735e52aa332ae495b2b7cd1752ea7800a4a3afb7383c15a39ae7b77f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-02T01:31:19Z","title_canon_sha256":"5b1a05e3000edbe551ee95dfefc0c13c7efe00cbd84e4f6845fb6c289ff1a881"},"schema_version":"1.0","source":{"id":"2410.01161","kind":"arxiv","version":2}},"canonical_sha256":"8ad6fdb990b15c610656e048560a62f4702601d96b62edd88443593aef3431cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad6fdb990b15c610656e048560a62f4702601d96b62edd88443593aef3431cd","first_computed_at":"2026-07-05T10:30:56.793996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:56.793996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYU1NThV1yj+YEzVeXLQXky0XdfTrViysHNIAvy0h988DMAskjmycBwPBrbc71HWitjHh3HHGsaJY5WZr9zvDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:56.795003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.01161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:202d78a306da0a48c01aa4f52324f21732bf7b98ee07506fec1c6e849e52cefe","sha256:02a958a4c0335ffcb7b0e473faaa1a52249df15ce03de64198c67641180149b0"],"state_sha256":"73c911201398dc8c5bac99b2679885d5894cf13726b0384d65529098627151d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ly6AJqrxX2GUlieHsDAS/x2rJmP94Rj0BO5XVhucguQIA86JP6Y9hk5h5fuNicJVa+xZUNxachDgqubwvoV6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T09:49:28.549102Z","bundle_sha256":"91641ba1cb9a89a878fb629a73182210014ff6b3e1278db2554faa5882b75b5c"}}