{"as_of":"2026-08-10T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4259ce7f45942ccaf37b3319c93a8f066cd85867d4338214b699c20d7fe235a","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-10T17:35:46.255291Z","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-01T18:35:59.114010Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.02711","last_updated":"2022-03-05T11:41:13Z","snapshot_observed_at":"2026-07-06T12:44:36.926275Z","submitted_at":"2022-03-05T11:41:13Z","title":"Meta Mirror Descent: Optimiser Learning for Fast Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02711","snapshot_observed_at":"2026-08-10T17:35:46.255291Z","title":"Meta mirror descent: Optimiser learning for fast convergence","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-10T17:27:33.755532Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.255291Z"},"links":{"cited_paper":"/paper/2203.02711","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:cff0ed4bbc4dfa24a9b02cd1416b592c726a2b4c9ca457c221f3812de367a6b4","observation_id":"2e51fcfe-df6d-4316-8917-56b6b481fa62","resolution":{"observed_at":"2026-08-10T17:35:46.255291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02711","last_updated":"2022-03-05T11:41:13Z","snapshot_observed_at":"2026-07-06T12:44:36.926275Z","submitted_at":"2022-03-05T11:41:13Z","title":"Meta Mirror Descent: Optimiser Learning for Fast Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02711","snapshot_observed_at":"2026-08-05T11:45:39.016680Z","title":"Meta mirror descent: Optimiser learning for fast convergence,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.02418","last_updated":"2025-09-02T15:23:21Z","snapshot_observed_at":"2026-08-07T20:31:28.705513Z","submitted_at":"2025-09-02T15:23:21Z","title":"Learnable Loss Geometries with Mirror Descent for Scalable and Convergent Meta-Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:45:39.016680Z"},"links":{"cited_paper":"/paper/2203.02711","citing_paper":"/paper/2509.02418"},"observation_digest":"sha256:a21a10399b6df8b9b31921cd870c4a9dd16643315cda049c94cb3f77d287b0c3","observation_id":"bcb18031-2c65-428c-b8dc-48d3a6e50c6c","resolution":{"observed_at":"2026-08-05T11:45:39.016680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02711","last_updated":"2022-03-05T11:41:13Z","snapshot_observed_at":"2026-07-06T12:44:36.926275Z","submitted_at":"2022-03-05T11:41:13Z","title":"Meta Mirror Descent: Optimiser Learning for Fast Convergence","version":1},"cited_work":{"arxiv_id":"2203.02711","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.02711","snapshot_observed_at":"2026-07-01T18:35:59.114010Z","title":null,"venue":null,"work_id":"88c7fd45-6218-4b1e-a1ad-5543f1f2ef07","year":2022},"citing_paper":{"arxiv_id":"2606.28204","last_updated":"2026-06-26T15:52:48Z","snapshot_observed_at":"2026-08-10T16:41:38.565477Z","submitted_at":"2026-06-26T15:52:48Z","title":"Non-Linear Strategic Classification Made Practical","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T01:51:39.878873Z"},"links":{"cited_paper":"/paper/2203.02711","citing_paper":"/paper/2606.28204"},"observation_digest":"sha256:494a9d58e46c002a669a4ab2393df00ff810258f70b8b0ec987d898df9633a7d","observation_id":"76c62ca0-37c4-4e3a-b860-a83f36bda7b7","resolution":{"observed_at":"2026-07-01T18:35:59.115271Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2203.02711/citation-record","integrity":"/paper/2203.02711/integrity","json":"/paper/2203.02711/citation-record.json","paper":"/paper/2203.02711"},"outbound":[],"paper":{"arxiv_id":"2203.02711","last_updated":"2022-03-05T11:41:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:44:36.926275Z","submitted_at":"2022-03-05T11:41:13Z","title":"Meta Mirror Descent: Optimiser Learning for Fast Convergence"},"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:2203.02711."}