Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks
As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.16413.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T20:17:59.338995Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-23T05:52:37.247642Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 8c3bc0a5-fd16-4b70-8498-b92e9ec10593 · inbound
Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks cites this paper.
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
- verified exact
- arxiv_id, observed 2026-05-23T05:52:37.251119Z
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.
Observation d513dc1a-b3c0-4c5b-a43e-7e4ba4ac4e39 · inbound
Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks cites this paper.
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.