{"as_of":"2026-08-08T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91b381d745779af50068cc516b872fa92df537d88647d368e75e4f0fc86bf5cb","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-08T06:32:00.761636+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-07T19:33:43.838988Z","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-07T19:33:44.332794Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.12497","last_updated":"2024-01-23T05:43:15Z","snapshot_observed_at":"2026-08-04T23:46:22.508036Z","submitted_at":"2024-01-23T05:43:15Z","title":"Building Minimal and Reusable Causal State Abstractions for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2401.12497","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.12497","snapshot_observed_at":"2026-08-07T19:33:44.332794Z","title":"Building Minimal and Reusable Causal State Abstractions for Reinforcement Learning","venue":"cs.AI","work_id":"161fd13c-6013-4624-9878-24d42811d3b6","year":2024},"citing_paper":{"arxiv_id":"2502.10097","last_updated":"2025-02-14T11:44:17Z","snapshot_observed_at":"2026-08-08T07:32:34.314640Z","submitted_at":"2025-02-14T11:44:17Z","title":"Causal Information Prioritization for Efficient Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T19:33:43.838988Z"},"links":{"cited_paper":"/paper/2401.12497","citing_paper":"/paper/2502.10097"},"observation_digest":"sha256:ebc3a2c989730c7f6ec3b4f46fbc9b4ff1bacd284e838af4697413bfa79f857a","observation_id":"469e464c-8623-44d2-851a-e9bb8bd78aec","resolution":{"observed_at":"2026-08-07T19:33:44.340968Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.12497/citation-record","integrity":"/paper/2401.12497/integrity","json":"/paper/2401.12497/citation-record.json","paper":"/paper/2401.12497"},"outbound":[],"paper":{"arxiv_id":"2401.12497","last_updated":"2024-01-23T05:43:15Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-04T23:46:22.508036Z","submitted_at":"2024-01-23T05:43:15Z","title":"Building Minimal and Reusable Causal State Abstractions for Reinforcement Learning"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2401.12497."}