{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LVGWNIUEKAJ4BYFJZZ5YOREMCZ","short_pith_number":"pith:LVGWNIUE","canonical_record":{"source":{"id":"1406.7841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-30T18:32:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ea871c8a343d9497a26a3c64c5822f85eaa5ff0f3f8d3e1671fe53fe2eff3177","abstract_canon_sha256":"13e5db68ecd077a8695336e5c1555dbf1f04305ba84d305e6ccff232a28f03d0"},"schema_version":"1.0"},"canonical_sha256":"5d4d66a2845013c0e0a9ce7b87448c164198670d3f7bd4cb4c2c637640d03ae6","source":{"kind":"arxiv","id":"1406.7841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7841","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7841v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7841","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"LVGWNIUEKAJ4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LVGWNIUEKAJ4BYFJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LVGWNIUE","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LVGWNIUEKAJ4BYFJZZ5YOREMCZ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-30T18:32:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ea871c8a343d9497a26a3c64c5822f85eaa5ff0f3f8d3e1671fe53fe2eff3177","abstract_canon_sha256":"13e5db68ecd077a8695336e5c1555dbf1f04305ba84d305e6ccff232a28f03d0"},"schema_version":"1.0"},"canonical_sha256":"5d4d66a2845013c0e0a9ce7b87448c164198670d3f7bd4cb4c2c637640d03ae6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.036345Z","signature_b64":"oBmuzTAp0eeHBZB5Q6RIHo65YQ8meujUlpm2Dn1S15GrMT+xW3YwI6ZUH3qw3U1tHDw5d1RG1YB3PpZf+dpQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d4d66a2845013c0e0a9ce7b87448c164198670d3f7bd4cb4c2c637640d03ae6","last_reissued_at":"2026-05-18T02:48:44.035676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.035676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7841","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpB8mZs0zXRpmRJlZDU/DSbv+X0Vj/bpiaPfjCHUzhKPsjFyH09t61VNeCgQzGl11M86djThYci3+5e+J/G8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:41:38.873394Z"},"content_sha256":"0c594ce3887335cf1eb755a70e635985409891b0e09300472e1bc2f8c49c5930","schema_version":"1.0","event_id":"sha256:0c594ce3887335cf1eb755a70e635985409891b0e09300472e1bc2f8c49c5930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LVGWNIUEKAJ4BYFJZZ5YOREMCZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on hierarchical hubbing for a generalization of the VPN problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Neil Olver","submitted_at":"2014-06-30T18:32:28Z","abstract_excerpt":"Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of \"hierarchical hubbing\" was introduced (in the narrow context of a specific robust network design question), by Olver and Shepherd [2010]. Hierarchical hubbing allows for routings with a multiplicity of \"hubs\" which are connected to the terminals and to each other in a treelike fashion. Recently, Fr\\'echette et al. [2013] explored this notion much more generally, focusing on its applicability to an extension of the well-studied hose model that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7841","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:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J11aZVcdiifJ7K8mx4fQSPNq13IYJeAEiS2SzYS30K67NT9KVh65gbAgwvhSNBjTPQhRCXSkZYNpewERFbxpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:41:38.873820Z"},"content_sha256":"269c1286b83edcf0ef6717cca987255c1a6f4cfca612b0bc8b0aa2ec89553fd7","schema_version":"1.0","event_id":"sha256:269c1286b83edcf0ef6717cca987255c1a6f4cfca612b0bc8b0aa2ec89553fd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/bundle.json","state_url":"https://pith.science/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/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-30T15:41:38Z","links":{"resolver":"https://pith.science/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ","bundle":"https://pith.science/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/bundle.json","state":"https://pith.science/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVGWNIUEKAJ4BYFJZZ5YOREMCZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LVGWNIUEKAJ4BYFJZZ5YOREMCZ","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":"13e5db68ecd077a8695336e5c1555dbf1f04305ba84d305e6ccff232a28f03d0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-30T18:32:28Z","title_canon_sha256":"ea871c8a343d9497a26a3c64c5822f85eaa5ff0f3f8d3e1671fe53fe2eff3177"},"schema_version":"1.0","source":{"id":"1406.7841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7841","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7841v1","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7841","created_at":"2026-05-18T02:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"LVGWNIUEKAJ4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LVGWNIUEKAJ4BYFJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LVGWNIUE","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:269c1286b83edcf0ef6717cca987255c1a6f4cfca612b0bc8b0aa2ec89553fd7","target":"graph","created_at":"2026-05-18T02:48:44Z","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":"Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of \"hierarchical hubbing\" was introduced (in the narrow context of a specific robust network design question), by Olver and Shepherd [2010]. Hierarchical hubbing allows for routings with a multiplicity of \"hubs\" which are connected to the terminals and to each other in a treelike fashion. Recently, Fr\\'echette et al. [2013] explored this notion much more generally, focusing on its applicability to an extension of the well-studied hose model that","authors_text":"Neil Olver","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-30T18:32:28Z","title":"A note on hierarchical hubbing for a generalization of the VPN problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7841","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:0c594ce3887335cf1eb755a70e635985409891b0e09300472e1bc2f8c49c5930","target":"record","created_at":"2026-05-18T02:48:44Z","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":"13e5db68ecd077a8695336e5c1555dbf1f04305ba84d305e6ccff232a28f03d0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-30T18:32:28Z","title_canon_sha256":"ea871c8a343d9497a26a3c64c5822f85eaa5ff0f3f8d3e1671fe53fe2eff3177"},"schema_version":"1.0","source":{"id":"1406.7841","kind":"arxiv","version":1}},"canonical_sha256":"5d4d66a2845013c0e0a9ce7b87448c164198670d3f7bd4cb4c2c637640d03ae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d4d66a2845013c0e0a9ce7b87448c164198670d3f7bd4cb4c2c637640d03ae6","first_computed_at":"2026-05-18T02:48:44.035676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:44.035676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBmuzTAp0eeHBZB5Q6RIHo65YQ8meujUlpm2Dn1S15GrMT+xW3YwI6ZUH3qw3U1tHDw5d1RG1YB3PpZf+dpQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:44.036345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c594ce3887335cf1eb755a70e635985409891b0e09300472e1bc2f8c49c5930","sha256:269c1286b83edcf0ef6717cca987255c1a6f4cfca612b0bc8b0aa2ec89553fd7"],"state_sha256":"3ba3e92c39741ba06c698c043b61f2598be1b44c6e33290b1aa5a8141f7b20e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QhN1WvN8GNUZpvVWlKLYpLUttlkFPiJnRaEdTOjP7FBsNunuuyNIzo+2ypDTjENHcbL5aI41PGSCRKuNxstAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:41:38.876927Z","bundle_sha256":"d0331198b93c98f457098f02e6aec325a3ac0d4c7c6d468e3e969618112470d7"}}