{"as_of":"2026-08-08T10:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:343758fbe931efafbfaafcb9491072b770731b4760d0338e827ab6778440e610","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-08T06:32:00.761636+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-07T14:21:39.299158Z","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-10T07:37:04.719767Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02332","last_updated":"2025-04-11T18:06:15Z","snapshot_observed_at":"2026-08-01T12:31:15.134485Z","submitted_at":"2025-02-04T14:09:00Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02332","snapshot_observed_at":"2026-08-07T14:21:39.299158Z","title":"Toso, and James Anderson","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19426","last_updated":"2025-06-05T08:20:31Z","snapshot_observed_at":"2026-08-07T14:11:58.376018Z","submitted_at":"2025-05-26T02:37:26Z","title":"The Role of Diversity in In-Context Learning for Large Language Models","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T14:21:39.299158Z"},"links":{"cited_paper":"/paper/2502.02332","citing_paper":"/paper/2505.19426"},"observation_digest":"sha256:f25b30eccfea37ced293ebf851823a885b94b2625edbe6b74ed7f32936e5a5ea","observation_id":"2917b736-4708-4d6c-a94e-839588e3bc20","resolution":{"observed_at":"2026-08-07T14:21:39.299158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02332","last_updated":"2025-04-11T18:06:15Z","snapshot_observed_at":"2026-08-01T12:31:15.134485Z","submitted_at":"2025-02-04T14:09:00Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02332","snapshot_observed_at":"2026-08-06T18:20:57.142267Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.09026","last_updated":"2025-07-11T21:19:47Z","snapshot_observed_at":"2026-08-06T18:03:41.578264Z","submitted_at":"2025-07-11T21:19:47Z","title":"On the Gradient Domination of the LQG Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:20:57.142267Z"},"links":{"cited_paper":"/paper/2502.02332","citing_paper":"/paper/2507.09026"},"observation_digest":"sha256:37feaab77b8442ea4398d64ac3f91609fe6b17c8fbefd0d57854e8eb681f4f2b","observation_id":"f129d589-0c70-4fce-9cee-63627b49746a","resolution":{"observed_at":"2026-08-06T18:20:57.142267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02332","last_updated":"2025-04-11T18:06:15Z","snapshot_observed_at":"2026-08-01T12:31:15.134485Z","submitted_at":"2025-02-04T14:09:00Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2502.02332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02332","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning","venue":null,"work_id":"116cd78a-fcd8-4774-b18d-4f3cf7d9334b","year":2025},"citing_paper":{"arxiv_id":"2604.16730","last_updated":"2026-04-17T22:25:00Z","snapshot_observed_at":"2026-07-31T07:35:19.162172Z","submitted_at":"2026-04-17T22:25:00Z","title":"Multitask LQG Control: Performance and Generalization Bounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T07:34:29.215557Z"},"links":{"cited_paper":"/paper/2502.02332","citing_paper":"/paper/2604.16730"},"observation_digest":"sha256:46f4f0d59783282c667e782db92c995994584cc420af01ab0b8a41559c306107","observation_id":"bf50c772-4d04-4a30-a485-46555d042a65","resolution":{"observed_at":"2026-05-10T07:37:04.721129Z","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/2502.02332/citation-record","integrity":"/paper/2502.02332/integrity","json":"/paper/2502.02332/citation-record.json","paper":"/paper/2502.02332"},"outbound":[],"paper":{"arxiv_id":"2502.02332","last_updated":"2025-04-11T18:06:15Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-01T12:31:15.134485Z","submitted_at":"2025-02-04T14:09:00Z","title":"Coreset-Based Task Selection for Sample-Efficient Meta-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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.02332."}