{"as_of":"2026-08-20T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:220e9da1fef7270f977f611dd10c880c8038b0c3ac1a096398e805b22330967f","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-20T06:33:59.587034+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-08-11T11:24:46.082731Z","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-07T04:59:18.383419Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.03186","last_updated":"2023-06-05T18:56:48Z","snapshot_observed_at":"2026-08-18T17:16:05.132363Z","submitted_at":"2023-06-05T18:56:48Z","title":"Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03186","snapshot_observed_at":"2026-08-11T11:24:46.082731Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15517","last_updated":"2024-12-20T03:09:18Z","snapshot_observed_at":"2026-08-14T18:48:57.881854Z","submitted_at":"2024-12-20T03:09:18Z","title":"Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T11:24:46.082731Z"},"links":{"cited_paper":"/paper/2306.03186","citing_paper":"/paper/2412.15517"},"observation_digest":"sha256:75d5460d456343c3150a3b3e610f463a5f796c3ff689465bff440a83cf38554b","observation_id":"178a22d7-f949-4f45-b2f3-34ac4c0b3e90","resolution":{"observed_at":"2026-08-11T11:24:46.082731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03186","last_updated":"2023-06-05T18:56:48Z","snapshot_observed_at":"2026-08-18T17:16:05.132363Z","submitted_at":"2023-06-05T18:56:48Z","title":"Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2306.03186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.03186","snapshot_observed_at":"2026-08-07T04:59:18.383419Z","title":"Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learning","venue":"cs.LG","work_id":"2b61012e-7b8a-43fe-9e11-5f87d24e37c0","year":2023},"citing_paper":{"arxiv_id":"2506.09270","last_updated":"2025-06-10T22:07:13Z","snapshot_observed_at":"2026-08-16T19:04:25.859116Z","submitted_at":"2025-06-10T22:07:13Z","title":"Uncertainty Prioritized Experience Replay","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T04:59:09.924917Z"},"links":{"cited_paper":"/paper/2306.03186","citing_paper":"/paper/2506.09270"},"observation_digest":"sha256:9c5d5741f1d5db4e151f49fc1942aaf03f0d9cba2f45d080479baa7697c53dab","observation_id":"2a17d01a-be66-4f75-bde9-57049b616361","resolution":{"observed_at":"2026-08-07T04:59:18.436575Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.03186/citation-record","integrity":"/paper/2306.03186/integrity","json":"/paper/2306.03186/citation-record.json","paper":"/paper/2306.03186"},"outbound":[],"paper":{"arxiv_id":"2306.03186","last_updated":"2023-06-05T18:56:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T17:16:05.132363Z","submitted_at":"2023-06-05T18:56:48Z","title":"Flipping Coins to Estimate Pseudocounts for Exploration in 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.03186."}