{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MAGTQCK35V5ZIM4OPX3LDZMUTN","short_pith_number":"pith:MAGTQCK3","canonical_record":{"source":{"id":"1702.05645","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-18T19:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"130e7c552156f7d2dfc5605f6f31a4afbb9d5d976c7ca1446f88bb946ee9c865","abstract_canon_sha256":"6ead10a73a5189afeb4b8464286d66e650a41999b87f6b57d4a487d854ac3112"},"schema_version":"1.0"},"canonical_sha256":"600d38095bed7b94338e7df6b1e5949b65770da513fe7aad9dc5cf3ed71e4d33","source":{"kind":"arxiv","id":"1702.05645","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05645","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05645v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05645","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"MAGTQCK35V5Z","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MAGTQCK35V5ZIM4O","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MAGTQCK3","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MAGTQCK35V5ZIM4OPX3LDZMUTN","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05645","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-18T19:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"130e7c552156f7d2dfc5605f6f31a4afbb9d5d976c7ca1446f88bb946ee9c865","abstract_canon_sha256":"6ead10a73a5189afeb4b8464286d66e650a41999b87f6b57d4a487d854ac3112"},"schema_version":"1.0"},"canonical_sha256":"600d38095bed7b94338e7df6b1e5949b65770da513fe7aad9dc5cf3ed71e4d33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.163609Z","signature_b64":"zx9j0FX/iTNPoajEI6ewvHXWkFif9wospTym24cOxTHyrEfIwyX8s4IvehTED1/2azLAS2ZqwR/mM/7+b8zTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600d38095bed7b94338e7df6b1e5949b65770da513fe7aad9dc5cf3ed71e4d33","last_reissued_at":"2026-05-17T23:45:10.162792Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.162792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05645","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jf2exzNXTafzvKluNHv+EbSGR963wL9UbfHhxWH9sD6PVp4rgv5BtmW6f9wIs0gPw9iK0cbtrMwMFAws2Vd/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:49:11.041901Z"},"content_sha256":"52f743680d112cfb9b7e8d965737f7eba87baecedccacc7515e8b453d0f68858","schema_version":"1.0","event_id":"sha256:52f743680d112cfb9b7e8d965737f7eba87baecedccacc7515e8b453d0f68858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MAGTQCK35V5ZIM4OPX3LDZMUTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Firdevs Ulus","submitted_at":"2017-02-18T19:09:15Z","abstract_excerpt":"There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner and outer approximations to the Pareto frontier. A CVOP with compact feasible region is known to be bounded and there exists a solution of this sense to it. However, it is not known if it is possible to generate polyhedral inner and outer approximations to the Pareto frontier of a CVOP if the feasible region is not compact. This study shows that not all CVOPs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05645","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwtrQ3hYddDeRKvfZlb6dPlN+HBYEctlnmwnryJTFfNCEVxR1cbDRWU+Kjwyw0spU+RxofpnVhnkIXkjXTDWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:49:11.042233Z"},"content_sha256":"54fc2613bf5273ddc4b69aedeac3cc2f05e97dcb81ab4304da11e5d8e9ed2004","schema_version":"1.0","event_id":"sha256:54fc2613bf5273ddc4b69aedeac3cc2f05e97dcb81ab4304da11e5d8e9ed2004"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/bundle.json","state_url":"https://pith.science/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T16:49:11Z","links":{"resolver":"https://pith.science/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN","bundle":"https://pith.science/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/bundle.json","state":"https://pith.science/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAGTQCK35V5ZIM4OPX3LDZMUTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MAGTQCK35V5ZIM4OPX3LDZMUTN","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":"6ead10a73a5189afeb4b8464286d66e650a41999b87f6b57d4a487d854ac3112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-18T19:09:15Z","title_canon_sha256":"130e7c552156f7d2dfc5605f6f31a4afbb9d5d976c7ca1446f88bb946ee9c865"},"schema_version":"1.0","source":{"id":"1702.05645","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05645","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05645v3","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05645","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"MAGTQCK35V5Z","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MAGTQCK35V5ZIM4O","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MAGTQCK3","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:54fc2613bf5273ddc4b69aedeac3cc2f05e97dcb81ab4304da11e5d8e9ed2004","target":"graph","created_at":"2026-05-17T23:45:10Z","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"},"paper":{"abstract_excerpt":"There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner and outer approximations to the Pareto frontier. A CVOP with compact feasible region is known to be bounded and there exists a solution of this sense to it. However, it is not known if it is possible to generate polyhedral inner and outer approximations to the Pareto frontier of a CVOP if the feasible region is not compact. This study shows that not all CVOPs","authors_text":"Firdevs Ulus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-18T19:09:15Z","title":"Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05645","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:52f743680d112cfb9b7e8d965737f7eba87baecedccacc7515e8b453d0f68858","target":"record","created_at":"2026-05-17T23:45:10Z","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":"6ead10a73a5189afeb4b8464286d66e650a41999b87f6b57d4a487d854ac3112","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-18T19:09:15Z","title_canon_sha256":"130e7c552156f7d2dfc5605f6f31a4afbb9d5d976c7ca1446f88bb946ee9c865"},"schema_version":"1.0","source":{"id":"1702.05645","kind":"arxiv","version":3}},"canonical_sha256":"600d38095bed7b94338e7df6b1e5949b65770da513fe7aad9dc5cf3ed71e4d33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"600d38095bed7b94338e7df6b1e5949b65770da513fe7aad9dc5cf3ed71e4d33","first_computed_at":"2026-05-17T23:45:10.162792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.162792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zx9j0FX/iTNPoajEI6ewvHXWkFif9wospTym24cOxTHyrEfIwyX8s4IvehTED1/2azLAS2ZqwR/mM/7+b8zTCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.163609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05645","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52f743680d112cfb9b7e8d965737f7eba87baecedccacc7515e8b453d0f68858","sha256:54fc2613bf5273ddc4b69aedeac3cc2f05e97dcb81ab4304da11e5d8e9ed2004"],"state_sha256":"9d506da4c1ac34211763f93b20b9fb5c05200e902a2054eee3185ebdc7bdae98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXG1nGNGtd5JY0gAmvjPaaWapZLJ1TTYyE77mqpyM49obnOgDkbJwA8SuEHIKBzFRFRF4wDId71b0QXI8qclAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:49:11.044171Z","bundle_sha256":"80104ab65b8cc9e865ae6160b6561b981e420fec8159a26145172493f5ae90d0"}}