{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:43UHRHOGJGAIL3CO7Y6JSVH54M","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":"2132d162f14609744c163dd49b4bacf5e2387461d03ae9c6fd1d4bb5be2113d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-28T00:26:17Z","title_canon_sha256":"5e2992ffe2fab8313dadc9a03b81901dce55c2d677c15f5a823a20a799a338d0"},"schema_version":"1.0","source":{"id":"1403.7254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7254","created_at":"2026-05-18T02:29:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7254v2","created_at":"2026-05-18T02:29:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7254","created_at":"2026-05-18T02:29:25Z"},{"alias_kind":"pith_short_12","alias_value":"43UHRHOGJGAI","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43UHRHOGJGAIL3CO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43UHRHOG","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:92789f12db2f1624ff5647f6090c5ac3ff08f15c13136b0f7636617668d46fc5","target":"graph","created_at":"2026-05-18T02:29:25Z","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":"In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our algorithm pieces the unknown into sub-blocs of unknowns and considers a partial optimization over each sub-bloc. In quadratic optimization, our method involves Newton technique to compute the step-lengths for the sub-blocs resulting descent directions. Our optimization method is fully parallel and easily implementable, we first presents it in a general linear algebra setting, then we highlight its applicability to a parabolic optimal control problem, where we consider the blocs of unknowns with","authors_text":"Mohamed Kamel Riahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-28T00:26:17Z","title":"A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7254","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:f068ee14cb092a6d4a1b6ce3f14b741faf67c689e5c25f5c8b9ca0b0009f5b5c","target":"record","created_at":"2026-05-18T02:29:25Z","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":"2132d162f14609744c163dd49b4bacf5e2387461d03ae9c6fd1d4bb5be2113d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-28T00:26:17Z","title_canon_sha256":"5e2992ffe2fab8313dadc9a03b81901dce55c2d677c15f5a823a20a799a338d0"},"schema_version":"1.0","source":{"id":"1403.7254","kind":"arxiv","version":2}},"canonical_sha256":"e6e8789dc6498085ec4efe3c9954fde324d4d5c30e18f9f632254e6c8a08e594","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e8789dc6498085ec4efe3c9954fde324d4d5c30e18f9f632254e6c8a08e594","first_computed_at":"2026-05-18T02:29:25.076486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:25.076486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ZX5RF8DLe2G6xACwTrgHMv3LXdL9t9rfInUmEzAGSuP38R2a9xfGgO1ONsGSMG42I3+Z6XONv26mQv1P6d2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:25.076864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f068ee14cb092a6d4a1b6ce3f14b741faf67c689e5c25f5c8b9ca0b0009f5b5c","sha256:92789f12db2f1624ff5647f6090c5ac3ff08f15c13136b0f7636617668d46fc5"],"state_sha256":"6e6e2051522a4dc17f94e259a27ff655929355038d023df4fdef873fcf5977fa"}