{"as_of":"2026-08-10T11:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58b82fd4f3459d42c8782f4889628636ec82bc18ecd2d2ea411b492b324117c4","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T03:33:55.002375Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.27680/citation-record","integrity":"/paper/2607.27680/integrity","json":"/paper/2607.27680/citation-record.json","paper":"/paper/2607.27680"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:33:52.785671Z","title":"Annals of Statistics 33(4):1497--1537","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:52.785671Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:cbfb0a57e2abefc0bd945d61995c921f1da6170ce645e1f8186d054debed8e37","observation_id":"3c867719-47df-4e69-881e-fc7c5ee64c29","resolution":{"observed_at":"2026-08-01T03:33:52.785671Z","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-01T03:33:52.828806Z","title":"Machine Learning 79(1--2):151--175","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:52.828806Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:3a7b2985c58ee65cf22b5f6e710615850d29a445bd08d93c6afd5285a2ae1d1d","observation_id":"e394ea98-282d-4536-9ce1-1d620055ece2","resolution":{"observed_at":"2026-08-01T03:33:52.828806Z","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-01T03:33:52.885577Z","title":"Transactions on Machine Learning Research","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:52.885577Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:0aea392eb4d296e91d814b8545306e5f0b12d8ff255beddf9cb9cb589b1c6053","observation_id":"3306739a-2a5e-49a2-8861-991ce95aad55","resolution":{"observed_at":"2026-08-01T03:33:52.885577Z","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-01T03:33:52.927261Z","title":"IEEE Transactions on Information Theory 56(5):2053--2080","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:52.927261Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:1afbc70f761c742e7ce6e288776224c834630e5ea169b2e73f404e1110dea00e","observation_id":"832ca43c-13f1-4621-90e8-bdccbdc215fc","resolution":{"observed_at":"2026-08-01T03:33:52.927261Z","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-01T03:33:52.990799Z","title":"Wiley-Interscience","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:52.990799Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:a222c82845d440d7d76c72334116887a34de92b5f3cab633ffc89ffe409cd165","observation_id":"c9c00217-1068-424c-90a8-37f48542d5b9","resolution":{"observed_at":"2026-08-01T03:33:52.990799Z","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-01T03:33:53.048974Z","title":"Advances in Neural Information Processing Systems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.048974Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:493d0966e9f4efaa0da518e3e2a1dbbdc8223ee6f0107fb14faef572153ee5a3","observation_id":"3cfe07da-f526-4a4a-8de9-a8d01001520d","resolution":{"observed_at":"2026-08-01T03:33:53.048974Z","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-01T03:33:53.122863Z","title":"Johns Hopkins University Press","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.122863Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:2c1329d1849b58b2b4600e197daa87cf4b225e72a68e175235b7dd9b6b0c1d93","observation_id":"40ac8e6d-34d5-4eff-b7bd-44214ad99133","resolution":{"observed_at":"2026-08-01T03:33:53.122863Z","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-01T03:33:53.169759Z","title":"In: International Conference on Machine Learning (ICML)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.169759Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:4dda80a23a48782b46d465a39b6f348d1a43d732d70b02fd92ffbcf636735da7","observation_id":"8156f7d0-4e5a-4009-9016-2f4875558be2","resolution":{"observed_at":"2026-08-01T03:33:53.169759Z","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-01T03:33:53.217121Z","title":"arXiv preprint arXiv:240212354","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.217121Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:8f10c8344bba56258c801614a33d928cbe259d35d21bbf4a1846abf58c9d2eeb","observation_id":"d6961243-a1d4-4751-99a9-5207d96ae1bb","resolution":{"observed_at":"2026-08-01T03:33:53.217121Z","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-01T03:33:53.284378Z","title":"In: International Conference on Machine Learning (ICML)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.284378Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:28638a2fed1f3f49614218aa24abab3352e4108b6c77507ec23e3fafc5d84037","observation_id":"76249672-9a14-441d-a381-00fb4fdfde3a","resolution":{"observed_at":"2026-08-01T03:33:53.284378Z","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-07T07:43:16.294957Z","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-01T03:33:53.354479Z","title":"In: International Conference on Learning Representations (ICLR), ://arxiv.org/abs/2106.09685","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.354479Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:85c14514b4ff4d75255d26994239f1cea1f63c1a8f284e6e0984cc850ea31665","observation_id":"7308cd61-3e9f-4110-9341-308e34e151e1","resolution":{"observed_at":"2026-08-01T03:33:53.354479Z","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-01T03:33:53.417093Z","title":"arXiv preprint arXiv:240211867","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.417093Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:930c0b38344d578108141bd20507bf31299dfad33a3c3e7302954b20640cea64","observation_id":"1031c9ba-c64b-42fd-941c-19597e794a24","resolution":{"observed_at":"2026-08-01T03:33:53.417093Z","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-01T03:33:53.481398Z","title":"arXiv preprint arXiv:250614530","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.481398Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:096d2f761cc7de4f4c29e01be161cbfbaa7f7146309ea80c6729aeeb5bec963e","observation_id":"61008c5c-8c04-4ee5-b0d2-00063748b55e","resolution":{"observed_at":"2026-08-01T03:33:53.481398Z","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-01T03:33:53.557961Z","title":"\\'E cole d' \\'E t \\'e de Probabilit \\'e s de Saint-Flour","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.557961Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:fef26b77454759efe647ee03cf759408adb86d80a3c4b1213e3ab0d024221371","observation_id":"38f5caac-727f-48a7-bfc8-b6412c615ce4","resolution":{"observed_at":"2026-08-01T03:33:53.557961Z","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-01T03:33:53.639843Z","title":"Annals of Statistics 39(5):2302--2329","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.639843Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:f43723eb2c69db86503e8f1f370b8c409890fb8f2bf8e7a78a5859bcff49b9f3","observation_id":"a9afcf30-147d-4eff-84ca-6cba31263b8d","resolution":{"observed_at":"2026-08-01T03:33:53.639843Z","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-01T03:33:53.723279Z","title":"arXiv preprint arXiv:240603136","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.723279Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:afd353e28e1140c3a119e996f562893d351c17abbb86f1947313420c9dc54230","observation_id":"924f36fb-7c42-44e9-93d9-dbe4fc392724","resolution":{"observed_at":"2026-08-01T03:33:53.723279Z","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-01T03:33:53.796349Z","title":"In: International Conference on Learning Representations (ICLR)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.796349Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:37abdccbc72eb38c9ded5f41c57bebda18a80c3740e49bef5443996fd25bb4a6","observation_id":"e835673b-a758-4d66-becf-7ec0c0970424","resolution":{"observed_at":"2026-08-01T03:33:53.796349Z","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-01T03:33:53.889745Z","title":"Empirical Methods in Natural Language Processing (EMNLP)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.889745Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:9e4ec5c8518ec0379243635f668e70a55c9948e1a5b4ca82f5f9fc85f78857c8","observation_id":"9d497480-b3ad-48af-922b-b37263316ec5","resolution":{"observed_at":"2026-08-01T03:33:53.889745Z","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-01T03:33:53.911305Z","title":"In: Annual Meeting of the Association for Computational Linguistics (ACL)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.911305Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:163a1f0dee2a85d797b57eaa7851831cf3e49d002bcd549c252f334592c62360","observation_id":"19d9059e-d86f-4244-adb1-25d5082c3c7c","resolution":{"observed_at":"2026-08-01T03:33:53.911305Z","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-01T03:33:53.991804Z","title":"Advances in Neural Information Processing Systems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:53.991804Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:a2adbe501ced8438014d623e8eef7b6ddb03d8cf91176fd9defe72acd19670c4","observation_id":"a7eee352-72e1-4321-ab30-54c08ad43923","resolution":{"observed_at":"2026-08-01T03:33:53.991804Z","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-01T03:33:54.041033Z","title":"In: International Conference on Machine Learning (ICML)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.041033Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:e2fa092ff92bd034379b9a09e2bdcdfbc547ccd1719aaf12f02b902f11b546fa","observation_id":"2e31ad8b-582d-40fe-b045-d7e1b146a928","resolution":{"observed_at":"2026-08-01T03:33:54.041033Z","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-01T03:33:54.102470Z","title":"In: International Conference on Learning Representations (ICLR)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.102470Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:9bfafd9dafcee2a15e1c12df8bd3f21a1409e4c2cab1b81e0195af4b561a7132","observation_id":"11226325-c399-45e1-bfce-84c962a6bf08","resolution":{"observed_at":"2026-08-01T03:33:54.102470Z","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-01T03:33:54.186308Z","title":"arXiv preprint arXiv:241008305","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.186308Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:2db41ef122c06b891b7b199a5c444a9f8f7fecd2d1ff91b6a900166e916aec3a","observation_id":"8a3c7497-79a5-4537-9096-ab793efe859c","resolution":{"observed_at":"2026-08-01T03:33:54.186308Z","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-01T03:33:54.266488Z","title":"In: Conference on Learning Theory (COLT)","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.266488Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:8969258800184a9c0f0a1810eacbacf828b6c1096c44661977797445225f896c","observation_id":"de314c19-cc73-42b4-a0b8-03c95117aa53","resolution":{"observed_at":"2026-08-01T03:33:54.266488Z","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-01T03:33:54.357000Z","title":"In: Journal of Machine Learning Research","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.357000Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:6f63dbce5b4981b5766b00fa58bed75cb582dbd3b36b8a0de82f61214a216c5b","observation_id":"6bab990d-1591-4e85-a646-3256b34b3022","resolution":{"observed_at":"2026-08-01T03:33:54.357000Z","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-01T03:33:54.425763Z","title":"Annals of Statistics 39(2):1069--1097","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.425763Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:6803978721b0b0c29825c021e9ac5f24696a23fada50b057c20e89f96a2f0908","observation_id":"281c9b19-4b72-44f3-9786-4e66ad7e2ca1","resolution":{"observed_at":"2026-08-01T03:33:54.425763Z","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-01T03:33:54.488971Z","title":"Statistical Science 27(4):538--557","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.488971Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:b4aaf52822a15a4cdd0880e1601e540647ee6cd726040bdfb8d33c587568e056","observation_id":"b044aec0-4494-4e38-8a73-84b7e64185a1","resolution":{"observed_at":"2026-08-01T03:33:54.488971Z","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-01T03:33:54.535374Z","title":"Journal of Machine Learning Research 12:3413--3430","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.535374Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:fc7d51f35305f4e1678cde9402595b72a67ba079d52e5302f56d0a07e6d94ec9","observation_id":"e38d550e-300e-441a-9844-ccb01245066c","resolution":{"observed_at":"2026-08-01T03:33:54.535374Z","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-01T03:33:54.623324Z","title":"Cambridge University Press","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.623324Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:1ebf3a90a62d967da7eeb83dc69d841922fe8eaafbcfaa49987623d5073621e9","observation_id":"a183458a-4bb7-498d-9c41-58125ed6e15f","resolution":{"observed_at":"2026-08-01T03:33:54.623324Z","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-01T03:33:54.692052Z","title":"Journal of Machine Learning Research 19(1):2822--2878","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.692052Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:977b7c8d755f07072c16f7c39633b29c5b99a10a8eb348f71ed7a18bdabf07b8","observation_id":"6fd21371-300a-400d-87f4-9fd2ac122a0f","resolution":{"observed_at":"2026-08-01T03:33:54.692052Z","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-01T03:33:54.780979Z","title":"Proceedings of Research Workshop on Banach Space Theory (Iowa City) pp 169--185","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.780979Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:0ecbd100aa1731715d252dfd3bdb97e8149ceb48d80d2b3c111a5cdf9e688236","observation_id":"47868dfa-639d-459a-b149-8c18c0696453","resolution":{"observed_at":"2026-08-01T03:33:54.780979Z","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-01T03:33:54.839986Z","title":"Cambridge University Press","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.839986Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:b8db2005e2c94aeeccc3a040c4a64ca285f394f87541ccf14dbfd940576e1d3b","observation_id":"6e31476f-3a7f-43a5-a8c2-efcb923aa6c4","resolution":{"observed_at":"2026-08-01T03:33:54.839986Z","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-01T03:33:54.922480Z","title":"Cambridge University Press","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:54.922480Z"},"links":{"citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:ae135f87e6dd41f289584f9b692d0191b7712fbe4c27784149e39e4da8ccf668","observation_id":"51ef4712-d38a-4040-b133-33a1363d540e","resolution":{"observed_at":"2026-08-01T03:33:54.922480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17513","last_updated":"2024-03-18T02:13:24Z","snapshot_observed_at":"2026-08-10T09:46:48.454103Z","submitted_at":"2023-10-26T16:08:33Z","title":"The Expressive Power of Low-Rank Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17513","snapshot_observed_at":"2026-08-01T03:33:55.002375Z","title":"In: International Conference on Learning Representations (ICLR), ://arxiv.org/abs/2310.17513","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T03:33:55.002375Z"},"links":{"cited_paper":"/paper/2310.17513","citing_paper":"/paper/2607.27680"},"observation_digest":"sha256:185eed2b4867df68bbbb52c1915a374611174e822ced5dc3afa0f0c92f5e4910","observation_id":"d573aafb-caf5-4965-8dea-b34e57d121f6","resolution":{"observed_at":"2026-08-01T03:33:55.002375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27680","last_updated":"2026-07-30T04:56:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T11:04:47.865895Z","submitted_at":"2026-07-30T04:56:27Z","title":"Tight Sample Complexity for Low-Rank Adaptation: Matching Bounds and Rank Selection"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.27680."}