{"as_of":"2026-08-05T22:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e677c1af2449bdc63f872ed3555143b942a6d9f1f9a3f6598c653a783db6280","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-05T06:32:48.257954+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-05-16T01:55:53.584473Z","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-16T01:57:06.070959Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.03380","last_updated":"2023-08-28T05:47:12Z","snapshot_observed_at":"2026-07-06T15:51:20.400240Z","submitted_at":"2023-07-07T04:20:36Z","title":"On Formal Feature Attribution and Its Approximation","version":3},"cited_work":{"arxiv_id":"2307.03380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.03380","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"accept” s.t. κ is the DFA applied to w. Similarly CXpu l (S, w) is a CXp iff S is a CXp of the classification problem κ(w) =“accept","venue":null,"work_id":"ffb46fbb-787e-4038-88c2-fe5477900ade","year":2023},"citing_paper":{"arxiv_id":"2602.13351","last_updated":"2026-02-17T03:19:21Z","snapshot_observed_at":"2026-07-06T22:45:49.118915Z","submitted_at":"2026-02-12T23:58:56Z","title":"A Formal Framework for the Explanation of Finite Automata Decisions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-16T01:55:53.584473Z"},"links":{"cited_paper":"/paper/2307.03380","citing_paper":"/paper/2602.13351"},"observation_digest":"sha256:391a35a1a90bb5a459f850242d8bf685f24ee9c245fcf57f744c032b3ba57c2b","observation_id":"a12999dc-800f-4b8a-9160-beae2ab28fc6","resolution":{"observed_at":"2026-05-16T01:57:06.075831Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.03380/citation-record","integrity":"/paper/2307.03380/integrity","json":"/paper/2307.03380/citation-record.json","paper":"/paper/2307.03380"},"outbound":[],"paper":{"arxiv_id":"2307.03380","last_updated":"2023-08-28T05:47:12Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T15:51:20.400240Z","submitted_at":"2023-07-07T04:20:36Z","title":"On Formal Feature Attribution and Its Approximation"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2307.03380."}