{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BOQZQJKPKR5WR4DFHPA5F5MPC4","short_pith_number":"pith:BOQZQJKP","canonical_record":{"source":{"id":"1702.00085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T23:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"f3a190f1e15400aa69b4d4523978d91d8b57d35342ff78661a6df646cf623a89","abstract_canon_sha256":"2f75c0fd1026b4ca40dcb6bdd8ab70e7e179a107fed3acf198999fb261a1a195"},"schema_version":"1.0"},"canonical_sha256":"0ba198254f547b68f0653bc1d2f58f1733ad1817f83f486c29c4c4e53b8f2759","source":{"kind":"arxiv","id":"1702.00085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00085","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00085v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00085","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"BOQZQJKPKR5W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BOQZQJKPKR5WR4DF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BOQZQJKP","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BOQZQJKPKR5WR4DFHPA5F5MPC4","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T23:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"f3a190f1e15400aa69b4d4523978d91d8b57d35342ff78661a6df646cf623a89","abstract_canon_sha256":"2f75c0fd1026b4ca40dcb6bdd8ab70e7e179a107fed3acf198999fb261a1a195"},"schema_version":"1.0"},"canonical_sha256":"0ba198254f547b68f0653bc1d2f58f1733ad1817f83f486c29c4c4e53b8f2759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.247909Z","signature_b64":"/3XjnwVqmSsacoPl9zYLi2NlgRBBtZGK8lrGLZbrSJ/e86mrqfhezEhpMfgXMj51g2TDQRNm58MUIwC1T0XsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba198254f547b68f0653bc1d2f58f1733ad1817f83f486c29c4c4e53b8f2759","last_reissued_at":"2026-05-18T00:51:35.247461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.247461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00085","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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiZk3j0nLmIWq00WNWxkLpRyKjv9FPBxiWEkVKbsOwkGFU83GNxvCxglLHt0wxhCnKJovsJhfCRHUwUCvftSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:50.204350Z"},"content_sha256":"b34897d9c3a3f26af5c551a5bd2c65c2fb6ac077a6fbdfb86e1ddb5e3eb082ae","schema_version":"1.0","event_id":"sha256:b34897d9c3a3f26af5c551a5bd2c65c2fb6ac077a6fbdfb86e1ddb5e3eb082ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BOQZQJKPKR5WR4DFHPA5F5MPC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Relax-and-Decomposition Algorithm for a p-Robust Hub Location Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew Eberhard, Mahdi Bashiri, Saeid Abbasi Parizi","submitted_at":"2017-01-31T23:12:12Z","abstract_excerpt":"In this paper, a non-linear p-robust hub location problem is extended to a risky environment where augmented chance constraint with a min-max regret form is employed to consider network risk as one of the objectives. The model considers risk factors such as security, air pollution and congestion to design the robust hub network. A Monte-Carlo simulation based algorithm, namely, a sample average approximation scheme is applied to select a set of efficient scenarios. The problem is then solved using a novel relax-and-decomposition heuristic based on the coupling of an accelerated Benders decompo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00085","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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISTkFo0H5SIzPQFV8Wxu2Xx/gc6xuoFwWE5A40y83XQIaFvxn4yJTwZ92stUZvwo6/RqwTQ0eeKi4LHf6H6ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:25:50.204722Z"},"content_sha256":"8bf36e6dcdfbe70f1d4827ded0908807cab815d81e41ce777a7c57276d9f9885","schema_version":"1.0","event_id":"sha256:8bf36e6dcdfbe70f1d4827ded0908807cab815d81e41ce777a7c57276d9f9885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/bundle.json","state_url":"https://pith.science/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/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-01T10:25:50Z","links":{"resolver":"https://pith.science/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4","bundle":"https://pith.science/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/bundle.json","state":"https://pith.science/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOQZQJKPKR5WR4DFHPA5F5MPC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BOQZQJKPKR5WR4DFHPA5F5MPC4","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":"2f75c0fd1026b4ca40dcb6bdd8ab70e7e179a107fed3acf198999fb261a1a195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T23:12:12Z","title_canon_sha256":"f3a190f1e15400aa69b4d4523978d91d8b57d35342ff78661a6df646cf623a89"},"schema_version":"1.0","source":{"id":"1702.00085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00085","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00085v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00085","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"BOQZQJKPKR5W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BOQZQJKPKR5WR4DF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BOQZQJKP","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8bf36e6dcdfbe70f1d4827ded0908807cab815d81e41ce777a7c57276d9f9885","target":"graph","created_at":"2026-05-18T00:51:35Z","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 paper, a non-linear p-robust hub location problem is extended to a risky environment where augmented chance constraint with a min-max regret form is employed to consider network risk as one of the objectives. The model considers risk factors such as security, air pollution and congestion to design the robust hub network. A Monte-Carlo simulation based algorithm, namely, a sample average approximation scheme is applied to select a set of efficient scenarios. The problem is then solved using a novel relax-and-decomposition heuristic based on the coupling of an accelerated Benders decompo","authors_text":"Andrew Eberhard, Mahdi Bashiri, Saeid Abbasi Parizi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T23:12:12Z","title":"A Relax-and-Decomposition Algorithm for a p-Robust Hub Location Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00085","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:b34897d9c3a3f26af5c551a5bd2c65c2fb6ac077a6fbdfb86e1ddb5e3eb082ae","target":"record","created_at":"2026-05-18T00:51:35Z","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":"2f75c0fd1026b4ca40dcb6bdd8ab70e7e179a107fed3acf198999fb261a1a195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-31T23:12:12Z","title_canon_sha256":"f3a190f1e15400aa69b4d4523978d91d8b57d35342ff78661a6df646cf623a89"},"schema_version":"1.0","source":{"id":"1702.00085","kind":"arxiv","version":1}},"canonical_sha256":"0ba198254f547b68f0653bc1d2f58f1733ad1817f83f486c29c4c4e53b8f2759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ba198254f547b68f0653bc1d2f58f1733ad1817f83f486c29c4c4e53b8f2759","first_computed_at":"2026-05-18T00:51:35.247461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.247461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3XjnwVqmSsacoPl9zYLi2NlgRBBtZGK8lrGLZbrSJ/e86mrqfhezEhpMfgXMj51g2TDQRNm58MUIwC1T0XsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.247909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b34897d9c3a3f26af5c551a5bd2c65c2fb6ac077a6fbdfb86e1ddb5e3eb082ae","sha256:8bf36e6dcdfbe70f1d4827ded0908807cab815d81e41ce777a7c57276d9f9885"],"state_sha256":"7e767190afd4ec5cd671f110ba7c4a498f43a1a1d505172f07b5de3315a11efd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voXAEaowyjys5DnmSx7Hl+I6pQL7MTr5umXX44EckjU5xwtIDDz6JJPOpc73joHh8HUC/ObBi6h4UWsc8vegAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:25:50.206762Z","bundle_sha256":"a468f70bec7e31564ada1e86025619d56bd5c772bc093db33ff24a52c7acfc4b"}}