{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TEJO7GPOH2OJZS46OPAPDVGWMG","short_pith_number":"pith:TEJO7GPO","canonical_record":{"source":{"id":"1501.02658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-12T14:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"57e45968ff129d08b50f177fc408b0b03aac71f077a879c02015fc9457a30379","abstract_canon_sha256":"974466918db5023fd444e763267c7eb60cf97391f3d7855b227e743af0c014cc"},"schema_version":"1.0"},"canonical_sha256":"9912ef99ee3e9c9ccb9e73c0f1d4d6618767ab23c6ab81bf97b18f143e507c17","source":{"kind":"arxiv","id":"1501.02658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02658","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02658v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02658","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"TEJO7GPOH2OJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TEJO7GPOH2OJZS46","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TEJO7GPO","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TEJO7GPOH2OJZS46OPAPDVGWMG","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-12T14:23:24Z","cross_cats_sorted":[],"title_canon_sha256":"57e45968ff129d08b50f177fc408b0b03aac71f077a879c02015fc9457a30379","abstract_canon_sha256":"974466918db5023fd444e763267c7eb60cf97391f3d7855b227e743af0c014cc"},"schema_version":"1.0"},"canonical_sha256":"9912ef99ee3e9c9ccb9e73c0f1d4d6618767ab23c6ab81bf97b18f143e507c17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.531229Z","signature_b64":"9nwun6nBc5rAGsrjXMGpYzs1iSpDfiwYunrEkhPuEYpRdqW+71e4kCyw3eFkR+Xh5IrNyHTAqpu5nwc7ksQYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9912ef99ee3e9c9ccb9e73c0f1d4d6618767ab23c6ab81bf97b18f143e507c17","last_reissued_at":"2026-05-18T02:29:37.530825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.530825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02658","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esXoSCR/bwMKx9jG38aRqmW8CCnhUPDKIqUVPs28EKTXnU0nCBb1QTSbqDux7fOp6PskJrlWTIpNsWL3brBwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:55:32.469502Z"},"content_sha256":"f30955d865c5f0b18fdcbf6071580bbe39ba3a6a4bc3c536bfa8b848bf211472","schema_version":"1.0","event_id":"sha256:f30955d865c5f0b18fdcbf6071580bbe39ba3a6a4bc3c536bfa8b848bf211472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TEJO7GPOH2OJZS46OPAPDVGWMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Pareto set of multiobjective linear programs via Robust Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bram L. Gorissen, Dick den Hertog","submitted_at":"2015-01-12T14:23:24Z","abstract_excerpt":"We consider problems with multiple linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large degree. The main difference with existing techniques is that we optimize a single (extended) optimization problem that provides a polynomial approximation whereas existing methods iteratively construct a piecewise linear approximation. One of the advantages of the proposed method is that it is more useful for visualizing the Pareto set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02658","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"um1Jqkr/mz9wLIkORFPb5ab+uevFBCgKRC2g7vhmV0gJQTAyxGL/yQn8Aq5pLj+Wtr9J2vByq0uer8BqmipuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:55:32.470136Z"},"content_sha256":"8ad2460339f4d22ff02bee73ab1ddba4afe9faf714fd06c164de6d2fa5cb2a9f","schema_version":"1.0","event_id":"sha256:8ad2460339f4d22ff02bee73ab1ddba4afe9faf714fd06c164de6d2fa5cb2a9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/bundle.json","state_url":"https://pith.science/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/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-08T01:55:32Z","links":{"resolver":"https://pith.science/pith/TEJO7GPOH2OJZS46OPAPDVGWMG","bundle":"https://pith.science/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/bundle.json","state":"https://pith.science/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEJO7GPOH2OJZS46OPAPDVGWMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TEJO7GPOH2OJZS46OPAPDVGWMG","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":"974466918db5023fd444e763267c7eb60cf97391f3d7855b227e743af0c014cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-12T14:23:24Z","title_canon_sha256":"57e45968ff129d08b50f177fc408b0b03aac71f077a879c02015fc9457a30379"},"schema_version":"1.0","source":{"id":"1501.02658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02658","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02658v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02658","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"TEJO7GPOH2OJ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TEJO7GPOH2OJZS46","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TEJO7GPO","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:8ad2460339f4d22ff02bee73ab1ddba4afe9faf714fd06c164de6d2fa5cb2a9f","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"We consider problems with multiple linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large degree. The main difference with existing techniques is that we optimize a single (extended) optimization problem that provides a polynomial approximation whereas existing methods iteratively construct a piecewise linear approximation. One of the advantages of the proposed method is that it is more useful for visualizing the Pareto set.","authors_text":"Bram L. Gorissen, Dick den Hertog","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-12T14:23:24Z","title":"Approximating the Pareto set of multiobjective linear programs via Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02658","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:f30955d865c5f0b18fdcbf6071580bbe39ba3a6a4bc3c536bfa8b848bf211472","target":"record","created_at":"2026-05-18T02:29:37Z","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":"974466918db5023fd444e763267c7eb60cf97391f3d7855b227e743af0c014cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-12T14:23:24Z","title_canon_sha256":"57e45968ff129d08b50f177fc408b0b03aac71f077a879c02015fc9457a30379"},"schema_version":"1.0","source":{"id":"1501.02658","kind":"arxiv","version":1}},"canonical_sha256":"9912ef99ee3e9c9ccb9e73c0f1d4d6618767ab23c6ab81bf97b18f143e507c17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9912ef99ee3e9c9ccb9e73c0f1d4d6618767ab23c6ab81bf97b18f143e507c17","first_computed_at":"2026-05-18T02:29:37.530825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.530825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9nwun6nBc5rAGsrjXMGpYzs1iSpDfiwYunrEkhPuEYpRdqW+71e4kCyw3eFkR+Xh5IrNyHTAqpu5nwc7ksQYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.531229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30955d865c5f0b18fdcbf6071580bbe39ba3a6a4bc3c536bfa8b848bf211472","sha256:8ad2460339f4d22ff02bee73ab1ddba4afe9faf714fd06c164de6d2fa5cb2a9f"],"state_sha256":"d4189124926fbf55ac3d5fa4e91b75475ccf88cec9cf66ab6d9448bceec7923a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ecxosEwsVcQe6HF4xIoqZ/uw+HXAVUmoGdT+4ONKv9syAalSXz34iejri10GgQfLgBoq2qkHoZcJNOdG01uCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:55:32.473537Z","bundle_sha256":"32dfd9e4a6bb198444a33e63082909c2899edaff92afff75a8408dba0ffbde77"}}