{"as_of":"2026-08-22T15:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d10bef6062774ab32bc4235dbdf05da88bedfb35e1d59195c66a2f314b2b209","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:16:28.937160Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.07082","last_updated":"2025-04-15T15:07:30Z","snapshot_observed_at":"2026-08-16T13:35:41.062830Z","submitted_at":"2024-07-09T17:55:23Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07082","snapshot_observed_at":"2026-08-10T17:01:13.785256Z","title":"Can learned optimization make reinforcement learning less difficult? arXiv preprint arXiv:2407.07082, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12670","last_updated":"2025-06-19T15:01:04Z","snapshot_observed_at":"2026-08-17T22:51:52.134879Z","submitted_at":"2025-01-22T06:10:27Z","title":"Celo: Training Versatile Learned Optimizers on a Compute Diet","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T17:01:13.785256Z"},"links":{"cited_paper":"/paper/2407.07082","citing_paper":"/paper/2501.12670"},"observation_digest":"sha256:c5219986804954265336940dd428ba9ca1e9b10a051e8ca6fedc8af733c8180c","observation_id":"2b79ed6f-1eb3-4c4a-8054-13d8babdbe4b","resolution":{"observed_at":"2026-08-10T17:01:13.785256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07082","last_updated":"2025-04-15T15:07:30Z","snapshot_observed_at":"2026-08-16T13:35:41.062830Z","submitted_at":"2024-07-09T17:55:23Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07082","snapshot_observed_at":"2026-08-15T19:16:28.937160Z","title":"D., Lu, C., Jackson, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17204","last_updated":"2025-06-20T17:54:24Z","snapshot_observed_at":"2026-08-19T22:11:33.663475Z","submitted_at":"2025-06-20T17:54:24Z","title":"Network Sparsity Unlocks the Scaling Potential of Deep Reinforcement Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T19:16:28.937160Z"},"links":{"cited_paper":"/paper/2407.07082","citing_paper":"/paper/2506.17204"},"observation_digest":"sha256:c71a1c0a6c6071e9a9a008c305d84e8f432d8811504e353942aa27c0e44e0ca6","observation_id":"721330c9-be0b-40bf-bf43-596a35d3b977","resolution":{"observed_at":"2026-08-15T19:16:28.937160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07082","last_updated":"2025-04-15T15:07:30Z","snapshot_observed_at":"2026-08-16T13:35:41.062830Z","submitted_at":"2024-07-09T17:55:23Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","version":3},"cited_work":{"arxiv_id":"2407.07082","doi":"10.48550/arxiv.2407.07082","metadata_source":"pith","pith_arxiv_id":"2407.07082","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","venue":"cs.LG","work_id":"2573e96d-2995-4762-ac7d-9e8459e181e6","year":2024},"citing_paper":{"arxiv_id":"2607.29559","last_updated":"2026-07-31T15:50:29Z","snapshot_observed_at":"2026-08-20T00:00:43.308138Z","submitted_at":"2026-07-31T15:50:29Z","title":"LEMUR: Learning to Align with Multi-Objective Reinforcement Learning from Preference Feedback","version":1},"reference_index":265,"source":"arxiv_source","source_observed_at":"2026-08-03T04:39:32.184113Z"},"links":{"cited_paper":"/paper/2407.07082","citing_paper":"/paper/2607.29559"},"observation_digest":"sha256:1f2c32828eba8ddc3bbf008b4825fe5d92df18a8008d54c02cdd326e8b86f4de","observation_id":"fccf9ced-5d15-4f59-a74e-442bc1bb0471","resolution":{"observed_at":"2026-08-03T04:44:18.380119Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-10T21:38:18.334799+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-10T21:38:18.334799+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07082","last_updated":"2025-04-15T15:07:30Z","snapshot_observed_at":"2026-08-16T13:35:41.062830Z","submitted_at":"2024-07-09T17:55:23Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07082","snapshot_observed_at":"2026-08-05T15:25:40.590903Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03644","last_updated":"2026-08-04T13:29:00Z","snapshot_observed_at":"2026-08-18T16:50:46.109145Z","submitted_at":"2026-08-04T13:29:00Z","title":"Is Inter-Seed Cross-Play Enough? Evaluating the Robustness of Zero-Shot Coordination Algorithms to Implementation Details","version":1},"reference_index":264,"source":"arxiv_source","source_observed_at":"2026-08-05T15:25:40.590903Z"},"links":{"cited_paper":"/paper/2407.07082","citing_paper":"/paper/2608.03644"},"observation_digest":"sha256:303521971e031fe71eb5e2a70daa5861e254e32365f276637437be12ef402caf","observation_id":"aebf1e82-e7d4-420b-b10e-aacea1cd344b","resolution":{"observed_at":"2026-08-05T15:25:40.590903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.07082/citation-record","integrity":"/paper/2407.07082/integrity","json":"/paper/2407.07082/citation-record.json","paper":"/paper/2407.07082"},"outbound":[],"paper":{"arxiv_id":"2407.07082","last_updated":"2025-04-15T15:07:30Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:35:41.062830Z","submitted_at":"2024-07-09T17:55:23Z","title":"Can Learned Optimization Make Reinforcement Learning Less Difficult?"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2407.07082."}