{"as_of":"2026-08-13T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:410094c753b9e7fc957b3010f9f8543a0c408a62824f0d693a69fdf757664300","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:45:23.242099Z","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-08-12T01:28:44.939671Z","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-10T22:40:16.221035Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01085","last_updated":"2025-01-02T06:05:59Z","snapshot_observed_at":"2026-08-13T08:57:44.967116Z","submitted_at":"2025-01-02T06:05:59Z","title":"Noise-Resilient Symbolic Regression with Dynamic Gating Reinforcement Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T22:40:16.221035Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2501.01085"},"observation_digest":"sha256:fad60d4f8af4ccbf6c8d325a61ccd9c0204c79716eb82465a03f09c7441cdc53","observation_id":"337f6a73-6a5b-45ff-b647-f0f198d752fb","resolution":{"observed_at":"2026-08-10T22:40:16.221035Z","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-08-12T01:28:44.939671Z","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-10T04:37:01.861960Z","title":"Dealing with sparse rewards in reinforcement learning","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2501.17842","last_updated":"2025-01-29T18:46:35Z","snapshot_observed_at":"2026-08-13T02:21:46.374360Z","submitted_at":"2025-01-29T18:46:35Z","title":"From Sparse to Dense: Toddler-inspired Reward Transition in Goal-Oriented Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T04:37:01.861960Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2501.17842"},"observation_digest":"sha256:0ff9024bec53662dd3aa41f8bdc3b2df5e912cecdbe91ace06197eb9cd24d1a7","observation_id":"bfb38035-4bbb-48cc-85b1-f078aa19bae0","resolution":{"observed_at":"2026-08-10T04:37:01.861960Z","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-08-12T01:28:44.939671Z","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-09T17:44:56.423478Z","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:e6118ce88a054f5fe247f4a0344ef3f0f91149a660171e843d69e0fa2f0e5009","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-08-12T01:28:44.939671Z","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-11T00:09:29.999243Z","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:fea426da04c1fe757fb53b0c3d0f0d6b3741aa5752b6b98417cfef5e47e0a008","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-08-12T01:28:44.939671Z","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-08-12T15:32:26.557707Z","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:7fce5a81f8df38909f467b64472c07c6ec7fdb09fc13fc1a360177338d8590ab","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T01:28:44.939671Z","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-08-11T14:59:26.940318Z","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:7fadc7ec09e64b0bf57948ab58aa70be91549564a4dd9af87647ce87de1bf898","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T01:28:44.939671Z","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-13T07:25:57.864655Z","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:610d9edd4f075714ff88e3f179c2fe41de0cfb888620886c291dce9cf051dc2a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T01:28:44.939671Z","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-11T15:45:23.242099Z","title":"Dealing with sparse rewards in reinforcement learning,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2608.09524","last_updated":"2026-08-10T12:25:12Z","snapshot_observed_at":"2026-08-13T22:42:30.396788Z","submitted_at":"2026-08-10T12:25:12Z","title":"STAIR: Effective Incident Response Using an End-to-End Agentic Planning Framework","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:23.242099Z"},"links":{"cited_paper":"/paper/1910.09281","citing_paper":"/paper/2608.09524"},"observation_digest":"sha256:a36e56f13c089e0a4778b2e15178b4b627ee7b5a879b726553937de21c3f18bd","observation_id":"11b4206c-2cfd-4ab9-a6c8-5e136347aefd","resolution":{"observed_at":"2026-08-11T15:45:23.242099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"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-08-12T01:28:44.939671Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:1910.09281."}