{"as_of":"2026-08-14T18:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c05e9ed674e29915da17f9614cde102c3321e2454b1a1a73e4a8ce274998364c","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:24:46.194807Z","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-18T11:51:20.168569Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09750","snapshot_observed_at":"2026-08-11T11:24:46.194807Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15517","last_updated":"2024-12-20T03:09:18Z","snapshot_observed_at":"2026-08-12T01:00:53.196211Z","submitted_at":"2024-12-20T03:09:18Z","title":"Novelty-Guided Data Reuse for Efficient and Diversified Multi-Agent Reinforcement Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T11:24:46.194807Z"},"links":{"cited_paper":"/paper/2401.09750","citing_paper":"/paper/2412.15517"},"observation_digest":"sha256:4b74b9c1f9bef6da4861d03c97e508e135ecdd00a05b86187d59999faad2c6a6","observation_id":"8f552d30-c97f-4eb1-94de-9a26bdbfc608","resolution":{"observed_at":"2026-08-11T11:24:46.194807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09750","snapshot_observed_at":"2026-08-06T20:38:35.625180Z","title":"Exploration and anti-exploration with distributional random network distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02356","last_updated":"2025-07-03T06:41:03Z","snapshot_observed_at":"2026-08-14T13:08:53.477930Z","submitted_at":"2025-07-03T06:41:03Z","title":"Offline Reinforcement Learning with Penalized Action Noise Injection","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T20:38:35.625180Z"},"links":{"cited_paper":"/paper/2401.09750","citing_paper":"/paper/2507.02356"},"observation_digest":"sha256:484674cd3fd4054d2bb6c20ffb80ddee392b671dc0f17fe0a7dbd56be0cc874f","observation_id":"993d3e30-6b2c-4ac3-b75d-ea23486c921c","resolution":{"observed_at":"2026-08-06T20:38:35.625180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09750","snapshot_observed_at":"2026-08-06T15:42:03.316515Z","title":"Exploration and anti-exploration with distributional random network distillation.arXiv preprint arXiv:2401.09750,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.15287","last_updated":"2025-07-21T06:38:46Z","snapshot_observed_at":"2026-08-07T20:50:35.708825Z","submitted_at":"2025-07-21T06:38:46Z","title":"Mixture of Autoencoder Experts Guidance using Unlabeled and Incomplete Data for Exploration in Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:03.316515Z"},"links":{"cited_paper":"/paper/2401.09750","citing_paper":"/paper/2507.15287"},"observation_digest":"sha256:2b4b9bc266d17aa017fc2c78a8463f058382becca8c47e5f094efc652d0648cb","observation_id":"73993afe-7cd8-40dd-8d48-f2bc7bafdf6a","resolution":{"observed_at":"2026-08-06T15:42:03.316515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation","version":4},"cited_work":{"arxiv_id":"2401.09750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.09750","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploration and anti-exploration with distributional random network distillation.arXiv preprint arXiv:2401.09750","venue":null,"work_id":"a2dffb4c-0de7-4319-b9ff-db71d3a7865b","year":null},"citing_paper":{"arxiv_id":"2509.25438","last_updated":"2026-04-03T16:34:50Z","snapshot_observed_at":"2026-08-13T08:27:13.793339Z","submitted_at":"2025-09-29T19:43:44Z","title":"Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoring","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T11:50:46.257332Z"},"links":{"cited_paper":"/paper/2401.09750","citing_paper":"/paper/2509.25438"},"observation_digest":"sha256:d4af4548e8b0e6ebace289220a7688d8b2033d753fc7e1a22b7ff916ba316ebc","observation_id":"fd8018ef-90aa-4245-8426-0573690ce471","resolution":{"observed_at":"2026-05-18T11:51:20.172000Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09750","snapshot_observed_at":"2026-08-01T16:35:03.014320Z","title":"arXiv preprint arXiv:2401.09750 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17981","last_updated":"2026-07-20T14:15:03Z","snapshot_observed_at":"2026-08-07T06:41:03.058424Z","submitted_at":"2026-07-20T14:15:03Z","title":"Information-Based Exploration via Random Features for Reinforcement Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T16:35:03.014320Z"},"links":{"cited_paper":"/paper/2401.09750","citing_paper":"/paper/2607.17981"},"observation_digest":"sha256:ad6cd60890d45e9e259f94cbaf30c8a117bb74e4925ec20647eb54130938e1ce","observation_id":"cce06467-27f8-4fea-b403-c81ef45a05e7","resolution":{"observed_at":"2026-08-01T16:35:03.014320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.09750/citation-record","integrity":"/paper/2401.09750/integrity","json":"/paper/2401.09750/citation-record.json","paper":"/paper/2401.09750"},"outbound":[],"paper":{"arxiv_id":"2401.09750","last_updated":"2024-05-20T02:12:21Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:40:08.732985Z","submitted_at":"2024-01-18T06:32:53Z","title":"Exploration and Anti-Exploration with Distributional Random Network Distillation"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2401.09750."}