{"as_of":"2026-08-10T19:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97875318dd6016f9233a055a369b7ef8f518f41c660c294a754f5c56deaa9bc7","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:47:07.346265Z","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-11T03:40:53.729806Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.01180","last_updated":"2019-07-02T05:51:04Z","snapshot_observed_at":"2026-08-05T03:40:23.581115Z","submitted_at":"2019-07-02T05:51:04Z","title":"Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.01180","snapshot_observed_at":"2026-08-06T16:47:07.346265Z","title":"Roth, Nicholay Topin, Pooyan Jamshidi, and Manuela Veloso","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.12599","last_updated":"2025-07-16T19:41:41Z","snapshot_observed_at":"2026-08-09T17:38:39.904921Z","submitted_at":"2025-07-16T19:41:41Z","title":"A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs","version":1},"reference_index":290,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:07.346265Z"},"links":{"cited_paper":"/paper/1907.01180","citing_paper":"/paper/2507.12599"},"observation_digest":"sha256:4ddf21324e1b6d3da60edf5b93acb65991f695a70a80b1cff648c7eceaccf2cd","observation_id":"601b3df6-0e14-4db3-9ce8-19cdb4a878fa","resolution":{"observed_at":"2026-08-06T16:47:07.346265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.01180","last_updated":"2019-07-02T05:51:04Z","snapshot_observed_at":"2026-08-05T03:40:23.581115Z","submitted_at":"2019-07-02T05:51:04Z","title":"Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.01180","snapshot_observed_at":"2026-08-06T15:04:38.852237Z","title":"Conservative Q- improvement: Reinforcement learning for an interpretable decision-tree policy","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.17056","last_updated":"2025-07-22T22:34:35Z","snapshot_observed_at":"2026-08-09T05:16:12.996238Z","submitted_at":"2025-07-22T22:34:35Z","title":"Pragmatic Policy Development via Interpretable Behavior Cloning","version":1},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-06T15:04:38.852237Z"},"links":{"cited_paper":"/paper/1907.01180","citing_paper":"/paper/2507.17056"},"observation_digest":"sha256:10a137c52832206d877a3104561e546926fccd98b288bd593afada8dbfdf0d1b","observation_id":"d4132ec1-52da-45e4-ba46-67765db35e5c","resolution":{"observed_at":"2026-08-06T15:04:38.852237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.01180","last_updated":"2019-07-02T05:51:04Z","snapshot_observed_at":"2026-08-05T03:40:23.581115Z","submitted_at":"2019-07-02T05:51:04Z","title":"Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy","version":1},"cited_work":{"arxiv_id":"1907.01180","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.01180","snapshot_observed_at":"2026-07-04T23:45:51.155646Z","title":"arXiv preprint arXiv:1907.01180 , year=","venue":null,"work_id":"cc0eb5fa-510e-46ae-9e2c-1fe67151925d","year":1907},"citing_paper":{"arxiv_id":"2605.07837","last_updated":"2026-05-08T15:04:04Z","snapshot_observed_at":"2026-07-09T23:17:43.933034Z","submitted_at":"2026-05-08T15:04:04Z","title":"Approximation-Free Differentiable Oblique Decision Trees","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-11T03:39:14.908354Z"},"links":{"cited_paper":"/paper/1907.01180","citing_paper":"/paper/2605.07837"},"observation_digest":"sha256:ca49554d56740526ca0d0dca322778e0230c781b9bd5ccc7efbd4f6a3ab1fd2b","observation_id":"a7b7b0c9-7f4a-489d-93f5-2510187bc597","resolution":{"observed_at":"2026-07-04T23:45:51.155646Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.01180/citation-record","integrity":"/paper/1907.01180/integrity","json":"/paper/1907.01180/citation-record.json","paper":"/paper/1907.01180"},"outbound":[],"paper":{"arxiv_id":"1907.01180","last_updated":"2019-07-02T05:51:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T03:40:23.581115Z","submitted_at":"2019-07-02T05:51:04Z","title":"Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1907.01180."}