Pith. sign in

Paper Citation Record · LEDGER

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks

As of 12 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.09293.

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

pith.paper-citation-record.v1
2501.09293 v7

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T20:17:59.471406Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

25 of 25 outbound references displayed

  • verified exact0
  • verified fuzzy3
  • unresolved22
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6e435301-9685-4aaf-a353-1ed68e854673 · outbound

This paper cites Sincronia: Near-optimal network design for coflows,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Sincronia: Near-optimal network design for coflows,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.313421Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.313421Z digest=sha256:e6faefba6493d8d74524e7aea45e84c5590bbf61b9be98ef8cf86d98a0f83ac7

Observation 72d5ec1e-2d06-496e-9648-bbe88e49b1bf · outbound

This paper cites On scheduling coflows,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks On scheduling coflows,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.320041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.320041Z digest=sha256:9f217f6ea6458d907f1098c3ffbf8be8be0a1ef81e7a65ab5fa2daca5dbe5da0

Observation 7760686c-8f23-4762-96d7-635c60f8f667 · outbound

This paper cites The hadoop distributed file system: Architecture and design,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks The hadoop distributed file system: Architecture and design,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.325527Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.325527Z digest=sha256:c80ea3afc25e7d9b88250179125608610e2a524e3ab163cdc27e48de69993683

Observation b91a1d92-9e1b-4aa6-b402-8a02fe4109b2 · outbound

This paper cites Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.330891Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.330891Z digest=sha256:ec2c2d940dcf0d0b6437aca26166686b9f516b06e4ea1827b2d1d038b9e71534

Observation d513dc1a-b3c0-4c5b-a43e-7e4ba4ac4e39 · outbound

This paper cites Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.338995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.338995Z digest=sha256:30ea24afdca9c25b5015f981bbdec92aa34e3b13ea2295be6d2cf9b8c3daea4b

Observation 0f27a9c3-baef-487b-a0dc-f96cb6b6f820 · outbound

This paper cites Scheduling coflows for minimizing the total weighted completion time in hetero- geneous parallel networks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Scheduling coflows for minimizing the total weighted completion time in hetero- geneous parallel networks,

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:17:59.832620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-10T20:17:59.345623Z digest=sha256:3bd5159bd4d7cb67e2f6026627b9792513b6bcf2fbee0ea7f916c90dbfc6d31c

Observation 8beeedcb-72a5-42d1-80eb-d0e78acfec28 · outbound

This paper cites Efficient approximation algorithms for scheduling coflows with precedence con- straints in identical parallel networks to minimize weighted completion time,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Efficient approximation algorithms for scheduling coflows with precedence con- straints in identical parallel networks to minimize weighted completion time,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.352534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.352534Z digest=sha256:20e89f37d0df6d405f9757d849add6012319436e63665a8e31f28d4d07b9c7dd

Observation 22a04a05-9cd1-4d4e-a5e9-87cb8ac0d7bf · outbound

This paper cites Efficient approximation algorithms for scheduling coflows with total weighted completion time in identical parallel networks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Efficient approximation algorithms for scheduling coflows with total weighted completion time in identical parallel networks,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.359714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.359714Z digest=sha256:5def8e1a25ab021a3a193ab03f74827a9dd1382cf5d945da3d9cb267e58a1820

Observation c2dfaa3a-1e20-4c57-bcab-454af963be49 · outbound

This paper cites Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.365988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.365988Z digest=sha256:c38eda4ffa079bcbe006bec5c2e7586fce1c8bd34fbdd67f452e6444896b75d8

Observation afa14bcd-2916-41f1-a83c-2e61cc99f612 · outbound

This paper cites Coflow: A networking abstraction for cluster applications,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Coflow: A networking abstraction for cluster applications,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.373735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.373735Z digest=sha256:9decc7103fac6dd1a33b88a50552136b49bbd53b17d96b74424ba567473f1ac7

Observation 13cfdb2a-8aa4-4016-a549-d23da3b00be3 · outbound

This paper cites Efficient coflow scheduling without prior knowledge,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Efficient coflow scheduling without prior knowledge,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.379446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.379446Z digest=sha256:594f51faa6685024b471f9cb8ca143289c65c8bff257d0ccfb792c3f29060a79

Observation aa96230d-5982-429d-8e0b-689deca07c1c · outbound

This paper cites Efficient coflow scheduling with varys,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Efficient coflow scheduling with varys,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.385489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.385489Z digest=sha256:d902e157fe628933690d48fe52f6764a383b1ee2c07bc94d3dc0687e57592dc8

Observation 47614e64-5c83-4417-80f6-779c3fa7d013 · outbound

This paper cites Mapreduce: Simplified data processing on large clusters,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Mapreduce: Simplified data processing on large clusters,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.393090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.393090Z digest=sha256:f97e538c499e8ee0e7c7a0ab26f4582da29a94e956690dbef164580f89602f43

Observation 4e2ad431-dde7-467b-ab15-433dc8aed1fb · outbound

This paper cites Dryad: distributed data-parallel programs from sequential building blocks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Dryad: distributed data-parallel programs from sequential building blocks,

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.403951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.403951Z digest=sha256:489f14c51687b4705e3b5a81a11073694ff6a66d3d081396ed67c77eb417c138

Observation 6ef3ac3e-8856-45a7-8f6c-b0dee14ce261 · outbound

This paper cites Brief announcement: Improved approximation algorithms for scheduling co-flows,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Brief announcement: Improved approximation algorithms for scheduling co-flows,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.411621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.411621Z digest=sha256:1bf63c21f389320f3af707630ff7c9f3012432f701e2c4c2cd4951cb6b7d00c2

Observation b5744c34-6c07-4136-9867-71c1b2018b20 · outbound

This paper cites Co-scheduler: A coflow-aware data-parallel job scheduler in hybrid elec- trical/optical datacenter networks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Co-scheduler: A coflow-aware data-parallel job scheduler in hybrid elec- trical/optical datacenter networks,

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.419273Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.419273Z digest=sha256:1bdd4f35a40886b16af9ef7372b3cddf1ecccb02e15b0e43762b0d48bf1c5f38

Observation f032ffe6-1cbe-44bf-b06b-9358ff9159ba · outbound

This paper cites Diagonals of doubly stochastic matrices,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Diagonals of doubly stochastic matrices,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.424837Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.424837Z digest=sha256:f604489cab18276bec9054947c66c7ae8644f8c1e191b4d510ef6e796a6adcf6

Observation 9d2083e6-835e-42a3-92bf-e0ca475fe90f · outbound

This paper cites Minimizing the total weighted completion time of coflows in datacenter networks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Minimizing the total weighted completion time of coflows in datacenter networks,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.430051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.430051Z digest=sha256:6b77d0239554df60df3cbf2ce202fb779b5e7edf50f572665dee4df09dd236d2

Observation 263783ee-92d1-4241-9e4a-6beca06b0888 · outbound

This paper cites Scheduling unrelated machines by randomized rounding,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Scheduling unrelated machines by randomized rounding,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.435508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.435508Z digest=sha256:36d7867e18498b438d82004afac06a8b0eecf73d7b0a24e12157e340af07a540

Observation 069e5ebf-0894-4fd2-b230-9e15f9361acd · outbound

This paper cites An improved bound for minimizing the total weighted completion time of coflows in datacenters,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks An improved bound for minimizing the total weighted completion time of coflows in datacenters,

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.440608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.440608Z digest=sha256:687cae6ae97007a5f4de1e66bffccd679995d2d4e9ad01c90409f9b92495a938

Observation e3771384-e797-4a6c-8387-cfc355d07e29 · outbound

This paper cites The hadoop distributed file system,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks The hadoop distributed file system,

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.446617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.446617Z digest=sha256:e9f654ab67f6587d17e24c55f244051a6445bdc37e3a8251ab502c0e3b5e03c8

Observation 4f387e52-fc8b-4a7c-97c6-806c1bd9a3de · outbound

This paper cites Regularization-based coflow scheduling in optical circuit switches,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Regularization-based coflow scheduling in optical circuit switches,

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.452465Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.452465Z digest=sha256:087f6dba5e6f79d60ca16330cabe3f25202cad200dd80592c98e4600813e1b27

Observation 62161604-9509-4560-b3df-5b236db1f34e · outbound

This paper cites Spark: Cluster com- puting with working sets,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Spark: Cluster com- puting with working sets,

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:17:59.608197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-10T20:17:59.457799Z digest=sha256:bc0fa21b4976e7e5c9ba522e51daa36f8e9813eb37414142538b041b15cebbf5

Observation 599561c9-0ca8-469c-93d9-af4459371e20 · outbound

This paper cites Coda: Toward auto- matically identifying and scheduling coflows in the dark,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Coda: Toward auto- matically identifying and scheduling coflows in the dark,

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-10T20:17:59.465239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T20:17:59.465239Z digest=sha256:9837162d91dfb0adf7a0d47968ea693f95951b9a41e2f8f94a4d0e0dcc42984c

Observation 35ddaed5-7401-4700-8c3e-603c3bbc7ba2 · outbound

This paper cites Minimizing coflow completion time in optical circuit switched networks,.

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks Minimizing coflow completion time in optical circuit switched networks,

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:17:59.574171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-10T20:17:59.471406Z digest=sha256:cbbff43e1d813d558173a48d4faf20891da8d99db59ce45a7e1251c8c61c31f4

Pith citing papers

No inbound Pith citation observations are available.