{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OHZQCR36H5VHBZ76LTEOUKKYXS","short_pith_number":"pith:OHZQCR36","canonical_record":{"source":{"id":"1906.09075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-21T11:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"45bb08a8638b7eb41e371d28d326951a127e99a70c9f25360f19e00dc322c0dd","abstract_canon_sha256":"b73813ede6da36b3a84e197ff5c71bf277038dfa7d216b7e3d6074837db5a4e7"},"schema_version":"1.0"},"canonical_sha256":"71f301477e3f6a70e7fe5cc8ea2958bcad47e30d2d8a236eac3a08ffc5f44b41","source":{"kind":"arxiv","id":"1906.09075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09075","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09075v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09075","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"OHZQCR36H5VH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHZQCR36H5VHBZ76","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHZQCR36","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OHZQCR36H5VHBZ76LTEOUKKYXS","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-21T11:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"45bb08a8638b7eb41e371d28d326951a127e99a70c9f25360f19e00dc322c0dd","abstract_canon_sha256":"b73813ede6da36b3a84e197ff5c71bf277038dfa7d216b7e3d6074837db5a4e7"},"schema_version":"1.0"},"canonical_sha256":"71f301477e3f6a70e7fe5cc8ea2958bcad47e30d2d8a236eac3a08ffc5f44b41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.653772Z","signature_b64":"NHOMCfsDWfpsQqPREF4qjwGqkIdtuJ/h4Y3E/0iaDYoCgKjMSUzuxR+95nrVU6FvHJ/GCWK5mX5927uhynV9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71f301477e3f6a70e7fe5cc8ea2958bcad47e30d2d8a236eac3a08ffc5f44b41","last_reissued_at":"2026-05-17T23:42:44.653086Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.653086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09075","source_version":1,"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMgBJuHJeBcC2PkovuraBtsel+nk5WDLn45jfZfDUXcPplkQPN/SOLb0gEHJ5Oq7Zwc4qNc0+5h+GBYfEhxsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:56:17.209021Z"},"content_sha256":"48a71a47a83844699b95196c651484bac8cb6365105a80f87c167f75d6cd83f2","schema_version":"1.0","event_id":"sha256:48a71a47a83844699b95196c651484bac8cb6365105a80f87c167f75d6cd83f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OHZQCR36H5VHBZ76LTEOUKKYXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ROM-based multiobjective optimization of elliptic PDEs via numerical continuation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bennet Gebken, Michael Dellnitz, Sebastian Peitz, Stefan Banholzer, Stefan Volkwein","submitted_at":"2019-06-21T11:28:04Z","abstract_excerpt":"Multiobjective optimization plays an increasingly important role in modern applications, where several objectives are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging which is particularly problematic when the objectives are costly to evaluate as is the case for models governed by partial differential equa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09075","kind":"arxiv","version":1},"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtiM3PuWFHY42vTepMv9XDzpzdt2+BbVgRGSS1cK8xK0l3wTNU56OwpyZjRANwnwLHi0P1qrL4/seXAPXFRDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:56:17.209391Z"},"content_sha256":"870a7f293c3c34c66d69932721d6ff6bad376d9ba18720209328a645f3158ef8","schema_version":"1.0","event_id":"sha256:870a7f293c3c34c66d69932721d6ff6bad376d9ba18720209328a645f3158ef8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/bundle.json","state_url":"https://pith.science/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/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-22T05:56:17Z","links":{"resolver":"https://pith.science/pith/OHZQCR36H5VHBZ76LTEOUKKYXS","bundle":"https://pith.science/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/bundle.json","state":"https://pith.science/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHZQCR36H5VHBZ76LTEOUKKYXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OHZQCR36H5VHBZ76LTEOUKKYXS","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":"b73813ede6da36b3a84e197ff5c71bf277038dfa7d216b7e3d6074837db5a4e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-21T11:28:04Z","title_canon_sha256":"45bb08a8638b7eb41e371d28d326951a127e99a70c9f25360f19e00dc322c0dd"},"schema_version":"1.0","source":{"id":"1906.09075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09075","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09075v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09075","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"OHZQCR36H5VH","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHZQCR36H5VHBZ76","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHZQCR36","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:870a7f293c3c34c66d69932721d6ff6bad376d9ba18720209328a645f3158ef8","target":"graph","created_at":"2026-05-17T23:42:44Z","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":"Multiobjective optimization plays an increasingly important role in modern applications, where several objectives are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging which is particularly problematic when the objectives are costly to evaluate as is the case for models governed by partial differential equa","authors_text":"Bennet Gebken, Michael Dellnitz, Sebastian Peitz, Stefan Banholzer, Stefan Volkwein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-21T11:28:04Z","title":"ROM-based multiobjective optimization of elliptic PDEs via numerical continuation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09075","kind":"arxiv","version":1},"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:48a71a47a83844699b95196c651484bac8cb6365105a80f87c167f75d6cd83f2","target":"record","created_at":"2026-05-17T23:42:44Z","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":"b73813ede6da36b3a84e197ff5c71bf277038dfa7d216b7e3d6074837db5a4e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-21T11:28:04Z","title_canon_sha256":"45bb08a8638b7eb41e371d28d326951a127e99a70c9f25360f19e00dc322c0dd"},"schema_version":"1.0","source":{"id":"1906.09075","kind":"arxiv","version":1}},"canonical_sha256":"71f301477e3f6a70e7fe5cc8ea2958bcad47e30d2d8a236eac3a08ffc5f44b41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71f301477e3f6a70e7fe5cc8ea2958bcad47e30d2d8a236eac3a08ffc5f44b41","first_computed_at":"2026-05-17T23:42:44.653086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:44.653086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NHOMCfsDWfpsQqPREF4qjwGqkIdtuJ/h4Y3E/0iaDYoCgKjMSUzuxR+95nrVU6FvHJ/GCWK5mX5927uhynV9AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:44.653772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a71a47a83844699b95196c651484bac8cb6365105a80f87c167f75d6cd83f2","sha256:870a7f293c3c34c66d69932721d6ff6bad376d9ba18720209328a645f3158ef8"],"state_sha256":"f8ed79cface7fe6029c5bb4f5b134f27291b3162d785f231e287776285016640"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfNH5UkRM6p9CI95gI4IEXQ0ReD6U61MLXdtPOxVD0D6Kf92ExVRl4u4JW+26T7/RyjuT037X2HXI4/vopgsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T05:56:17.211302Z","bundle_sha256":"77effae1a35e5ff394f4e5838c275d5effc457e98f2f09d931f2168d896770aa"}}