{"as_of":"2026-08-12T19:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c687e3ab4972d484d0328d9bac6576da961516bda9c17ca06f3e2c5bf0ff828","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:10:44.946179Z","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-02T11:56:56.009111Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-08-11T20:29:54.087975Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.05710","last_updated":"2025-05-31T23:34:02Z","snapshot_observed_at":"2026-08-12T01:11:38.493372Z","submitted_at":"2024-12-07T17:51:31Z","title":"PromptRefine: Enhancing Few-Shot Performance on Low-Resource Indic Languages with Example Selection from Related Example Banks","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T20:29:54.087975Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2412.05710"},"observation_digest":"sha256:572ab4278fef08085f261267b18a87c2142b3c21798ff6a26dbc5b9fd3b6f350","observation_id":"b69eb140-ffa9-49e3-a38c-c1bfca8c2884","resolution":{"observed_at":"2026-08-11T20:29:54.087975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-08-09T14:47:40.740251Z","title":"K., Jain, P., Netrapalli, P., and Oh, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01763","last_updated":"2025-02-03T19:08:32Z","snapshot_observed_at":"2026-08-10T11:24:38.785549Z","submitted_at":"2025-02-03T19:08:32Z","title":"On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning","version":1},"reference_index":103,"source":"arxiv_source","source_observed_at":"2026-08-09T14:47:40.740251Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2502.01763"},"observation_digest":"sha256:05f43f7b82a4773b6e77b594f1c0ab242035a4f98641d4f1c28c73d81308d944","observation_id":"a6c7bafc-b400-42fd-aecd-5ca855204ccc","resolution":{"observed_at":"2026-08-09T14:47:40.740251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-08-03T03:49:40.538573Z","title":"K., Jain, P., Netrapalli, P., and Oh, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.07218","last_updated":"2026-05-29T20:42:03Z","snapshot_observed_at":"2026-08-07T08:11:04.251717Z","submitted_at":"2026-02-06T21:59:40Z","title":"Collaborative and Efficient Fine-tuning: Leveraging Task Similarity","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T03:49:40.538573Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2602.07218"},"observation_digest":"sha256:44ba8772762c86d96d5f8767f50fe5f53a9e82b71da1b050c5da241b5802567c","observation_id":"754faaeb-50c0-4d6c-bcf6-8761031094e5","resolution":{"observed_at":"2026-08-03T03:49:40.538573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":"2105.08306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-07-02T11:56:56.009111Z","title":"Sample efficient linear meta-learning by alternating minimization","venue":null,"work_id":"9c865cf4-e78f-4463-84aa-d324ad8e7115","year":2021},"citing_paper":{"arxiv_id":"2605.12176","last_updated":"2026-05-12T14:22:03Z","snapshot_observed_at":"2026-07-06T23:23:54.142937Z","submitted_at":"2026-05-12T14:22:03Z","title":"Multi-Task Representation Learning for Conservative Linear Bandits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T07:12:06.759848Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2605.12176"},"observation_digest":"sha256:b907eba86fd80623ece17ff5960ffaae6847067b8ddc15e0fa978ceaac18feca","observation_id":"adb75f6d-12d3-48d1-bdfb-5061a7af9b1c","resolution":{"observed_at":"2026-05-13T07:12:27.892795Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":"2105.08306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-07-02T11:56:56.009111Z","title":"Sample efficient linear meta-learning by alternating minimization","venue":null,"work_id":"9c865cf4-e78f-4463-84aa-d324ad8e7115","year":2021},"citing_paper":{"arxiv_id":"2606.06418","last_updated":"2026-06-04T17:22:58Z","snapshot_observed_at":"2026-08-02T08:47:15.917924Z","submitted_at":"2026-06-04T17:22:58Z","title":"Double Preconditioning (DoPr): Optimization for Test-Time Performance, not Validation Loss","version":1},"reference_index":251,"source":"arxiv_source","source_observed_at":"2026-06-28T02:35:39.845487Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2606.06418"},"observation_digest":"sha256:2a3bf0f4503992e8f0edcf90b780ab2fc7ef63ca42964663d6954fd605d26e5a","observation_id":"4a1241d1-e7aa-4711-a87d-1dedb16a30e3","resolution":{"observed_at":"2026-07-02T11:56:56.010536Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.08306","snapshot_observed_at":"2026-08-12T14:10:44.946179Z","title":"arXiv preprint arXiv:2105.08306 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.10928","last_updated":"2026-08-11T13:58:07Z","snapshot_observed_at":"2026-08-12T19:25:48.064813Z","submitted_at":"2026-08-11T13:58:07Z","title":"ThinkRetrieve: Retrieval-Augmented Reasoning Traces for Test-Time Scaling","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T14:10:44.946179Z"},"links":{"cited_paper":"/paper/2105.08306","citing_paper":"/paper/2608.10928"},"observation_digest":"sha256:24cbd883f587b0e39f56b76e3caf1530eeb1a46181083231d4e0ce71bbe7d0af","observation_id":"c7ef8b83-49ce-4ac0-9c6b-95af26dd96b4","resolution":{"observed_at":"2026-08-12T14:10:44.946179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2105.08306/citation-record","integrity":"/paper/2105.08306/integrity","json":"/paper/2105.08306/citation-record.json","paper":"/paper/2105.08306"},"outbound":[],"paper":{"arxiv_id":"2105.08306","last_updated":"2021-05-18T06:46:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T01:10:55.251893Z","submitted_at":"2021-05-18T06:46:48Z","title":"Sample Efficient Linear Meta-Learning by Alternating Minimization"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2105.08306."}