{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XY7FWYDTA3NTSPUEET5FLVY5QY","short_pith_number":"pith:XY7FWYDT","schema_version":"1.0","canonical_sha256":"be3e5b607306db393e8424fa55d71d8619a280c537f4ff124670acd1a833b5ac","source":{"kind":"arxiv","id":"2605.14320","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation.","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Mohammed Alshahrani","submitted_at":"2026-05-14T03:32:59Z","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"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14320","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:32:59Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"6a7d41becbb7ce922fb454a079da21b4bb1588f14e9736e2d0fd83db089b3f5e","abstract_canon_sha256":"922f8f55c410e8b78d32734137186cdc2c9872e0009517d4dd4d3ba274b1b196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:09.849900Z","signature_b64":"Ofq7Mc7+VzU/BFSvRj6Ri4TUXRAzm6NKJHa0ltgIEjEzWZErvdJm2Hsh2IEEBTxJQPwJd+EmkGykRhHa0hlQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3e5b607306db393e8424fa55d71d8619a280c537f4ff124670acd1a833b5ac","last_reissued_at":"2026-05-17T23:39:09.849277Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:09.849277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation.","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Mohammed Alshahrani","submitted_at":"2026-05-14T03:32:59Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c9acb063fa38b68cd019f232ae9c16ab6fe5aa8c792638009203916c583b2ed3"},"source":{"id":"2605.14320","kind":"arxiv","version":1},"verdict":{"id":"34a90024-2ed3-4fd7-ad8b-4805c18d5e19","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:42:26.871740Z","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.","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","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.","pith_extraction_headline":"Adaptive metrics extend improved convergence rates to all inner-product norms in convex vector optimization outer approximation."},"references":{"count":25,"sample":[{"doi":"10.1007/978-3-319-63049-6","year":2018,"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","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"A Norm Minimization-Based Convex Vector Optimization Algorithm,","work_id":"104bfda2-ea9e-422b-bc55-e2f711eda42e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Outer Approximation Algorithms for Convex Vector Optimization Problems,","work_id":"71309eac-3772-461e-abf5-014427db40e6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/23m1574580","year":2024,"title":"Convergence Analysis of a Norm Minimization-Based Convex Vector Optimization Algorithm,","work_id":"f84b4e15-7f19-43c9-be85-1193fecf1f0d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1992,"title":"A Class of Adaptive Algorithms for Approximating Convex Bodies by Polyhedra,","work_id":"2437bde4-aaae-4c02-ad80-32ba31631e94","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"f17a053871e22ba7395c11655d31c1bbfdd6ed7d4ee6c98beca19eaccc8ef22e","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ed9dcfc4f4065758de2778fe135cdb3645e9aabf74b104d0aba68bca6c0bbeb4"},"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":"2605.14320","created_at":"2026-05-17T23:39:09.849383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14320v1","created_at":"2026-05-17T23:39:09.849383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14320","created_at":"2026-05-17T23:39:09.849383+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY7FWYDTA3NT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY7FWYDTA3NTSPUE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY7FWYDT","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14324","citing_title":"Convergence Rates for $\\ell_p$ Norm Minimization in Convex Vector Optimization","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY","json":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY.json","graph_json":"https://pith.science/api/pith-number/XY7FWYDTA3NTSPUEET5FLVY5QY/graph.json","events_json":"https://pith.science/api/pith-number/XY7FWYDTA3NTSPUEET5FLVY5QY/events.json","paper":"https://pith.science/paper/XY7FWYDT"},"agent_actions":{"view_html":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY","download_json":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY.json","view_paper":"https://pith.science/paper/XY7FWYDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14320&json=true","fetch_graph":"https://pith.science/api/pith-number/XY7FWYDTA3NTSPUEET5FLVY5QY/graph.json","fetch_events":"https://pith.science/api/pith-number/XY7FWYDTA3NTSPUEET5FLVY5QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY/action/storage_attestation","attest_author":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY/action/author_attestation","sign_citation":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY/action/citation_signature","submit_replication":"https://pith.science/pith/XY7FWYDTA3NTSPUEET5FLVY5QY/action/replication_record"}},"created_at":"2026-05-17T23:39:09.849383+00:00","updated_at":"2026-05-17T23:39:09.849383+00:00"}