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:8347b7a99b3e60fe75dc225d730f9d48aeeae67ee666742022e2ad89abbdf5ec

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:d752748c0698ed417e01f018f76e91b7a682282ed0689152599a5e6463029270

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:0dae2532d607a3511624fd769e6d0f0e2bda8bce6a41e43dea09136c3e01a1c2

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:19cf2b6e83a69d8b1cc7e8b538935aff8de388a198ccbb4d99a4fe917f0f1dde

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:5b1ff0fa14d8b2071fcf28e1b395d7aede957f18e39419eb7fc688b50fadb78c

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:5657f84a6a84c91fa26da9e81944a38e75a55a8ac7b66fcbc4b6ea1cf8561ad4

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:a3bc96c8edd70a77b1d915f2e15e88f22c19cf9c114b798b2114b84575d3e8c5

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:8cb72c1771b79110f8f2a0cc659b848581c4c07eb0bb6898ceda4e94fc400647

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:ceb0256dca217428e86a199b02ea8a6e791558ff3705fc74c488ae4f416092d0

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:73cdda67d0cbafad3293aca3e9529e2a6463ef326c59674a50b7ff9138d34e1a

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:0243d6f2880acb9ee4848e688426fdc721d0672522e7e0d09ebd80aea0c20f36

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:07af7a57e1105320370a2d097380781ff4828456aaeba636c0e32f77486bdc22

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:1ec90768a7c9a37a4898f6db8192dcff944d1f169618d0445e80d77a3b426e98

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:7ec157fbdff2391e1d59a55b45bff1eba8b07cc2d58e382a1266c3783a21f9f1

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:c34ec8a1ae864c3e651bf48c6c974096bd9feab5e13f12c9cd19a6be79a69a26

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:b4c9709edce95007001391a66788eaece345f9f4ccd6f355a4b0708d7a71494b

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:6b6574ce526494da63c8ecfa62cb1f88e223c4b00d102820ba103c07b96dd4a1

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:3ed9ec2ccda65572676d6ad7426c0720ddc3d727f051c39d12fa40f02ca1633f

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:8be05b7e2089776da26838950298d68d039bd8b78915ef543c92422980603f49

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:5f9c642b6fdf21bea1628df5df36473f103bd67fe95946e6b5eba50181f7b62f

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:4b3ccd9fb0be9da165a08fe44e6ecc987b2ce2bf347fc3f47f6f1edb54962b9b

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:908b9fb4583dfb9a3cfff082e7a1c2a25c80325080a89528e6d6baec5bdb186b

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:95526a951e236bc50cb773ab44820722de368a3895f4696aae5506b26e644e7b

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:fb28f80a5e80027fcf91b728a5aab6bfcc76d3c0901c3dfc86202cf041c3c642

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:63550f0e1758a42eb1fe14e4c350a197405cca264a337df70c151ca9e7236b65

Pith citing papers

No inbound Pith citation observations are available.