{"as_of":"2026-08-16T22:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ce0588006bd3c69368305ea4992052c633c18977b63186d872829f901486ec3","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:43:25.457909Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T21:43:26.226812Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.01741","last_updated":"2024-09-23T13:50:32Z","snapshot_observed_at":"2026-08-16T17:17:12.414136Z","submitted_at":"2022-03-03T14:33:45Z","title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","version":2},"cited_work":{"arxiv_id":"2203.01741","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.01741","snapshot_observed_at":"2026-08-10T21:43:26.226812Z","title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","venue":"cs.DS","work_id":"d968b202-1fd1-4547-adb5-b4e60cac2fe3","year":2022},"citing_paper":{"arxiv_id":"2501.04859","last_updated":"2025-01-08T22:17:28Z","snapshot_observed_at":"2026-08-16T13:53:20.566494Z","submitted_at":"2025-01-08T22:17:28Z","title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:43:25.457909Z"},"links":{"cited_paper":"/paper/2203.01741","citing_paper":"/paper/2501.04859"},"observation_digest":"sha256:db0f940397c5bcf140858f511277b6741868f19e9c8c9e4a3d1c5d98f7c0fc29","observation_id":"8b94cbc7-1ad4-41ef-8b2b-a25995d23250","resolution":{"observed_at":"2026-08-10T21:43:26.235263Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.01741/citation-record","integrity":"/paper/2203.01741/integrity","json":"/paper/2203.01741/citation-record.json","paper":"/paper/2203.01741"},"outbound":[],"paper":{"arxiv_id":"2203.01741","last_updated":"2024-09-23T13:50:32Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T17:17:12.414136Z","submitted_at":"2022-03-03T14:33:45Z","title":"Structural Results for High-Multiplicity Scheduling on Uniform 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2203.01741."}