{"as_of":"2026-08-08T09:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a11bd93437a54dd91b0e0a6c0aa922dfe9cbe70f22e72f985cd0d4ad27bb334","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:07:12.592925Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.06178/citation-record","integrity":"/paper/2506.06178/integrity","json":"/paper/2506.06178/citation-record.json","paper":"/paper/2506.06178"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:13.097977Z","title":"Next, we imposeAď ϵ 2 as well, from which we will recover a condition on the total sample complexityN K","venue":null,"work_id":"37efc644-01a0-4d0e-9af7-647d56c80cb6","year":null},"citing_paper":{"arxiv_id":"2506.06178","last_updated":"2026-06-03T08:21:07Z","snapshot_observed_at":"2026-08-07T05:56:48.398039Z","submitted_at":"2025-06-06T15:42:15Z","title":"Reusing Trajectories in Policy Gradients Enables Fast Convergence","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T06:07:12.476857Z"},"links":{"citing_paper":"/paper/2506.06178"},"observation_digest":"sha256:e2fa284a73c292d294c0af57dac34d5925a9731c621ed5937427f9d0bb8ea00d","observation_id":"8d3a055e-135e-4e37-be9b-b361edacc6be","resolution":{"observed_at":"2026-08-07T06:07:13.162777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:07:12.902477Z","title":"1, then with the discussed conditions on iteration, batch, and sample complexities, Equation (166) is equivalent to: E","venue":null,"work_id":"b7b0f42b-1eb0-43bb-a558-ab18f5898acc","year":2021},"citing_paper":{"arxiv_id":"2506.06178","last_updated":"2026-06-03T08:21:07Z","snapshot_observed_at":"2026-08-07T05:56:48.398039Z","submitted_at":"2025-06-06T15:42:15Z","title":"Reusing Trajectories in Policy Gradients Enables Fast Convergence","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T06:07:12.592925Z"},"links":{"citing_paper":"/paper/2506.06178"},"observation_digest":"sha256:7c16ae1bffbde84707064dd613d520997ec6f4412e0a078d3a4099fd60ddc8da","observation_id":"c6b5ae3e-4677-45dc-b2fb-09eb2a0535f6","resolution":{"observed_at":"2026-08-07T06:07:13.014124Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":"2003.04302","last_updated":"2020-03-09T17:59:03Z","snapshot_observed_at":"2026-08-02T20:56:14.744824Z","submitted_at":"2020-03-09T17:59:03Z","title":"Stochastic Recursive Momentum for Policy Gradient Methods","version":1},"cited_work":{"arxiv_id":"2003.04302","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.04302","snapshot_observed_at":"2026-08-07T06:07:12.736188Z","title":"Stochastic Recursive Momentum for Policy Gradient Methods","venue":"stat.ML","work_id":"9a20943d-fe5b-424f-b9ec-71627e199d57","year":2020},"citing_paper":{"arxiv_id":"2506.06178","last_updated":"2026-06-03T08:21:07Z","snapshot_observed_at":"2026-08-07T05:56:48.398039Z","submitted_at":"2025-06-06T15:42:15Z","title":"Reusing Trajectories in Policy Gradients Enables Fast Convergence","version":3},"reference_index":551,"source":"pdf_text","source_observed_at":"2026-08-07T06:07:12.402659Z"},"links":{"cited_paper":"/paper/2003.04302","citing_paper":"/paper/2506.06178"},"observation_digest":"sha256:8d8993f4cdc55fad331127141f35c1000c0c34e0f735bcece5415193096f56e9","observation_id":"c94ec586-1d63-4a91-913a-d53a48797acf","resolution":{"observed_at":"2026-08-07T06:07:12.828255Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"paper":{"arxiv_id":"2506.06178","last_updated":"2026-06-03T08:21:07Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:56:48.398039Z","submitted_at":"2025-06-06T15:42:15Z","title":"Reusing Trajectories in Policy Gradients Enables Fast Convergence"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":3},"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 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2506.06178."}