{"as_of":"2026-08-19T02:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:759f6d04d6abcc702ba02f370130586bc3027a3537bc75319a77247fec07626e","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:52:08.714593Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.03908/citation-record","integrity":"/paper/2505.03908/integrity","json":"/paper/2505.03908/citation-record.json","paper":"/paper/2505.03908"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.122929Z","title":"CONGA: Distributed Congestion-Aware Load Balancing for Data Centers","venue":null,"work_id":"2e154c1d-6fed-4720-ad65-d3d8f4e47f79","year":2014},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.589795Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:a87f86df2b9d46c65b8f00d9c5c2cf42b73db5c1d9bde36351bb5d263877e2b5","observation_id":"deb6d245-5cb8-45a2-a5d0-6f4151d99f6a","resolution":{"observed_at":"2026-08-15T23:52:09.126620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.112582Z","title":"A Scalable, Commodity Data Center Network Architecture","venue":null,"work_id":"459879d4-6ddc-4bf6-8264-53436a76c33b","year":2008},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.594136Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:21e2137da9900636b6d7212b9b9f624a00b3156c61157276fc536a7cba9e9b1f","observation_id":"577ef5c9-dd02-4103-816c-3510dcbdcf40","resolution":{"observed_at":"2026-08-15T23:52:09.116293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.102736Z","title":"Hedera: Dynamic Flow Scheduling for Data Center Networks","venue":null,"work_id":"3425b823-f123-41ff-8644-3de9edfa1974","year":2010},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.598233Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:691e315ded0c4bc340e5e343faf3ab351c69547d5d589ee96ffb0b38d83aa014","observation_id":"9531051b-3095-4f5d-acc7-c4c6d56ea149","resolution":{"observed_at":"2026-08-15T23:52:09.106246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.092413Z","title":"Network Traffic Characteristics of Data Centers in the Wild","venue":null,"work_id":"094fc5ef-fe46-423e-bb1f-8835bdbe2079","year":2010},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.602069Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:a1772135b4aff904ed6382086249fa604e522cda24d8d8d8f6cb4c6f3b8fcfd2","observation_id":"0f85abbb-94e0-4bb3-9870-3e7a408393df","resolution":{"observed_at":"2026-08-15T23:52:09.096172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.082363Z","title":"Intel® Omni-Path Architecture: Enabling Scalable, High Performance Fabrics","venue":null,"work_id":"fc1b50ee-beb5-4549-b40a-41a8fe171975","year":2015},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.606130Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:02667e91d6d30ea5f6417d27717af67f99e7fd3e1fb4021859932075f17e20c0","observation_id":"a574df0e-1990-47c3-877b-9fb4c5891bd0","resolution":{"observed_at":"2026-08-15T23:52:09.085943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.071374Z","title":"Approximation Algorithms for the Unsplittable Flow Problem","venue":null,"work_id":"83552bc0-bc2a-4b99-902d-d49d1f770f7d","year":2007},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.609959Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:8515c40e13a1342200e7039b9000c9dd77d00547e6b6ed349303c26dd49ee3ac","observation_id":"07aea0a5-6127-4110-ab68-81028a0111c5","resolution":{"observed_at":"2026-08-15T23:52:09.074974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.060028Z","title":"Hardness of Routing with Congestion in Directed Graphs","venue":null,"work_id":"46145113-1892-4eb5-b99f-6eca05ee0eea","year":2007},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.613447Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:a279a28b62b8f4ebe884d35e7cd299ab0502b4a42ca00028d32226400575aaa7","observation_id":"6cc57885-4db9-4b76-93ed-ab210c69ca1b","resolution":{"observed_at":"2026-08-15T23:52:09.063916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.049689Z","title":"Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective","venue":null,"work_id":"0865a73a-4fad-4ddd-ade7-a5b1298bba52","year":2017},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.616962Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:f66b690002fa8162c14f9edda0a1572f93e97e2cde505bc22a27b406f4e8ecd8","observation_id":"5ec3b649-5ce4-414a-95a6-f2e859a4c87c","resolution":{"observed_at":"2026-08-15T23:52:09.053301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.039342Z","title":"A Study of Non-Blocking Switching Networks","venue":null,"work_id":"6596e04b-0178-4ca6-876f-b7576ff15cb3","year":1953},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.620403Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:3d4983b391a5e258cf1cd83c8ccabb46b91aff42959e1dd39f1859dd814cef21","observation_id":"2dd1b6fb-97d4-46e0-9434-a07df83eec9c","resolution":{"observed_at":"2026-08-15T23:52:09.042979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.027647Z","title":"DevoFlow: scaling flow management for high-performance networks","venue":null,"work_id":"292e319d-dc3b-4951-8804-f12ce3cffb4c","year":2011},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.623724Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:5a93c2d3b3ab7925a1d7ce826c6caf8d9710d597122eb87b85534e27e5cfab78","observation_id":"cf07065a-fd67-4271-a910-4e2de86f6728","resolution":{"observed_at":"2026-08-15T23:52:09.031487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.013221Z","title":"RFC 4338: Transmission of IPv6, IPv4, and Address Resolution Protocol (ARP) Packets over Fibre Channel , 2006","venue":null,"work_id":"03465e82-b03c-4df3-8c71-11301415c4be","year":2006},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.627418Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:eaa3cc4920aeb324dc1c76f89532fd4fd7d574a29c9b8085083990553bbd12fc","observation_id":"911ff704-1e4e-47e5-a246-2fdd7c7528f0","resolution":{"observed_at":"2026-08-15T23:52:09.019384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:09.001784Z","title":"A Flexible Model for Resource Management in Virtual Private Networks","venue":null,"work_id":"cf702184-62c8-459e-8aed-9f9c02f78335","year":1999},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.631074Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:a37b21cf77da39654f08b7bc2a1953d1da8dacd99d35ba052381c970473bd8fc","observation_id":"c11a9a07-8993-4641-b6fc-aa9dcc50a65c","resolution":{"observed_at":"2026-08-15T23:52:09.006206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.990130Z","title":"IEEE Std 802.3-2022 (Revision of IEEE Std 802.3-2018) , pages 1--7025, 2022","venue":null,"work_id":"45a4a27e-3049-4287-9a3b-d34345b4700f","year":2022},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.634866Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:e3e36aee2e5e1811a78c0e7f9cefb69dc4f71c1f8ec63d1a9d3efc652e851b81","observation_id":"b12a1674-e265-4b19-8ae0-67d274cf2b5e","resolution":{"observed_at":"2026-08-15T23:52:08.993533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.979240Z","title":"VL2: A Scalable and Flexible Data Center Network","venue":null,"work_id":"042a1d5a-bde2-4088-a0f7-e8531a0bf620","year":2009},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.638274Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:c1a82acf5d6a811d8c2d09760353f89ded6b3bad494b11f9a9812efbde78e920","observation_id":"68e7cde2-9f86-4e8c-8282-660004e6bf06","resolution":{"observed_at":"2026-08-15T23:52:08.982974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.968432Z","title":"RDMA Over Ethernet for Distributed Training at Meta Scale","venue":null,"work_id":"1257c5b9-9eef-43f1-9392-03cbb292b6df","year":2024},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.641799Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:3cb7f26884aecbda3b4b116fc4a81f64178a0f9dda2395103b8bfcb3018ef295","observation_id":"cfeaca47-a3ae-4065-899b-3b4c242f92ff","resolution":{"observed_at":"2026-08-15T23:52:08.972279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.955646Z","title":"Contra: A Programmable System for Performance-Aware Routing","venue":null,"work_id":"9c6a0101-20bb-446a-bacf-2f22b4ab3fb7","year":2020},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.645161Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:29ee9a146430b69da519e0064b2a78b5ed3d42d066be43443d4dfd173dd6bef9","observation_id":"9e34a2a0-bd95-4ba0-a08a-a0dd06611b09","resolution":{"observed_at":"2026-08-15T23:52:08.960476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.943011Z","title":"Control Algorithms for Rearrangeable Clos Networks","venue":null,"work_id":"4b8e6077-12fc-401a-80c1-d8da3939e6eb","year":1983},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.649221Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:de79aa46515ef129e4b50149a5ee44f1bee86746cfe61739e7f11174188a3d5f","observation_id":"a898455c-832c-4ff2-b25d-6ae80240cc99","resolution":{"observed_at":"2026-08-15T23:52:08.947601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.928496Z","title":"Reducibility Among Combinatorial Problems","venue":null,"work_id":"b4b60766-adf6-443a-929f-e434cb780eaf","year":1972},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.653122Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:fd34618a2dc077a944864737986fed5571cd28c8cd78d9c074f2f5f35c270f6a","observation_id":"1e93b008-ad2c-41c9-ac4c-4402f77319f4","resolution":{"observed_at":"2026-08-15T23:52:08.933503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.916632Z","title":"Improved Bounds for the Unsplittable Flow Problem","venue":null,"work_id":"45c6767c-192d-41ac-ae1d-f3e7be9205d6","year":2006},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.656754Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:93774f56478886c6cdb7912ba85f5e98ee0fc388bbb746d757fcc9800a765cdc","observation_id":"7e87771a-d22b-4bc7-8ec6-75c61ee6667a","resolution":{"observed_at":"2026-08-15T23:52:08.920662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.905293Z","title":"On Weighted Bipartite Edge Coloring","venue":null,"work_id":"19207097-e7d0-4d78-83e7-ca83a52dc600","year":2015},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.660913Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:488282bc004d121caee500347bb1fa2d4449b2ae7938e6a74e322ae73521aa3b","observation_id":"e9395126-a01b-4c1c-ac88-d23e6ca39ada","resolution":{"observed_at":"2026-08-15T23:52:08.910000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.891964Z","title":"Matching Theory","venue":null,"work_id":"0b7a4124-8c84-443d-b7ca-eb609ea5b1e5","year":2009},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.665930Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:7c2f7027c5b452d98f5172e5f5655f1e66671e6c362b5c89997c847166a28021","observation_id":"c294f454-3266-4972-a82c-345426447c3c","resolution":{"observed_at":"2026-08-15T23:52:08.895795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.670253Z","title":"Randomized Algorithms","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.670253Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:b2ded90279e836f10759ea5d8ce6bd83289b1dc6e43fe9b86b6ae07168ce996f","observation_id":"7098ab13-6e94-4b4c-b712-176575889967","resolution":{"observed_at":"2026-08-15T23:52:08.670253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.871876Z","title":"Nonblocking Multirate Networks","venue":null,"work_id":"a556bbf0-53f1-4455-8551-5d24982a29ef","year":1989},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.674068Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:847c000f9d69835802f7eb2a737236735ca0ea3933fc33dcefea2bcfa403c63b","observation_id":"e87f4e43-40b8-42fc-a4db-7d2368717429","resolution":{"observed_at":"2026-08-15T23:52:08.875450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.860520Z","title":"A Throughput-Centric View of the Performance of Datacenter Topologies","venue":null,"work_id":"70c978fb-7b51-433b-946b-ce4070444a74","year":2021},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.677723Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:d17337ca57ee7b11e04b1cd24a63313c62874998677d81298b37dd3ba20cd30f","observation_id":"a80e6793-bb97-447c-81ff-95a6000026e4","resolution":{"observed_at":"2026-08-15T23:52:08.864396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.847915Z","title":"Multirate Rearrangeable Clos networks and a Generalized Edge-Coloring Problem on Bipartite Graphs","venue":null,"work_id":"d8477d3c-5724-4643-aa66-515b702182f4","year":2003},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.681729Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:2ea702960a569bfdb2360662858a5d9fede3c281054c187fc283ff299abe3baf","observation_id":"a34ab035-8043-49d2-9c2d-9816658ed604","resolution":{"observed_at":"2026-08-15T23:52:08.851784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.836968Z","title":"An Introduction to the Infiniband Architecture","venue":null,"work_id":"eff03dd3-dc10-4ff1-9671-a96c590d410d","year":2001},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.685885Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:ee2315e0d3a2d9a3547b5a6779918641180bd58d8a16b2abac42f34a209ca274","observation_id":"e5d2d11b-003f-4665-bef3-e1524e418afd","resolution":{"observed_at":"2026-08-15T23:52:08.840631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.823292Z","title":"PLB: Congestion Signals are Simple and Effective for Network Load Balancing","venue":null,"work_id":"72cdd9bc-2557-47d3-975b-4578b95240d3","year":2022},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.689333Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:a78eda3811ac237b12d1b70d39fbf274ec4b7cb604fa1fd8c66de2d1da455c8d","observation_id":"d2b58c63-b6ed-4ca5-adb4-e44fe4029b2f","resolution":{"observed_at":"2026-08-15T23:52:08.829395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.811017Z","title":"Alibaba HPN: A Data Center Network for Large Language Model Training","venue":null,"work_id":"ecf76bbe-f94e-4fb0-b52c-6947a0b6e7df","year":2024},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.694051Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:d7d2a23093b4b6db494e2e22aaabeb634fa720f25e8e5b4738d82b7da80169bd","observation_id":"8602313f-ad1d-47a1-81ea-bc266905190d","resolution":{"observed_at":"2026-08-15T23:52:08.815298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.800240Z","title":"Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs","venue":null,"work_id":"3395e10f-4311-4469-952e-a956b05e9207","year":1987},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.698656Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:c3969276539381fbc9501fe19b864b10e946218e9c7dde9982c639dc7803b3b1","observation_id":"bc9e1821-4e0c-4a78-8d35-65efd794b0cf","resolution":{"observed_at":"2026-08-15T23:52:08.803843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.789050Z","title":"Inside the Social Network's (Datacenter) Network","venue":null,"work_id":"12bfb6f1-4935-4923-a936-da9ba1c8dd42","year":2015},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.702293Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:e427d3c894a662f9454a3da60be69439b3bb9e12d864dd6f81931923f5a97919","observation_id":"44f10aed-f447-4d0e-9024-26724c6ec34d","resolution":{"observed_at":"2026-08-15T23:52:08.792686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.776491Z","title":"High Throughput Data Center Topology Design","venue":null,"work_id":"d826a9f5-1a83-48f6-a10f-ec7bc2df4406","year":2014},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.706178Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:5d73405d28fffdfbf850c2a4d909bfe4db38d3b36a8b3c55bd4feee91d52dde2","observation_id":"10beb80d-b38e-405e-9ecc-f440516672f3","resolution":{"observed_at":"2026-08-15T23:52:08.780700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.763274Z","title":"Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network","venue":null,"work_id":"3253c575-da38-42bf-9cf6-78a9138ca08a","year":2015},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.710612Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:96ecb873471c8ab3e8d60cf0a1f73563127a3dcb0187ff288f6aa19c461a9ee0","observation_id":"531f7f02-c4de-4558-99ef-5d4e14f02058","resolution":{"observed_at":"2026-08-15T23:52:08.767377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:52:08.748414Z","title":"Probabilistic Computations: Towards a Unified Measure of Complexity","venue":null,"work_id":"b9a1b549-58b1-4dda-aee8-3228b49af7b0","year":1977},"citing_paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T23:52:08.714593Z"},"links":{"citing_paper":"/paper/2505.03908"},"observation_digest":"sha256:f3cdc7bcd28301e9228c4681bbcf7486c2f8354fdf9627d7285e2ea87e6895a9","observation_id":"b635e2e3-aa44-498d-98d7-231509a469d9","resolution":{"observed_at":"2026-08-15T23:52:08.755360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.03908","last_updated":"2025-05-06T18:29:57Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-15T23:40:30.631709Z","submitted_at":"2025-05-06T18:29:57Z","title":"Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":33},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"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."}