{"as_of":"2026-08-19T08:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a3bb03a790d5f7607aae43471b440c58d9585a795d90b0b03036dd68a8ec81b","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-19T06:32:44.657259+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-15T23:48:59.832639Z","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-15T23:49:00.064642Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.01350","last_updated":"2021-06-03T08:15:16Z","snapshot_observed_at":"2026-08-16T18:20:11.364535Z","submitted_at":"2021-06-02T17:55:41Z","title":"On Efficiently Explaining Graph-Based Classifiers","version":2},"cited_work":{"arxiv_id":"2106.01350","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.01350","snapshot_observed_at":"2026-08-15T23:49:00.064642Z","title":"On Efficiently Explaining Graph-Based Classifiers","venue":"cs.AI","work_id":"636eda78-6bc4-413b-b25e-8962701a7810","year":2021},"citing_paper":{"arxiv_id":"2505.09640","last_updated":"2025-05-06T21:41:07Z","snapshot_observed_at":"2026-08-18T07:54:26.327907Z","submitted_at":"2025-05-06T21:41:07Z","title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:48:59.832639Z"},"links":{"cited_paper":"/paper/2106.01350","citing_paper":"/paper/2505.09640"},"observation_digest":"sha256:49e0059a079ed07a4d70f6be8eb5ffad9f7959165522f57e3d0b36216eda96ce","observation_id":"f2982344-5420-4261-bf41-6a52ad73330b","resolution":{"observed_at":"2026-08-15T23:49:00.072301Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.01350/citation-record","integrity":"/paper/2106.01350/integrity","json":"/paper/2106.01350/citation-record.json","paper":"/paper/2106.01350"},"outbound":[],"paper":{"arxiv_id":"2106.01350","last_updated":"2021-06-03T08:15:16Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T18:20:11.364535Z","submitted_at":"2021-06-02T17:55:41Z","title":"On Efficiently Explaining Graph-Based Classifiers"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.01350."}