{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7EX3CSZB4PE4HSOMA73Z7SEPGW","short_pith_number":"pith:7EX3CSZB","schema_version":"1.0","canonical_sha256":"f92fb14b21e3c9c3c9cc07f79fc88f358227a6bcfae196162d5a935ea7ef52d1","source":{"kind":"arxiv","id":"2207.03200","version":3},"attestation_state":"computed","paper":{"title":"Algorithms to solve unbounded convex vector optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Wagner, Birgit Rudloff, Firdevs Ulus, Gabriela Kov\\'a\\v{c}ov\\'a, Niklas Hey","submitted_at":"2022-07-07T10:06:50Z","abstract_excerpt":"This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler et al. 2021, Loehne et al. 2014]. They provide a polyhedral inner and outer approximation of the upper image that have a Hausdorff distance of at most $\\varepsilon$. However, it is well known (see [Ulus, 2018]), that for some unbounded problems such polyhedral approximations do not exist. In this paper, we will propose a generalized solution concept, called"},"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":"2207.03200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T10:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"644fe14eee2272ea1e5075bc8f7a3fa14604cf1ee48c572d674cbb6bded49b3f","abstract_canon_sha256":"06ae56e7fff34c859066b56c3849035416f964a09260fd846cee010ff55fcfd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:47.898503Z","signature_b64":"ukQAOmh/HsH3mFcynuaNO1KXnjBWKEj0+NO6TRg0hrhTV8nFAfXerKiwTaqPrL/I+1RPiOmg6UE9kMF31ZTwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f92fb14b21e3c9c3c9cc07f79fc88f358227a6bcfae196162d5a935ea7ef52d1","last_reissued_at":"2026-07-05T05:34:47.898087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:47.898087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms to solve unbounded convex vector optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Wagner, Birgit Rudloff, Firdevs Ulus, Gabriela Kov\\'a\\v{c}ov\\'a, Niklas Hey","submitted_at":"2022-07-07T10:06:50Z","abstract_excerpt":"This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler et al. 2021, Loehne et al. 2014]. They provide a polyhedral inner and outer approximation of the upper image that have a Hausdorff distance of at most $\\varepsilon$. However, it is well known (see [Ulus, 2018]), that for some unbounded problems such polyhedral approximations do not exist. In this paper, we will propose a generalized solution concept, called"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03200","kind":"arxiv","version":3},"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/2207.03200/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":"2207.03200","created_at":"2026-07-05T05:34:47.898144+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.03200v3","created_at":"2026-07-05T05:34:47.898144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03200","created_at":"2026-07-05T05:34:47.898144+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EX3CSZB4PE4","created_at":"2026-07-05T05:34:47.898144+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EX3CSZB4PE4HSOM","created_at":"2026-07-05T05:34:47.898144+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EX3CSZB","created_at":"2026-07-05T05:34:47.898144+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW","json":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW.json","graph_json":"https://pith.science/api/pith-number/7EX3CSZB4PE4HSOMA73Z7SEPGW/graph.json","events_json":"https://pith.science/api/pith-number/7EX3CSZB4PE4HSOMA73Z7SEPGW/events.json","paper":"https://pith.science/paper/7EX3CSZB"},"agent_actions":{"view_html":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW","download_json":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW.json","view_paper":"https://pith.science/paper/7EX3CSZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.03200&json=true","fetch_graph":"https://pith.science/api/pith-number/7EX3CSZB4PE4HSOMA73Z7SEPGW/graph.json","fetch_events":"https://pith.science/api/pith-number/7EX3CSZB4PE4HSOMA73Z7SEPGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW/action/storage_attestation","attest_author":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW/action/author_attestation","sign_citation":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW/action/citation_signature","submit_replication":"https://pith.science/pith/7EX3CSZB4PE4HSOMA73Z7SEPGW/action/replication_record"}},"created_at":"2026-07-05T05:34:47.898144+00:00","updated_at":"2026-07-05T05:34:47.898144+00:00"}