Paper Citation Record · LEDGER

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks

As of 19 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2505.03908.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.03908 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:52:08.714593Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

33 of 33 outbound references displayed

verified exact0
verified fuzzy32
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation deb6d245-5cb8-45a2-a5d0-6f4151d99f6a · outbound

This paper cites CONGA: Distributed Congestion-Aware Load Balancing for Data Centers.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks CONGA: Distributed Congestion-Aware Load Balancing for Data Centers

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.126620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 577ef5c9-dd02-4103-816c-3510dcbdcf40 · outbound

This paper cites A Scalable, Commodity Data Center Network Architecture.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks A Scalable, Commodity Data Center Network Architecture

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.116293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 9531051b-3095-4f5d-acc7-c4c6d56ea149 · outbound

This paper cites Hedera: Dynamic Flow Scheduling for Data Center Networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Hedera: Dynamic Flow Scheduling for Data Center Networks

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.106246Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 0f85abbb-94e0-4bb3-9870-3e7a408393df · outbound

This paper cites Network Traffic Characteristics of Data Centers in the Wild.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Network Traffic Characteristics of Data Centers in the Wild

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.096172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a574df0e-1990-47c3-877b-9fb4c5891bd0 · outbound

This paper cites Intel® Omni-Path Architecture: Enabling Scalable, High Performance Fabrics.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Intel® Omni-Path Architecture: Enabling Scalable, High Performance Fabrics

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.085943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 07aea0a5-6127-4110-ab68-81028a0111c5 · outbound

This paper cites Approximation Algorithms for the Unsplittable Flow Problem.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Approximation Algorithms for the Unsplittable Flow Problem

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.074974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 6cc57885-4db9-4b76-93ed-ab210c69ca1b · outbound

This paper cites Hardness of Routing with Congestion in Directed Graphs.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Hardness of Routing with Congestion in Directed Graphs

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.063916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5ec3b649-5ce4-414a-95a6-f2e859a4c87c · outbound

This paper cites Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.053301Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2dd1b6fb-97d4-46e0-9434-a07df83eec9c · outbound

This paper cites A Study of Non-Blocking Switching Networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks A Study of Non-Blocking Switching Networks

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.042979Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation cf07065a-fd67-4271-a910-4e2de86f6728 · outbound

This paper cites DevoFlow: scaling flow management for high-performance networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks DevoFlow: scaling flow management for high-performance networks

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.031487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 911ff704-1e4e-47e5-a246-2fdd7c7528f0 · outbound

This paper cites RFC 4338: Transmission of IPv6, IPv4, and Address Resolution Protocol (ARP) Packets over Fibre Channel , 2006.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks RFC 4338: Transmission of IPv6, IPv4, and Address Resolution Protocol (ARP) Packets over Fibre Channel , 2006

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.019384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c11a9a07-8993-4641-b6fc-aa9dcc50a65c · outbound

This paper cites A Flexible Model for Resource Management in Virtual Private Networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks A Flexible Model for Resource Management in Virtual Private Networks

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:09.006206Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b12a1674-e265-4b19-8ae0-67d274cf2b5e · outbound

This paper cites IEEE Std 802.3-2022 (Revision of IEEE Std 802.3-2018) , pages 1--7025, 2022.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks IEEE Std 802.3-2022 (Revision of IEEE Std 802.3-2018) , pages 1--7025, 2022

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.993533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 68e7cde2-9f86-4e8c-8282-660004e6bf06 · outbound

This paper cites VL2: A Scalable and Flexible Data Center Network.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks VL2: A Scalable and Flexible Data Center Network

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.982974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation cfeaca47-a3ae-4065-899b-3b4c242f92ff · outbound

This paper cites RDMA Over Ethernet for Distributed Training at Meta Scale.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks RDMA Over Ethernet for Distributed Training at Meta Scale

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.972279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 9e34a2a0-bd95-4ba0-a08a-a0dd06611b09 · outbound

This paper cites Contra: A Programmable System for Performance-Aware Routing.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Contra: A Programmable System for Performance-Aware Routing

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.960476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a898455c-832c-4ff2-b25d-6ae80240cc99 · outbound

This paper cites Control Algorithms for Rearrangeable Clos Networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Control Algorithms for Rearrangeable Clos Networks

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.947601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1e93b008-ad2c-41c9-ac4c-4402f77319f4 · outbound

This paper cites Reducibility Among Combinatorial Problems.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Reducibility Among Combinatorial Problems

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.933503Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7e87771a-d22b-4bc7-8ec6-75c61ee6667a · outbound

This paper cites Improved Bounds for the Unsplittable Flow Problem.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Improved Bounds for the Unsplittable Flow Problem

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.920662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e9395126-a01b-4c1c-ac88-d23e6ca39ada · outbound

This paper cites On Weighted Bipartite Edge Coloring.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks On Weighted Bipartite Edge Coloring

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.910000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c294f454-3266-4972-a82c-345426447c3c · outbound

This paper cites Matching Theory.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Matching Theory

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.895795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7098ab13-6e94-4b4c-b712-176575889967 · outbound

This paper cites Randomized Algorithms.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Randomized Algorithms

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-15T23:52:08.670253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e87f4e43-40b8-42fc-a4db-7d2368717429 · outbound

This paper cites Nonblocking Multirate Networks.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Nonblocking Multirate Networks

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.875450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a80e6793-bb97-447c-81ff-95a6000026e4 · outbound

This paper cites A Throughput-Centric View of the Performance of Datacenter Topologies.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks A Throughput-Centric View of the Performance of Datacenter Topologies

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.864396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a34ab035-8043-49d2-9c2d-9816658ed604 · outbound

This paper cites Multirate Rearrangeable Clos networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Multirate Rearrangeable Clos networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.851784Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e5d2d11b-003f-4665-bef3-e1524e418afd · outbound

This paper cites An Introduction to the Infiniband Architecture.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks An Introduction to the Infiniband Architecture

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.840631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d2b58c63-b6ed-4ca5-adb4-e44fe4029b2f · outbound

This paper cites PLB: Congestion Signals are Simple and Effective for Network Load Balancing.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks PLB: Congestion Signals are Simple and Effective for Network Load Balancing

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.829395Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 8602313f-ad1d-47a1-81ea-bc266905190d · outbound

This paper cites Alibaba HPN: A Data Center Network for Large Language Model Training.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Alibaba HPN: A Data Center Network for Large Language Model Training

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.815298Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation bc9e1821-4e0c-4a78-8d35-65efd794b0cf · outbound

This paper cites Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.803843Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 44f10aed-f447-4d0e-9024-26724c6ec34d · outbound

This paper cites Inside the Social Network's (Datacenter) Network.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Inside the Social Network's (Datacenter) Network

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.792686Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 10beb80d-b38e-405e-9ecc-f440516672f3 · outbound

This paper cites High Throughput Data Center Topology Design.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks High Throughput Data Center Topology Design

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.780700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 531f7f02-c4de-4558-99ef-5d4e14f02058 · outbound

This paper cites Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.767377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b635e2e3-aa44-498d-98d7-231509a469d9 · outbound

This paper cites Probabilistic Computations: Towards a Unified Measure of Complexity.

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks Probabilistic Computations: Towards a Unified Measure of Complexity

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:52:08.755360Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

No inbound Pith citation observations are available.