{"as_of":"2026-08-13T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:096c042e1bef0b43ffb793c2d374cf7b7ccdc3a59b1ee81d2f059f3ec1892363","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-13T06:32:02.005865+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-10T22:07:55.450744Z","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-11T18:16:09.803364Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.07151","last_updated":"2020-04-15T15:30:38Z","snapshot_observed_at":"2026-08-13T04:23:45.255141Z","submitted_at":"2020-04-15T15:30:38Z","title":"An algorithmic framework for colouring locally sparse graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07151","snapshot_observed_at":"2026-08-10T22:07:55.450744Z","title":"Davies, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.03379","last_updated":"2025-09-03T11:47:53Z","snapshot_observed_at":"2026-08-13T04:45:11.195809Z","submitted_at":"2025-01-06T20:41:31Z","title":"The hard-core model in graph theory","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:07:55.450744Z"},"links":{"cited_paper":"/paper/2004.07151","citing_paper":"/paper/2501.03379"},"observation_digest":"sha256:b46dee97b16df8dd5ea5a6ccde0fdab900c8162d800ad3c85b7ad2c0a562d820","observation_id":"0fd2fd2f-7442-4acb-b947-3dd068d0cfc0","resolution":{"observed_at":"2026-08-10T22:07:55.450744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07151","last_updated":"2020-04-15T15:30:38Z","snapshot_observed_at":"2026-08-13T04:23:45.255141Z","submitted_at":"2020-04-15T15:30:38Z","title":"An algorithmic framework for colouring locally sparse graphs","version":1},"cited_work":{"arxiv_id":"2004.07151","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.07151","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Davies, R","venue":null,"work_id":"e9d39259-7870-4b80-a29a-bea192faf4a4","year":2020},"citing_paper":{"arxiv_id":"2605.05149","last_updated":"2026-05-06T17:20:28Z","snapshot_observed_at":"2026-08-02T21:37:54.382502Z","submitted_at":"2026-05-06T17:20:28Z","title":"Degree-sequence bounds for independent sets via multivariate local occupancy","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T16:23:56.274462Z"},"links":{"cited_paper":"/paper/2004.07151","citing_paper":"/paper/2605.05149"},"observation_digest":"sha256:815c19ad85e76e57d9c3668fde3aad328c0e4c1eab923dbc479960b30f6c3077","observation_id":"fabee0bf-0167-4a88-9476-3cdfee54c74b","resolution":{"observed_at":"2026-05-11T18:16:09.826358Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.07151/citation-record","integrity":"/paper/2004.07151/integrity","json":"/paper/2004.07151/citation-record.json","paper":"/paper/2004.07151"},"outbound":[],"paper":{"arxiv_id":"2004.07151","last_updated":"2020-04-15T15:30:38Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T04:23:45.255141Z","submitted_at":"2020-04-15T15:30:38Z","title":"An algorithmic framework for colouring locally sparse graphs"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2004.07151."}