{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BETF4CCDWRWLQWXWWYV3KYPFRR","short_pith_number":"pith:BETF4CCD","canonical_record":{"source":{"id":"1604.01542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T08:44:44Z","cross_cats_sorted":[],"title_canon_sha256":"cdf9cc890c5eb5ac7a4da16cb3d423ec945b5ab2b7a70752e9888f2839eb931a","abstract_canon_sha256":"71971b9c12f8a130d745db0c8159136cda5cc83ab9c5663553695481f8310901"},"schema_version":"1.0"},"canonical_sha256":"09265e0843b46cb85af6b62bb561e58c6f8bd8049404bb0da3951de3b291acd1","source":{"kind":"arxiv","id":"1604.01542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01542","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01542v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01542","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"BETF4CCDWRWL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BETF4CCDWRWLQWXW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BETF4CCD","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BETF4CCDWRWLQWXWWYV3KYPFRR","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T08:44:44Z","cross_cats_sorted":[],"title_canon_sha256":"cdf9cc890c5eb5ac7a4da16cb3d423ec945b5ab2b7a70752e9888f2839eb931a","abstract_canon_sha256":"71971b9c12f8a130d745db0c8159136cda5cc83ab9c5663553695481f8310901"},"schema_version":"1.0"},"canonical_sha256":"09265e0843b46cb85af6b62bb561e58c6f8bd8049404bb0da3951de3b291acd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.159073Z","signature_b64":"DVb65KOkFrto82ke5rV2CBZSskvNjzQE+OVh0TjjS7skil6WmWqfiLg2ntOkrv6r0czyLF7t+1P4swkAeaIoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09265e0843b46cb85af6b62bb561e58c6f8bd8049404bb0da3951de3b291acd1","last_reissued_at":"2026-05-18T01:17:36.158413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.158413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01542","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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EkOWAzBwrfhMk7LgpyRMKhvuc/yU0wqDoM2xjkBltXyrufJ5g2/Dfw6Qeu0tpS/NpF+w/8j1SXVBDEBcs8EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:23.310436Z"},"content_sha256":"8d0c07135b92b737f6254cb261a0b24ab4030fc1f75f093155df51808ac17843","schema_version":"1.0","event_id":"sha256:8d0c07135b92b737f6254cb261a0b24ab4030fc1f75f093155df51808ac17843"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BETF4CCDWRWLQWXWWYV3KYPFRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A biobjective approach to robustness based on location planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anita Sch\\\"obel, Emilio Carrizosa, Marc Goerigk","submitted_at":"2016-04-06T08:44:44Z","abstract_excerpt":"Finding robust solutions of an optimization problem is an important issue in practice, and various concepts on how to define the robustness of a solution have been suggested. The idea of recoverable robustness requires that a solution can be recovered to a feasible one as soon as the realized scenario becomes known. The usual approach in the literature is to minimize the objective function value of the recovered solution in the nominal or in the worst case.\n  As the recovery itself is also costly, there is a trade-off between the recovery costs and the solution value obtained; we study both, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01542","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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAds1+D8z3B3YlFvbddPaNAeCfi6iltEO1H/rCTUulDs95Brzwlxm+eJ+ewBxKn7rHWRvkxX0wtVqvVui6syBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:23.311074Z"},"content_sha256":"e54e719ff5a346f769c5f1769d48ed88f633bf74e568ec06061b0f5ad465174d","schema_version":"1.0","event_id":"sha256:e54e719ff5a346f769c5f1769d48ed88f633bf74e568ec06061b0f5ad465174d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/bundle.json","state_url":"https://pith.science/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/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-05-30T23:51:23Z","links":{"resolver":"https://pith.science/pith/BETF4CCDWRWLQWXWWYV3KYPFRR","bundle":"https://pith.science/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/bundle.json","state":"https://pith.science/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BETF4CCDWRWLQWXWWYV3KYPFRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BETF4CCDWRWLQWXWWYV3KYPFRR","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":"71971b9c12f8a130d745db0c8159136cda5cc83ab9c5663553695481f8310901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T08:44:44Z","title_canon_sha256":"cdf9cc890c5eb5ac7a4da16cb3d423ec945b5ab2b7a70752e9888f2839eb931a"},"schema_version":"1.0","source":{"id":"1604.01542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01542","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01542v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01542","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"BETF4CCDWRWL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BETF4CCDWRWLQWXW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BETF4CCD","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e54e719ff5a346f769c5f1769d48ed88f633bf74e568ec06061b0f5ad465174d","target":"graph","created_at":"2026-05-18T01:17:36Z","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":"Finding robust solutions of an optimization problem is an important issue in practice, and various concepts on how to define the robustness of a solution have been suggested. The idea of recoverable robustness requires that a solution can be recovered to a feasible one as soon as the realized scenario becomes known. The usual approach in the literature is to minimize the objective function value of the recovered solution in the nominal or in the worst case.\n  As the recovery itself is also costly, there is a trade-off between the recovery costs and the solution value obtained; we study both, t","authors_text":"Anita Sch\\\"obel, Emilio Carrizosa, Marc Goerigk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T08:44:44Z","title":"A biobjective approach to robustness based on location planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01542","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:8d0c07135b92b737f6254cb261a0b24ab4030fc1f75f093155df51808ac17843","target":"record","created_at":"2026-05-18T01:17:36Z","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":"71971b9c12f8a130d745db0c8159136cda5cc83ab9c5663553695481f8310901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-06T08:44:44Z","title_canon_sha256":"cdf9cc890c5eb5ac7a4da16cb3d423ec945b5ab2b7a70752e9888f2839eb931a"},"schema_version":"1.0","source":{"id":"1604.01542","kind":"arxiv","version":1}},"canonical_sha256":"09265e0843b46cb85af6b62bb561e58c6f8bd8049404bb0da3951de3b291acd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09265e0843b46cb85af6b62bb561e58c6f8bd8049404bb0da3951de3b291acd1","first_computed_at":"2026-05-18T01:17:36.158413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:36.158413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DVb65KOkFrto82ke5rV2CBZSskvNjzQE+OVh0TjjS7skil6WmWqfiLg2ntOkrv6r0czyLF7t+1P4swkAeaIoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:36.159073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d0c07135b92b737f6254cb261a0b24ab4030fc1f75f093155df51808ac17843","sha256:e54e719ff5a346f769c5f1769d48ed88f633bf74e568ec06061b0f5ad465174d"],"state_sha256":"1c49e880bd4203185efe598aabe3d405755afec5c1741c69447dc540e2089a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXg1GK7z9L7ap+cDfO5kz5UBgDLeZYJvTNFMEyRKTkwluu8GjkZ57n9zzD3saxNv73I4/Q3ghMswRPS6fy4eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:23.315032Z","bundle_sha256":"dce7af917342df4d21f483d49452b486cd6f3564e5e0f208487e6e01cec71146"}}