{"as_of":"2026-08-08T16:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e6113424376fd72e84190e2375684508da036c4d0bf4aed5bc504de69d3c020","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-05T19:48:43.042093Z","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-05T19:48:50.717826Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.12739","last_updated":"2020-04-27T12:27:37Z","snapshot_observed_at":"2026-08-05T10:58:00.251628Z","submitted_at":"2020-04-27T12:27:37Z","title":"Dynamic complexity of Reachability: How many changes can we handle?","version":1},"cited_work":{"arxiv_id":"2004.12739","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.12739","snapshot_observed_at":"2026-08-05T19:48:50.717826Z","title":"Dynamic complexity of Reachability: How many changes can we handle?","venue":"cs.LO","work_id":"607c2452-dd1a-4f21-8c3e-3aab6c42376f","year":2020},"citing_paper":{"arxiv_id":"2508.11961","last_updated":"2025-08-16T07:48:36Z","snapshot_observed_at":"2026-08-05T19:48:34.676128Z","submitted_at":"2025-08-16T07:48:36Z","title":"PEdger++: Practical Edge Detection via Assembling Cross Information","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T19:48:43.042093Z"},"links":{"cited_paper":"/paper/2004.12739","citing_paper":"/paper/2508.11961"},"observation_digest":"sha256:73d279dd0faa20ac495353f6336f0c8ab191ac6b3bcd7ea2b12460733eea54d7","observation_id":"6f7f8123-0820-4b9b-8f11-a2a845bc04a7","resolution":{"observed_at":"2026-08-05T19:48:50.838467Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"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/2004.12739/citation-record","integrity":"/paper/2004.12739/integrity","json":"/paper/2004.12739/citation-record.json","paper":"/paper/2004.12739"},"outbound":[],"paper":{"arxiv_id":"2004.12739","last_updated":"2020-04-27T12:27:37Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-05T10:58:00.251628Z","submitted_at":"2020-04-27T12:27:37Z","title":"Dynamic complexity of Reachability: How many changes can we handle?"},"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:2004.12739."}