{"as_of":"2026-08-17T18:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5035a87dc65eb4eeef206de92ffccff1dfe6ecf4c3fff01524337e4f9d1e5cd3","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:58:52.619058Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.03152/citation-record","integrity":"/paper/2501.03152/integrity","json":"/paper/2501.03152/citation-record.json","paper":"/paper/2501.03152"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.11696","last_updated":"2023-11-20T11:56:25Z","snapshot_observed_at":"2026-08-16T14:41:53.322833Z","submitted_at":"2023-11-20T11:56:25Z","title":"Sparse Low-rank Adaptation of Pre-trained Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.11696","snapshot_observed_at":"2026-08-10T21:58:52.543402Z","title":"arXiv preprint arXiv:2311.11696","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.543402Z"},"links":{"cited_paper":"/paper/2311.11696","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:134d81d29e48b8f30be26c93e54ecd63370b769a49e5d38f1f548a1ac9b5ae87","observation_id":"68c52571-d031-4cc8-8afd-012665368e96","resolution":{"observed_at":"2026-08-10T21:58:52.543402Z","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-10T21:58:52.948533Z","title":"In Proceedings of the 62nd Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), pages 1932–1945","venue":null,"work_id":"3c979677-602a-4897-94c1-2a159236e8c6","year":1932},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.549108Z"},"links":{"citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:eb2ebbad93350fc63350ff177ac5845d3c67acef47ea23775ac531cfe5a274cb","observation_id":"b3a54f99-1edb-4b6f-8359-5b0d7da3857f","resolution":{"observed_at":"2026-08-10T21:58:52.953660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-10T21:58:52.553978Z","title":"arXiv preprint arXiv:2407.21783","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.553978Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:d93de9cb154ed5ace9050e498466094c2e952bf21a8bfe305b1464256a6ffeab","observation_id":"28d21235-2da8-4b27-8229-d00da5723e08","resolution":{"observed_at":"2026-08-10T21:58:52.553978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.06945","last_updated":"2024-05-08T18:16:09Z","snapshot_observed_at":"2026-08-16T15:16:25.575218Z","submitted_at":"2023-07-13T17:59:21Z","title":"In-context Autoencoder for Context Compression in a Large Language Model","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.06945","snapshot_observed_at":"2026-08-10T21:58:52.558962Z","title":"arXiv preprint arXiv:2307.06945","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.558962Z"},"links":{"cited_paper":"/paper/2307.06945","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:ff2537101e8d916550f6fb94b33b29670e5079d69a2b6d959ef65f6c1d9aa9ad","observation_id":"ba757bc8-b355-4435-9040-cfd4061f6034","resolution":{"observed_at":"2026-08-10T21:58:52.558962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13269","last_updated":"2024-08-19T03:31:19Z","snapshot_observed_at":"2026-08-16T15:13:34.132588Z","submitted_at":"2023-07-25T05:39:21Z","title":"LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Composition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13269","snapshot_observed_at":"2026-08-10T21:58:52.569132Z","title":"arXiv preprint arXiv:2307.13269","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.569132Z"},"links":{"cited_paper":"/paper/2307.13269","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:9498387d9a0d4c518e007a5d105e189c85036ea5d69655ec80d356cad9635f53","observation_id":"019b5182-381d-42ab-b947-6a1e708f9a56","resolution":{"observed_at":"2026-08-10T21:58:52.569132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.18311","last_updated":"2025-09-02T13:28:42Z","snapshot_observed_at":"2026-08-16T13:57:09.061731Z","submitted_at":"2024-04-28T20:44:53Z","title":"Towards Incremental Learning in Large Language Models: A Critical Review","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.18311","snapshot_observed_at":"2026-08-10T21:58:52.574174Z","title":"arXiv preprint arXiv:2404.18311","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.574174Z"},"links":{"cited_paper":"/paper/2404.18311","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:65a58abfabb26f049c2b9a8cf84a1ff3a552b4f09fcba647d96b42c19b1d5e91","observation_id":"c9e70e27-54a6-4b89-bb42-9ae954f6f404","resolution":{"observed_at":"2026-08-10T21:58:52.574174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18339","last_updated":"2024-05-31T07:56:08Z","snapshot_observed_at":"2026-08-16T14:50:08.381859Z","submitted_at":"2023-10-21T17:18:09Z","title":"When MOE Meets LLMs: Parameter Efficient Fine-tuning for Multi-task Medical Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18339","snapshot_observed_at":"2026-08-10T21:58:52.584385Z","title":"arXiv preprint arXiv:2310.18339","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.584385Z"},"links":{"cited_paper":"/paper/2310.18339","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:2fc8081e37f7c5c797099c094d5751d4307bb97ebba96a86f126e8b0770cd287","observation_id":"452ce9ff-988e-43a2-9400-d3e8d88adf0c","resolution":{"observed_at":"2026-08-10T21:58:52.584385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11046","last_updated":"2024-10-24T03:30:46Z","snapshot_observed_at":"2026-08-16T13:36:11.466197Z","submitted_at":"2024-07-08T12:32:10Z","title":"A Survey on LoRA of Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11046","snapshot_observed_at":"2026-08-10T21:58:52.589258Z","title":"arXiv preprint arXiv:2407.11046","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.589258Z"},"links":{"cited_paper":"/paper/2407.11046","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:a31466f0c7ad11dfb0ac31035f58241fe393ded66b155f69706f988e8048bb13","observation_id":"25d77728-3c89-49b4-b4d7-b43ce2105560","resolution":{"observed_at":"2026-08-10T21:58:52.589258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18406","last_updated":"2024-11-14T10:55:14Z","snapshot_observed_at":"2026-08-16T13:39:23.786786Z","submitted_at":"2024-06-26T14:57:38Z","title":"IRCAN: Mitigating Knowledge Conflicts in LLM Generation via Identifying and Reweighting Context-Aware Neurons","version":2},"cited_work":{"arxiv_id":"2406.18406","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.18406","snapshot_observed_at":"2026-08-10T21:58:52.720326Z","title":"IRCAN: Mitigating Knowledge Conflicts in LLM Generation via Identifying and Reweighting Context-Aware Neurons","venue":"cs.CL","work_id":"ee9adb54-6a71-48fe-a3a6-1bff8ae5ebe5","year":2024},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.599624Z"},"links":{"cited_paper":"/paper/2406.18406","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:664a653004833a12b907742cc06bfa592aa81795738e00914e18893ff49cf354","observation_id":"4bb3142e-730b-465f-b617-bdea726661ba","resolution":{"observed_at":"2026-08-10T21:58:52.727602Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17139","last_updated":"2024-10-14T04:36:09Z","snapshot_observed_at":"2026-08-16T14:23:11.665288Z","submitted_at":"2024-01-30T16:19:55Z","title":"Diff-eRank: A Novel Rank-Based Metric for Evaluating Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17139","snapshot_observed_at":"2026-08-10T21:58:52.604367Z","title":"arXiv preprint arXiv:2401.17139","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.604367Z"},"links":{"cited_paper":"/paper/2401.17139","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:2777979bb4b5416225b8d9048aaa4336d7b38bba0bfa8bbc2cc7f8b1781ccec8","observation_id":"bae52bfb-41b7-478b-9f05-0f695f45ca6b","resolution":{"observed_at":"2026-08-10T21:58:52.604367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11260","last_updated":"2024-02-17T12:25:31Z","snapshot_observed_at":"2026-08-16T14:17:45.799395Z","submitted_at":"2024-02-17T12:25:31Z","title":"MoRAL: MoE Augmented LoRA for LLMs' Lifelong Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11260","snapshot_observed_at":"2026-08-10T21:58:52.609235Z","title":"arXiv preprint arXiv:2402.11260","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.609235Z"},"links":{"cited_paper":"/paper/2402.11260","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:33b951c28c0baa41a3cfc41442e26a3b73a3de7ffec656ab83bc60037648c574","observation_id":"c05772d7-7620-4f5c-b558-4ec2cbf3b27e","resolution":{"observed_at":"2026-08-10T21:58:52.609235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17193","last_updated":"2024-02-27T04:18:49Z","snapshot_observed_at":"2026-08-16T14:15:03.626390Z","submitted_at":"2024-02-27T04:18:49Z","title":"When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17193","snapshot_observed_at":"2026-08-10T21:58:52.619058Z","title":"arXiv preprint arXiv:2402.17193","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.619058Z"},"links":{"cited_paper":"/paper/2402.17193","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:64c702745c69b42c88f1f36b2cd6f6cc855cc2765113ae802966c889c329e9c5","observation_id":"19cd457d-ea9d-4d08-be66-a3eb4c070df3","resolution":{"observed_at":"2026-08-10T21:58:52.619058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-10T21:58:52.594103Z","title":"arXiv preprint arXiv:1609.07843","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.594103Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:4c6e5b3444c6f3305732054b188f328101bb300be8e32bff314e9eb985a3ee5f","observation_id":"7ac267db-060f-4923-8662-4df32315cbea","resolution":{"observed_at":"2026-08-10T21:58:52.594103Z","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-08-14T19:36:07.505691Z","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-10T21:58:52.538147Z","title":"arXiv preprint arXiv:1803.05457","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.538147Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:b471c2c66140bc052cdec00994150db46d310a748d8a426630372f6742878dbc","observation_id":"cb1b10a5-34d8-4051-953e-aa65ff95121f","resolution":{"observed_at":"2026-08-10T21:58:52.538147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-08-15T09:37:44.321271Z","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-10T21:58:52.613977Z","title":"Biao Zhang, Zhongtao Liu, Colin Cherry, and Orhan Firat","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.613977Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:72282bd383149c0c47ed0a7e02ad0973359d7c3051440e4bff122c87b59f26c4","observation_id":"68e264ce-2140-4cc2-80a9-6c425b73a9f6","resolution":{"observed_at":"2026-08-10T21:58:52.613977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-10T21:58:52.579531Z","title":"arXiv preprint arXiv:2001.08361","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.579531Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:344f4e404f0dfd3566a1fa0cad052603e1270a7511bca31aa5a0a09634a94975","observation_id":"7d4ca7e0-040e-4c1c-aa51-337297d673ac","resolution":{"observed_at":"2026-08-10T21:58:52.579531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-17T18:04:53.578114Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-10T21:58:52.564571Z","title":"arXiv preprint arXiv:2106.09685","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.564571Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:536d8dd2c643c29256c1984d529e8635e465d2740772779f0a6275b638dee9d5","observation_id":"73840786-7bef-4d21-a9d1-b3a7ab8ff8c2","resolution":{"observed_at":"2026-08-10T21:58:52.564571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-10T21:58:52.532293Z","title":"arXiv preprint arXiv:2303.08774","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.532293Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:4850805d6f088e00c788dd3d83ef7071a7a20d843bbba4e9246c9414d891ebe0","observation_id":"3e716698-8a13-4248-8873-dd8a0e038cb2","resolution":{"observed_at":"2026-08-10T21:58:52.532293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14219","last_updated":"2024-08-30T21:17:17Z","snapshot_observed_at":"2026-08-17T03:25:04.404839Z","submitted_at":"2024-04-22T14:32:33Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14219","snapshot_observed_at":"2026-08-10T21:58:52.526772Z","title":"Josh Achiam, Steven Adler, Sandhini Agarwal, Lama Ahmad, Ilge Akkaya, Florencia Leoni Aleman, Diogo Almeida, Janko Altenschmidt, Sam Altman, Shyamal Anadkat, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:52.526772Z"},"links":{"cited_paper":"/paper/2404.14219","citing_paper":"/paper/2501.03152"},"observation_digest":"sha256:5ede6138a322e4ee1cb4e3e62f7aa5e5c0ac8113ed6106c8cb3243ab8690b553","observation_id":"6980b089-ed59-4f17-9c18-55bffee3eff8","resolution":{"observed_at":"2026-08-10T21:58:52.526772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.03152","last_updated":"2025-01-06T17:19:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T09:39:10.963454Z","submitted_at":"2025-01-06T17:19:19Z","title":"The Scaling Law for LoRA Base on Mutual Information Upper Bound"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":19},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2501.03152."}