{"as_of":"2026-08-19T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b7383c7eddb8f69b559f3f33db7030fafffcc6c0fc9829bd370b686cb392a1b","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:14:33.989387Z","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-20T12:48:17.553752Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-08-12T18:14:33.989387Z","title":"C., Castro, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12042","last_updated":"2025-05-30T01:46:35Z","snapshot_observed_at":"2026-08-19T17:48:04.568289Z","submitted_at":"2024-11-18T20:27:13Z","title":"Fast Convergence of Softmax Policy Mirror Ascent","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T18:14:33.989387Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2411.12042"},"observation_digest":"sha256:782a9aa9699d9b4e998f7f0960424d0e3d3f0187cdbbe2f789b89a1ede6bf967","observation_id":"fba64ec1-bb3b-4173-bca5-b9c122c15fac","resolution":{"observed_at":"2026-08-12T18:14:33.989387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-08-08T17:54:46.683421Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05812","last_updated":"2025-02-09T08:35:09Z","snapshot_observed_at":"2026-08-13T23:31:42.905194Z","submitted_at":"2025-02-09T08:35:09Z","title":"Multi-Agent Reinforcement Learning in Wireless Distributed Networks for 6G","version":1},"reference_index":200,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:46.683421Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2502.05812"},"observation_digest":"sha256:bdbee54fe8dcbd85da7817438265b3eb57ae253340e79779cee3af5128817e42","observation_id":"f4a52692-0c4d-462f-9324-32a22e6970d2","resolution":{"observed_at":"2026-08-08T17:54:46.683421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":"2108.05828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2108.05828 , year=","venue":null,"work_id":"20d49751-07c0-44e7-bc27-500b5982dfe5","year":2021},"citing_paper":{"arxiv_id":"2509.09838","last_updated":"2026-05-11T21:29:26Z","snapshot_observed_at":"2026-08-17T03:13:48.374680Z","submitted_at":"2025-09-11T20:34:08Z","title":"Dissecting Discrete Soft Actor-Critic: Limitations and Principled Alternatives","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-18T17:05:36.100114Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2509.09838"},"observation_digest":"sha256:de1f0b2457b4a663359cb1ac8c5fc3803f686168d5f2f64990c2f34b2690960f","observation_id":"84b6513c-37d4-49fb-a202-acc5094a8723","resolution":{"observed_at":"2026-05-18T17:06:39.818733Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":"2108.05828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2108.05828 , year=","venue":null,"work_id":"20d49751-07c0-44e7-bc27-500b5982dfe5","year":2021},"citing_paper":{"arxiv_id":"2605.11694","last_updated":"2026-05-12T07:51:18Z","snapshot_observed_at":"2026-08-14T16:49:14.775442Z","submitted_at":"2026-05-12T07:51:18Z","title":"Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T07:27:12.302109Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2605.11694"},"observation_digest":"sha256:1a79368a02566e148068649f5c78c023ef3aa4ba872da14a880ac765b26a28b6","observation_id":"1fc7e9a6-ab16-4e5b-a227-5eba737a471f","resolution":{"observed_at":"2026-05-13T07:27:29.105915Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":"2108.05828","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2108.05828 , year=","venue":null,"work_id":"20d49751-07c0-44e7-bc27-500b5982dfe5","year":2021},"citing_paper":{"arxiv_id":"2605.18591","last_updated":"2026-08-03T00:43:51Z","snapshot_observed_at":"2026-08-15T18:49:00.297497Z","submitted_at":"2026-05-18T16:05:36Z","title":"Randomized Advantage Transformation (RAT): Computing Natural Policy Gradients via Direct Backpropagation","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-05-20T12:44:29.147095Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2605.18591"},"observation_digest":"sha256:5489331f766dd01c5c55c7fa34d45052a48c12d9769e082f98d5057a187bf219","observation_id":"7f7f6c33-825d-4603-a0c2-dc63c6bd6fa9","resolution":{"observed_at":"2026-05-20T12:48:17.555556Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient reinforcement learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.05828","snapshot_observed_at":"2026-07-14T04:17:12.534820Z","title":"arXiv preprint arXiv:2108.05828 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11626","last_updated":"2026-07-13T14:45:07Z","snapshot_observed_at":"2026-08-15T03:05:44.120652Z","submitted_at":"2026-07-13T14:45:07Z","title":"On the Policy Convergence of Policy Mirror Descent Methods","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-14T04:17:12.534820Z"},"links":{"cited_paper":"/paper/2108.05828","citing_paper":"/paper/2607.11626"},"observation_digest":"sha256:0358f02328d257287a3fc8406103de305f575c21725877403eaa688e92f22edf","observation_id":"652097ef-63fc-4676-9b7f-82e914a7b81a","resolution":{"observed_at":"2026-07-14T04:17:12.534820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.05828/citation-record","integrity":"/paper/2108.05828/integrity","json":"/paper/2108.05828/citation-record.json","paper":"/paper/2108.05828"},"outbound":[],"paper":{"arxiv_id":"2108.05828","last_updated":"2023-10-31T00:56:56Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T12:20:42.609426Z","submitted_at":"2021-08-12T16:19:19Z","title":"A general class of surrogate functions for stable and efficient 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2108.05828."}