{"as_of":"2026-08-08T15:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c503f0edfcb7b0c4c476d3ae4c18b2c51439addec418916df4909cd032418ebc","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-08T06:32:00.761636+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-06T20:31:07.811010Z","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-06T20:31:08.352916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.18443","last_updated":"2023-05-29T03:25:22Z","snapshot_observed_at":"2026-07-06T15:34:59.457879Z","submitted_at":"2023-05-29T03:25:22Z","title":"Off-Policy RL Algorithms Can be Sample-Efficient for Continuous Control via Sample Multiple Reuse","version":1},"cited_work":{"arxiv_id":"2305.18443","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18443","snapshot_observed_at":"2026-08-06T20:31:08.352916Z","title":"Off-Policy RL Algorithms Can be Sample-Efficient for Continuous Control via Sample Multiple Reuse","venue":"cs.LG","work_id":"f5c2fdc6-8bb9-4a98-8cc0-9bb0605f356a","year":2023},"citing_paper":{"arxiv_id":"2507.02712","last_updated":"2025-07-03T15:26:48Z","snapshot_observed_at":"2026-08-06T20:20:16.400675Z","submitted_at":"2025-07-03T15:26:48Z","title":"A Forget-and-Grow Strategy for Deep Reinforcement Learning Scaling in Continuous Control","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T20:31:07.811010Z"},"links":{"cited_paper":"/paper/2305.18443","citing_paper":"/paper/2507.02712"},"observation_digest":"sha256:b760a65d57100ae7ac1084df905fe06d3aa00a95ce14bb25d2f6091f6f6413f2","observation_id":"21ad5a78-4195-4b9f-81e7-a00887f5abe9","resolution":{"observed_at":"2026-08-06T20:31:08.356162Z","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/2305.18443/citation-record","integrity":"/paper/2305.18443/integrity","json":"/paper/2305.18443/citation-record.json","paper":"/paper/2305.18443"},"outbound":[],"paper":{"arxiv_id":"2305.18443","last_updated":"2023-05-29T03:25:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:34:59.457879Z","submitted_at":"2023-05-29T03:25:22Z","title":"Off-Policy RL Algorithms Can be Sample-Efficient for Continuous Control via Sample Multiple Reuse"},"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 1 inbound Pith citation observation for arXiv:2305.18443."}