{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MPPOH5RYGKXSC3RSLDDGX4AVKD","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":"13a98cc0ba11c6c31a1d51a1cc773bd5f64deea7c97977622943989659717dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-17T18:52:16Z","title_canon_sha256":"b6202fd76a8f4907ab19e89d0a1d8e3e7e407d2e6fae22fc5358259aa0950154"},"schema_version":"1.0","source":{"id":"2605.17599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17599","created_at":"2026-05-20T00:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17599v1","created_at":"2026-05-20T00:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17599","created_at":"2026-05-20T00:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"MPPOH5RYGKXS","created_at":"2026-05-20T00:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"MPPOH5RYGKXSC3RS","created_at":"2026-05-20T00:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"MPPOH5RY","created_at":"2026-05-20T00:04:47Z"}],"graph_snapshots":[{"event_id":"sha256:c38249cb973b5c92d909fdf6ba92f011bb36b91695b9312d67e3f6ba63b91a37","target":"graph","created_at":"2026-05-20T00:04:47Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On compact sets of decision variables, a uniform version of this bound is obtained, leading to a directional tolerance condition under which the inexact gradient satisfies an exact descent inequality. The resulting inexact general directions method inherits convergence properties under uniformly bounded, diminishing, and Armijo-type step-size rules."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The gradient-error bound and subsequent directional tolerance hold when the state and adjoint residuals are affine in the state variable; this assumption is invoked to obtain the linear combination bound on gradient error (see theoretical part of abstract)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Connects inexact discrete adjoint gradient bounds to directional tolerances that guarantee descent and convergence in full-potential airfoil pressure-matching optimization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Inexact adjoint gradients satisfy exact descent inequalities under directional tolerances derived from residual bounds."}],"snapshot_sha256":"5830b153fc7438e7ea29d16fb5f02d0af9fcab41753905f35b6e86066e00b948"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"1561d03099cf80217a88bab31233051663d79b4c561e3fc8419677b93f19e232"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.540901Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:21:37.848991Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.576390Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.505975Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17599/integrity.json","findings":[],"snapshot_sha256":"7fb711ff36ef0a3388930b8078e5d8025c4bc44f8918dbb390ceba71507967a6","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper develops a framework connecting discrete adjoint gradient-error analysis with an optimization method that uses directional error tolerances, and applies it to airfoil shape optimization governed by a conservative full-potential flow solver on body-fitted structured meshes. The theoretical part derives the reduced discrete adjoint formula for scalar objectives constrained by a state equation and analyzes how inexact state and adjoint residuals propagate into the reduced gradient. For residuals that are affine in the state variable, the gradient error is bounded by a linear combinatio","authors_text":"Humberto Gimenes Macedo, Lu\\'is Felipe Bueno","cross_cats":[],"headline":"Inexact adjoint gradients satisfy exact descent inequalities under directional tolerances derived from residual bounds.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-17T18:52:16Z","title":"Inexact Adjoint Gradients and Directional Tolerances for Full-Potential Airfoil Optimization"},"references":{"count":7,"internal_anchors":0,"resolved_work":7,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"D. P. Bertsekas,Nonlinear Programming, Athena Scientific, 3rd ed., 2016","work_id":"1f3e95fb-2484-417a-88a1-06138e4af2b4","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"T. G. Kolda and B. W. Bader, Tensor decompositions and applications,SIAM Review, 51 (2009), pp. 455–500","work_id":"e0d8f16d-1d17-4226-b241-f22546c537a9","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"G. K. W. Kenway, C. A. Mader, P. He, and J. R. R. A. Martins, Effective adjoint approaches for computational fluid dynamics,Progress in Aerospace Sciences, 110 (2019), 100542","work_id":"529ab165-6ac8-4472-8df3-a711dd00948d","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"P. D. Khanh, B. S. Mordukhovich, and D. B. Tran, Inexact reduced gradient methods with adaptive error control, 2024","work_id":"6b076fcd-b0cf-419e-94f2-752c0a4c761e","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"T. L. Holst, Implicit algorithm for the conservative transonic full-potential equation using an arbitrary mesh,AIAA Journal, 17 (1979), pp. 1038–1045","work_id":"a7c559d4-6f2f-49ab-ae07-bd1675e7ff0c","year":1979}],"snapshot_sha256":"3f684dfc8262bc4889981ba1291c2156eab735c70d3e38d51f59d414b0c424f6"},"source":{"id":"2605.17599","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:17:35.607333Z","id":"af958ac3-3e81-4705-9cbe-58359c36920b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Connects inexact discrete adjoint gradient bounds to directional tolerances that guarantee descent and convergence in full-potential airfoil pressure-matching optimization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Inexact adjoint gradients satisfy exact descent inequalities under directional tolerances derived from residual bounds.","strongest_claim":"On compact sets of decision variables, a uniform version of this bound is obtained, leading to a directional tolerance condition under which the inexact gradient satisfies an exact descent inequality. The resulting inexact general directions method inherits convergence properties under uniformly bounded, diminishing, and Armijo-type step-size rules.","weakest_assumption":"The gradient-error bound and subsequent directional tolerance hold when the state and adjoint residuals are affine in the state variable; this assumption is invoked to obtain the linear combination bound on gradient error (see theoretical part of abstract)."}},"verdict_id":"af958ac3-3e81-4705-9cbe-58359c36920b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:667127bad0b677360c431d0cc780cf41fcfc858a6bf6fb49c6bc7bd15c286373","target":"record","created_at":"2026-05-20T00:04:47Z","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":"13a98cc0ba11c6c31a1d51a1cc773bd5f64deea7c97977622943989659717dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-17T18:52:16Z","title_canon_sha256":"b6202fd76a8f4907ab19e89d0a1d8e3e7e407d2e6fae22fc5358259aa0950154"},"schema_version":"1.0","source":{"id":"2605.17599","kind":"arxiv","version":1}},"canonical_sha256":"63dee3f63832af216e3258c66bf01550e01d372abe5dc52718d5b05dfa7977ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63dee3f63832af216e3258c66bf01550e01d372abe5dc52718d5b05dfa7977ec","first_computed_at":"2026-05-20T00:04:47.909695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:47.909695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JE40TwOIT11AR2t+6ND/FRTodwJRGvPBcyCrTWIGaHJQrXDyJCRDP/NFGz2wfNDcs3llapxhb06sq1cFtC8CQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:47.910464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:667127bad0b677360c431d0cc780cf41fcfc858a6bf6fb49c6bc7bd15c286373","sha256:c38249cb973b5c92d909fdf6ba92f011bb36b91695b9312d67e3f6ba63b91a37"],"state_sha256":"e63c951716f9002116d1dcb81840cc341669b7293da2eb43873ba29d7c0f3773"}