{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VNJVSX57HNRFWAY5IKEJYAMBQG","short_pith_number":"pith:VNJVSX57","canonical_record":{"source":{"id":"1302.7028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-27T23:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"cd85891a50f30a45fb34477f3dbf3b22b90f8ab26c307cfd436ef9e9be1f8289","abstract_canon_sha256":"b2b0d882542c568b9e620af9af9e5b63f8b763bd79c5ea20d8254de3562cbe83"},"schema_version":"1.0"},"canonical_sha256":"ab53595fbf3b625b031d42889c018181b2c0ddb3907f0c0ddfef1e2357fe3c9e","source":{"kind":"arxiv","id":"1302.7028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7028","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7028v1","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7028","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"VNJVSX57HNRF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VNJVSX57HNRFWAY5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VNJVSX57","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VNJVSX57HNRFWAY5IKEJYAMBQG","target":"record","payload":{"canonical_record":{"source":{"id":"1302.7028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-27T23:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"cd85891a50f30a45fb34477f3dbf3b22b90f8ab26c307cfd436ef9e9be1f8289","abstract_canon_sha256":"b2b0d882542c568b9e620af9af9e5b63f8b763bd79c5ea20d8254de3562cbe83"},"schema_version":"1.0"},"canonical_sha256":"ab53595fbf3b625b031d42889c018181b2c0ddb3907f0c0ddfef1e2357fe3c9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:17.668986Z","signature_b64":"V/+VfGJT5uOMYTiiQS//2LuO3aj2P4fcTXlfTf5q9Ege8HXy6FXNJPrv3rsmWj+9Vg7Bg9ekfLKNkJpbZJT5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab53595fbf3b625b031d42889c018181b2c0ddb3907f0c0ddfef1e2357fe3c9e","last_reissued_at":"2026-05-18T03:32:17.668437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:17.668437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.7028","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-18T03:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XaCDn71ko5NHwxgs7itMDY10xRArCRqZ9swVUN+ZQsEwlUseIZ8CptNn1ARasaoDTv+lYWLRM8VC+gru00XtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:06:02.618741Z"},"content_sha256":"bafe8b58be39d78a1cff8526fa87c5ca035d24e2098913b48a2c3740f186cac3","schema_version":"1.0","event_id":"sha256:bafe8b58be39d78a1cff8526fa87c5ca035d24e2098913b48a2c3740f186cac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VNJVSX57HNRFWAY5IKEJYAMBQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexandre Fr\\'echette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer","submitted_at":"2013-02-27T23:25:36Z","abstract_excerpt":"We study a class of robust network design problems motivated by the need to scale core networks to meet increasingly dynamic capacity demands. Past work has focused on designing the network to support all hose matrices (all matrices not exceeding marginal bounds at the nodes). This model may be too conservative if additional information on traffic patterns is available. Another extreme is the fixed demand model, where one designs the network to support peak point-to-point demands. We introduce a capped hose model to explore a broader range of traffic matrices which includes the above two as sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7028","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-18T03:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ee9xQLgqgSCW5cIr/hVF6V2xfAJzvnoG78gra0aV2RNLNycAmuIQg+f004BgtXUfIcOjDyuln/xyx51uOllbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:06:02.619113Z"},"content_sha256":"dc58a0c59bc5894c3614d5db7bb82986f1e0406abd81f08678e55c1b5e201dd1","schema_version":"1.0","event_id":"sha256:dc58a0c59bc5894c3614d5db7bb82986f1e0406abd81f08678e55c1b5e201dd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/bundle.json","state_url":"https://pith.science/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/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-29T18:06:02Z","links":{"resolver":"https://pith.science/pith/VNJVSX57HNRFWAY5IKEJYAMBQG","bundle":"https://pith.science/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/bundle.json","state":"https://pith.science/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNJVSX57HNRFWAY5IKEJYAMBQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VNJVSX57HNRFWAY5IKEJYAMBQG","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":"b2b0d882542c568b9e620af9af9e5b63f8b763bd79c5ea20d8254de3562cbe83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-27T23:25:36Z","title_canon_sha256":"cd85891a50f30a45fb34477f3dbf3b22b90f8ab26c307cfd436ef9e9be1f8289"},"schema_version":"1.0","source":{"id":"1302.7028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7028","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7028v1","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7028","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"VNJVSX57HNRF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VNJVSX57HNRFWAY5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VNJVSX57","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:dc58a0c59bc5894c3614d5db7bb82986f1e0406abd81f08678e55c1b5e201dd1","target":"graph","created_at":"2026-05-18T03:32:17Z","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 study a class of robust network design problems motivated by the need to scale core networks to meet increasingly dynamic capacity demands. Past work has focused on designing the network to support all hose matrices (all matrices not exceeding marginal bounds at the nodes). This model may be too conservative if additional information on traffic patterns is available. Another extreme is the fixed demand model, where one designs the network to support peak point-to-point demands. We introduce a capped hose model to explore a broader range of traffic matrices which includes the above two as sp","authors_text":"Alexandre Fr\\'echette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-27T23:25:36Z","title":"Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7028","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:bafe8b58be39d78a1cff8526fa87c5ca035d24e2098913b48a2c3740f186cac3","target":"record","created_at":"2026-05-18T03:32:17Z","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":"b2b0d882542c568b9e620af9af9e5b63f8b763bd79c5ea20d8254de3562cbe83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-27T23:25:36Z","title_canon_sha256":"cd85891a50f30a45fb34477f3dbf3b22b90f8ab26c307cfd436ef9e9be1f8289"},"schema_version":"1.0","source":{"id":"1302.7028","kind":"arxiv","version":1}},"canonical_sha256":"ab53595fbf3b625b031d42889c018181b2c0ddb3907f0c0ddfef1e2357fe3c9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab53595fbf3b625b031d42889c018181b2c0ddb3907f0c0ddfef1e2357fe3c9e","first_computed_at":"2026-05-18T03:32:17.668437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:17.668437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V/+VfGJT5uOMYTiiQS//2LuO3aj2P4fcTXlfTf5q9Ege8HXy6FXNJPrv3rsmWj+9Vg7Bg9ekfLKNkJpbZJT5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:17.668986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.7028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bafe8b58be39d78a1cff8526fa87c5ca035d24e2098913b48a2c3740f186cac3","sha256:dc58a0c59bc5894c3614d5db7bb82986f1e0406abd81f08678e55c1b5e201dd1"],"state_sha256":"6d9bbb269aba141de20397f538a8cb3ba35ed544f9e821d43560810026887ef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pElkqYgOsV7NKCd9uRXyp2bf/wgap6Xp/JKggVm2UFCnQZpVvF+uCp4wUxSd34RhpMswetRWVKaDkXqxYDNFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:06:02.622376Z","bundle_sha256":"233c5b2bb74fde2434246dcb9e1c21bc06316065a1523636183456a469e44545"}}