{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PJRFMS3LHOWHNPLPBCSYONANH2","short_pith_number":"pith:PJRFMS3L","schema_version":"1.0","canonical_sha256":"7a62564b6b3bac76bd6f08a587340d3ea320e90c0c05b978303090d124c6ec8a","source":{"kind":"arxiv","id":"1708.09135","version":1},"attestation_state":"computed","paper":{"title":"Randomized Load-balanced Routing for Fat-tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bruce Kwong-Bun Tong, Jingjing Luo, Suzhen Wang, Wing S. Wong","submitted_at":"2017-08-30T06:35:17Z","abstract_excerpt":"Fat-tree networks have been widely adopted to High Performance Computing (HPC) clusters and to Data Center Networks (DCN). These parallel systems usually have a large number of servers and hosts, which generate large volumes of highly-volatile traffic. Thus, distributed load-balancing routing design becomes critical to achieve high bandwidth utilization, and low-latency packet delivery. Existing distributed designs rely on remote congestion feedbacks to address congestion, which add overheads to collect and react to network-wide congestion information. In contrast, we propose a simple but effe"},"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":"1708.09135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-30T06:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"f5af7d83f0cee771f3687bb66c00a7daf89a4da53b76a02532562b8ff1075eb3","abstract_canon_sha256":"b40dba0cfa694a7f38e8ad742d2e98fb91e3ad023040dd366a1f300cb28de4d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.870645Z","signature_b64":"HnVTjMpe2hh34DtMyuJvICVNn3/uRyY/aiDhgJHR5kTFyFYvgtd/kuKYYfL4FmT57yfRyKY2es4SMYKgvGBUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a62564b6b3bac76bd6f08a587340d3ea320e90c0c05b978303090d124c6ec8a","last_reissued_at":"2026-05-18T00:36:20.869472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.869472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Load-balanced Routing for Fat-tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bruce Kwong-Bun Tong, Jingjing Luo, Suzhen Wang, Wing S. Wong","submitted_at":"2017-08-30T06:35:17Z","abstract_excerpt":"Fat-tree networks have been widely adopted to High Performance Computing (HPC) clusters and to Data Center Networks (DCN). These parallel systems usually have a large number of servers and hosts, which generate large volumes of highly-volatile traffic. Thus, distributed load-balancing routing design becomes critical to achieve high bandwidth utilization, and low-latency packet delivery. Existing distributed designs rely on remote congestion feedbacks to address congestion, which add overheads to collect and react to network-wide congestion information. In contrast, we propose a simple but effe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09135","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":"1708.09135","created_at":"2026-05-18T00:36:20.869548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09135v1","created_at":"2026-05-18T00:36:20.869548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09135","created_at":"2026-05-18T00:36:20.869548+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJRFMS3LHOWH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJRFMS3LHOWHNPLP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJRFMS3L","created_at":"2026-05-18T12:31:37.085036+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/PJRFMS3LHOWHNPLPBCSYONANH2","json":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2.json","graph_json":"https://pith.science/api/pith-number/PJRFMS3LHOWHNPLPBCSYONANH2/graph.json","events_json":"https://pith.science/api/pith-number/PJRFMS3LHOWHNPLPBCSYONANH2/events.json","paper":"https://pith.science/paper/PJRFMS3L"},"agent_actions":{"view_html":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2","download_json":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2.json","view_paper":"https://pith.science/paper/PJRFMS3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09135&json=true","fetch_graph":"https://pith.science/api/pith-number/PJRFMS3LHOWHNPLPBCSYONANH2/graph.json","fetch_events":"https://pith.science/api/pith-number/PJRFMS3LHOWHNPLPBCSYONANH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2/action/storage_attestation","attest_author":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2/action/author_attestation","sign_citation":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2/action/citation_signature","submit_replication":"https://pith.science/pith/PJRFMS3LHOWHNPLPBCSYONANH2/action/replication_record"}},"created_at":"2026-05-18T00:36:20.869548+00:00","updated_at":"2026-05-18T00:36:20.869548+00:00"}