{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IK3Q3DQQ77CZH7DZCIGX2MQAGU","short_pith_number":"pith:IK3Q3DQQ","schema_version":"1.0","canonical_sha256":"42b70d8e10ffc593fc79120d7d32003532a7d0c37defc3bc8c5358ffa771d363","source":{"kind":"arxiv","id":"1309.4140","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.4140","created_at":"2026-05-18T03:13:09.457197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4140v1","created_at":"2026-05-18T03:13:09.457197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4140","created_at":"2026-05-18T03:13:09.457197+00:00"},{"alias_kind":"pith_short_12","alias_value":"IK3Q3DQQ77CZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IK3Q3DQQ77CZH7DZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IK3Q3DQQ","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU","json":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU.json","graph_json":"https://pith.science/api/pith-number/IK3Q3DQQ77CZH7DZCIGX2MQAGU/graph.json","events_json":"https://pith.science/api/pith-number/IK3Q3DQQ77CZH7DZCIGX2MQAGU/events.json","paper":"https://pith.science/paper/IK3Q3DQQ"},"agent_actions":{"view_html":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU","download_json":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU.json","view_paper":"https://pith.science/paper/IK3Q3DQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4140&json=true","fetch_graph":"https://pith.science/api/pith-number/IK3Q3DQQ77CZH7DZCIGX2MQAGU/graph.json","fetch_events":"https://pith.science/api/pith-number/IK3Q3DQQ77CZH7DZCIGX2MQAGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/action/storage_attestation","attest_author":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/action/author_attestation","sign_citation":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/action/citation_signature","submit_replication":"https://pith.science/pith/IK3Q3DQQ77CZH7DZCIGX2MQAGU/action/replication_record"}},"created_at":"2026-05-18T03:13:09.457197+00:00","updated_at":"2026-05-18T03:13:09.457197+00:00"}