{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:I2DMH2ANPJYYXI5SNFMYXROSWJ","short_pith_number":"pith:I2DMH2AN","schema_version":"1.0","canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","source":{"kind":"arxiv","id":"2011.10446","version":2},"attestation_state":"computed","paper":{"title":"Hop-Constrained Oblivious Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Mohsen Ghaffari","submitted_at":"2020-11-20T15:20:23Z","abstract_excerpt":"We prove the existence of an oblivious routing scheme that is $\\mathrm{poly}(\\log n)$-competitive in terms of $(congestion + dilation)$, thus resolving a well-known question in oblivious routing.\n  Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize $(congestion + dilation)$, defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme "},"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":"2011.10446","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","cross_cats_sorted":[],"title_canon_sha256":"bf6bfcd6bdaa1e924c27ec8d7c322f9178ea7c255489a1a64a41376d76385ccb","abstract_canon_sha256":"cb1a76b0be6c12211d723da92722216970af8a977b75aee2891f70033ef1af3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:03.779252Z","signature_b64":"ryd0zHOMYBdRMp8nUQxFmQeCtfjGXkdTT9axA5ms3q3cpBxLciWtcQbqius8qGGywRNE+nxpnYNSmQ8nIKvfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","last_reissued_at":"2026-07-05T05:09:03.778830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:03.778830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hop-Constrained Oblivious Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Mohsen Ghaffari","submitted_at":"2020-11-20T15:20:23Z","abstract_excerpt":"We prove the existence of an oblivious routing scheme that is $\\mathrm{poly}(\\log n)$-competitive in terms of $(congestion + dilation)$, thus resolving a well-known question in oblivious routing.\n  Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize $(congestion + dilation)$, defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10446","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.10446/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.10446","created_at":"2026-07-05T05:09:03.778882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10446v2","created_at":"2026-07-05T05:09:03.778882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10446","created_at":"2026-07-05T05:09:03.778882+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2DMH2ANPJYY","created_at":"2026-07-05T05:09:03.778882+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2DMH2ANPJYYXI5S","created_at":"2026-07-05T05:09:03.778882+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2DMH2AN","created_at":"2026-07-05T05:09:03.778882+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/I2DMH2ANPJYYXI5SNFMYXROSWJ","json":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ.json","graph_json":"https://pith.science/api/pith-number/I2DMH2ANPJYYXI5SNFMYXROSWJ/graph.json","events_json":"https://pith.science/api/pith-number/I2DMH2ANPJYYXI5SNFMYXROSWJ/events.json","paper":"https://pith.science/paper/I2DMH2AN"},"agent_actions":{"view_html":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ","download_json":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ.json","view_paper":"https://pith.science/paper/I2DMH2AN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10446&json=true","fetch_graph":"https://pith.science/api/pith-number/I2DMH2ANPJYYXI5SNFMYXROSWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/I2DMH2ANPJYYXI5SNFMYXROSWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/action/storage_attestation","attest_author":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/action/author_attestation","sign_citation":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/action/citation_signature","submit_replication":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/action/replication_record"}},"created_at":"2026-07-05T05:09:03.778882+00:00","updated_at":"2026-07-05T05:09:03.778882+00:00"}