{"as_of":"2026-08-12T13:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4984da7df5b9cf86d6b8b35c61f6f48e8fcc08873dd01115b94efb159dc28ff5","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:17:59.471406Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2501.09293/citation-record","integrity":"/paper/2501.09293/integrity","json":"/paper/2501.09293/citation-record.json","paper":"/paper/2501.09293"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.313421Z","title":"Sincronia: Near-optimal network design for coflows,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.313421Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:8347b7a99b3e60fe75dc225d730f9d48aeeae67ee666742022e2ad89abbdf5ec","observation_id":"6e435301-9685-4aaf-a353-1ed68e854673","resolution":{"observed_at":"2026-08-10T20:17:59.313421Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.320041Z","title":"On scheduling coflows,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.320041Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:d752748c0698ed417e01f018f76e91b7a682282ed0689152599a5e6463029270","observation_id":"72d5ec1e-2d06-496e-9648-bbe88e49b1bf","resolution":{"observed_at":"2026-08-10T20:17:59.320041Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.325527Z","title":"The hadoop distributed file system: Architecture and design,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.325527Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:0dae2532d607a3511624fd769e6d0f0e2bda8bce6a41e43dea09136c3e01a1c2","observation_id":"7760686c-8f23-4762-96d7-635c60f8f667","resolution":{"observed_at":"2026-08-10T20:17:59.325527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11296","last_updated":"2023-12-24T11:24:43Z","snapshot_observed_at":"2026-08-12T12:03:57.712684Z","submitted_at":"2023-11-19T11:02:04Z","title":"Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.11296","snapshot_observed_at":"2026-08-10T20:17:59.330891Z","title":"Improved approximation algorithms for minimizing the total weighted completion time of coflows,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.330891Z"},"links":{"cited_paper":"/paper/2311.11296","citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:19cf2b6e83a69d8b1cc7e8b538935aff8de388a198ccbb4d99a4fe917f0f1dde","observation_id":"b91a1d92-9e1b-4aa6-b402-8a02fe4109b2","resolution":{"observed_at":"2026-08-10T20:17:59.330891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16413","last_updated":"2023-12-27T05:11:02Z","snapshot_observed_at":"2026-07-06T17:08:30.524802Z","submitted_at":"2023-12-27T05:11:02Z","title":"Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16413","snapshot_observed_at":"2026-08-10T20:17:59.338995Z","title":"Improved approximation coflows scheduling algorithms for minimizing the total weighted completion time and makespan in heterogeneous parallel networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.338995Z"},"links":{"cited_paper":"/paper/2312.16413","citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:5b1ff0fa14d8b2071fcf28e1b395d7aede957f18e39419eb7fc688b50fadb78c","observation_id":"d513dc1a-b3c0-4c5b-a43e-7e4ba4ac4e39","resolution":{"observed_at":"2026-08-10T20:17:59.338995Z","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-10T20:17:59.826601Z","title":"Scheduling coflows for minimizing the total weighted completion time in hetero- geneous parallel networks,","venue":null,"work_id":"74ad5c3d-1415-4c5a-acfc-25e21a73e7cf","year":2023},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.345623Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:5657f84a6a84c91fa26da9e81944a38e75a55a8ac7b66fcbc4b6ea1cf8561ad4","observation_id":"0f27a9c3-baef-487b-a0dc-f96cb6b6f820","resolution":{"observed_at":"2026-08-10T20:17:59.832620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T20:17:59.352534Z","title":"Efficient approximation algorithms for scheduling coflows with precedence con- straints in identical parallel networks to minimize weighted completion time,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.352534Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:a3bc96c8edd70a77b1d915f2e15e88f22c19cf9c114b798b2114b84575d3e8c5","observation_id":"8beeedcb-72a5-42d1-80eb-d0e78acfec28","resolution":{"observed_at":"2026-08-10T20:17:59.352534Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.359714Z","title":"Efficient approximation algorithms for scheduling coflows with total weighted completion time in identical parallel networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.359714Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:8cb72c1771b79110f8f2a0cc659b848581c4c07eb0bb6898ceda4e94fc400647","observation_id":"22a04a05-9cd1-4d4e-a5e9-87cb8ac0d7bf","resolution":{"observed_at":"2026-08-10T20:17:59.359714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06846","last_updated":"2023-06-14T10:46:00Z","snapshot_observed_at":"2026-07-06T14:51:33.651976Z","submitted_at":"2023-02-14T05:49:48Z","title":"Scheduling Coflows for Minimizing the Makespan in Identical Parallel Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06846","snapshot_observed_at":"2026-08-10T20:17:59.365988Z","title":"Scheduling coflows for minimizing the makespan in identical parallel networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.365988Z"},"links":{"cited_paper":"/paper/2302.06846","citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:ceb0256dca217428e86a199b02ea8a6e791558ff3705fc74c488ae4f416092d0","observation_id":"c2dfaa3a-1e20-4c57-bcab-454af963be49","resolution":{"observed_at":"2026-08-10T20:17:59.365988Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.373735Z","title":"Coflow: A networking abstraction for cluster applications,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.373735Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:73cdda67d0cbafad3293aca3e9529e2a6463ef326c59674a50b7ff9138d34e1a","observation_id":"afa14bcd-2916-41f1-a83c-2e61cc99f612","resolution":{"observed_at":"2026-08-10T20:17:59.373735Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.379446Z","title":"Efficient coflow scheduling without prior knowledge,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.379446Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:0243d6f2880acb9ee4848e688426fdc721d0672522e7e0d09ebd80aea0c20f36","observation_id":"13cfdb2a-8aa4-4016-a549-d23da3b00be3","resolution":{"observed_at":"2026-08-10T20:17:59.379446Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.385489Z","title":"Efficient coflow scheduling with varys,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.385489Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:07af7a57e1105320370a2d097380781ff4828456aaeba636c0e32f77486bdc22","observation_id":"aa96230d-5982-429d-8e0b-689deca07c1c","resolution":{"observed_at":"2026-08-10T20:17:59.385489Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.393090Z","title":"Mapreduce: Simplified data processing on large clusters,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.393090Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:1ec90768a7c9a37a4898f6db8192dcff944d1f169618d0445e80d77a3b426e98","observation_id":"47614e64-5c83-4417-80f6-779c3fa7d013","resolution":{"observed_at":"2026-08-10T20:17:59.393090Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.403951Z","title":"Dryad: distributed data-parallel programs from sequential building blocks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.403951Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:7ec157fbdff2391e1d59a55b45bff1eba8b07cc2d58e382a1266c3783a21f9f1","observation_id":"4e2ad431-dde7-467b-ab15-433dc8aed1fb","resolution":{"observed_at":"2026-08-10T20:17:59.403951Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.411621Z","title":"Brief announcement: Improved approximation algorithms for scheduling co-flows,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.411621Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:c34ec8a1ae864c3e651bf48c6c974096bd9feab5e13f12c9cd19a6be79a69a26","observation_id":"6ef3ac3e-8856-45a7-8f6c-b0dee14ce261","resolution":{"observed_at":"2026-08-10T20:17:59.411621Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.419273Z","title":"Co-scheduler: A coflow-aware data-parallel job scheduler in hybrid elec- trical/optical datacenter networks,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.419273Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:b4c9709edce95007001391a66788eaece345f9f4ccd6f355a4b0708d7a71494b","observation_id":"b5744c34-6c07-4136-9867-71c1b2018b20","resolution":{"observed_at":"2026-08-10T20:17:59.419273Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.424837Z","title":"Diagonals of doubly stochastic matrices,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.424837Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:6b6574ce526494da63c8ecfa62cb1f88e223c4b00d102820ba103c07b96dd4a1","observation_id":"f032ffe6-1cbe-44bf-b06b-9358ff9159ba","resolution":{"observed_at":"2026-08-10T20:17:59.424837Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.430051Z","title":"Minimizing the total weighted completion time of coflows in datacenter networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.430051Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:3ed9ec2ccda65572676d6ad7426c0720ddc3d727f051c39d12fa40f02ca1633f","observation_id":"9d2083e6-835e-42a3-92bf-e0ca475fe90f","resolution":{"observed_at":"2026-08-10T20:17:59.430051Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.435508Z","title":"Scheduling unrelated machines by randomized rounding,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.435508Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:8be05b7e2089776da26838950298d68d039bd8b78915ef543c92422980603f49","observation_id":"263783ee-92d1-4241-9e4a-6beca06b0888","resolution":{"observed_at":"2026-08-10T20:17:59.435508Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.440608Z","title":"An improved bound for minimizing the total weighted completion time of coflows in datacenters,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.440608Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:5f9c642b6fdf21bea1628df5df36473f103bd67fe95946e6b5eba50181f7b62f","observation_id":"069e5ebf-0894-4fd2-b230-9e15f9361acd","resolution":{"observed_at":"2026-08-10T20:17:59.440608Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.446617Z","title":"The hadoop distributed file system,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.446617Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:4b3ccd9fb0be9da165a08fe44e6ecc987b2ce2bf347fc3f47f6f1edb54962b9b","observation_id":"e3771384-e797-4a6c-8387-cfc355d07e29","resolution":{"observed_at":"2026-08-10T20:17:59.446617Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:17:59.452465Z","title":"Regularization-based coflow scheduling in optical circuit switches,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.452465Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:908b9fb4583dfb9a3cfff082e7a1c2a25c80325080a89528e6d6baec5bdb186b","observation_id":"4f387e52-fc8b-4a7c-97c6-806c1bd9a3de","resolution":{"observed_at":"2026-08-10T20:17:59.452465Z","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-10T20:17:59.602015Z","title":"Spark: Cluster com- puting with working sets,","venue":null,"work_id":"23eab07e-9ca5-4b81-af12-b555bf278cec","year":2010},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.457799Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:95526a951e236bc50cb773ab44820722de368a3895f4696aae5506b26e644e7b","observation_id":"62161604-9509-4560-b3df-5b236db1f34e","resolution":{"observed_at":"2026-08-10T20:17:59.608197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T20:17:59.465239Z","title":"Coda: Toward auto- matically identifying and scheduling coflows in the dark,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.465239Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:fb28f80a5e80027fcf91b728a5aab6bfcc76d3c0901c3dfc86202cf041c3c642","observation_id":"599561c9-0ca8-469c-93d9-af4459371e20","resolution":{"observed_at":"2026-08-10T20:17:59.465239Z","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-10T20:17:59.566673Z","title":"Minimizing coflow completion time in optical circuit switched networks,","venue":null,"work_id":"aa128afb-ca54-4a7e-8fd7-0ebda58429a0","year":2021},"citing_paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks","version":7},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T20:17:59.471406Z"},"links":{"citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:63550f0e1758a42eb1fe14e4c350a197405cca264a337df70c151ca9e7236b65","observation_id":"35ddaed5-7401-4700-8c3e-603c3bbc7ba2","resolution":{"observed_at":"2026-08-10T20:17:59.574171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.09293","last_updated":"2026-06-18T13:28:35Z","latest_version":7,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T12:46:12.464268Z","submitted_at":"2025-01-16T05:01:22Z","title":"Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":25},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}