{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CQYD5JJDDZLPCEXSRAUBDD5RY5","short_pith_number":"pith:CQYD5JJD","canonical_record":{"source":{"id":"1612.03815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-12T17:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"8510e3325f89cb97c038e19272bf6f63af84df098d87d5d3d6e85748cb1536ec","abstract_canon_sha256":"7410d29d5492c1e9d5371fcf48458d60c2661d59fd2c86740781d725d7668cf8"},"schema_version":"1.0"},"canonical_sha256":"14303ea5231e56f112f28828118fb1c743b686eeaba7687a064a3f4e7fdd6d50","source":{"kind":"arxiv","id":"1612.03815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03815","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03815v2","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03815","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"CQYD5JJDDZLP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQYD5JJDDZLPCEXS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQYD5JJD","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CQYD5JJDDZLPCEXSRAUBDD5RY5","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-12T17:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"8510e3325f89cb97c038e19272bf6f63af84df098d87d5d3d6e85748cb1536ec","abstract_canon_sha256":"7410d29d5492c1e9d5371fcf48458d60c2661d59fd2c86740781d725d7668cf8"},"schema_version":"1.0"},"canonical_sha256":"14303ea5231e56f112f28828118fb1c743b686eeaba7687a064a3f4e7fdd6d50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:10.210348Z","signature_b64":"1W8+0FqFrp6gwGL42O6ZaV7SGzzLXFCAbcBoFl9OVjIJm5pT+DJnROtgtu4Ups7i27p6CRYP0Rs9ARm8jr5FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14303ea5231e56f112f28828118fb1c743b686eeaba7687a064a3f4e7fdd6d50","last_reissued_at":"2026-05-18T00:09:10.209764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:10.209764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03815","source_version":2,"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-18T00:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdpYeMYhLx1V6Fwa2+NH6bFwmmZ672ckhJtVbsB13JKkOjjYXd10tKjd8RCdp5cp/sNIDDlYsfX1WI4KDJDEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:04.473486Z"},"content_sha256":"31c50cab561a275bf33a37c6a7cf92211f45d35dfc7bc2bdef9a8c4af7177812","schema_version":"1.0","event_id":"sha256:31c50cab561a275bf33a37c6a7cf92211f45d35dfc7bc2bdef9a8c4af7177812"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CQYD5JJDDZLPCEXSRAUBDD5RY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient-Based Multiobjective Optimization with Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Dellnitz, Sebastian Peitz","submitted_at":"2016-12-12T17:50:31Z","abstract_excerpt":"In this article we develop a gradient-based algorithm for the solution of multiobjective optimization problems with uncertainties. To this end, an additional condition is derived for the descent direction in order to account for inaccuracies in the gradients and then incorporated in a subdivison algorithm for the computation of global solutions to multiobjective optimization problems. Convergence to a superset of the Pareto set is proved and an upper bound for the maximal distance to the set of substationary points is given. Besides the applicability to problems with uncertainties, the algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03815","kind":"arxiv","version":2},"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-18T00:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVbsHA30rxgCLrS304mi2WLtnRX0FG/XBWpBcKVx4xOiINRjc03tjC7bNK7fbbiqSbsMWhBdy8sm+SKq9jtKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:04.473967Z"},"content_sha256":"2b87607c1227cbb247c4c89a635e1d551d246aba83aad5c376bd9ec3207c3732","schema_version":"1.0","event_id":"sha256:2b87607c1227cbb247c4c89a635e1d551d246aba83aad5c376bd9ec3207c3732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/bundle.json","state_url":"https://pith.science/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/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-01T05:45:04Z","links":{"resolver":"https://pith.science/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5","bundle":"https://pith.science/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/bundle.json","state":"https://pith.science/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQYD5JJDDZLPCEXSRAUBDD5RY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CQYD5JJDDZLPCEXSRAUBDD5RY5","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":"7410d29d5492c1e9d5371fcf48458d60c2661d59fd2c86740781d725d7668cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-12T17:50:31Z","title_canon_sha256":"8510e3325f89cb97c038e19272bf6f63af84df098d87d5d3d6e85748cb1536ec"},"schema_version":"1.0","source":{"id":"1612.03815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03815","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03815v2","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03815","created_at":"2026-05-18T00:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"CQYD5JJDDZLP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQYD5JJDDZLPCEXS","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQYD5JJD","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:2b87607c1227cbb247c4c89a635e1d551d246aba83aad5c376bd9ec3207c3732","target":"graph","created_at":"2026-05-18T00:09: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":"In this article we develop a gradient-based algorithm for the solution of multiobjective optimization problems with uncertainties. To this end, an additional condition is derived for the descent direction in order to account for inaccuracies in the gradients and then incorporated in a subdivison algorithm for the computation of global solutions to multiobjective optimization problems. Convergence to a superset of the Pareto set is proved and an upper bound for the maximal distance to the set of substationary points is given. Besides the applicability to problems with uncertainties, the algorit","authors_text":"Michael Dellnitz, Sebastian Peitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-12T17:50:31Z","title":"Gradient-Based Multiobjective Optimization with Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03815","kind":"arxiv","version":2},"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:31c50cab561a275bf33a37c6a7cf92211f45d35dfc7bc2bdef9a8c4af7177812","target":"record","created_at":"2026-05-18T00:09: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":"7410d29d5492c1e9d5371fcf48458d60c2661d59fd2c86740781d725d7668cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-12T17:50:31Z","title_canon_sha256":"8510e3325f89cb97c038e19272bf6f63af84df098d87d5d3d6e85748cb1536ec"},"schema_version":"1.0","source":{"id":"1612.03815","kind":"arxiv","version":2}},"canonical_sha256":"14303ea5231e56f112f28828118fb1c743b686eeaba7687a064a3f4e7fdd6d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14303ea5231e56f112f28828118fb1c743b686eeaba7687a064a3f4e7fdd6d50","first_computed_at":"2026-05-18T00:09:10.209764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:10.209764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1W8+0FqFrp6gwGL42O6ZaV7SGzzLXFCAbcBoFl9OVjIJm5pT+DJnROtgtu4Ups7i27p6CRYP0Rs9ARm8jr5FCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:10.210348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31c50cab561a275bf33a37c6a7cf92211f45d35dfc7bc2bdef9a8c4af7177812","sha256:2b87607c1227cbb247c4c89a635e1d551d246aba83aad5c376bd9ec3207c3732"],"state_sha256":"9d5b49204033bbf5332621c481840c9ae561d35efc1872ed3e601700b7df069c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLaTwpTIiq2HkqyewDfNOS85XLKpFQvgJAcNsyHgviPPQziKP7lzZC9vJ0KTob1bV6AqHMNZXRz+mYTQGHdxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:45:04.475877Z","bundle_sha256":"2968f0806b7b6868ca984e8571d6d271b84d969b675f3beb3d870ae6142432e0"}}