{"as_of":"2026-08-08T18:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f29dbf132ee6028fc165f9dfeb202bb022a31ced97fb1f3160ee647d7bb8a20a","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:10:40.237902Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":98,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.02477","last_updated":"2019-04-10T09:09:46Z","snapshot_observed_at":"2026-07-06T06:32:12.791177Z","submitted_at":"2018-04-06T22:17:18Z","title":"Programmatically Interpretable Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.02477","snapshot_observed_at":"2026-08-07T12:10:40.237902Z","title":"In: Proceedings of the 35th International Conference on Machine Learning, pp","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.00328","last_updated":"2025-06-11T06:03:44Z","snapshot_observed_at":"2026-08-07T12:05:14.980727Z","submitted_at":"2025-05-31T00:47:24Z","title":"BASIL: Best-Action Symbolic Interpretable Learning for Evolving Compact RL Policies","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:10:40.237902Z"},"links":{"cited_paper":"/paper/1804.02477","citing_paper":"/paper/2506.00328"},"observation_digest":"sha256:8786b4981259810827d688557c4de349a687dac51f07fa01dfd510ec591011e7","observation_id":"85e96d88-dea6-4d59-a2b1-967616435cbb","resolution":{"observed_at":"2026-08-07T12:10:40.237902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.02477","last_updated":"2019-04-10T09:09:46Z","snapshot_observed_at":"2026-07-06T06:32:12.791177Z","submitted_at":"2018-04-06T22:17:18Z","title":"Programmatically Interpretable Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.02477","snapshot_observed_at":"2026-08-06T18:36:43.074284Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07848","last_updated":"2025-07-29T08:20:12Z","snapshot_observed_at":"2026-08-07T09:41:56.231425Z","submitted_at":"2025-07-10T15:27:44Z","title":"\"So, Tell Me About Your Policy...\": Distillation of interpretable policies from Deep Reinforcement Learning agents","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:36:43.074284Z"},"links":{"cited_paper":"/paper/1804.02477","citing_paper":"/paper/2507.07848"},"observation_digest":"sha256:c6a8d775833bb1ebb4310bad28c0ed6b0280f3309d17b90aa17a8cd155e61688","observation_id":"87dc3488-3b3b-4306-bec0-a90966db9e2b","resolution":{"observed_at":"2026-08-06T18:36:43.074284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.02477","last_updated":"2019-04-10T09:09:46Z","snapshot_observed_at":"2026-07-06T06:32:12.791177Z","submitted_at":"2018-04-06T22:17:18Z","title":"Programmatically Interpretable Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1804.02477","doi":"10.48550/arxiv.1804.02477","metadata_source":"pith","pith_arxiv_id":"1804.02477","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Programmatically Interpretable Reinforcement Learning","venue":"cs.LG","work_id":"3d1f3cf5-a4d0-440b-bff7-754ecad81b03","year":2018},"citing_paper":{"arxiv_id":"2605.12809","last_updated":"2026-05-12T23:01:29Z","snapshot_observed_at":"2026-07-06T23:24:27.821980Z","submitted_at":"2026-05-12T23:01:29Z","title":"Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces","version":1},"reference_index":114,"source":"arxiv_source","source_observed_at":"2026-05-14T20:17:01.224864Z"},"links":{"cited_paper":"/paper/1804.02477","citing_paper":"/paper/2605.12809"},"observation_digest":"sha256:c5bdfc428868303d0b43c473ebb4d02aae9ea07a8f614a1e6c247e7d7cd38a8e","observation_id":"e11c99fe-b15d-4bfc-8bf6-f8723af271ef","resolution":{"observed_at":"2026-05-14T20:17:54.496480Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1804.02477","last_updated":"2019-04-10T09:09:46Z","snapshot_observed_at":"2026-07-06T06:32:12.791177Z","submitted_at":"2018-04-06T22:17:18Z","title":"Programmatically Interpretable Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1804.02477","doi":"10.48550/arxiv.1804.02477","metadata_source":"pith","pith_arxiv_id":"1804.02477","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Programmatically Interpretable Reinforcement Learning","venue":"cs.LG","work_id":"3d1f3cf5-a4d0-440b-bff7-754ecad81b03","year":2018},"citing_paper":{"arxiv_id":"2606.04812","last_updated":"2026-06-05T04:02:34Z","snapshot_observed_at":"2026-08-02T06:51:34.868321Z","submitted_at":"2026-06-03T12:36:43Z","title":"Scenario Generation for Risk-Aware Reinforcement Learning with Probably Approximately Safe Guarantees","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T07:07:30.760507Z"},"links":{"cited_paper":"/paper/1804.02477","citing_paper":"/paper/2606.04812"},"observation_digest":"sha256:5b5100f19a9b1645d5168c61c80760f1c78d5f3f8f8ed1f571cd8b423ea2514d","observation_id":"20dae1d8-7b08-4abd-aff3-2a78b4e45c71","resolution":{"observed_at":"2026-07-02T07:06:44.592210Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1804.02477/citation-record","integrity":"/paper/1804.02477/integrity","json":"/paper/1804.02477/citation-record.json","paper":"/paper/1804.02477"},"outbound":[],"paper":{"arxiv_id":"1804.02477","last_updated":"2019-04-10T09:09:46Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T06:32:12.791177Z","submitted_at":"2018-04-06T22:17:18Z","title":"Programmatically Interpretable 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 4 inbound Pith citation observations for arXiv:1804.02477."}