{"as_of":"2026-08-12T23:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5666236e1b7e1fd460492686099e021f4cf6ea2fd8d2d0a81f8342574b8d23b7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:17:59.338995Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T05:52:37.247642Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2312.16413","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.16413","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved approximation coflows scheduling algorithms for minimizing the total weighted completion time and makespan in heterogeneous parallel networks","venue":null,"work_id":"242f07a5-581c-408c-9aae-d8487a6b2483","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":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T05:47:51.513945Z"},"links":{"cited_paper":"/paper/2312.16413","citing_paper":"/paper/2501.09293"},"observation_digest":"sha256:594fbca6aabdd243187dd598e394e1771265cbee1bbf97276cce77013c1b3567","observation_id":"8c3bc0a5-fd16-4b70-8498-b92e9ec10593","resolution":{"observed_at":"2026-05-23T05:52:37.251119Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2312.16413/citation-record","integrity":"/paper/2312.16413/integrity","json":"/paper/2312.16413/citation-record.json","paper":"/paper/2312.16413"},"outbound":[],"paper":{"arxiv_id":"2312.16413","last_updated":"2023-12-27T05:11:02Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.16413."}