{"as_of":"2026-08-09T22:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8fbfdb47b00ca61c91853fa84a22f0be96a1d2fe6df1cff8fefe033449e0886","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-09T04:59:50.573327Z","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-06-30T08:24:26.425433Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.08025","last_updated":"2025-04-01T14:16:47Z","snapshot_observed_at":"2026-07-06T19:31:13.821669Z","submitted_at":"2024-10-10T15:22:48Z","title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08025","snapshot_observed_at":"2026-08-09T04:59:50.573327Z","title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03391","last_updated":"2025-03-02T17:32:48Z","snapshot_observed_at":"2026-08-09T16:58:15.678871Z","submitted_at":"2025-02-05T17:29:12Z","title":"Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:50.573327Z"},"links":{"cited_paper":"/paper/2410.08025","citing_paper":"/paper/2502.03391"},"observation_digest":"sha256:dd55fd7b60055e501f5865a97db077f934b1b794291a622488240e5b6c009d77","observation_id":"d24f79fe-3978-4be5-8724-e0b428a1608f","resolution":{"observed_at":"2026-08-09T04:59:50.573327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08025","last_updated":"2025-04-01T14:16:47Z","snapshot_observed_at":"2026-07-06T19:31:13.821669Z","submitted_at":"2024-10-10T15:22:48Z","title":"The Computational Complexity of Circuit Discovery for Inner Interpretability","version":3},"cited_work":{"arxiv_id":"2410.08025","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.08025","snapshot_observed_at":"2026-06-30T08:24:26.425433Z","title":"arXiv preprint arXiv:2410.08025v3 , year=","venue":null,"work_id":"714062cf-d1a4-4db4-a6c9-cb949864c67e","year":null},"citing_paper":{"arxiv_id":"2606.29346","last_updated":"2026-06-28T11:29:15Z","snapshot_observed_at":"2026-08-06T15:56:57.654202Z","submitted_at":"2026-06-28T11:29:15Z","title":"Reliability, Faithfulness, and the Limits of Post-hoc Explanations of Opaque Scientific Models","version":1},"reference_index":147,"source":"arxiv_source","source_observed_at":"2026-06-30T08:20:23.645840Z"},"links":{"cited_paper":"/paper/2410.08025","citing_paper":"/paper/2606.29346"},"observation_digest":"sha256:9ae9e80ecea8a753697fdbb234e406865e7e2167c7b058eb47491d1c9c62b771","observation_id":"edd2d276-aeaf-4e1f-a1fb-aa437d2f821d","resolution":{"observed_at":"2026-06-30T08:24:26.427482Z","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/2410.08025/citation-record","integrity":"/paper/2410.08025/integrity","json":"/paper/2410.08025/citation-record.json","paper":"/paper/2410.08025"},"outbound":[],"paper":{"arxiv_id":"2410.08025","last_updated":"2025-04-01T14:16:47Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T19:31:13.821669Z","submitted_at":"2024-10-10T15:22:48Z","title":"The Computational Complexity of Circuit Discovery for Inner Interpretability"},"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:2410.08025."}