{"as_of":"2026-08-07T10:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c1ee3d4290cb931ff207409b679e50eb6b50961bbc9b5feda2a5a674da4e1ba","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:28:44.499298Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06-28T02:14:38.644041Z","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-02T12:16:57.389694Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"cited_work":{"arxiv_id":"2506.14530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14530","snapshot_observed_at":"2026-07-02T12:16:57.389694Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Ran- domized Low-Rank Adapters","venue":null,"work_id":"aa45a6b0-6b75-4596-a483-7a3ef4197ae2","year":2025},"citing_paper":{"arxiv_id":"2605.14276","last_updated":"2026-05-14T02:20:36Z","snapshot_observed_at":"2026-08-03T04:07:32.785860Z","submitted_at":"2026-05-14T02:20:36Z","title":"Training-Free Generative Sampling via Moment-Matched Score Smoothing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T02:31:15.134624Z"},"links":{"cited_paper":"/paper/2506.14530","citing_paper":"/paper/2605.14276"},"observation_digest":"sha256:082e1f201dd35dcc806fac97dda50d339cac5215a3cb37da2aefe3fb1b534cc2","observation_id":"7d1bb97a-56d0-4699-9c29-532e3494de1e","resolution":{"observed_at":"2026-05-15T02:33:32.464066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"cited_work":{"arxiv_id":"2506.14530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14530","snapshot_observed_at":"2026-07-02T12:16:57.389694Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Ran- domized Low-Rank Adapters","venue":null,"work_id":"aa45a6b0-6b75-4596-a483-7a3ef4197ae2","year":2025},"citing_paper":{"arxiv_id":"2605.19018","last_updated":"2026-05-18T18:40:24Z","snapshot_observed_at":"2026-08-01T08:22:24.297762Z","submitted_at":"2026-05-18T18:40:24Z","title":"LoRA vs. Full Fine-Tuning: A Theoretical Perspective","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T12:14:11.947836Z"},"links":{"cited_paper":"/paper/2506.14530","citing_paper":"/paper/2605.19018"},"observation_digest":"sha256:e65b6ac0899bc8e8240ac98143ad4be509d044158e4574ccd1d51f0d71b55bc4","observation_id":"3ffe8f13-7a4f-4a55-bbda-ede4caac1dc6","resolution":{"observed_at":"2026-05-20T12:18:16.814921Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"cited_work":{"arxiv_id":"2506.14530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14530","snapshot_observed_at":"2026-07-02T12:16:57.389694Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Ran- domized Low-Rank Adapters","venue":null,"work_id":"aa45a6b0-6b75-4596-a483-7a3ef4197ae2","year":2025},"citing_paper":{"arxiv_id":"2605.23024","last_updated":"2026-05-21T20:48:35Z","snapshot_observed_at":"2026-07-06T23:33:19.375527Z","submitted_at":"2026-05-21T20:48:35Z","title":"The Deterministic Horizon: Impossibility Results as Design Specifications for Trustworthy AI Systems","version":1},"reference_index":142,"source":"pdf_text","source_observed_at":"2026-05-25T05:29:39.640753Z"},"links":{"cited_paper":"/paper/2506.14530","citing_paper":"/paper/2605.23024"},"observation_digest":"sha256:710e05d5c84cc555c442f8e3a9c20edea2b99c3392da9ec6b403b1a09a011548","observation_id":"6a1e3411-87cc-4297-ad07-373987a4c8af","resolution":{"observed_at":"2026-05-25T05:30:22.698577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"cited_work":{"arxiv_id":"2506.14530","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.14530","snapshot_observed_at":"2026-07-02T12:16:57.389694Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Ran- domized Low-Rank Adapters","venue":null,"work_id":"aa45a6b0-6b75-4596-a483-7a3ef4197ae2","year":2025},"citing_paper":{"arxiv_id":"2606.05899","last_updated":"2026-06-04T09:05:59Z","snapshot_observed_at":"2026-07-06T23:45:51.910263Z","submitted_at":"2026-06-04T09:05:59Z","title":"High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T02:14:38.644041Z"},"links":{"cited_paper":"/paper/2506.14530","citing_paper":"/paper/2606.05899"},"observation_digest":"sha256:206895462856e85fe7cf24709a54e88ee97085794c369b8971b9ed1c3c6f4d5d","observation_id":"9c9d3486-dd12-4427-b999-c6dc16e62fd6","resolution":{"observed_at":"2026-07-02T12:16:57.391161Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14530/citation-record","integrity":"/paper/2506.14530/integrity","json":"/paper/2506.14530/citation-record.json","paper":"/paper/2506.14530"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-07T00:28:38.928811Z","title":"Qwen technical report, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:38.928811Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:ae07e81f0353800c30b6e6ded74e4a54a58b724cb98cad991f0c37d0874eb36a","observation_id":"4561add7-f94b-41d3-a25d-adc8865c0415","resolution":{"observed_at":"2026-08-07T00:28:38.928811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:39.007053Z","title":"Rademacher and gaussian complexities: Risk bounds and structural results","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.007053Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:6876477dc3c5e6e63bf319ac01b6bd2d67b448d78804fe41941deb14c18a4aeb","observation_id":"fe78cf12-c86e-46f4-8135-81a4c9ae5a9f","resolution":{"observed_at":"2026-08-07T00:28:39.007053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-07T00:28:39.096975Z","title":"Zhang, Han Bao, Hanwei Xu, Haocheng Wang, Haowei Zhang, Honghui Ding, Huajian Xin, Huazuo Gao, Hui Li, Hui Qu, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.096975Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:f7cccc835d33487184d8e1418c3cb172833f057472b50517f3e592ee7a83cfda","observation_id":"113461f1-a7e4-4c61-a371-caa50b6813bb","resolution":{"observed_at":"2026-08-07T00:28:39.096975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14314","last_updated":"2023-05-23T17:50:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-23T17:50:33Z","title":"QLoRA: Efficient Finetuning of Quantized LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14314","snapshot_observed_at":"2026-08-07T00:28:39.230103Z","title":"Qlora: Efficient finetuning of quantized llms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.230103Z"},"links":{"cited_paper":"/paper/2305.14314","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:6ccb6dbe701d19a00a87e3b51b8d225a116ffc1cf383626d88048fad1511c8a3","observation_id":"50f9a5b7-9f8e-448c-8342-2abd49537da1","resolution":{"observed_at":"2026-08-07T00:28:39.230103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.06904","last_updated":"2022-03-15T01:22:04Z","snapshot_observed_at":"2026-08-04T10:39:03.604973Z","submitted_at":"2022-03-14T07:56:32Z","title":"Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.06904","snapshot_observed_at":"2026-08-07T00:28:39.344281Z","title":"Delta tuning: A comprehensive study of parameter efficient methods for pre-trained language models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.344281Z"},"links":{"cited_paper":"/paper/2203.06904","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:27d8b7765e58b4250c074361ab8d8cc6500f643bbdbc9ae33864fd00cf5a1000","observation_id":"abeddf7b-7e53-4746-9c12-1baa38dae98f","resolution":{"observed_at":"2026-08-07T00:28:39.344281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:49.995891Z","title":"Efficient adaptation of large vision transformer via adapter re-composing","venue":null,"work_id":"e4d8b2d7-0880-4734-83da-256539f8de0e","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.437282Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:856fdca204262999ac1b81ceebf1ddc6fb262c71d2486f92ea7a815c5f5cbbb5","observation_id":"66c46c12-ee65-414d-830f-b44320ccf9a0","resolution":{"observed_at":"2026-08-07T00:28:50.121561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:39.545388Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.545388Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:3414a586ccca39f1902560d894993ccaa49c8684cb592c7684d427ca07bec261","observation_id":"b508df02-891a-4a8f-806b-cbf61f1320c4","resolution":{"observed_at":"2026-08-07T00:28:39.545388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:49.773573Z","title":null,"venue":null,"work_id":"648705ef-6fab-44ea-8edc-4e5741e1f6db","year":1999},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.651946Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:53b175ba316eef833cd5ac6da83076e55964d3d5874738a083049f67b2afbc36","observation_id":"7213516c-a363-4a30-80bd-f55e54363e7b","resolution":{"observed_at":"2026-08-07T00:28:49.855657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.01618","last_updated":"2022-08-02T17:50:36Z","snapshot_observed_at":"2026-08-02T23:40:32.342515Z","submitted_at":"2022-08-02T17:50:36Z","title":"An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.01618","snapshot_observed_at":"2026-08-07T00:28:39.775832Z","title":"An image is worth one word: Personalizing text-to-image generation using textual inversion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.775832Z"},"links":{"cited_paper":"/paper/2208.01618","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:03729ae5716974c3c7eb0e5de62bf37dda6d66288cba1d8134f5c5e2e267ab5d","observation_id":"56ffb907-59a7-4e1c-ac24-63047da71ab8","resolution":{"observed_at":"2026-08-07T00:28:39.775832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:39.874272Z","title":"Mahoney, and Kurt Keutzer","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.874272Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:d29b3d6fef152fa4f32dad066ff52bcfe106bc223e688390066765e9387263b0","observation_id":"fa65a0a5-7b93-4399-b84c-562da4ec4100","resolution":{"observed_at":"2026-08-07T00:28:39.874272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:49.612211Z","title":"Majorization of gaussian processes and geometric applications","venue":null,"work_id":"3919f374-db69-4a8b-881e-c607a5564c41","year":1992},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:39.996570Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:df2b186d7036d952f814d8ae7485d7a770d8d85b9b24c56dbf79ee9560f15a0d","observation_id":"f4b6a9f7-2615-4955-9b43-427ca31be702","resolution":{"observed_at":"2026-08-07T00:28:49.686408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:40.091662Z","title":"Xing, and Yoon Kim","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.091662Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:c01df12d1f02342b0c1ef282f0929c25d413f85a4d974ea05f2e37bc3efa565a","observation_id":"b4f42db1-5663-4f7f-b12f-c8ba9c298889","resolution":{"observed_at":"2026-08-07T00:28:40.091662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.11305","last_updated":"2023-07-02T21:16:39Z","snapshot_observed_at":"2026-08-03T06:10:43.690213Z","submitted_at":"2023-03-20T17:45:02Z","title":"SVDiff: Compact Parameter Space for Diffusion Fine-Tuning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.11305","snapshot_observed_at":"2026-08-07T00:28:40.177864Z","title":"Svdiff: Compact parameter space for diffusion fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.177864Z"},"links":{"cited_paper":"/paper/2303.11305","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:91c5ed85a980354d50d651d92d1eb563a2f38fc700ee9a6d7a6f2e66ef10cee2","observation_id":"f0203d22-dfab-4e6a-b124-4b0996eafdc0","resolution":{"observed_at":"2026-08-07T00:28:40.177864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14608","last_updated":"2024-09-16T02:54:50Z","snapshot_observed_at":"2026-08-04T09:07:42.158421Z","submitted_at":"2024-03-21T17:55:50Z","title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14608","snapshot_observed_at":"2026-08-07T00:28:40.291765Z","title":"Parameter-efficient fine-tuning for large models: A comprehensive survey, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.291765Z"},"links":{"cited_paper":"/paper/2403.14608","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:52104a592a9ca2d11bd5f03fe28f76bc41356c01a365ecb8ce67fcac4f54735c","observation_id":"aa035ff7-027f-4206-b7bc-9f822aab70fe","resolution":{"observed_at":"2026-08-07T00:28:40.291765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:49.394300Z","title":"Towards a unified view of parameter-efficient transfer learning","venue":null,"work_id":"2c45d43c-cf5e-4da0-a777-444a1d190f7a","year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.362788Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:c6cbcf552e46645d769b88e4aa841714cd4c648a5b309cd67f5b756f57da47ad","observation_id":"3c09a719-21bc-4eba-a884-caaa4848b48c","resolution":{"observed_at":"2026-08-07T00:28:49.503394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:40.443350Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.443350Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:0f0430a3f6c9dd6ca12c1af221e68bafb9b9b58fd48015db62aa39fb854013eb","observation_id":"34b0a033-e981-4074-abe3-524c78c567bf","resolution":{"observed_at":"2026-08-07T00:28:40.443350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:49.181525Z","title":"Lee, and Ernest K","venue":null,"work_id":"f2df4bbc-112d-4e1f-8399-0e9eac674326","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.543712Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:d825f7ad0ecc38e97619817d0447bfcb9fea043a536af73722a4337bda0b49b9","observation_id":"11f973e9-f08f-4330-b2f3-acef725af31e","resolution":{"observed_at":"2026-08-07T00:28:49.256101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:48.940846Z","title":"Nola: Networks as linear combination of low rank random basis, 2023","venue":null,"work_id":"61ac118b-a3e3-4a8f-8451-d1d6b95ff100","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.668862Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:39fb12b497d246e50e6a84800462e45aed51b1205acc45cea9e819e5f709e9fe","observation_id":"ff01a909-205a-4df8-86a0-0d7d4944b6fc","resolution":{"observed_at":"2026-08-07T00:28:49.048086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:40.807426Z","title":"Kopiczko, Tijmen Blankevoort, and Yuki M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.807426Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:df15eebf4cb74199bf56aeafb1cabeeded2a8b360a182c6a8accf1e183e9554b","observation_id":"b8789460-dd77-4dc0-87aa-35fc713d09b3","resolution":{"observed_at":"2026-08-07T00:28:40.807426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:48.760900Z","title":"Fast randomized low-rank adaptation of pre-trained language models with pac regularization","venue":null,"work_id":"1538eafd-6ecc-4cf3-aa1a-baa3f97464d7","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:40.926556Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:8364dc81fa4037301b10e281688998ed60f5963c12c2b70f623b16d72ce10eff","observation_id":"541f57db-7334-40aa-b1a0-1f3dd41ed6e1","resolution":{"observed_at":"2026-08-07T00:28:48.834854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:48.531862Z","title":"Graphadapter: Tuning vision-language models with dual knowledge graph","venue":null,"work_id":"de19ae76-a253-4712-9162-a4786f6096d0","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.067631Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:9d1c4dd9411f4b45fb96672ccc871eb2d7c01bdec923cb48edf62906d700e836","observation_id":"ebd7a1ed-7a2d-4cd4-a6c6-e02091c66606","resolution":{"observed_at":"2026-08-07T00:28:48.649763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:48.340372Z","title":"PAC -tuning: Fine-tuning pre-trained language models with PAC -driven perturbed gradient descent","venue":null,"work_id":"5065d2b9-d579-4659-814b-551a9f9d83fe","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.176156Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:5dab08d57592e2cc2e8fa20d7b25551eca9088061bea0056678b91794c93beb2","observation_id":"f4cfc307-67d0-4dc2-8225-8cd778f0636e","resolution":{"observed_at":"2026-08-07T00:28:48.424173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:48.123082Z","title":"Black, Adrian Weller, and Bernhard Sch \\\"o lkopf","venue":null,"work_id":"5ba169e5-6c18-4215-884e-ea8515c4a061","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.274110Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:41330305ef498ba995a06f2c9e5365c3751c30d94c820034408b7e980ee37d55","observation_id":"3867a646-87cf-4be4-b1ad-4d72927e85ac","resolution":{"observed_at":"2026-08-07T00:28:48.209986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:41.379277Z","title":"Lorentz, Manfred v","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.379277Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:3764224d8848af453944bcfd21dfe7ed1252283703d5f5ef9f74f6ec3185b426","observation_id":"1ab69905-c495-48c1-9d7a-9c9541688302","resolution":{"observed_at":"2026-08-07T00:28:41.379277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:47.898869Z","title":null,"venue":null,"work_id":"0795c900-5fc0-4e9e-bbe9-920f5d44c488","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.492582Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:d8133965b9aa4486e292898db79757fa1165f28a0432eeb3f70b859d8dbffb76","observation_id":"1d55c6f5-8e4c-4a96-adb3-649177fe3e7d","resolution":{"observed_at":"2026-08-07T00:28:48.019566Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:47.677548Z","title":"Score distillation via reparametrized DDIM","venue":null,"work_id":"f5dd35cf-4098-409e-aa05-9f772b2cf07b","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.587654Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:fa4dfe6e24db0e9ada0966b0a94b03be511b96d9b2167dc13df0e4ad2201df2f","observation_id":"3690a7d8-03c9-414d-9bd2-8f8e7f58d448","resolution":{"observed_at":"2026-08-07T00:28:47.795480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:41.718459Z","title":"A kernel-based view of language model fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.718459Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:9883aab42176d73b35058e8b976cf922a4f8953233981c5db9123d6e9f41cf01","observation_id":"d164aff2-ae6c-4575-902e-d1e73045401f","resolution":{"observed_at":"2026-08-07T00:28:41.718459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:47.487668Z","title":"Gpt-4 technical report, 2023","venue":null,"work_id":"29df948d-be5b-4aaf-9339-3f5ebc7b3fcc","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.816891Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:6d496308bbcd3f176a2916ebe0adc8a6be2b496de50e6ff9d15b16265d3143b6","observation_id":"3e22fc2a-5cd9-402e-ad74-c4fbd38a9945","resolution":{"observed_at":"2026-08-07T00:28:47.574736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:47.272479Z","title":"Bronstein","venue":null,"work_id":"0ad01382-7ead-4f62-aa88-1dd507424e57","year":2025},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:41.957389Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:3c1a452b1b70a513978690388fea3340db562e20f2542272cba99fc5cba7b3c1","observation_id":"8da69855-40d0-48f4-a95f-bfd8367b4e5e","resolution":{"observed_at":"2026-08-07T00:28:47.363321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:47.079772Z","title":"Limitations on approximation by deep and shallow neural networks","venue":null,"work_id":"8ba72b86-3282-4adc-af38-022cc46f500e","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.057445Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:b51ad5ef91cf2149a80ff7ecb2c23b3ecf0729dd6ca7ad09433c287903c12a18","observation_id":"89648b03-5004-4d30-8840-f6a7a9fad848","resolution":{"observed_at":"2026-08-07T00:28:47.190935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:46.903368Z","title":"Lipschitz widths","venue":null,"work_id":"1cd49496-252b-484f-af15-e2539d771cd1","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.150653Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:d205c39d7e4f630295aa1d93137e8d16788924a55fac9ea15fc15c1438129e0c","observation_id":"854de3ad-eaf4-4f2b-839d-665e4b541dea","resolution":{"observed_at":"2026-08-07T00:28:46.991644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:42.253468Z","title":"A dapter H ub: A framework for adapting transformers","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.253468Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:cdb3af5012b14840fae38ee84e5bcdd7ed78d641522615effb28558f1341fe83","observation_id":"bf96fc9f-178d-4688-83cc-1bcf311cd52d","resolution":{"observed_at":"2026-08-07T00:28:42.253468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T00:28:42.352895Z","title":"Qwen2.5 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.352895Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:249ff72792b2791defbf8bdd586551ea813248236b5b4aa33c57f28fe7849764","observation_id":"a54e5703-7b73-43b2-b778-6be9c9f21062","resolution":{"observed_at":"2026-08-07T00:28:42.352895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:42.432558Z","title":"What’s hidden in a randomly weighted neural network? In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.432558Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:8fd599145f0e1f04d73d1308888b936d2fb660dcda69a9b8b979e7b935f73e29","observation_id":"79884fff-ecb1-4609-b8cf-15a7ccb36cd2","resolution":{"observed_at":"2026-08-07T00:28:42.432558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:46.631127Z","title":"Pivotal tuning for latent-based editing of real images","venue":null,"work_id":"fb4f9cbc-608f-40c0-af80-c7ac916c8447","year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.522663Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:4103b53a3277d8261eccfc26a0ff313dfc16ece48811335141bc7e5c92524fc2","observation_id":"357b2f47-0bff-470f-a5e8-013702536f36","resolution":{"observed_at":"2026-08-07T00:28:46.773403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.10752","last_updated":"2022-04-13T11:38:44Z","snapshot_observed_at":"2026-07-06T12:20:47.369918Z","submitted_at":"2021-12-20T18:55:25Z","title":"High-Resolution Image Synthesis with Latent Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.10752","snapshot_observed_at":"2026-08-07T00:28:42.624359Z","title":"High-resolution image synthesis with latent diffusion models, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.624359Z"},"links":{"cited_paper":"/paper/2112.10752","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:dcdd6318054f5430856f6d472c41fff5aa98a5888fd70d804c6074e4d4d4a67e","observation_id":"cfd7f0de-117e-419b-b344-5744e303788e","resolution":{"observed_at":"2026-08-07T00:28:42.624359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:46.436215Z","title":"The littlewood--offord problem and invertibility of random matrices","venue":null,"work_id":"e3a33d4c-99c4-40c5-b2a1-283e3dcca55f","year":2008},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.711023Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:90cd6e0a69a5b5d0d65526372abe0d8077c3739fda4d630d1b70990a406ade0c","observation_id":"d32fa9d4-00a2-452b-b60e-b2fe0761d355","resolution":{"observed_at":"2026-08-07T00:28:46.510104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.12242","last_updated":"2023-03-15T17:52:27Z","snapshot_observed_at":"2026-07-06T13:45:31.237782Z","submitted_at":"2022-08-25T17:45:49Z","title":"DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.12242","snapshot_observed_at":"2026-08-07T00:28:42.818206Z","title":"Dreambooth: Fine tuning text-to-image diffusion models for subject-driven generation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.818206Z"},"links":{"cited_paper":"/paper/2208.12242","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:6ed0a43f4dc3b62f8497057b343af40a29887c0846c90cc9a7bdbf979fa6f0e6","observation_id":"8f303483-a3d2-454a-be45-585c19ca4afc","resolution":{"observed_at":"2026-08-07T00:28:42.818206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:46.205726Z","title":"A sharp inverse littlewood-offord theorem","venue":null,"work_id":"87f5fb4d-fa48-465b-b163-f73271ae0320","year":2010},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:42.913233Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:854ab0dce08b5b89d64fdf1df1001959d5c555662509d0c90ee8ab4f1c02ab92","observation_id":"86cb33c1-c06b-43e5-a491-66111d0e1f18","resolution":{"observed_at":"2026-08-07T00:28:46.304894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:46.033487Z","title":"Inverse littlewood-offord theorems and the condition number of random discrete matrices","venue":null,"work_id":"edc502da-eaa2-4281-af00-1d1e2ed0c0fc","year":2009},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.052065Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:ff61e325958be724f0eee5849f033d812a0353f8ac8cf93054e837d937e9092a","observation_id":"41aaaa0b-122e-4693-825c-d4961c3e6188","resolution":{"observed_at":"2026-08-07T00:28:46.096793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T00:28:43.144889Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.144889Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:deddec3feeb4dd104ea78565420ccfa2bb0eaf438e521f351fa2b3220d9e0da3","observation_id":"e6bc0598-fe79-4096-9b02-a4710728345c","resolution":{"observed_at":"2026-08-07T00:28:43.144889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:43.242662Z","title":"van der Vaart and Jon A","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.242662Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:3cfeea5b89c54fe349ebb407b08331ef0877c1254c454d02c499a3ecf44b0331","observation_id":"d0f64b80-6c96-4a8d-ae07-7739e50f08d6","resolution":{"observed_at":"2026-08-07T00:28:43.242662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1011.3027","last_updated":"2011-11-23T21:11:38Z","snapshot_observed_at":"2026-08-04T12:57:10.755670Z","submitted_at":"2010-11-12T20:20:28Z","title":"Introduction to the non-asymptotic analysis of random matrices","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1011.3027","snapshot_observed_at":"2026-08-07T00:28:43.365578Z","title":"Introduction to the non-asymptotic analysis of random matrices","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.365578Z"},"links":{"cited_paper":"/paper/1011.3027","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:33faac6053f6ec973fd76b5f39f9c3ecb92f0405acb15c8744da59137d9af386","observation_id":"6aab43da-e1e9-4e1c-b1ea-44f9d09d8db0","resolution":{"observed_at":"2026-08-07T00:28:43.365578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:43.453792Z","title":"Wainwright","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.453792Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:57a9ea3ad01965d9ae47e8cce7e35bb584c7eaa8f24d22a02839c0d56d3125f7","observation_id":"e4ad13c6-9212-487d-982f-f585b915301b","resolution":{"observed_at":"2026-08-07T00:28:43.453792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15777","last_updated":"2025-04-22T10:38:00Z","snapshot_observed_at":"2026-07-06T21:13:00.237924Z","submitted_at":"2025-04-22T10:38:00Z","title":"Tina: Tiny Reasoning Models via LoRA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15777","snapshot_observed_at":"2026-08-07T00:28:43.564233Z","title":"Tina: Tiny reasoning models via lora, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.564233Z"},"links":{"cited_paper":"/paper/2504.15777","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:52b2279921b57d27cebe5a73dbeb3345ee3f305b7e258079a54c21f1ee9934d3","observation_id":"69f5e61a-5f4d-4ef7-a578-3c7f63f99790","resolution":{"observed_at":"2026-08-07T00:28:43.564233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:43.677951Z","title":"Prolificdreamer: High-fidelity and diverse text-to-3d generation with variational score distillation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.677951Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:85995d61ec56484d9cab4a6816a3db8103974d82c4299cb4ea8182befb6513c1","observation_id":"56fa959c-e82f-4b0d-b2cb-6616d3ac55da","resolution":{"observed_at":"2026-08-07T00:28:43.677951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13171","last_updated":"2025-08-09T02:52:18Z","snapshot_observed_at":"2026-07-06T16:50:58.750467Z","submitted_at":"2023-11-22T05:28:59Z","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","version":2},"cited_work":{"arxiv_id":"2311.13171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.13171","snapshot_observed_at":"2026-08-07T00:28:44.681229Z","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","venue":"cs.LG","work_id":"e5796037-e852-411e-9895-d5ace7122ca7","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.789821Z"},"links":{"cited_paper":"/paper/2311.13171","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:fb8cd3f6d885fd1a406d22b1148343d4672732a4239768cce26430598245fa07","observation_id":"2f3462be-0449-490f-aa29-2eeb8c796be8","resolution":{"observed_at":"2026-08-07T00:28:44.797667Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00788","last_updated":"2023-03-02T03:00:36Z","snapshot_observed_at":"2026-07-06T13:58:56.329236Z","submitted_at":"2022-10-03T09:54:39Z","title":"Towards a Unified View on Visual Parameter-Efficient Transfer Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00788","snapshot_observed_at":"2026-08-07T00:28:43.893214Z","title":"Yu, Jianlong Chang, Lingbo Liu, Qi Tian, and Chang Wen Chen","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:43.893214Z"},"links":{"cited_paper":"/paper/2210.00788","citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:3c7647c33dced523998ff2b56af86c702a6c705ee80f4a76ecca06581dff8634","observation_id":"997c86c3-a6f3-4bae-b9a2-49aff0c6511e","resolution":{"observed_at":"2026-08-07T00:28:43.893214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:44.012742Z","title":"Low-rank few-shot adaptation of vision-language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:44.012742Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:00497b645af18d409df1f1de649bef3c59bcf559bc514a06fc06ffb78523ff55","observation_id":"39768ebb-a3dd-486d-8d9d-1587326f74b4","resolution":{"observed_at":"2026-08-07T00:28:44.012742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:45.840973Z","title":"The expressive power of low-rank adaptation","venue":null,"work_id":"dc5d7d91-2b8c-4c99-85d1-3609497c1c23","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:44.156637Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:51a6ab14656c5f77a15cde9d1fdc4de59ca1729351ea7b8d1d5e561c170ec1d0","observation_id":"f353bca3-3ffa-49b3-841d-5afac10463fe","resolution":{"observed_at":"2026-08-07T00:28:45.924218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:45.611925Z","title":"Lora-fa: Memory-efficient low-rank adaptation for large language models fine-tuning, 2023 a","venue":null,"work_id":"3333aab7-acd7-47dd-9c3d-42aebd86b8d2","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:44.235085Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:318d1038c10c64f7b4cd368aeb8eff2e230a83da380ace66dac92d021bcb0b7c","observation_id":"144cc3c5-2f78-4f30-9ee7-fd7e1f760a9c","resolution":{"observed_at":"2026-08-07T00:28:45.725703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:45.370977Z","title":"Adalora: Adaptive budget allocation for parameter-efficient fine-tuning, 2023 b","venue":null,"work_id":"96b01644-502a-42dd-8258-4e804bb0a5d5","year":2023},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:44.386103Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:ad96a737ef57399718ec4a37e752a07c8b133497dbc747284aa35d92ef55b61a","observation_id":"18cf8f03-14b9-4192-82c3-f1f3b08c5b4b","resolution":{"observed_at":"2026-08-07T00:28:45.488253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:28:45.139516Z","title":"Asymmetry in low-rank adapters of foundation models","venue":null,"work_id":"55cf1a68-c4da-4ff5-88b4-f16790b2cf13","year":2024},"citing_paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T00:28:44.499298Z"},"links":{"citing_paper":"/paper/2506.14530"},"observation_digest":"sha256:f4815006c264f1c0a82dc74f87f3efb04969c51ac9e6f34452909dd754a5cdce","observation_id":"2abf90d7-637f-4c94-91a2-51c7d68c6690","resolution":{"observed_at":"2026-08-07T00:28:45.238940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.14530","last_updated":"2025-06-17T13:55:13Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T05:41:51.344558Z","submitted_at":"2025-06-17T13:55:13Z","title":"Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":53},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 4 inbound Pith citation observations for arXiv:2506.14530."}