{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:IBPZDEYOEVWWYVH7AXSLW4EPTP","short_pith_number":"pith:IBPZDEYO","canonical_record":{"source":{"id":"2205.07077","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-14T14:59:43Z","cross_cats_sorted":["q-fin.MF","q-fin.RM"],"title_canon_sha256":"27d34479cf9422bf271708e963a6c7cb0e4a418d6fb74f07a0970489c11eaf85","abstract_canon_sha256":"8351f736c83ecad35aedf955fb9a8ac5f86957e135a879404ce1b2216575b958"},"schema_version":"1.0"},"canonical_sha256":"405f91930e256d6c54ff05e4bb708f9beffaa80bd2de4d0aa19339c96c7286aa","source":{"kind":"arxiv","id":"2205.07077","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07077","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07077v4","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07077","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"IBPZDEYOEVWW","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_16","alias_value":"IBPZDEYOEVWWYVH7","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_8","alias_value":"IBPZDEYO","created_at":"2026-07-05T08:24:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:IBPZDEYOEVWWYVH7AXSLW4EPTP","target":"record","payload":{"canonical_record":{"source":{"id":"2205.07077","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-14T14:59:43Z","cross_cats_sorted":["q-fin.MF","q-fin.RM"],"title_canon_sha256":"27d34479cf9422bf271708e963a6c7cb0e4a418d6fb74f07a0970489c11eaf85","abstract_canon_sha256":"8351f736c83ecad35aedf955fb9a8ac5f86957e135a879404ce1b2216575b958"},"schema_version":"1.0"},"canonical_sha256":"405f91930e256d6c54ff05e4bb708f9beffaa80bd2de4d0aa19339c96c7286aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:52.533965Z","signature_b64":"bcABjvH3B1y+KzaPhCsTDxpWM/zSEizi+T4gVLyzQGmri+OAoM4Gs3Q5thUp9LgWpiXMmOeQFIq5ZEdEdujdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405f91930e256d6c54ff05e4bb708f9beffaa80bd2de4d0aa19339c96c7286aa","last_reissued_at":"2026-07-05T08:24:52.533600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:52.533600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.07077","source_version":4,"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-07-05T08:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SK2QXrLzREm8XRFj0lAOA9yqEC377jRn7rm34TMpg0bhQR2IZ6drPqkzFSJoMslxbuD6vEPB0lY3hmHKUSXyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:47.988411Z"},"content_sha256":"075b653763a206bb3362f7b1929b2c7c5c6e2407ac1cf4c01723a95c31c9353b","schema_version":"1.0","event_id":"sha256:075b653763a206bb3362f7b1929b2c7c5c6e2407ac1cf4c01723a95c31c9353b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:IBPZDEYOEVWWYVH7AXSLW4EPTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning the Efficient Frontier of Convex Vector Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.MF","q-fin.RM"],"primary_cat":"math.OC","authors_text":"Birgit Rudloff, Zachary Feinstein","submitted_at":"2022-05-14T14:59:43Z","abstract_excerpt":"In this paper, we design a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition. The proposed machine learning methodology provides both an inner and outer approximation of the weakly efficient frontier, as well as an upper bound to the error at each approximated efficient point. In numerical case studies we demonstrate that the proposed algorithm is effectively able to approximate the true weakly efficient frontier of CVOPs. This remains true even for large problems (i.e., many objectives, variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07077","kind":"arxiv","version":4},"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/2205.07077/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"},"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-07-05T08:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bDmITjULpM/GZXt1zNe0U3kZE+XCZAExRnU0qceshVWBwqbTRZTdD6vbq39kMHDRuu8YuITIztIZI8+XtrvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:47.988793Z"},"content_sha256":"da026aa35647b6c423d34f74d2da6d530f733447790c9863076c8c0418554e73","schema_version":"1.0","event_id":"sha256:da026aa35647b6c423d34f74d2da6d530f733447790c9863076c8c0418554e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/bundle.json","state_url":"https://pith.science/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/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-07-06T18:34:47Z","links":{"resolver":"https://pith.science/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP","bundle":"https://pith.science/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/bundle.json","state":"https://pith.science/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBPZDEYOEVWWYVH7AXSLW4EPTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:IBPZDEYOEVWWYVH7AXSLW4EPTP","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":"8351f736c83ecad35aedf955fb9a8ac5f86957e135a879404ce1b2216575b958","cross_cats_sorted":["q-fin.MF","q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-14T14:59:43Z","title_canon_sha256":"27d34479cf9422bf271708e963a6c7cb0e4a418d6fb74f07a0970489c11eaf85"},"schema_version":"1.0","source":{"id":"2205.07077","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07077","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07077v4","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07077","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"IBPZDEYOEVWW","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_16","alias_value":"IBPZDEYOEVWWYVH7","created_at":"2026-07-05T08:24:52Z"},{"alias_kind":"pith_short_8","alias_value":"IBPZDEYO","created_at":"2026-07-05T08:24:52Z"}],"graph_snapshots":[{"event_id":"sha256:da026aa35647b6c423d34f74d2da6d530f733447790c9863076c8c0418554e73","target":"graph","created_at":"2026-07-05T08:24:52Z","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/2205.07077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we design a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition. The proposed machine learning methodology provides both an inner and outer approximation of the weakly efficient frontier, as well as an upper bound to the error at each approximated efficient point. In numerical case studies we demonstrate that the proposed algorithm is effectively able to approximate the true weakly efficient frontier of CVOPs. This remains true even for large problems (i.e., many objectives, variable","authors_text":"Birgit Rudloff, Zachary Feinstein","cross_cats":["q-fin.MF","q-fin.RM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-14T14:59:43Z","title":"Deep Learning the Efficient Frontier of Convex Vector Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07077","kind":"arxiv","version":4},"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:075b653763a206bb3362f7b1929b2c7c5c6e2407ac1cf4c01723a95c31c9353b","target":"record","created_at":"2026-07-05T08:24:52Z","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":"8351f736c83ecad35aedf955fb9a8ac5f86957e135a879404ce1b2216575b958","cross_cats_sorted":["q-fin.MF","q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-14T14:59:43Z","title_canon_sha256":"27d34479cf9422bf271708e963a6c7cb0e4a418d6fb74f07a0970489c11eaf85"},"schema_version":"1.0","source":{"id":"2205.07077","kind":"arxiv","version":4}},"canonical_sha256":"405f91930e256d6c54ff05e4bb708f9beffaa80bd2de4d0aa19339c96c7286aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405f91930e256d6c54ff05e4bb708f9beffaa80bd2de4d0aa19339c96c7286aa","first_computed_at":"2026-07-05T08:24:52.533600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:52.533600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bcABjvH3B1y+KzaPhCsTDxpWM/zSEizi+T4gVLyzQGmri+OAoM4Gs3Q5thUp9LgWpiXMmOeQFIq5ZEdEdujdBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:52.533965Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.07077","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:075b653763a206bb3362f7b1929b2c7c5c6e2407ac1cf4c01723a95c31c9353b","sha256:da026aa35647b6c423d34f74d2da6d530f733447790c9863076c8c0418554e73"],"state_sha256":"d017c324f25c84d22dcd1b7bca666f409404f559f97f8aea3fd65ae0e3192851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3T8j6b0amfj4+eXgA53ffoCkj4ZIJjGdz2WFU9Q2SdexGEyDl9G25rL76nvu5hkHxpBA3UcHyYiMNAV0/0grDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:34:47.990843Z","bundle_sha256":"a768fffd90c411ca42fc9d1091b8b7e2242fe8fcb955c362833c13ac1eb2a018"}}