{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7REWP3CWDH34PXOTTXHV23OBSL","short_pith_number":"pith:7REWP3CW","canonical_record":{"source":{"id":"1603.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-03T19:55:07Z","cross_cats_sorted":["math.AP","math.NA"],"title_canon_sha256":"5d9ce27e600abbdd8ad52ffb43c5191407d1a7d0409667d57c8837d09a0e0abe","abstract_canon_sha256":"2989d1d9c6361963c4282daa6c3cbac011234819eae50d151ab8ee843ab7b970"},"schema_version":"1.0"},"canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","source":{"kind":"arxiv","id":"1603.01237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01237","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01237v1","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01237","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"7REWP3CWDH34","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7REWP3CWDH34PXOT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7REWP3CW","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7REWP3CWDH34PXOTTXHV23OBSL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-03T19:55:07Z","cross_cats_sorted":["math.AP","math.NA"],"title_canon_sha256":"5d9ce27e600abbdd8ad52ffb43c5191407d1a7d0409667d57c8837d09a0e0abe","abstract_canon_sha256":"2989d1d9c6361963c4282daa6c3cbac011234819eae50d151ab8ee843ab7b970"},"schema_version":"1.0"},"canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:42.028919Z","signature_b64":"Em2+qAXaFyuDx+WZm3ezAKRmIX36BCEsu4+/V2B0RwfMPQRW21wD2h4vzk1/XTCA5nQ92sG5LkekoqmJ+Ou0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","last_reissued_at":"2026-05-18T01:15:42.028167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:42.028167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01237","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-05-18T01:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3mL15NZW3JhvNZcJjG56yHsHTsK0u6F7du62SLsOWwi2JnmYXqc5fp3Hr6LAchyB4HnfFWSG02h3wUZqDrsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:51.552476Z"},"content_sha256":"d8d935ec53489dc4df010473f355311d258beee2d044c3d4c2dc3d058158689f","schema_version":"1.0","event_id":"sha256:d8d935ec53489dc4df010473f355311d258beee2d044c3d4c2dc3d058158689f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7REWP3CWDH34PXOTTXHV23OBSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fully efficient time-parallelized quantum optimal control algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.NA"],"primary_cat":"math.OC","authors_text":"D Sugny (LICB), Julien Salomon (CEREMADE), Mohamed-Kamel Riahi, S. J. Glaser (TUM)","submitted_at":"2016-03-03T19:55:07Z","abstract_excerpt":"We present a time-parallelization method that enables to accelerate the computation of quantum optimal control algorithms. We show that this approach is approximately fully efficient when based on a gradient method as optimization solver: the computational time is approximately divided by the number of available processors. The control of spin systems, molecular orientation and Bose-Einstein condensates are used as illustrative examples to highlight the wide range of application of this numerical scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01237","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":""},"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-05-18T01:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+0yT6aUVtwv2NxklDWPcWCcTWl+dMbuol8jyiPfDiy4uyI4EQ/rSHic+SlzLGJOoLqQlOt/82Y8Ry1HlydWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:51.552828Z"},"content_sha256":"cc0d9cd52b8f91755294e90b903a68cd4f43a02c7827e1c5ad670eb075a54c98","schema_version":"1.0","event_id":"sha256:cc0d9cd52b8f91755294e90b903a68cd4f43a02c7827e1c5ad670eb075a54c98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/bundle.json","state_url":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7REWP3CWDH34PXOTTXHV23OBSL/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-06-11T11:00:51Z","links":{"resolver":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL","bundle":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/bundle.json","state":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7REWP3CWDH34PXOTTXHV23OBSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7REWP3CWDH34PXOTTXHV23OBSL","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":"2989d1d9c6361963c4282daa6c3cbac011234819eae50d151ab8ee843ab7b970","cross_cats_sorted":["math.AP","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-03T19:55:07Z","title_canon_sha256":"5d9ce27e600abbdd8ad52ffb43c5191407d1a7d0409667d57c8837d09a0e0abe"},"schema_version":"1.0","source":{"id":"1603.01237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01237","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01237v1","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01237","created_at":"2026-05-18T01:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"7REWP3CWDH34","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7REWP3CWDH34PXOT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7REWP3CW","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:cc0d9cd52b8f91755294e90b903a68cd4f43a02c7827e1c5ad670eb075a54c98","target":"graph","created_at":"2026-05-18T01:15: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"},"paper":{"abstract_excerpt":"We present a time-parallelization method that enables to accelerate the computation of quantum optimal control algorithms. We show that this approach is approximately fully efficient when based on a gradient method as optimization solver: the computational time is approximately divided by the number of available processors. The control of spin systems, molecular orientation and Bose-Einstein condensates are used as illustrative examples to highlight the wide range of application of this numerical scheme.","authors_text":"D Sugny (LICB), Julien Salomon (CEREMADE), Mohamed-Kamel Riahi, S. J. Glaser (TUM)","cross_cats":["math.AP","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-03T19:55:07Z","title":"A fully efficient time-parallelized quantum optimal control algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01237","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:d8d935ec53489dc4df010473f355311d258beee2d044c3d4c2dc3d058158689f","target":"record","created_at":"2026-05-18T01:15: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":"2989d1d9c6361963c4282daa6c3cbac011234819eae50d151ab8ee843ab7b970","cross_cats_sorted":["math.AP","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-03T19:55:07Z","title_canon_sha256":"5d9ce27e600abbdd8ad52ffb43c5191407d1a7d0409667d57c8837d09a0e0abe"},"schema_version":"1.0","source":{"id":"1603.01237","kind":"arxiv","version":1}},"canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","first_computed_at":"2026-05-18T01:15:42.028167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:42.028167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Em2+qAXaFyuDx+WZm3ezAKRmIX36BCEsu4+/V2B0RwfMPQRW21wD2h4vzk1/XTCA5nQ92sG5LkekoqmJ+Ou0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:42.028919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8d935ec53489dc4df010473f355311d258beee2d044c3d4c2dc3d058158689f","sha256:cc0d9cd52b8f91755294e90b903a68cd4f43a02c7827e1c5ad670eb075a54c98"],"state_sha256":"41374f911df2c4f845d322695fe29d822322ed1ef232d1ad54d65321a131c2a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUtG468p6eATGtxssinagtkRVEUikvfZHAeImatLo7QtXw4i1KONQuLhWmEVXV1Il75qAjRM5pcBwiMyuFcIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:00:51.554836Z","bundle_sha256":"ebcd59e213b530462df032ecb86a696a4163975c9d36cf1d51370ca3585728c0"}}