{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U4PRVX3T7QCNG2FSMMUUZGS5HY","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":"af2d5141685e3acc49a412ea076c8c9c38b0d72224824f9b51cd2ae59a99eeda","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-01-05T20:21:38Z","title_canon_sha256":"2ad10b442f446b28e61c6d4d90d6adf3525a316cad4a69747a5ee4274d3f1dc1"},"schema_version":"1.0","source":{"id":"2601.02537","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.02537","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2601.02537v5","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.02537","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"U4PRVX3T7QCN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"U4PRVX3T7QCNG2FS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"U4PRVX3T","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:688e43d8903094373e91d1af7993a3b8864b5972098b919f9971eed8e994d0b5","target":"graph","created_at":"2026-05-18T03:09:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"no oblivious routing scheme can achieve a worst-case load lower than approximately √(2k)/4 when 1<k ≤ N²/2 and N/4 when N²/2≤k≤N². Moreover, we demonstrate that the celebrated Valiant Load Balancing scheme is suboptimal under sparse traffic and construct an optimal oblivious load-balancing scheme that achieves the lower bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The network is exactly an N x N torus with uniform capacities and traffic consists of at most k active source-destination pairs whose locations are unknown in advance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For sparse traffic with k pairs in an N x N torus, the minimal worst-case load achievable by any oblivious routing is approximately sqrt(2k)/4, with a new scheme attaining this bound and outperforming Valiant load balancing."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"No oblivious routing scheme can achieve worst-case load lower than approximately √(2k)/4 on an N×N torus with at most k active pairs."}],"snapshot_sha256":"2eb8a75c59c8c7d0708ba2f079c280395dd572796ec827c21cfeec6741d8d0d6"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f12c8bca82f4882eeda3b67c27256793d9b17dcb0c24422854392f8b02e59ade"},"paper":{"abstract_excerpt":"Oblivious load-balancing in networks involves routing traffic from sources to destinations using predetermined routes independent of the traffic, so that the maximum load on any link in the network is minimized. We investigate oblivious load-balancing schemes for a $N\\times N$ torus network under sparse traffic where there are at most $k$ active source-destination pairs. We are motivated by the problem of load-balancing in large-scale LEO satellite networks, which can be modelled as a torus, where the traffic is known to be sparse and localized to certain hotspot areas. We formulate the proble","authors_text":"Eytan Modiano, Rudrapatna Vallabh Ramakanth","cross_cats":["cs.DC"],"headline":"No oblivious routing scheme can achieve worst-case load lower than approximately √(2k)/4 on an N×N torus with at most k active pairs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-01-05T20:21:38Z","title":"Optimal Oblivious Load-Balancing for Sparse Traffic in Large-Scale Satellite Networks"},"references":{"count":28,"internal_anchors":0,"resolved_work":28,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Delay is Not an Option: Low Latency Routing in Space,","work_id":"4088d395-d0d7-4ae3-887f-35b8afa85549","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A dynamic routing concept for ATM-based satellite per- sonal communication networks,","work_id":"2c8732d2-6427-4518-b5e9-0f89f57ae503","year":1997},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A distributed routing algorithm for datagram traffic in LEO satellite networks,","work_id":"01837ee7-2fb3-492b-82b2-cfe6ffbd8f32","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Capacity provisioning and failure recovery for Low Earth Orbit satellite constellation,","work_id":"b95f5415-426b-42b6-ab11-41d594c52d65","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Routing strategies for maximizing throughput in LEO satellite networks,","work_id":"13ff0db7-b12c-4b43-b80e-7362629cba5c","year":2004}],"snapshot_sha256":"46c9ef460d929ad857f773179838527d6e1791376ade1579912d94675f97cf5c"},"source":{"id":"2601.02537","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-16T17:09:48.478334Z","id":"c57d1d54-f8bd-44ed-b551-b34d722a5687","model_set":{"reader":"grok-4.3"},"one_line_summary":"For sparse traffic with k pairs in an N x N torus, the minimal worst-case load achievable by any oblivious routing is approximately sqrt(2k)/4, with a new scheme attaining this bound and outperforming Valiant load balancing.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"No oblivious routing scheme can achieve worst-case load lower than approximately √(2k)/4 on an N×N torus with at most k active pairs.","strongest_claim":"no oblivious routing scheme can achieve a worst-case load lower than approximately √(2k)/4 when 1<k ≤ N²/2 and N/4 when N²/2≤k≤N². Moreover, we demonstrate that the celebrated Valiant Load Balancing scheme is suboptimal under sparse traffic and construct an optimal oblivious load-balancing scheme that achieves the lower bound.","weakest_assumption":"The network is exactly an N x N torus with uniform capacities and traffic consists of at most k active source-destination pairs whose locations are unknown in advance."}},"verdict_id":"c57d1d54-f8bd-44ed-b551-b34d722a5687"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ef5009138bf281e0b61afa50f0d557af5b17bc86698f245732548e3edcc3df9","target":"record","created_at":"2026-05-18T03:09:32Z","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":"af2d5141685e3acc49a412ea076c8c9c38b0d72224824f9b51cd2ae59a99eeda","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-01-05T20:21:38Z","title_canon_sha256":"2ad10b442f446b28e61c6d4d90d6adf3525a316cad4a69747a5ee4274d3f1dc1"},"schema_version":"1.0","source":{"id":"2601.02537","kind":"arxiv","version":5}},"canonical_sha256":"a71f1adf73fc04d368b263294c9a5d3e3b7eb6eb6e5aa8f4264019e4aac00756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a71f1adf73fc04d368b263294c9a5d3e3b7eb6eb6e5aa8f4264019e4aac00756","first_computed_at":"2026-05-18T03:09:32.281959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:32.281959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLxL5ZlAU/8wu7+n3zlcUIsPl7sLb6bsZo2tjf0KbhU7f0K+3ey0NuLrZzzEP7a5Z3xcfkJLNu0vayTxk1aLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:32.282558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.02537","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ef5009138bf281e0b61afa50f0d557af5b17bc86698f245732548e3edcc3df9","sha256:688e43d8903094373e91d1af7993a3b8864b5972098b919f9971eed8e994d0b5"],"state_sha256":"427d26a8c101b956a25379890da74e5547e110d41296364952b5c388c13080d4"}