{"as_of":"2026-08-20T19:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45a6fe9663741264301c2c89208e8432a5c654adff8f05cd17181d736059a7a4","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:32:45.150684Z","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-10T07:21:55.169299Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14956","snapshot_observed_at":"2026-08-11T13:32:45.150684Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13053","last_updated":"2024-12-17T16:15:04Z","snapshot_observed_at":"2026-08-12T04:27:13.118081Z","submitted_at":"2024-12-17T16:15:04Z","title":"SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T13:32:45.150684Z"},"links":{"cited_paper":"/paper/2405.14956","citing_paper":"/paper/2412.13053"},"observation_digest":"sha256:e0b2b6c0a64b7591a8b39f20af20d8f881e87e7bdf4acbd9ef8fd9594f17e77e","observation_id":"cec939f8-62dc-45ad-8e6b-bf0c0563917d","resolution":{"observed_at":"2026-08-11T13:32:45.150684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14956","snapshot_observed_at":"2026-08-10T19:30:54.408504Z","title":"Preprint arXiv:2405.14956 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10126","last_updated":"2025-05-22T12:48:23Z","snapshot_observed_at":"2026-08-20T11:54:01.388291Z","submitted_at":"2025-01-17T11:30:31Z","title":"Small Decision Trees for MDPs with Deductive Synthesis","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:30:54.408504Z"},"links":{"cited_paper":"/paper/2405.14956","citing_paper":"/paper/2501.10126"},"observation_digest":"sha256:b5db0b7a64234350e6aa0530d436f4d1d02f68ae753df083c8c5449535557e2a","observation_id":"c0c0ad0b-248b-4083-badb-719320ba596e","resolution":{"observed_at":"2026-08-10T19:30:54.408504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14956","snapshot_observed_at":"2026-08-06T16:47:07.096224Z","title":"Interpretable and editable programmatic tree policies for reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12599","last_updated":"2025-07-16T19:41:41Z","snapshot_observed_at":"2026-08-14T20:39:32.495663Z","submitted_at":"2025-07-16T19:41:41Z","title":"A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs","version":1},"reference_index":201,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:07.096224Z"},"links":{"cited_paper":"/paper/2405.14956","citing_paper":"/paper/2507.12599"},"observation_digest":"sha256:b84c6f2e1ba7bb06ec1378cfcad9df8c701eb5ccf7d500252ff0e9d011441e9b","observation_id":"3a3cfdfb-0c0a-463c-b835-9d4984537d60","resolution":{"observed_at":"2026-08-06T16:47:07.096224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2405.14956","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.14956","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Interpretable and editable programmatic tree policies for reinforcement learning","venue":null,"work_id":"75e82a90-a275-43ef-b8e1-82e31da8c288","year":2024},"citing_paper":{"arxiv_id":"2604.16871","last_updated":"2026-04-18T06:41:59Z","snapshot_observed_at":"2026-08-14T15:11:41.140640Z","submitted_at":"2026-04-18T06:41:59Z","title":"GRAIL: Autonomous Concept Grounding for Neuro-Symbolic Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T07:20:32.282630Z"},"links":{"cited_paper":"/paper/2405.14956","citing_paper":"/paper/2604.16871"},"observation_digest":"sha256:e10104a008029fc6892c1b3adcd3385e878a7abcca8805fb9f8fd74db9560a11","observation_id":"84bdf642-30d4-4603-8c62-7f3c4d97b89f","resolution":{"observed_at":"2026-05-10T07:21:55.170675Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14956","snapshot_observed_at":"2026-08-01T23:25:56.343456Z","title":"Interpretable and editable programmatic tree policies for reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15459","last_updated":"2026-07-20T09:36:34Z","snapshot_observed_at":"2026-08-19T09:55:20.102983Z","submitted_at":"2026-07-16T21:10:27Z","title":"From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T23:25:56.343456Z"},"links":{"cited_paper":"/paper/2405.14956","citing_paper":"/paper/2607.15459"},"observation_digest":"sha256:3c95aa413bb197d9da1865e49ba7b2d9f949d05e4fb6a82e46a8f6d6cbb09395","observation_id":"e8e864a3-c648-421f-bc60-c0a6106f6ec5","resolution":{"observed_at":"2026-08-01T23:25:56.343456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.14956/citation-record","integrity":"/paper/2405.14956/integrity","json":"/paper/2405.14956/citation-record.json","paper":"/paper/2405.14956"},"outbound":[],"paper":{"arxiv_id":"2405.14956","last_updated":"2024-05-23T18:07:38Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T13:50:02.349530Z","submitted_at":"2024-05-23T18:07:38Z","title":"Interpretable and Editable Programmatic Tree Policies 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.14956."}