{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XY7FWYDTA3NTSPUEET5FLVY5QY","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"922f8f55c410e8b78d32734137186cdc2c9872e0009517d4dd4d3ba274b1b196","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:32:59Z","title_canon_sha256":"6a7d41becbb7ce922fb454a079da21b4bb1588f14e9736e2d0fd83db089b3f5e"},"schema_version":"1.0","source":{"id":"2605.14320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14320","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14320v1","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14320","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"XY7FWYDTA3NT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XY7FWYDTA3NTSPUE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XY7FWYDT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d0e4ce3c9a55d41c05cd9dfa507516c74f76857720b8b707dd1331d4d026b6e5","target":"graph","created_at":"2026-05-17T23:39:09Z","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":"We prove that the improved Euclidean convergence rate O(k^{2/(1-q)}) extends to all fixed inner-product norms and establish a dispersion theorem showing that the cut normals generated by the algorithm naturally spread across all directions when the upper image has a strictly convex boundary with bounded curvature."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The upper image has a strictly convex boundary with bounded curvature, which is required to guarantee that the adaptive metric remains well-conditioned throughout execution."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An adaptive metric framework for outer approximation in convex vector optimization extends convergence rates to inner-product norms, proves a dispersion theorem under strict convexity, and achieves 31-33% fewer iterations than fixed Euclidean norm on curved Pareto fronts."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation."}],"snapshot_sha256":"c9acb063fa38b68cd019f232ae9c16ab6fe5aa8c792638009203916c583b2ed3"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ed9dcfc4f4065758de2778fe135cdb3645e9aabf74b104d0aba68bca6c0bbeb4"},"paper":{"abstract_excerpt":"We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation error in a fixed Euclidean norm. This enables the algorithm to exploit problem geometry dynamically. Our approach rests on two theoretical foundations. First, we prove that the improved Euclidean convergence rate $O(k^{2/(1-q)})$ -- previously known only for the standard $\\ell_2$ norm -- extends to all fixed inner-product norms. Second, we establish a dispers","authors_text":"Mohammed Alshahrani","cross_cats":["cs.NA","math.NA"],"headline":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:32:59Z","title":"Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"10.1007/978-3-319-63049-6","is_internal_anchor":false,"ref_index":1,"title":"Q. H. Ansari, E. K¨ obis, and J.-C. Yao,Vector Variational Inequalities and Vector Optimization(Vector Optimization), en. Cham: Springer International Publishing, 2018.doi:10.1007/978-3-319-63049-6","work_id":"f2cde9a9-0b19-4d23-8ffe-2012e2fe4bf0","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A Norm Minimization-Based Convex Vector Optimization Algorithm,","work_id":"104bfda2-ea9e-422b-bc55-e2f711eda42e","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Outer Approximation Algorithms for Convex Vector Optimization Problems,","work_id":"71309eac-3772-461e-abf5-014427db40e6","year":2023},{"cited_arxiv_id":"","doi":"10.1137/23m1574580","is_internal_anchor":false,"ref_index":4,"title":"Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm,","work_id":"f84b4e15-7f19-43c9-be85-1193fecf1f0d","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A Class of Adaptive Algorithms for Approximating Convex Bodies by Polyhedra,","work_id":"2437bde4-aaae-4c02-ad80-32ba31631e94","year":1992}],"snapshot_sha256":"f17a053871e22ba7395c11655d31c1bbfdd6ed7d4ee6c98beca19eaccc8ef22e"},"source":{"id":"2605.14320","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:42:26.871740Z","id":"34a90024-2ed3-4fd7-ad8b-4805c18d5e19","model_set":{"reader":"grok-4.3"},"one_line_summary":"An adaptive metric framework for outer approximation in convex vector optimization extends convergence rates to inner-product norms, proves a dispersion theorem under strict convexity, and achieves 31-33% fewer iterations than fixed Euclidean norm on curved Pareto fronts.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation.","strongest_claim":"We prove that the improved Euclidean convergence rate O(k^{2/(1-q)}) extends to all fixed inner-product norms and establish a dispersion theorem showing that the cut normals generated by the algorithm naturally spread across all directions when the upper image has a strictly convex boundary with bounded curvature.","weakest_assumption":"The upper image has a strictly convex boundary with bounded curvature, which is required to guarantee that the adaptive metric remains well-conditioned throughout execution."}},"verdict_id":"34a90024-2ed3-4fd7-ad8b-4805c18d5e19"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:66041298007ec77c8fbd4b65e177d6dfa5c1d58fb2af14e85a1bd3597b782cb2","target":"record","created_at":"2026-05-17T23:39:09Z","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":"922f8f55c410e8b78d32734137186cdc2c9872e0009517d4dd4d3ba274b1b196","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:32:59Z","title_canon_sha256":"6a7d41becbb7ce922fb454a079da21b4bb1588f14e9736e2d0fd83db089b3f5e"},"schema_version":"1.0","source":{"id":"2605.14320","kind":"arxiv","version":1}},"canonical_sha256":"be3e5b607306db393e8424fa55d71d8619a280c537f4ff124670acd1a833b5ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3e5b607306db393e8424fa55d71d8619a280c537f4ff124670acd1a833b5ac","first_computed_at":"2026-05-17T23:39:09.849277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:09.849277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ofq7Mc7+VzU/BFSvRj6Ri4TUXRAzm6NKJHa0ltgIEjEzWZErvdJm2Hsh2IEEBTxJQPwJd+EmkGykRhHa0hlQAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:09.849900Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66041298007ec77c8fbd4b65e177d6dfa5c1d58fb2af14e85a1bd3597b782cb2","sha256:d0e4ce3c9a55d41c05cd9dfa507516c74f76857720b8b707dd1331d4d026b6e5","sha256:c796174fe512ef8688687ad0ec555f53ff3b98b82de891ab4c33d38c42eb4422"],"state_sha256":"d2449b39426f73471a4ab61faa12462e1a6d98179119c301fe90900b3517adfe"}