{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7REWP3CWDH34PXOTTXHV23OBSL","short_pith_number":"pith:7REWP3CW","schema_version":"1.0","canonical_sha256":"fc4967ec5619f7c7ddd39dcf5d6dc192d190b716c70ba1dc90a410e8be64269a","source":{"kind":"arxiv","id":"1603.01237","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.01237","created_at":"2026-05-18T01:15:42.028289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01237v1","created_at":"2026-05-18T01:15:42.028289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01237","created_at":"2026-05-18T01:15:42.028289+00:00"},{"alias_kind":"pith_short_12","alias_value":"7REWP3CWDH34","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7REWP3CWDH34PXOT","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7REWP3CW","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL","json":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL.json","graph_json":"https://pith.science/api/pith-number/7REWP3CWDH34PXOTTXHV23OBSL/graph.json","events_json":"https://pith.science/api/pith-number/7REWP3CWDH34PXOTTXHV23OBSL/events.json","paper":"https://pith.science/paper/7REWP3CW"},"agent_actions":{"view_html":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL","download_json":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL.json","view_paper":"https://pith.science/paper/7REWP3CW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01237&json=true","fetch_graph":"https://pith.science/api/pith-number/7REWP3CWDH34PXOTTXHV23OBSL/graph.json","fetch_events":"https://pith.science/api/pith-number/7REWP3CWDH34PXOTTXHV23OBSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/action/storage_attestation","attest_author":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/action/author_attestation","sign_citation":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/action/citation_signature","submit_replication":"https://pith.science/pith/7REWP3CWDH34PXOTTXHV23OBSL/action/replication_record"}},"created_at":"2026-05-18T01:15:42.028289+00:00","updated_at":"2026-05-18T01:15:42.028289+00:00"}