{"as_of":"2026-08-19T13:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e96e03059cbf88588b938f1c87244c7f17f203f033492d2880ba7066dcb84c13","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-19T06:32:44.657259+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-16T00:31:35.754759Z","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-10T12:20:22.473884Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13631","last_updated":"2025-02-19T11:09:35Z","snapshot_observed_at":"2026-08-19T09:15:43.396473Z","submitted_at":"2025-02-19T11:09:35Z","title":"Faster Minimization of Total Weighted Completion Time on Parallel Machines","version":1},"cited_work":{"arxiv_id":"2502.13631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13631","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast makespan minimization via short ILP s","venue":null,"work_id":"c9ab0c46-0dc1-4b32-9142-27229dda57be","year":2026},"citing_paper":{"arxiv_id":"2604.13642","last_updated":"2026-04-15T09:09:19Z","snapshot_observed_at":"2026-07-06T23:01:37.207817Z","submitted_at":"2026-04-15T09:09:19Z","title":"Lawler-Moore Speedups via Additive Combinatorics","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T12:20:02.378014Z"},"links":{"cited_paper":"/paper/2502.13631","citing_paper":"/paper/2604.13642"},"observation_digest":"sha256:b1af8cbdbe826570b23bfa642db61640cf2309bbacd0abbdb59aff82c7f76e8f","observation_id":"dd7f26dd-4c47-4625-8412-7decf0239e90","resolution":{"observed_at":"2026-05-10T12:20:22.475386Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13631","last_updated":"2025-02-19T11:09:35Z","snapshot_observed_at":"2026-08-19T09:15:43.396473Z","submitted_at":"2025-02-19T11:09:35Z","title":"Faster Minimization of Total Weighted Completion Time on Parallel Machines","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13631","snapshot_observed_at":"2026-08-16T00:31:35.754759Z","title":"Faster minimization of total weighted completion time on parallel machines","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.12224","last_updated":"2026-08-12T16:22:21Z","snapshot_observed_at":"2026-08-19T07:42:52.294838Z","submitted_at":"2026-08-12T16:22:21Z","title":"Faster Exponential Algorithms for Multi-Machine Scheduling Problems","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:31:35.754759Z"},"links":{"cited_paper":"/paper/2502.13631","citing_paper":"/paper/2608.12224"},"observation_digest":"sha256:ecac4308982c5ef4d7526a0a3f4f085adf8b9c41348c4aacd9d0bdf09561d873","observation_id":"af710169-4156-49a2-8bd8-214162943e77","resolution":{"observed_at":"2026-08-16T00:31:35.754759Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13631/citation-record","integrity":"/paper/2502.13631/integrity","json":"/paper/2502.13631/citation-record.json","paper":"/paper/2502.13631"},"outbound":[],"paper":{"arxiv_id":"2502.13631","last_updated":"2025-02-19T11:09:35Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T09:15:43.396473Z","submitted_at":"2025-02-19T11:09:35Z","title":"Faster Minimization of Total Weighted Completion Time on Parallel Machines"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.13631."}