{"as_of":"2026-08-09T23:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e275a12728d291326d7d35c466081db9ee090b6221e8ca07d1a1f8aa5eb09347","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:05:22.619509Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:05:00.462706Z","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-04T07:59:40.238182Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00987","snapshot_observed_at":"2026-08-07T05:05:00.462706Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09105","last_updated":"2026-07-02T14:37:04Z","snapshot_observed_at":"2026-08-09T13:44:17.807274Z","submitted_at":"2025-06-10T16:32:05Z","title":"MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:05:00.462706Z"},"links":{"cited_paper":"/paper/2502.00987","citing_paper":"/paper/2506.09105"},"observation_digest":"sha256:3a2e067847fef568d6f0cd30613cee2859d3b787baaa79e614e11affd3685867","observation_id":"d71639ba-bbae-46ca-9a54-a60e0ad5a28a","resolution":{"observed_at":"2026-08-07T05:05:00.462706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"cited_work":{"arxiv_id":"2502.00987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00987","snapshot_observed_at":"2026-07-04T07:59:40.238182Z","title":"Randlora: Full-rank parameter-efficient fine-tuning of large models.arXiv preprint arXiv:2502.00987","venue":null,"work_id":"1b652910-37fc-40e9-acdd-9a95dbbfdc50","year":2025},"citing_paper":{"arxiv_id":"2509.21637","last_updated":"2026-05-07T23:03:51Z","snapshot_observed_at":"2026-08-02T14:46:32.268900Z","submitted_at":"2025-09-25T21:54:09Z","title":"BoHA: Blockwise Hadamard Product Adaptation for Parameter-Efficient Fine-Tuning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T13:47:15.959308Z"},"links":{"cited_paper":"/paper/2502.00987","citing_paper":"/paper/2509.21637"},"observation_digest":"sha256:3c1d889e6eedf80ab218c47ce119f26d045fc52d11f3d43cdf7da2b83ef8d7ef","observation_id":"c559c1b9-11ba-4567-97e2-ce7d734968c5","resolution":{"observed_at":"2026-05-18T13:51:26.040161Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"cited_work":{"arxiv_id":"2502.00987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00987","snapshot_observed_at":"2026-07-04T07:59:40.238182Z","title":"Randlora: Full-rank parameter-efficient fine-tuning of large models.arXiv preprint arXiv:2502.00987","venue":null,"work_id":"1b652910-37fc-40e9-acdd-9a95dbbfdc50","year":2025},"citing_paper":{"arxiv_id":"2604.04440","last_updated":"2026-04-09T03:32:05Z","snapshot_observed_at":"2026-07-06T22:53:24.585766Z","submitted_at":"2026-04-06T05:39:31Z","title":"Training Transformers in Cosine Coefficient Space","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T20:09:39.611239Z"},"links":{"cited_paper":"/paper/2502.00987","citing_paper":"/paper/2604.04440"},"observation_digest":"sha256:f4424bdb8413c630c2e7c2f2b39e05832bebe5b56aca35f7c01a23f3ec9a1c1a","observation_id":"5c74edfa-3e47-4152-ab80-1fe430e76eb9","resolution":{"observed_at":"2026-05-10T22:10:50.618392Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"cited_work":{"arxiv_id":"2502.00987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00987","snapshot_observed_at":"2026-07-04T07:59:40.238182Z","title":"Randlora: Full-rank parameter-efficient fine-tuning of large models.arXiv preprint arXiv:2502.00987","venue":null,"work_id":"1b652910-37fc-40e9-acdd-9a95dbbfdc50","year":2025},"citing_paper":{"arxiv_id":"2605.29498","last_updated":"2026-05-28T07:22:39Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:22:39Z","title":"Mask the Target: A Plug-and-Play Regularizer Against LoRA Forgetting","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T07:36:24.624420Z"},"links":{"cited_paper":"/paper/2502.00987","citing_paper":"/paper/2605.29498"},"observation_digest":"sha256:eef12c2bcfed2eccb5c91b964e760ac3b5f5e3d7bd6f9b9bb8d02ff5344a48cc","observation_id":"e34e35a1-07a0-4dea-b2c9-4fa591c3143d","resolution":{"observed_at":"2026-06-29T07:43:14.114918Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"cited_work":{"arxiv_id":"2502.00987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00987","snapshot_observed_at":"2026-07-04T07:59:40.238182Z","title":"Randlora: Full-rank parameter-efficient fine-tuning of large models.arXiv preprint arXiv:2502.00987","venue":null,"work_id":"1b652910-37fc-40e9-acdd-9a95dbbfdc50","year":2025},"citing_paper":{"arxiv_id":"2606.21935","last_updated":"2026-06-20T08:07:59Z","snapshot_observed_at":"2026-08-02T12:14:20.498770Z","submitted_at":"2026-06-20T08:07:59Z","title":"CoRDE: Concept-Prior Routed Diffusion Experts for Structural Generalization in Robot Manipulation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T12:20:55.565704Z"},"links":{"cited_paper":"/paper/2502.00987","citing_paper":"/paper/2606.21935"},"observation_digest":"sha256:38979cd2c21add184482561fc2a2557c210420f9cd555aa884d91adec2090111","observation_id":"e7c27703-dcca-43af-8046-6e9b295b6f9d","resolution":{"observed_at":"2026-07-04T07:59:40.239675Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00987/citation-record","integrity":"/paper/2502.00987/integrity","json":"/paper/2502.00987/citation-record.json","paper":"/paper/2502.00987"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T17:05:23.254802Z","title":"Intrinsic dimensionality explains the effectiveness of language model fine-tuning","venue":null,"work_id":"a47c6fc1-cfb4-493c-bce7-a3bab6acc287","year":2021},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.476806Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:e8fbc184297e82d3c7c78547f5482235b9ea023015b5ddb9829e0b6afdb41fda","observation_id":"a6ff0c57-a818-46b1-84a0-5e3da0b32241","resolution":{"observed_at":"2026-08-09T17:05:23.258159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17604","last_updated":"2025-08-19T19:14:56Z","snapshot_observed_at":"2026-07-06T18:20:52.408832Z","submitted_at":"2024-05-27T19:07:13Z","title":"LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17604","snapshot_observed_at":"2026-08-09T17:05:22.480219Z","title":"Lora-xs: Low-rank adaptation with extremely small number of parameters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.480219Z"},"links":{"cited_paper":"/paper/2405.17604","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:c68b006cd4c5c81074a9f6538437de86a8ca4f6462f00aab7f39cb480a08fba4","observation_id":"564d14ce-5b4c-4847-9416-2652b17c7bac","resolution":{"observed_at":"2026-08-09T17:05:22.480219Z","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-09T17:05:23.240540Z","title":"Random projection in dimensionality reduction: applications to image and text data","venue":null,"work_id":"c155b7ee-badf-45cb-b757-53b2723b414d","year":2001},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.483502Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:9dc5a32ffa874facb136b57bdba888891f193b9d949c229a121bb1cd5553c453","observation_id":"e8b98d16-8757-417e-a64e-fb65c655a55b","resolution":{"observed_at":"2026-08-09T17:05:23.248427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.231061Z","title":"Piqa: Reasoning about physical commonsense in natural language","venue":null,"work_id":"f825e314-8ccc-48a9-afcb-f258a2a3b81f","year":2020},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.487080Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:ab752180397e8bd3e7996a65d60af90ecf24943ab9440a713bbcb8599a55566e","observation_id":"7f2ec47f-96b3-43ae-a8a8-592c3b9f400f","resolution":{"observed_at":"2026-08-09T17:05:23.234275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.221775Z","title":"Reproducible scaling laws for contrastive language-image learning","venue":null,"work_id":"eb0fa175-82ff-4d54-9b6e-f2998a9572fe","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.490349Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:f3d7973a3b5c7f982162366c78a5a65a0b1ade58b14b2c0522202c5724d25337","observation_id":"d90c4c79-8c87-40ae-abb6-bf8f7621cead","resolution":{"observed_at":"2026-08-09T17:05:23.224938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-09T17:05:22.493400Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.493400Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:7a2dca98670b269e4fcaac8576e8d47111076833c8a85c948c83618cc294bd46","observation_id":"7e08daf0-7a3b-48b2-8239-f45a47d9f526","resolution":{"observed_at":"2026-08-09T17:05:22.493400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-09T17:05:22.497550Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.497550Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:e8656ff5dffed179916463475a93b31f595e1db0622f0f48f29166ce4832f0de","observation_id":"7e231fb6-19fe-4803-9e9c-f09e5a28f645","resolution":{"observed_at":"2026-08-09T17:05:22.497550Z","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-09T17:05:22.500769Z","title":"Parameter-efficient fine-tuning for large models: A comprehensive survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.500769Z"},"links":{"cited_paper":"/paper/2403.14608","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:2048764050b6f573ab5c0d69aac34b895fb547539c8b9e7f4c4905c40d89bd4b","observation_id":"c5857b1b-cbc5-488e-98ea-d5b02bb9393f","resolution":{"observed_at":"2026-08-09T17:05:22.500769Z","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-09T17:05:23.212485Z","title":"Lo RA : Low-Rank Adaptation of Large Language Models","venue":null,"work_id":"539c2a81-90a5-4cff-a78f-cfe819668c9b","year":2022},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.504144Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:faf2144b8ec0dac684fbb1a9a8292455681ae0ad75b93d52cc733c851b5d3dcc","observation_id":"c700d5ac-cb9d-4f71-9c14-bc2bac8119af","resolution":{"observed_at":"2026-08-09T17:05:23.215475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01933","last_updated":"2023-10-09T15:38:46Z","snapshot_observed_at":"2026-08-09T04:45:14.956800Z","submitted_at":"2023-04-04T16:31:37Z","title":"LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01933","snapshot_observed_at":"2026-08-09T17:05:22.507305Z","title":"Llm-adapters: An adapter family for parameter-efficient fine-tuning of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.507305Z"},"links":{"cited_paper":"/paper/2304.01933","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:2361c0ce8af8c5372e4a8b2159f037c265ce63b9eab4d248674c3920d89c4852","observation_id":"2ebf00cd-a208-44ae-b720-58e0499b173d","resolution":{"observed_at":"2026-08-09T17:05:22.507305Z","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-09T17:05:23.203340Z","title":"Maple: Multi-modal prompt learning","venue":null,"work_id":"6a424579-f164-4c54-9d5a-f5dbe31cb7df","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.510953Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:4f41b486eb4d68da1c3d33cc5351635e820832a206b3cfe30bfb8c206223c8ef","observation_id":"a0aaa559-143c-4f2c-b735-a382fc1ee484","resolution":{"observed_at":"2026-08-09T17:05:23.206645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.193653Z","title":"Self-regulating prompts: Foundational model adaptation without forgetting","venue":null,"work_id":"addf19ee-4dcc-4e46-82ee-066697691e42","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.514249Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:b930c7216ff5c8a6631e638d13a10dac80187452a1a6923223d5f1caad1f5546","observation_id":"7b3e1f6e-68aa-4c2b-b4fb-127479189546","resolution":{"observed_at":"2026-08-09T17:05:23.196853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.184098Z","title":"NOLA: Compressing LoRA using Linear Combination of Random Basis","venue":null,"work_id":"26a8aaec-d52f-4538-b7ee-2c21ce304015","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.517206Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:494184d26fa637341f14607638c1df562d9acef868ccba35108a2615f26534c4","observation_id":"5cd173a0-db59-415f-b424-db2158701718","resolution":{"observed_at":"2026-08-09T17:05:23.187244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.175097Z","title":"Vera: Vector-based random matrix adaptation","venue":null,"work_id":"ebd0dc2b-03eb-467e-b194-90617eb0d974","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.520095Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:cad2c55345566617f3e323482c906b12a169f8771f2591005163e57fdf4e6080","observation_id":"b4d5d1d6-e799-4929-94eb-b1b9f3b85334","resolution":{"observed_at":"2026-08-09T17:05:23.178219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.165513Z","title":"Similarity of neural network representations revisited","venue":null,"work_id":"896a2653-dbc6-4d2c-8b30-6628bafd40ed","year":2019},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.523117Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:79b6d9c258cdf38ddaf4dbd147d3bd3d311c96183821f7b4671146ea972caea4","observation_id":"f3f6763f-bc33-4faf-a3e5-86834796c4a9","resolution":{"observed_at":"2026-08-09T17:05:23.168603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.156513Z","title":"Krizhevsky, I","venue":null,"work_id":"14624c9a-184e-4cdc-91d2-a39ef1ec2c34","year":2012},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.526072Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:bccf2cafb94804f83126abe5b4329cff1d3c85864262d37b77f2b2105ee73637","observation_id":"d9f6f64b-b3a9-4df5-8cbe-51a811718083","resolution":{"observed_at":"2026-08-09T17:05:23.159360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.147759Z","title":"Measuring the instrinsic dimension of objective landscapes","venue":null,"work_id":"bf1023b3-75af-4b6f-a541-1ce370696361","year":2018},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.529004Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:b5f0be9b57390bb7ad942c528d1e33045524a8fbf598e235e538651f8976e374","observation_id":"de1421f7-4c4a-4ad8-8df2-cbc39294ac09","resolution":{"observed_at":"2026-08-09T17:05:23.150811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.138559Z","title":"Very sparse random projections","venue":null,"work_id":"7643f156-128e-4116-b8b7-d906b4154423","year":2006},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.531898Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:a0991f0d5d84e13f489485a0dacae88251137a67342a67175c54d8c36deb789f","observation_id":"e4891c77-a044-4f03-a529-7e7236ddfa61","resolution":{"observed_at":"2026-08-09T17:05:23.141565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.129785Z","title":"Extensions of lipschitz maps into a hilbert space","venue":null,"work_id":"1a2e8926-0a9c-42a8-92c6-607179810ffe","year":1984},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.534785Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:a0ff6bbc6f815288b6ea4e77a8e8a732e818d7c82fc23a1f553c0126be91eaee","observation_id":"2e53b143-1ef9-401b-ac40-67325cb4650c","resolution":{"observed_at":"2026-08-09T17:05:23.132818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.120822Z","title":"SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors","venue":null,"work_id":"235f706a-a0dc-4b97-8f29-b8bfc06d2eda","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.538289Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:00ede25be5718ef38fb3347b6e7366a146f7f2f2cddf20d664f9635a99839c79","observation_id":"b48f03fd-956b-42b1-b622-d3e6c1f8b0d9","resolution":{"observed_at":"2026-08-09T17:05:23.123905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.111320Z","title":"Dora: Weight-decomposed low-rank adaptation","venue":null,"work_id":"57fe9d23-9efc-4bca-bc8f-97f3fa400a3b","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.541304Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:7470a74b73b0f94c3e051b7ddf3f536c521b83b2d6d9ab90c13075bb2d3a8720","observation_id":"59c17187-7e81-40e2-92c5-5e35ce849d9f","resolution":{"observed_at":"2026-08-09T17:05:23.114616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-09T17:05:22.544317Z","title":"RoBERTa: A robustly optimized BERT pretraining approach","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.544317Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:2d4feb9b60d92e586954129fa4d15b0a9eacda0f96290a17a5df6fffddf844e8","observation_id":"7af1b770-819c-44a8-bb45-af26235e0c49","resolution":{"observed_at":"2026-08-09T17:05:22.544317Z","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-09T17:05:23.101476Z","title":"Pissa: Principal singular values and singular vectors adaptation of large language models","venue":null,"work_id":"e697968b-dbfc-4946-875a-d3963580121c","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.547394Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:ee6b6f4496fd566c515b34454fc84181e170f9dd64435b3d56cd4a45172d82e1","observation_id":"803b71a3-43a3-4e52-b3ec-16dbaca462d5","resolution":{"observed_at":"2026-08-09T17:05:23.104930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-08-08T02:19:52.596062Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-09T17:05:22.550347Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.550347Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:e69aa18f5589dcb70fdbbcbc688ee8deab652ccc9140438e33e7959f053d8040","observation_id":"5c01ad9c-f8ae-4674-9c3f-77fec640517e","resolution":{"observed_at":"2026-08-09T17:05:22.550347Z","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-09T17:05:23.091267Z","title":"Pranc: Pseudo random networks for compacting deep models","venue":null,"work_id":"70670288-22d4-4650-b27a-5fd333ae247e","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.553531Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:292638e648091271a78ff8d61fc295854115c730dbb82121a38a323dc31aacdd","observation_id":"7927dd17-ad99-485c-b131-2b70145b07b7","resolution":{"observed_at":"2026-08-09T17:05:23.095064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.081693Z","title":"The E2E dataset: New challenges for end-to-end generation","venue":null,"work_id":"ea5e1cff-a8ec-4729-9dc9-a76332001489","year":2017},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.556110Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:de8fe63449efdc0c459f31e4748da5335cc25af754cbc421f3797ff5c177aca6","observation_id":"7459b96e-d36b-4945-97f1-0420efde8960","resolution":{"observed_at":"2026-08-09T17:05:23.084980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.072759Z","title":null,"venue":null,"work_id":"849afd34-8d72-46e1-a8f7-bfb97b415afc","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.558877Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:4a3e39d7d3d8f79702669428f405918c841a47c445f13ba90b9439f8bb43b162","observation_id":"7438bc69-f8b2-4ee1-ba18-24b14d012971","resolution":{"observed_at":"2026-08-09T17:05:23.075723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.063323Z","title":"Language models are unsupervised multitask learners","venue":null,"work_id":"e06c80ce-1d1f-40d7-ab72-14e25996bdd9","year":2019},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.562726Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:19c40fbd1e6f78126e9d63aad1fb5ec807f760892af1367c60131a5e88cc1443","observation_id":"9440ded0-10ed-4efc-808f-82801de28c42","resolution":{"observed_at":"2026-08-09T17:05:23.066403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.054188Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"67aa6439-6be6-4aa1-9985-cd5db1bb35dd","year":2021},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.565588Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:c169a66b531cc367f8e89601f860c9f890f8bbf6264b552780b7e425df1a76e5","observation_id":"c68669df-d35d-4285-991a-fc916143e8e6","resolution":{"observed_at":"2026-08-09T17:05:23.057433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.045084Z","title":"Winogrande: An adversarial winograd schema challenge at scale","venue":null,"work_id":"cbd84cf5-12e1-4aec-8fa8-1bd5bca86d44","year":2021},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.568378Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:1d578813356ddb2408548892508c2a80f184786ac259ad40fc6846ebf4aa59a4","observation_id":"8c7a03ec-5949-4ef0-9777-d0b72ba81dfe","resolution":{"observed_at":"2026-08-09T17:05:23.048061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09728","last_updated":"2019-09-09T17:29:55Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-04-22T05:36:37Z","title":"SocialIQA: Commonsense Reasoning about Social Interactions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09728","snapshot_observed_at":"2026-08-09T17:05:22.571084Z","title":"Socialiqa: Commonsense reasoning about social interactions","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.571084Z"},"links":{"cited_paper":"/paper/1904.09728","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:ffad4842811d57f4c4fc62543371f7c2e242eeac2597e274f4dd23b4373a0ea4","observation_id":"725e56e2-704a-459d-ab76-1adfcb59f5d0","resolution":{"observed_at":"2026-08-09T17:05:22.571084Z","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-09T17:05:23.035783Z","title":"HydraLoRA: An Asymmetric LoRA Architecture for Efficient Fine-Tuning","venue":null,"work_id":"20d8fcbb-d799-4c6c-a77d-f336396110b7","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.574493Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:ad130aa6ac558b48c3315875b3d994280fe86fb5b3d77e4bf79cdbd7097abaee","observation_id":"3919879a-b3a8-4ef9-a436-39f2fd6f3af1","resolution":{"observed_at":"2026-08-09T17:05:23.038650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.027002Z","title":null,"venue":null,"work_id":"1d2af511-c500-49c7-a761-9cddac038454","year":2019},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.577448Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:bfd2136afbed22ac3b5d42710f522fca7eeb726abeb95cac97f92e341b5ccabb","observation_id":"4513ac2b-03e8-4e48-93c4-6866016b69da","resolution":{"observed_at":"2026-08-09T17:05:23.029772Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:23.015999Z","title":"Low-Rank Few-Shot Adaptation of Vision-Language Models","venue":null,"work_id":"4705121c-c8fa-4066-bd08-19cc01aaef58","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.580373Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:496397fd35def6259afdf468c5bd4dfe2555e75b105ea3b9a92577dd04034d1d","observation_id":"87f6fa6d-37b9-4fb8-898b-3effcad85104","resolution":{"observed_at":"2026-08-09T17:05:23.020345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-09T17:05:22.583219Z","title":"Hellaswag: Can a machine really finish your sentence? arXiv preprint arXiv:1905.07830, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.583219Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:fab5caad7ddfc09f4c652ac4856845ba87497326735487765786b84bbcfa92cd","observation_id":"c1920d05-af0a-4705-88fa-35a026b8843b","resolution":{"observed_at":"2026-08-09T17:05:22.583219Z","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-09T17:05:23.006449Z","title":"Knowledge Composition using Task Vectors with Learned Anisotropic Scaling","venue":null,"work_id":"6be6e78b-e11f-4f44-be8c-3b81289c5cdb","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.586543Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:19e99d6e07a097b82e574724ff8ad260da52701ccd5d179152db4fbe84a08315","observation_id":"3f32431c-7dc1-4dbe-ab21-54c15cb567df","resolution":{"observed_at":"2026-08-09T17:05:23.009477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:22.997169Z","title":"Dept: Decoupled prompt tuning","venue":null,"work_id":"3bb265bb-a7dd-410d-9635-e5646190907d","year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.589496Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:86b545970423ba0bee32dcd9d628befd431e143a4138a690649dbcd58dea184b","observation_id":"4b6766d1-d757-41bf-943f-00b7f635d2d5","resolution":{"observed_at":"2026-08-09T17:05:23.000184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:22.986906Z","title":"AdaLoRA: Adaptive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":"7cb53f59-8dc2-471a-861a-cf2a68624976","year":2023},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.592973Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:d687de02c06eae595a575d1d26d743003fa4f453b2bae5cad63623d45616edd9","observation_id":"4f07b158-3a01-4e0d-b579-1ac7a66c4029","resolution":{"observed_at":"2026-08-09T17:05:22.990258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09113","last_updated":"2024-03-17T17:55:47Z","snapshot_observed_at":"2026-08-09T20:14:29.239440Z","submitted_at":"2024-03-14T05:29:35Z","title":"AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09113","snapshot_observed_at":"2026-08-09T17:05:22.596077Z","title":"AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.596077Z"},"links":{"cited_paper":"/paper/2403.09113","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:7fead1acdc3658435b1fd09ac49eaf38dda92cb32fe5c0f6091cd6c45bff2233","observation_id":"fedb0fa4-2164-4baf-b5ad-4a5b26e4d878","resolution":{"observed_at":"2026-08-09T17:05:22.596077Z","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-09T17:05:22.976742Z","title":"Conditional prompt learning for vision-language models","venue":null,"work_id":"7ea1268f-2338-495d-a5b0-909036b6d9b5","year":2022},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.599405Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:661b2d71b5c085c0e7c33b1a87931b3b2a605d946eae75c5d871c1792aa32051","observation_id":"cedcc9d3-f3b4-4cfd-8cca-ce2a74daebc8","resolution":{"observed_at":"2026-08-09T17:05:22.980202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T17:05:22.965261Z","title":"Learning to prompt for vision-language models","venue":null,"work_id":"94aa3cd2-8647-481a-be49-ab31e62902b5","year":2022},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.602378Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:58e34252094b396d9c1539fa94b08ca3caa37ac01659e26f99df9694f0fcc939","observation_id":"09afea43-ec91-4d0c-bcb5-5c683e46037b","resolution":{"observed_at":"2026-08-09T17:05:22.970160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02528","last_updated":"2025-07-25T22:38:22Z","snapshot_observed_at":"2026-08-03T17:51:07.226078Z","submitted_at":"2024-06-04T17:50:34Z","title":"Scalable MatMul-free Language Modeling","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02528","snapshot_observed_at":"2026-08-09T17:05:22.605380Z","title":"Scalable MatMul-free Language Modeling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.605380Z"},"links":{"cited_paper":"/paper/2406.02528","citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:07dd069fb4c38b7e60588d229e99a368aeba1586bcdf79a8c9eb05f6b0f0d59c","observation_id":"9e678fa9-e5d7-4580-a0cb-f877f0b197cf","resolution":{"observed_at":"2026-08-09T17:05:22.605380Z","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-09T17:05:22.608571Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.608571Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:eeb6abf7f6cde598203a3d87f017e9799632996112205a602ec4e64e29c06645","observation_id":"deb6a3bb-e2af-470c-be39-994f74c15517","resolution":{"observed_at":"2026-08-09T17:05:22.608571Z","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-09T17:05:22.612580Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.612580Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:da9a64e0a0868330f9bbe737e3cf7e2334198c1ce8a2b4f3d73c0e0ce086395b","observation_id":"9f008da8-9f80-408a-b55c-0a451d054b87","resolution":{"observed_at":"2026-08-09T17:05:22.612580Z","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-09T17:05:22.616373Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.616373Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:246e95053c8f0e5a78ba831558a2dee64de9dcb121c12b3cd0f873401e31b3cc","observation_id":"47fbf239-2f82-4a3f-8ff1-d114a2c5fa0f","resolution":{"observed_at":"2026-08-09T17:05:22.616373Z","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-09T17:05:22.619509Z","title":"f FpE 5 ¡p;ơ̩P ^ 4 t H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T17:05:22.619509Z"},"links":{"citing_paper":"/paper/2502.00987"},"observation_digest":"sha256:f8e93bae307ffb696ef986acf5e90d856be796f94f0b6c055c02ec04161f5513","observation_id":"c44c662a-734b-4398-af0d-c97bc7dc2d7d","resolution":{"observed_at":"2026-08-09T17:05:22.619509Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.00987","last_updated":"2025-03-12T00:43:45Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T16:57:42.833492Z","submitted_at":"2025-02-03T01:59:45Z","title":"RandLoRA: Full-rank parameter-efficient fine-tuning of large models"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":46},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 5 inbound Pith citation observations for arXiv:2502.00987."}