{"as_of":"2026-08-08T15:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6903fbe4f1f00357bea6761d0f73fc45d5f269b586edc9bdee67b151f69eb2bf","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-08T06:32:00.761636+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-07T15:18:52.713790Z","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-07-04T15:29:55.594907Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.09281","last_updated":"2019-11-11T14:18:31Z","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09281","snapshot_observed_at":"2026-08-07T15:18:52.713790Z","title":"Dealing with sparse rewards in reinforcement learning.arXiv preprint arXiv:1910.09281,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.15791","last_updated":"2025-06-02T17:53:20Z","snapshot_observed_at":"2026-08-08T04:54:33.756332Z","submitted_at":"2025-05-21T17:44:37Z","title":"VARD: Efficient and Dense Fine-Tuning for Diffusion Models with Value-based RL","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:52.713790Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2505.15791"},"observation_digest":"sha256:1c891ff59b947567a1226b6d27d7ec77143bb6edaaf8af8b85b7b3625b9b6faa","observation_id":"3dcc38c7-143c-4d6c-9845-a260871e95c9","resolution":{"observed_at":"2026-08-07T15:18:52.713790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09281","last_updated":"2019-11-11T14:18:31Z","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09281","snapshot_observed_at":"2026-08-07T14:02:49.225204Z","title":"Dealing with sparse rewards in reinforcement learning","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.20417","last_updated":"2025-05-26T18:06:52Z","snapshot_observed_at":"2026-08-07T13:52:46.491642Z","submitted_at":"2025-05-26T18:06:52Z","title":"SCAR: Shapley Credit Assignment for More Efficient RLHF","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:02:49.225204Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2505.20417"},"observation_digest":"sha256:f9ba22e93c8c9456663c236fbf1371cfa863246b00fa580fd082653eb1129528","observation_id":"dc2e7ed3-6589-478f-8935-61ef15aaacef","resolution":{"observed_at":"2026-08-07T14:02:49.225204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09281","last_updated":"2019-11-11T14:18:31Z","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1910.09281","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09281","snapshot_observed_at":"2026-07-04T15:29:55.594907Z","title":"Dealing with sparse rewards in reinforcement learning","venue":null,"work_id":"906de8dd-dca7-4ded-a470-00299b47049d","year":1910},"citing_paper":{"arxiv_id":"2605.15855","last_updated":"2026-05-15T11:14:13Z","snapshot_observed_at":"2026-07-06T23:27:05.961780Z","submitted_at":"2026-05-15T11:14:13Z","title":"Do Less, Achieve More: Do We Need Every-Step Optimization for RL Fine-tuning of Diffusion Models?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-20T19:48:17.049547Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2605.15855"},"observation_digest":"sha256:b59281587ce114535b5bc0d81f86a75c6f19f15c0c9eca9ca45ca999e0fa2fd1","observation_id":"ce1b4e95-c112-4510-8d56-4328a4dbab63","resolution":{"observed_at":"2026-05-20T19:48:57.311552Z","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":"1910.09281","last_updated":"2019-11-11T14:18:31Z","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1910.09281","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09281","snapshot_observed_at":"2026-07-04T15:29:55.594907Z","title":"Dealing with sparse rewards in reinforcement learning","venue":null,"work_id":"906de8dd-dca7-4ded-a470-00299b47049d","year":1910},"citing_paper":{"arxiv_id":"2606.26333","last_updated":"2026-06-24T19:16:34Z","snapshot_observed_at":"2026-07-07T00:00:41.502665Z","submitted_at":"2026-06-24T19:16:34Z","title":"Mesh-RL: Coupled subgrid reinforcement learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T01:37:31.834106Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2606.26333"},"observation_digest":"sha256:79a38ed82d01d4ee20b06f31bcdc093fcecfacd8944b576fffa98b3e06cda0c3","observation_id":"824aeed7-4275-48ab-ba4a-539b19db6c86","resolution":{"observed_at":"2026-07-04T15:29:55.596964Z","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":"1910.09281","last_updated":"2019-11-11T14:18:31Z","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards in Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"1910.09281","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.09281","snapshot_observed_at":"2026-07-04T15:29:55.594907Z","title":"Dealing with sparse rewards in reinforcement learning","venue":null,"work_id":"906de8dd-dca7-4ded-a470-00299b47049d","year":1910},"citing_paper":{"arxiv_id":"2607.00442","last_updated":"2026-07-01T04:57:39Z","snapshot_observed_at":"2026-08-02T02:09:07.334839Z","submitted_at":"2026-07-01T04:57:39Z","title":"Learning Gait-Aware Quadruped Locomotion with Temporal Logic Specifications","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-02T11:59:04.103002Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2607.00442"},"observation_digest":"sha256:f43e8fc2d1d14a6802e26c9dd0144c3e0d86f31142560a43e9b5f94b4b05eb4e","observation_id":"d234f2db-73f8-4d88-8010-ee730468adda","resolution":{"observed_at":"2026-07-02T12:06:55.368456Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1910.09281/citation-record","integrity":"/paper/1910.09281/integrity","json":"/paper/1910.09281/citation-record.json","paper":"/paper/1910.09281"},"outbound":[],"paper":{"arxiv_id":"1910.09281","last_updated":"2019-11-11T14:18:31Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:31:00.030545Z","submitted_at":"2019-10-21T12:06:28Z","title":"Dealing with Sparse Rewards 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-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 5 inbound Pith citation observations for arXiv:1910.09281."}