{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7EX3CSZB4PE4HSOMA73Z7SEPGW","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":"06ae56e7fff34c859066b56c3849035416f964a09260fd846cee010ff55fcfd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T10:06:50Z","title_canon_sha256":"644fe14eee2272ea1e5075bc8f7a3fa14604cf1ee48c572d674cbb6bded49b3f"},"schema_version":"1.0","source":{"id":"2207.03200","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03200","created_at":"2026-07-05T05:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03200v3","created_at":"2026-07-05T05:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03200","created_at":"2026-07-05T05:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"7EX3CSZB4PE4","created_at":"2026-07-05T05:34:47Z"},{"alias_kind":"pith_short_16","alias_value":"7EX3CSZB4PE4HSOM","created_at":"2026-07-05T05:34:47Z"},{"alias_kind":"pith_short_8","alias_value":"7EX3CSZB","created_at":"2026-07-05T05:34:47Z"}],"graph_snapshots":[{"event_id":"sha256:0b748c10ba211c14bbe42bb9fe2a3bf56788a5b5fda7edb960f3858a2cac854a","target":"graph","created_at":"2026-07-05T05:34: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.03200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Wagner, Birgit Rudloff, Firdevs Ulus, Gabriela Kov\\'a\\v{c}ov\\'a, Niklas Hey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T10:06:50Z","title":"Algorithms to solve unbounded convex vector optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03200","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2409778a9fab49901ee367a2ca8ff1f8a06ea1c15c85530d9d563104f868f174","target":"record","created_at":"2026-07-05T05:34: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":"06ae56e7fff34c859066b56c3849035416f964a09260fd846cee010ff55fcfd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-07T10:06:50Z","title_canon_sha256":"644fe14eee2272ea1e5075bc8f7a3fa14604cf1ee48c572d674cbb6bded49b3f"},"schema_version":"1.0","source":{"id":"2207.03200","kind":"arxiv","version":3}},"canonical_sha256":"f92fb14b21e3c9c3c9cc07f79fc88f358227a6bcfae196162d5a935ea7ef52d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f92fb14b21e3c9c3c9cc07f79fc88f358227a6bcfae196162d5a935ea7ef52d1","first_computed_at":"2026-07-05T05:34:47.898087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:34:47.898087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ukQAOmh/HsH3mFcynuaNO1KXnjBWKEj0+NO6TRg0hrhTV8nFAfXerKiwTaqPrL/I+1RPiOmg6UE9kMF31ZTwAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:34:47.898503Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03200","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2409778a9fab49901ee367a2ca8ff1f8a06ea1c15c85530d9d563104f868f174","sha256:0b748c10ba211c14bbe42bb9fe2a3bf56788a5b5fda7edb960f3858a2cac854a"],"state_sha256":"b0b2153d89db5c5d93685e9d51f5680f55778dff30aebb9cd7c2b45151e54493"}