{"as_of":"2026-08-09T03:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc1041cf21059d54fa68bfb8569f7a7a20416fa795b16449d0c730624deb0bee","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-07T11:52:35.555023Z","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-04T10:49:45.563057Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.10897","last_updated":"2020-09-23T02:00:34Z","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10897","snapshot_observed_at":"2026-08-07T11:07:21.350107Z","title":"Revisiting design choices in proximal policy optimization.arXiv preprint arXiv:2009.10897, 2020","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.03474","last_updated":"2025-06-04T01:08:34Z","snapshot_observed_at":"2026-08-07T10:59:59.527719Z","submitted_at":"2025-06-04T01:08:34Z","title":"CORE: Constraint-Aware One-Step Reinforcement Learning for Simulation-Guided Neural Network Accelerator Design","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:07:21.350107Z"},"links":{"cited_paper":"/paper/2009.10897","citing_paper":"/paper/2506.03474"},"observation_digest":"sha256:2f1e97b7ecc23705a3ac0dd23fd50d7437070e1f6184f76806c2a8fb6650c42a","observation_id":"7447214d-7e81-4771-b36b-9bdd8b70b765","resolution":{"observed_at":"2026-08-07T11:07:21.350107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10897","last_updated":"2020-09-23T02:00:34Z","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10897","snapshot_observed_at":"2026-08-07T11:52:35.555023Z","title":"C., Mendler - D \\\" u nner, C., and Hardt, M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.08029","last_updated":"2025-06-02T02:31:52Z","snapshot_observed_at":"2026-08-08T20:46:41.868293Z","submitted_at":"2025-06-02T02:31:52Z","title":"Inverse Design in Distributed Circuits Using Single-Step Reinforcement Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T11:52:35.555023Z"},"links":{"cited_paper":"/paper/2009.10897","citing_paper":"/paper/2506.08029"},"observation_digest":"sha256:570aae7a8b2ac8bc18ba0949bdad3633e0915dd91586bd4f0e1ec8a8ba07a93c","observation_id":"fb34228b-9a45-42b7-aca3-fc385ac9f6c7","resolution":{"observed_at":"2026-08-07T11:52:35.555023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10897","last_updated":"2020-09-23T02:00:34Z","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization","version":1},"cited_work":{"arxiv_id":"2009.10897","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.10897","snapshot_observed_at":"2026-07-04T10:49:45.563057Z","title":"arXiv preprint arXiv:2009.10897 , year=","venue":null,"work_id":"0e74d2a9-f46a-4528-94a4-313d1abcebb8","year":2009},"citing_paper":{"arxiv_id":"2605.06032","last_updated":"2026-05-07T11:22:45Z","snapshot_observed_at":"2026-07-06T23:18:31.432422Z","submitted_at":"2026-05-07T11:22:45Z","title":"Does Synthetic Data Help? Empirical Evidence from Deep Learning Time Series Forecasters","version":1},"reference_index":262,"source":"arxiv_source","source_observed_at":"2026-05-08T14:16:34.235992Z"},"links":{"cited_paper":"/paper/2009.10897","citing_paper":"/paper/2605.06032"},"observation_digest":"sha256:294320a186e41de65303574a37718faa5401bfc1372558a1585dd33c53f39db0","observation_id":"c44ddcf7-6bee-48a6-af64-bdda314cd99a","resolution":{"observed_at":"2026-05-11T18:41:12.424999Z","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":"2009.10897","last_updated":"2020-09-23T02:00:34Z","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization","version":1},"cited_work":{"arxiv_id":"2009.10897","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.10897","snapshot_observed_at":"2026-07-04T10:49:45.563057Z","title":"arXiv preprint arXiv:2009.10897 , year=","venue":null,"work_id":"0e74d2a9-f46a-4528-94a4-313d1abcebb8","year":2009},"citing_paper":{"arxiv_id":"2606.08153","last_updated":"2026-06-06T13:08:14Z","snapshot_observed_at":"2026-08-08T00:54:11.133854Z","submitted_at":"2026-06-06T13:08:14Z","title":"LogNEO: A GPT-Neo Reinforcement Learning Framework for Accurate Real-Time Log Anomaly Detection","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T20:27:21.317586Z"},"links":{"cited_paper":"/paper/2009.10897","citing_paper":"/paper/2606.08153"},"observation_digest":"sha256:b1c25e5af1d8f7940260d0825982d2953c035b6feca81576a2b07fbbc7e771a2","observation_id":"d279ee8d-3619-45d0-a63d-418f3cbae076","resolution":{"observed_at":"2026-07-02T20:27:22.334873Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10897","last_updated":"2020-09-23T02:00:34Z","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization","version":1},"cited_work":{"arxiv_id":"2009.10897","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.10897","snapshot_observed_at":"2026-07-04T10:49:45.563057Z","title":"arXiv preprint arXiv:2009.10897 , year=","venue":null,"work_id":"0e74d2a9-f46a-4528-94a4-313d1abcebb8","year":2009},"citing_paper":{"arxiv_id":"2606.23932","last_updated":"2026-06-22T20:52:03Z","snapshot_observed_at":"2026-08-08T18:33:22.858039Z","submitted_at":"2026-06-22T20:52:03Z","title":"KLip-PPO: A per-sample KL perspective on PPO-Clip","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T08:33:38.220378Z"},"links":{"cited_paper":"/paper/2009.10897","citing_paper":"/paper/2606.23932"},"observation_digest":"sha256:0ff2b0fa7210fd455264b516e7daa4fbe80753833976ac8362f92b5a0e466394","observation_id":"9c2a93da-45fb-40ff-8bb9-8f768257e4bc","resolution":{"observed_at":"2026-07-04T10:49:45.565074Z","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/2009.10897/citation-record","integrity":"/paper/2009.10897/integrity","json":"/paper/2009.10897/citation-record.json","paper":"/paper/2009.10897"},"outbound":[],"paper":{"arxiv_id":"2009.10897","last_updated":"2020-09-23T02:00:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:58:00.143401Z","submitted_at":"2020-09-23T02:00:34Z","title":"Revisiting Design Choices in Proximal Policy Optimization"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2009.10897."}