{"as_of":"2026-08-21T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eddf12da78224c079fd3af4cd356dfb76284c9f1852b64583988171fa0de6115","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-21T06:32:19.484+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-15T16:29:07.018840Z","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-15T16:29:07.864974Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.10387","last_updated":"2020-11-09T00:36:43Z","snapshot_observed_at":"2026-08-16T12:46:16.942013Z","submitted_at":"2019-01-29T16:53:57Z","title":"Matching is as Easy as the Decision Problem, in the NC Model","version":5},"cited_work":{"arxiv_id":"1901.10387","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.10387","snapshot_observed_at":"2026-08-15T16:29:07.864974Z","title":"Matching is as Easy as the Decision Problem, in the NC Model","venue":"cs.DS","work_id":"d74b702f-6b46-45eb-9e1d-acbf5d97fe1c","year":2019},"citing_paper":{"arxiv_id":"2509.06435","last_updated":"2025-09-09T13:28:19Z","snapshot_observed_at":"2026-08-21T09:10:10.017445Z","submitted_at":"2025-09-08T08:29:16Z","title":"Linear Matroid Intersection is in Catalytic Logspace","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:29:07.018840Z"},"links":{"cited_paper":"/paper/1901.10387","citing_paper":"/paper/2509.06435"},"observation_digest":"sha256:ec25110edae3247a28ccdebfddd21bbf807315eac2c2fbfb78dcfdfee8a5d005","observation_id":"0ebff587-5908-447e-9eca-374701650e67","resolution":{"observed_at":"2026-08-15T16:29:07.870927Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.10387/citation-record","integrity":"/paper/1901.10387/integrity","json":"/paper/1901.10387/citation-record.json","paper":"/paper/1901.10387"},"outbound":[],"paper":{"arxiv_id":"1901.10387","last_updated":"2020-11-09T00:36:43Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T12:46:16.942013Z","submitted_at":"2019-01-29T16:53:57Z","title":"Matching is as Easy as the Decision Problem, in the NC Model"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.10387."}