{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HKL3Y5WNHFRJMUYZ7YYJRJBHGR","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":"cc2a79f418089ffa1c4b6498fdcb13a756cb92c124f364e4bffb3ae9aae945de","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-12-03T12:42:29Z","title_canon_sha256":"4529a8a88d5314c1d360769e626ae8cce2e8e668cf79c1bf29c3ad1bc22cb536"},"schema_version":"1.0","source":{"id":"2412.02425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02425","created_at":"2026-07-05T09:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02425v1","created_at":"2026-07-05T09:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02425","created_at":"2026-07-05T09:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"HKL3Y5WNHFRJ","created_at":"2026-07-05T09:43:49Z"},{"alias_kind":"pith_short_16","alias_value":"HKL3Y5WNHFRJMUYZ","created_at":"2026-07-05T09:43:49Z"},{"alias_kind":"pith_short_8","alias_value":"HKL3Y5WN","created_at":"2026-07-05T09:43:49Z"}],"graph_snapshots":[{"event_id":"sha256:3404ea6b32605b1ecefab5b60c4a80708e55f1f8bedd113abef18fe1a503e1b3","target":"graph","created_at":"2026-07-05T09:43:49Z","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/2412.02425/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, the ParaOpt algorithm was proposed as an extension of the time-parallel Parareal method to optimal control. ParaOpt uses quasi-Newton steps that each require solving a system of matching conditions iteratively. The state-of-the-art parallel preconditioner for linear problems leads to a set of independent smaller systems that are currently hard to solve. We generalize the preconditioner to the nonlinear case and propose a new, fast inversion method for these smaller systems, avoiding disadvantages of the current options with adjusted boundary conditions in the subproblems.","authors_text":"Arne Bouillon, Corentin Bonte, Giovanni Samaey, Karl Meerbergen","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-12-03T12:42:29Z","title":"Efficient parallel inversion of ParaOpt preconditioners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02425","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:4095ef29a3e715e0bc08b69d6ab2b3407ceadc0654454c0daf320a4ee26d2ebd","target":"record","created_at":"2026-07-05T09:43:49Z","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":"cc2a79f418089ffa1c4b6498fdcb13a756cb92c124f364e4bffb3ae9aae945de","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-12-03T12:42:29Z","title_canon_sha256":"4529a8a88d5314c1d360769e626ae8cce2e8e668cf79c1bf29c3ad1bc22cb536"},"schema_version":"1.0","source":{"id":"2412.02425","kind":"arxiv","version":1}},"canonical_sha256":"3a97bc76cd3962965319fe3098a4273446133075efcfaea6c2df27ee6c2a0795","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a97bc76cd3962965319fe3098a4273446133075efcfaea6c2df27ee6c2a0795","first_computed_at":"2026-07-05T09:43:49.588521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:49.588521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6mAV2Pb3+PhWt5S7YJ09YzGChGDKCkLDx6QDA7PMLIzzPszIdCUSYdllfiHGLYbGX/3GdDuyehY+o+UiMBkWBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:49.589023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4095ef29a3e715e0bc08b69d6ab2b3407ceadc0654454c0daf320a4ee26d2ebd","sha256:3404ea6b32605b1ecefab5b60c4a80708e55f1f8bedd113abef18fe1a503e1b3"],"state_sha256":"29cde88ab406103d91fee2f0345a4a1ccd0f6689a4c46677c03e345a45efc6a7"}