{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VGGH4XKJNNQ35WUTWFYKWXE7QH","short_pith_number":"pith:VGGH4XKJ","schema_version":"1.0","canonical_sha256":"a98c7e5d496b61beda93b170ab5c9f81d28d05183a0823df0a71fd2387c34f9a","source":{"kind":"arxiv","id":"2104.05672","version":1},"attestation_state":"computed","paper":{"title":"On the Globalization of ASPIN Employing Trust-Region Control Strategies -- Convergence Analysis and Numerical Examples","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Christian Gross, Rolf Krause","submitted_at":"2021-04-12T17:40:37Z","abstract_excerpt":"The parallel solution of large scale non-linear programming problems, which arise for example from the discretization of non-linear partial differential equations, is a highly demanding task. Here, a novel solution strategy is presented, which is inherently parallel and globally convergent. Each global non-linear iteration step consists of asynchronous solutions of local non-linear programming problems followed by a global recombination step. The recombination step, which is the solution of a quadratic programming problem, is designed in a way such that it ensures global convergence. As it tur"},"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":"2104.05672","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2021-04-12T17:40:37Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"c067d2090f1e1aeb4f0de0feade588d2104f57a81104898774cd4f60c41b2d4f","abstract_canon_sha256":"26245bd7be78b0969e225a501c1336a1a28af517246b6f82cf434d063b3d576f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:15.073208Z","signature_b64":"0GLf/c/w1urmZa/nIjOf0hwWFVcE1FRhBK7KcLMoFZCCAVLRl36Ds7nFtd8X+ybdZ/vFyfCqEmXKgftvGMNGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a98c7e5d496b61beda93b170ab5c9f81d28d05183a0823df0a71fd2387c34f9a","last_reissued_at":"2026-07-05T02:31:15.072794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:15.072794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Globalization of ASPIN Employing Trust-Region Control Strategies -- Convergence Analysis and Numerical Examples","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Christian Gross, Rolf Krause","submitted_at":"2021-04-12T17:40:37Z","abstract_excerpt":"The parallel solution of large scale non-linear programming problems, which arise for example from the discretization of non-linear partial differential equations, is a highly demanding task. Here, a novel solution strategy is presented, which is inherently parallel and globally convergent. Each global non-linear iteration step consists of asynchronous solutions of local non-linear programming problems followed by a global recombination step. The recombination step, which is the solution of a quadratic programming problem, is designed in a way such that it ensures global convergence. As it tur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05672","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.05672/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.05672","created_at":"2026-07-05T02:31:15.072852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.05672v1","created_at":"2026-07-05T02:31:15.072852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05672","created_at":"2026-07-05T02:31:15.072852+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGGH4XKJNNQ3","created_at":"2026-07-05T02:31:15.072852+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGGH4XKJNNQ35WUT","created_at":"2026-07-05T02:31:15.072852+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGGH4XKJ","created_at":"2026-07-05T02:31:15.072852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11513","citing_title":"Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization","ref_index":2011,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH","json":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH.json","graph_json":"https://pith.science/api/pith-number/VGGH4XKJNNQ35WUTWFYKWXE7QH/graph.json","events_json":"https://pith.science/api/pith-number/VGGH4XKJNNQ35WUTWFYKWXE7QH/events.json","paper":"https://pith.science/paper/VGGH4XKJ"},"agent_actions":{"view_html":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH","download_json":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH.json","view_paper":"https://pith.science/paper/VGGH4XKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.05672&json=true","fetch_graph":"https://pith.science/api/pith-number/VGGH4XKJNNQ35WUTWFYKWXE7QH/graph.json","fetch_events":"https://pith.science/api/pith-number/VGGH4XKJNNQ35WUTWFYKWXE7QH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH/action/storage_attestation","attest_author":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH/action/author_attestation","sign_citation":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH/action/citation_signature","submit_replication":"https://pith.science/pith/VGGH4XKJNNQ35WUTWFYKWXE7QH/action/replication_record"}},"created_at":"2026-07-05T02:31:15.072852+00:00","updated_at":"2026-07-05T02:31:15.072852+00:00"}