{"as_of":"2026-08-08T13:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92308330a06bca2f5b705e130825a5c6f5c735ec909497250b898a2f451801fd","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-08T06:32:00.761636+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-06T16:30:48.517134Z","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-06T16:30:52.789022Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11818","last_updated":"2020-03-17T18:25:36Z","snapshot_observed_at":"2026-08-08T12:58:41.847354Z","submitted_at":"2020-02-26T22:04:43Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3","version":2},"cited_work":{"arxiv_id":"2002.11818","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.11818","snapshot_observed_at":"2026-08-06T16:30:52.789022Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3","venue":"cs.CG","work_id":"8fbabc5b-b7b1-41ec-afd1-19b1b830c1fc","year":2020},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-08T02:58:57.924768Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.517134Z"},"links":{"cited_paper":"/paper/2002.11818","citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:ec97d62c292e81724f58f8ae159a1802e374192728d5c2bd98f2d08a1a1da3f5","observation_id":"925bea06-3b28-48b5-94d7-d7d233d09bd5","resolution":{"observed_at":"2026-08-06T16:30:52.837651Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.11818/citation-record","integrity":"/paper/2002.11818/integrity","json":"/paper/2002.11818/citation-record.json","paper":"/paper/2002.11818"},"outbound":[],"paper":{"arxiv_id":"2002.11818","last_updated":"2020-03-17T18:25:36Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-08T12:58:41.847354Z","submitted_at":"2020-02-26T22:04:43Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2002.11818."}