{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:62PQXNCPC3UEAIARTUBRKUTF3H","short_pith_number":"pith:62PQXNCP","canonical_record":{"source":{"id":"1901.03586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-11T14:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"7ce224c3238e67a96bbeee09e5e8cec0daedda533b3b0e5707404999198c8ecb","abstract_canon_sha256":"819bafd0bfbc6c1981563bed6cb42265c937c9021016fead137d0b5ebbac2600"},"schema_version":"1.0"},"canonical_sha256":"f69f0bb44f16e84020119d03155265d9d8b0f93e9a096cbd17fc59ab11e347ab","source":{"kind":"arxiv","id":"1901.03586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03586","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03586v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03586","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"62PQXNCPC3UE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"62PQXNCPC3UEAIAR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"62PQXNCP","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:62PQXNCPC3UEAIARTUBRKUTF3H","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-11T14:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"7ce224c3238e67a96bbeee09e5e8cec0daedda533b3b0e5707404999198c8ecb","abstract_canon_sha256":"819bafd0bfbc6c1981563bed6cb42265c937c9021016fead137d0b5ebbac2600"},"schema_version":"1.0"},"canonical_sha256":"f69f0bb44f16e84020119d03155265d9d8b0f93e9a096cbd17fc59ab11e347ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.864485Z","signature_b64":"Oi9H0Lle26q0APDa8zjoDqNVdueIRh99ihPAdo9qFMDnJiJv/wAOFshJhz3azfmYa8AxEcERoN20FdhFaXKuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f69f0bb44f16e84020119d03155265d9d8b0f93e9a096cbd17fc59ab11e347ab","last_reissued_at":"2026-05-17T23:56:30.864102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.864102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03586","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:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBxbyDCbzBabbCs4805YRnSNnpW/kpNEfx+z3iy6FSdlm9NQ9VPv7PukINf1DUUtJi+HWg//Ie/dVbaY3xbCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:48:50.102554Z"},"content_sha256":"943fbca87cc78f8c124fd41a489c98911091442833065203b7c2741b07e2aab1","schema_version":"1.0","event_id":"sha256:943fbca87cc78f8c124fd41a489c98911091442833065203b7c2741b07e2aab1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:62PQXNCPC3UEAIARTUBRKUTF3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparison of Models for Uncertain Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francis Garuba, Marc Goerigk, Peter Jacko","submitted_at":"2019-01-11T14:19:28Z","abstract_excerpt":"To solve a real-world problem, the modeler usually needs to make a trade-off between model complexity and usefulness. This is also true for robust optimization, where a wide range of models for uncertainty, so-called uncertainty sets, have been proposed. However, while these sets have been mainly studied from a theoretical perspective, there is little research comparing different sets regarding their usefulness for a real-world problem.\n  In this paper we consider a network design problem in a telecommunications context. We need to invest into the infrastructure, such that there is sufficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03586","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:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLzTZaDMverYeKhO2cj1ISoCRldpSNQNVbkV6v2R1nj/ueiSymsu1Lszr6TX9dFdSAOAidsyVE7nkPa9hkwKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:48:50.103147Z"},"content_sha256":"54321f2ed4203cc307db45de83ea2f2fb2f7f778077321d8b3f0be6421dcf6a2","schema_version":"1.0","event_id":"sha256:54321f2ed4203cc307db45de83ea2f2fb2f7f778077321d8b3f0be6421dcf6a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62PQXNCPC3UEAIARTUBRKUTF3H/bundle.json","state_url":"https://pith.science/pith/62PQXNCPC3UEAIARTUBRKUTF3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62PQXNCPC3UEAIARTUBRKUTF3H/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-31T10:48:50Z","links":{"resolver":"https://pith.science/pith/62PQXNCPC3UEAIARTUBRKUTF3H","bundle":"https://pith.science/pith/62PQXNCPC3UEAIARTUBRKUTF3H/bundle.json","state":"https://pith.science/pith/62PQXNCPC3UEAIARTUBRKUTF3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62PQXNCPC3UEAIARTUBRKUTF3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:62PQXNCPC3UEAIARTUBRKUTF3H","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":"819bafd0bfbc6c1981563bed6cb42265c937c9021016fead137d0b5ebbac2600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-11T14:19:28Z","title_canon_sha256":"7ce224c3238e67a96bbeee09e5e8cec0daedda533b3b0e5707404999198c8ecb"},"schema_version":"1.0","source":{"id":"1901.03586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03586","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03586v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03586","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"62PQXNCPC3UE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"62PQXNCPC3UEAIAR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"62PQXNCP","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:54321f2ed4203cc307db45de83ea2f2fb2f7f778077321d8b3f0be6421dcf6a2","target":"graph","created_at":"2026-05-17T23:56:30Z","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":"To solve a real-world problem, the modeler usually needs to make a trade-off between model complexity and usefulness. This is also true for robust optimization, where a wide range of models for uncertainty, so-called uncertainty sets, have been proposed. However, while these sets have been mainly studied from a theoretical perspective, there is little research comparing different sets regarding their usefulness for a real-world problem.\n  In this paper we consider a network design problem in a telecommunications context. We need to invest into the infrastructure, such that there is sufficient ","authors_text":"Francis Garuba, Marc Goerigk, Peter Jacko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-11T14:19:28Z","title":"A Comparison of Models for Uncertain Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03586","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:943fbca87cc78f8c124fd41a489c98911091442833065203b7c2741b07e2aab1","target":"record","created_at":"2026-05-17T23:56:30Z","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":"819bafd0bfbc6c1981563bed6cb42265c937c9021016fead137d0b5ebbac2600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-11T14:19:28Z","title_canon_sha256":"7ce224c3238e67a96bbeee09e5e8cec0daedda533b3b0e5707404999198c8ecb"},"schema_version":"1.0","source":{"id":"1901.03586","kind":"arxiv","version":1}},"canonical_sha256":"f69f0bb44f16e84020119d03155265d9d8b0f93e9a096cbd17fc59ab11e347ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f69f0bb44f16e84020119d03155265d9d8b0f93e9a096cbd17fc59ab11e347ab","first_computed_at":"2026-05-17T23:56:30.864102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:30.864102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oi9H0Lle26q0APDa8zjoDqNVdueIRh99ihPAdo9qFMDnJiJv/wAOFshJhz3azfmYa8AxEcERoN20FdhFaXKuCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:30.864485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943fbca87cc78f8c124fd41a489c98911091442833065203b7c2741b07e2aab1","sha256:54321f2ed4203cc307db45de83ea2f2fb2f7f778077321d8b3f0be6421dcf6a2"],"state_sha256":"9901bf3f0787332750933da28c5ec5195d3e362032f89962c79135b2fb263228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4WoCJSTvdbKGE4194tSc2q6eCiHqr0pesVuLWkz3G/xz1zer7h7UPz5fFAPuV8RXRALtaphUHfG4wM+PkHtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:48:50.106488Z","bundle_sha256":"22989c3c83dac2290724da5cd91053034fd5a9c3ad8c95910db97b83ae1e4b7e"}}