{"as_of":"2026-08-18T17:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14bc8f533d9dc7fa3e31cc690382ff1bdc0b548d1519be0969de1dcb858e211b","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-18T06:34:40.430872+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-12T18:35:59.722299Z","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-12T18:35:59.876718Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.03771","last_updated":"2022-04-07T23:00:39Z","snapshot_observed_at":"2026-08-17T23:24:58.389104Z","submitted_at":"2022-04-07T23:00:39Z","title":"Q-learning with online random forests","version":1},"cited_work":{"arxiv_id":"2204.03771","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.03771","snapshot_observed_at":"2026-08-12T18:35:59.876718Z","title":"Q-learning with online random forests","venue":"stat.ML","work_id":"4f60ee94-e650-4ff3-88b1-cb7a42954729","year":2022},"citing_paper":{"arxiv_id":"2411.11457","last_updated":"2024-11-18T10:44:20Z","snapshot_observed_at":"2026-08-17T09:25:13.586799Z","submitted_at":"2024-11-18T10:44:20Z","title":"Upside-Down Reinforcement Learning for More Interpretable Optimal Control","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T18:35:59.722299Z"},"links":{"cited_paper":"/paper/2204.03771","citing_paper":"/paper/2411.11457"},"observation_digest":"sha256:03f7fa2cb5a1fd7fa3104b010ae178fd1b0f09359b2a10ad339e804a2a73d3ef","observation_id":"1a1af645-6662-47f5-99ce-265f2350f2bd","resolution":{"observed_at":"2026-08-12T18:35:59.882991Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.03771/citation-record","integrity":"/paper/2204.03771/integrity","json":"/paper/2204.03771/citation-record.json","paper":"/paper/2204.03771"},"outbound":[],"paper":{"arxiv_id":"2204.03771","last_updated":"2022-04-07T23:00:39Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-17T23:24:58.389104Z","submitted_at":"2022-04-07T23:00:39Z","title":"Q-learning with online random forests"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2204.03771."}