{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JO5HEOV6USFODY2WH36QKX2ZRA","short_pith_number":"pith:JO5HEOV6","schema_version":"1.0","canonical_sha256":"4bba723abea48ae1e3563efd055f59882712270f8d0a7b02d682b6733678fefd","source":{"kind":"arxiv","id":"2111.08780","version":1},"attestation_state":"computed","paper":{"title":"Optimal Oblivious Reconfigurable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Daniel Amir, Hakim Weatherspoon, Rachit Agarwal, Robert Kleinberg, Tegan Wilson, Vishal Shrivastav","submitted_at":"2021-11-16T21:09:19Z","abstract_excerpt":"Oblivious routing has a long history in both the theory and practice of networking. In this work we initiate the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the fore in datacenter networking. These networks allow a rapidly changing bounded-degree pattern of interconnections between nodes, but the network topology and the selection of routing paths must both be oblivious to the traffic demand matrix. Our focus is on the trade-off between maximizing throughput and minimizing latency in these networks. For every constan"},"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":"2111.08780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-16T21:09:19Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"2f280827707246523fd6ef6c752be5e9790287613141fbba4e63fbd28361f873","abstract_canon_sha256":"a567aff76d1ac700f93852d23a6780479af399447eff6a9b0d020781ed25af37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:40.835402Z","signature_b64":"duUo6QMp1FCkbJJahEnlZsW0kGxnnQyj5Y6krDdPo0CbQVKW5DV63GGGX/MEym01cnjAaNEcro/o3Kxr9r8OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bba723abea48ae1e3563efd055f59882712270f8d0a7b02d682b6733678fefd","last_reissued_at":"2026-07-05T03:32:40.834897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:40.834897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Oblivious Reconfigurable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Daniel Amir, Hakim Weatherspoon, Rachit Agarwal, Robert Kleinberg, Tegan Wilson, Vishal Shrivastav","submitted_at":"2021-11-16T21:09:19Z","abstract_excerpt":"Oblivious routing has a long history in both the theory and practice of networking. In this work we initiate the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the fore in datacenter networking. These networks allow a rapidly changing bounded-degree pattern of interconnections between nodes, but the network topology and the selection of routing paths must both be oblivious to the traffic demand matrix. Our focus is on the trade-off between maximizing throughput and minimizing latency in these networks. For every constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.08780","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.08780/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":"2111.08780","created_at":"2026-07-05T03:32:40.834955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.08780v1","created_at":"2026-07-05T03:32:40.834955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.08780","created_at":"2026-07-05T03:32:40.834955+00:00"},{"alias_kind":"pith_short_12","alias_value":"JO5HEOV6USFO","created_at":"2026-07-05T03:32:40.834955+00:00"},{"alias_kind":"pith_short_16","alias_value":"JO5HEOV6USFODY2W","created_at":"2026-07-05T03:32:40.834955+00:00"},{"alias_kind":"pith_short_8","alias_value":"JO5HEOV6","created_at":"2026-07-05T03:32:40.834955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA","json":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA.json","graph_json":"https://pith.science/api/pith-number/JO5HEOV6USFODY2WH36QKX2ZRA/graph.json","events_json":"https://pith.science/api/pith-number/JO5HEOV6USFODY2WH36QKX2ZRA/events.json","paper":"https://pith.science/paper/JO5HEOV6"},"agent_actions":{"view_html":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA","download_json":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA.json","view_paper":"https://pith.science/paper/JO5HEOV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.08780&json=true","fetch_graph":"https://pith.science/api/pith-number/JO5HEOV6USFODY2WH36QKX2ZRA/graph.json","fetch_events":"https://pith.science/api/pith-number/JO5HEOV6USFODY2WH36QKX2ZRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA/action/storage_attestation","attest_author":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA/action/author_attestation","sign_citation":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA/action/citation_signature","submit_replication":"https://pith.science/pith/JO5HEOV6USFODY2WH36QKX2ZRA/action/replication_record"}},"created_at":"2026-07-05T03:32:40.834955+00:00","updated_at":"2026-07-05T03:32:40.834955+00:00"}