{"as_of":"2026-08-14T12:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2c2bfd2d82364330b56b34cc9502657bc67269a452a17477f05905ec555aba2","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-14T06:32:32.682623+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-12T16:53:52.331546Z","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-12T16:53:52.413832Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.11840","last_updated":"2020-09-24T17:38:31Z","snapshot_observed_at":"2026-08-14T09:29:47.200476Z","submitted_at":"2020-09-24T17:38:31Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","version":1},"cited_work":{"arxiv_id":"2009.11840","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11840","snapshot_observed_at":"2026-08-12T16:53:52.413832Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","venue":"cs.DS","work_id":"00af0048-d501-4404-aeeb-f07ddfc8bd82","year":2020},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.331546Z"},"links":{"cited_paper":"/paper/2009.11840","citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:5cf933d66b744061810620d01dac73c9367017c4e3b5d9d82fe142d72fd0c525","observation_id":"954ef9f0-596f-49db-adf5-d06841cd91a4","resolution":{"observed_at":"2026-08-12T16:53:52.420532Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.11840/citation-record","integrity":"/paper/2009.11840/integrity","json":"/paper/2009.11840/citation-record.json","paper":"/paper/2009.11840"},"outbound":[],"paper":{"arxiv_id":"2009.11840","last_updated":"2020-09-24T17:38:31Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T09:29:47.200476Z","submitted_at":"2020-09-24T17:38:31Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2009.11840."}