{"as_of":"2026-08-09T01:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17bfbf5c1b2cf5619e1b1ec21becbb188f0471da822f5d7a68fe7392e7970dde","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-08T06:32:00.761636+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-07-31T08:17:05.885673Z","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-28T19:32:35.101505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.11632","last_updated":"2024-08-21T14:04:00Z","snapshot_observed_at":"2026-07-06T19:04:00.888268Z","submitted_at":"2024-08-21T14:04:00Z","title":"Optimizing Interpretable Decision Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2408.11632","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.11632","snapshot_observed_at":"2026-06-28T19:32:35.101505Z","title":"arXiv preprint arXiv:2408.11632 (2024)","venue":null,"work_id":"cef9ca67-4ea2-4893-a3a2-47742d5a8aec","year":2024},"citing_paper":{"arxiv_id":"2606.00561","last_updated":"2026-05-30T06:32:55Z","snapshot_observed_at":"2026-08-08T17:20:13.260793Z","submitted_at":"2026-05-30T06:32:55Z","title":"Interpretable Policy Distillation for Power Grid Topology Control","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T19:24:38.237381Z"},"links":{"cited_paper":"/paper/2408.11632","citing_paper":"/paper/2606.00561"},"observation_digest":"sha256:5816502870df04a47466b4a1d14e5e0e064133bcde97084a58209a62149f9fee","observation_id":"94e6766c-7330-48a4-8dbb-d970210c4b1b","resolution":{"observed_at":"2026-06-28T19:32:35.102952Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11632","last_updated":"2024-08-21T14:04:00Z","snapshot_observed_at":"2026-07-06T19:04:00.888268Z","submitted_at":"2024-08-21T14:04:00Z","title":"Optimizing Interpretable Decision Tree Policies for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11632","snapshot_observed_at":"2026-07-31T08:17:05.885673Z","title":"V os and S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24672","last_updated":"2026-07-27T17:14:42Z","snapshot_observed_at":"2026-08-08T05:23:36.589882Z","submitted_at":"2026-07-27T17:14:42Z","title":"Explainable Reinforcement Learning via Physics-Aware Policy Distillation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T08:17:05.885673Z"},"links":{"cited_paper":"/paper/2408.11632","citing_paper":"/paper/2607.24672"},"observation_digest":"sha256:fe317f10fabeeea0c80a7ee3a99c0f4b991f6a265a84ff3811fe0d3fda19d0dd","observation_id":"d44322c7-57fc-4867-b6bf-544eadecab10","resolution":{"observed_at":"2026-07-31T08:17:05.885673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.11632/citation-record","integrity":"/paper/2408.11632/integrity","json":"/paper/2408.11632/citation-record.json","paper":"/paper/2408.11632"},"outbound":[],"paper":{"arxiv_id":"2408.11632","last_updated":"2024-08-21T14:04:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:04:00.888268Z","submitted_at":"2024-08-21T14:04:00Z","title":"Optimizing Interpretable Decision 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:2408.11632."}