{"as_of":"2026-08-10T09:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0611e003c3fb5966397ae3827007a0461fcaafe8943c3f723227dc29c5dabe92","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":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-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:48:47.922233Z","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-06-30T06:54:21.239534Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.01470","last_updated":"2024-06-04T07:52:31Z","snapshot_observed_at":"2026-08-10T02:12:36.285759Z","submitted_at":"2023-02-03T00:11:02Z","title":"Learning to Optimize for Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01470","snapshot_observed_at":"2026-08-06T14:48:47.922233Z","title":"Rupam Mahmood, Shuicheng Yan, and Zhongwen Xu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17668","last_updated":"2025-09-10T12:25:27Z","snapshot_observed_at":"2026-08-08T15:32:47.481175Z","submitted_at":"2025-07-23T16:31:38Z","title":"How Should We Meta-Learn Reinforcement Learning Algorithms?","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:47.922233Z"},"links":{"cited_paper":"/paper/2302.01470","citing_paper":"/paper/2507.17668"},"observation_digest":"sha256:dcdf758a7f43d3b4f93541397804af3648268d213875323fd39702dc33644e00","observation_id":"853ffeb4-20c3-4278-8903-a0cc889d3f0f","resolution":{"observed_at":"2026-08-06T14:48:47.922233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01470","last_updated":"2024-06-04T07:52:31Z","snapshot_observed_at":"2026-08-10T02:12:36.285759Z","submitted_at":"2023-02-03T00:11:02Z","title":"Learning to Optimize for Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2302.01470","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.01470","snapshot_observed_at":"2026-06-30T06:54:21.239534Z","title":"R., Yan, S., & Xu, Z","venue":null,"work_id":"a6b8d5b1-ff57-476e-ac91-223f51048f44","year":2023},"citing_paper":{"arxiv_id":"2606.29871","last_updated":"2026-06-29T07:07:33Z","snapshot_observed_at":"2026-08-05T08:23:21.262267Z","submitted_at":"2026-06-29T07:07:33Z","title":"AI Training Manager: Bounded Closed-Loop Control of Adaptive Training Recipes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T06:35:10.832304Z"},"links":{"cited_paper":"/paper/2302.01470","citing_paper":"/paper/2606.29871"},"observation_digest":"sha256:c02337652afcd14e64db1cf0824a1ceb732710b32d8251b39175a6972de8d3ba","observation_id":"4b35fd78-c9dd-4303-83a3-40cd843a3605","resolution":{"observed_at":"2026-06-30T06:54:21.241041Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01470","last_updated":"2024-06-04T07:52:31Z","snapshot_observed_at":"2026-08-10T02:12:36.285759Z","submitted_at":"2023-02-03T00:11:02Z","title":"Learning to Optimize for Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01470","snapshot_observed_at":"2026-08-06T00:32:46.754872Z","title":"arXiv preprint arXiv:2302.01470 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01205","last_updated":"2026-08-02T12:42:20Z","snapshot_observed_at":"2026-08-10T01:19:20.004392Z","submitted_at":"2026-08-02T12:42:20Z","title":"ReBRAC-v2: The Return of the King","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-06T00:32:46.754872Z"},"links":{"cited_paper":"/paper/2302.01470","citing_paper":"/paper/2608.01205"},"observation_digest":"sha256:39b55cecfb86bef8e065a469c59244466ec51d5df6e61b575fe38b1288963a30","observation_id":"53d4ecc1-07eb-45a0-9771-76c137642c19","resolution":{"observed_at":"2026-08-06T00:32:46.754872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.01470/citation-record","integrity":"/paper/2302.01470/integrity","json":"/paper/2302.01470/citation-record.json","paper":"/paper/2302.01470"},"outbound":[],"paper":{"arxiv_id":"2302.01470","last_updated":"2024-06-04T07:52:31Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T02:12:36.285759Z","submitted_at":"2023-02-03T00:11:02Z","title":"Learning to Optimize for 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2302.01470."}