{"as_of":"2026-08-09T15:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c1fbba9cd583b5859aef2ecc65b1a0ccff26213777edb3b1270d5ba444cef1a","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-09T06:31:02.800959+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-06T18:10:14.817996Z","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-11T17:46:13.518198Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.12533","last_updated":"2022-02-25T07:48:32Z","snapshot_observed_at":"2026-07-06T12:41:33.489597Z","submitted_at":"2022-02-25T07:48:32Z","title":"Improved Dual Correlation Reduction Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.12533","snapshot_observed_at":"2026-08-06T18:10:14.817996Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.10595","last_updated":"2025-08-05T09:10:42Z","snapshot_observed_at":"2026-08-06T18:01:01.550579Z","submitted_at":"2025-07-12T03:33:19Z","title":"Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:14.817996Z"},"links":{"cited_paper":"/paper/2202.12533","citing_paper":"/paper/2507.10595"},"observation_digest":"sha256:38e927178e2e1ae1f637e8811f976b772d232bb051af75d66eb92469dfafebad","observation_id":"3578ff77-1ac7-497d-aa33-46f4eb72a857","resolution":{"observed_at":"2026-08-06T18:10:14.817996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.12533","last_updated":"2022-02-25T07:48:32Z","snapshot_observed_at":"2026-07-06T12:41:33.489597Z","submitted_at":"2022-02-25T07:48:32Z","title":"Improved Dual Correlation Reduction Network","version":1},"cited_work":{"arxiv_id":"2202.12533","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.12533","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2202.12533 , year=","venue":null,"work_id":"06651967-5cef-4ca4-a43f-2078179e65ca","year":null},"citing_paper":{"arxiv_id":"2605.05476","last_updated":"2026-05-06T21:53:49Z","snapshot_observed_at":"2026-07-06T23:18:07.750358Z","submitted_at":"2026-05-06T21:53:49Z","title":"A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks","version":1},"reference_index":153,"source":"arxiv_source","source_observed_at":"2026-05-08T17:08:49.668765Z"},"links":{"cited_paper":"/paper/2202.12533","citing_paper":"/paper/2605.05476"},"observation_digest":"sha256:62989836e5ae76e69e3e5e9982d58887e2adc61402baf0dd1b38850661a6ef6e","observation_id":"7bc2c77e-ca24-4877-a400-0c5b07f0cc63","resolution":{"observed_at":"2026-05-11T17:46:13.520227Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.12533/citation-record","integrity":"/paper/2202.12533/integrity","json":"/paper/2202.12533/citation-record.json","paper":"/paper/2202.12533"},"outbound":[],"paper":{"arxiv_id":"2202.12533","last_updated":"2022-02-25T07:48:32Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-07-06T12:41:33.489597Z","submitted_at":"2022-02-25T07:48:32Z","title":"Improved Dual Correlation Reduction Network"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2202.12533."}