{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IK3Q3DQQ77CZH7DZCIGX2MQAGU","short_pith_number":"pith:IK3Q3DQQ","canonical_record":{"source":{"id":"1309.4140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-16T23:59:27Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"b3d974bc3eda3148134c66c78db808bfa3fd0486f4184fdda89f59555359adb2","abstract_canon_sha256":"f5f30fd6dacc60a55c2149ce21514e204df7916035dae84fa41e6d20eee253c0"},"schema_version":"1.0"},"canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","source":{"kind":"arxiv","id":"1309.4140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4140","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4140v1","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4140","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"IK3Q3DQQ77CZ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IK3Q3DQQ77CZH7DZ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IK3Q3DQQ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IK3Q3DQQ77CZH7DZCIGX2MQAGU","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-16T23:59:27Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"b3d974bc3eda3148134c66c78db808bfa3fd0486f4184fdda89f59555359adb2","abstract_canon_sha256":"f5f30fd6dacc60a55c2149ce21514e204df7916035dae84fa41e6d20eee253c0"},"schema_version":"1.0"},"canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:09.457759Z","signature_b64":"fIWQGgm3BKwF6m5JpMK4i63+bhLWfSHeYKaA8NB8RGxnnY2DDM8l23I6DOSRt6fVTbKLA+Ti1sONWDWCJfDJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","last_reissued_at":"2026-05-18T03:13:09.457069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:09.457069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4140","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:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ifp8o1ZX0DSON+jVd5DZdQf7MvmAwBoime/cgBrZFX70DztwaJcYRPLnRMihyBI8Zbi04CxuJ9m2rPIVEy/ZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:57:31.148565Z"},"content_sha256":"f89efdfd25decbc2d28afb159d2b88ceee15e81d46c18fcfdd9db712afc5e679","schema_version":"1.0","event_id":"sha256:f89efdfd25decbc2d28afb159d2b88ceee15e81d46c18fcfdd9db712afc5e679"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IK3Q3DQQ77CZH7DZCIGX2MQAGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic vs Oblivious Routing in Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.CC","authors_text":"F. Bruce Shepherd, Navin Goyal, Neil Olver","submitted_at":"2013-09-16T23:59:27Z","abstract_excerpt":"Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare \\emph{oblivious} routing, where the routing between each terminal pair must be fixed in advance, to \\emph{dynamic} routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4140","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:13:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mJOiG6RRCw5Y5slnyk7CFf+84d6avOqQ6BElycftzrB27cGXKd/7APvyIs7MRmtFgU73YWa2EArQzDU/eBAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:57:31.148906Z"},"content_sha256":"b3db552ad8157b77c042d47806788e8c27b970105294b6bb2d68cd71c8c39737","schema_version":"1.0","event_id":"sha256:b3db552ad8157b77c042d47806788e8c27b970105294b6bb2d68cd71c8c39737"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/bundle.json","state_url":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/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-27T04:57:31Z","links":{"resolver":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU","bundle":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/bundle.json","state":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IK3Q3DQQ77CZH7DZCIGX2MQAGU","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":"f5f30fd6dacc60a55c2149ce21514e204df7916035dae84fa41e6d20eee253c0","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-16T23:59:27Z","title_canon_sha256":"b3d974bc3eda3148134c66c78db808bfa3fd0486f4184fdda89f59555359adb2"},"schema_version":"1.0","source":{"id":"1309.4140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4140","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4140v1","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4140","created_at":"2026-05-18T03:13:09Z"},{"alias_kind":"pith_short_12","alias_value":"IK3Q3DQQ77CZ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IK3Q3DQQ77CZH7DZ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IK3Q3DQQ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:b3db552ad8157b77c042d47806788e8c27b970105294b6bb2d68cd71c8c39737","target":"graph","created_at":"2026-05-18T03:13:09Z","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":"Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, we compare \\emph{oblivious} routing, where the routing between each terminal pair must be fixed in advance, to \\emph{dynamic} routing, where routings may depend arbitrarily on the current demand. Our main result is a construction that shows that the optimal cost of such a network based on oblivious routing (fractional or integral) may be a factor of","authors_text":"F. Bruce Shepherd, Navin Goyal, Neil Olver","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-16T23:59:27Z","title":"Dynamic vs Oblivious Routing in Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4140","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:f89efdfd25decbc2d28afb159d2b88ceee15e81d46c18fcfdd9db712afc5e679","target":"record","created_at":"2026-05-18T03:13:09Z","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":"f5f30fd6dacc60a55c2149ce21514e204df7916035dae84fa41e6d20eee253c0","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-16T23:59:27Z","title_canon_sha256":"b3d974bc3eda3148134c66c78db808bfa3fd0486f4184fdda89f59555359adb2"},"schema_version":"1.0","source":{"id":"1309.4140","kind":"arxiv","version":1}},"canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","first_computed_at":"2026-05-18T03:13:09.457069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:09.457069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fIWQGgm3BKwF6m5JpMK4i63+bhLWfSHeYKaA8NB8RGxnnY2DDM8l23I6DOSRt6fVTbKLA+Ti1sONWDWCJfDJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:09.457759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f89efdfd25decbc2d28afb159d2b88ceee15e81d46c18fcfdd9db712afc5e679","sha256:b3db552ad8157b77c042d47806788e8c27b970105294b6bb2d68cd71c8c39737"],"state_sha256":"ffaca4051dc8506657f84fb60477e97a35c895bd30483a9d05405003f10ef2ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHWfDobyRRc7WOYXH0A40gDAt+Qz+XRpc/xGtewp/hqZyGoo/h+9sh9Zo/ziL0pgKviq46u9886UWj4vv6ewBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:57:31.150750Z","bundle_sha256":"fc793030297a659779749dadda4e705c9594d63c89ea754d42480fe35cf527bb"}}