{"as_of":"2026-08-09T03:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78b548da07d15082e600ee3bc4d068ef658453c4e00977706634109c2d0ffb4a","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-08T06:32:00.761636+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-06T04:52:17.506657Z","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:b242f4f1d48edde75ae8fb04d9ffedef96b51f669ee0d9980e60c5bddb1467db","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-06T04:52:17.506657Z","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:638ae64a75aaf4aa66eaf10e6706b3b0dd8b7929837f9f46581841a42360966c","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-06T04:52:17.506657Z","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:1a71af098e0843cd2d8d759ec179f40f7b11eef59b6e46aeeb724f0d15bf1fbe","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-06T04:52:17.506657Z","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:0a68136f7b712055bd98c98659c609142c12cdff0429b69dd8fc948cffffb243","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-06T04:52:17.506657Z","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:ccb5eac4aa2410336e4527ed1bd276aef64041050362f27d44ea4269f540118e","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-06T04:52:17.506657Z","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:964159e6fa944b28145ea750087bef85263ecba16ae2dd6e33f05d144a030440","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-06T04:52:17.506657Z","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:e2c04d57c36e2010435f84bf7e8f7f3c07cd9c53cd7f6392dbdcfe33d1eeb881","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-06T04:52:17.506657Z","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:0863c702b6f032abbc6b140b242f16634eb1e414cf6b652162f773c361fc0a3e","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-06T04:52:17.506657Z","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:9ece7f2a2a1e16619c8b23b29d605e31e2e00b1f43a85228893a5dbd92c1e187","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-06T04:52:17.506657Z","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:8feb6892240027e90fc15cda2486aa9ae3948e06ee5f7da659a473035b3d8c9f","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-06T04:52:17.506657Z","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:7b70cb6abc06486c7e068dd8bad1be56600645863bece7e3f059729d26520e7b","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-06T04:52:17.506657Z","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:fd55c62462ca507df38cb2f735fcca6d05e674a04f6c90cfb189d3b3ac592b30","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-06T04:52:17.506657Z","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:ad5408b1e0fe09096c02e4b846bcd8b5def11e4c1ff34fca055b46aabbec8294","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-06T04:52:17.506657Z","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:ebfc3a072b4ea09dc4b819aa426b5d31b42238900fa5d955a9ed2c4ee58e190f","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-06T04:52:17.506657Z","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:73888f479b10efe224762bdd40723ffee1f1d61f66ad8b08d83d25a7c6228b19","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-06T04:52:17.506657Z","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:caffabfa51d176bfc94e3cdfc67b76775e5900a2193e02b8fac6ca637b1231da","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-06T04:52:17.506657Z","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:87e7230b8d39d5af049d6768781fb9f91607946c5d416d4218ab86c284ecdf2e","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-06T04:52:17.506657Z","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:aabf82e01c7f32bc486700ac571bef17e947d8579ab63b4b9642d94005be4b9c","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-06T04:52:17.506657Z","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:59b2a63997ccef7f3343f9f91caac12bf2b138f4dbb0308ebf60a5586bc016d0","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-06T04:52:17.506657Z","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:9c12e922759947876d4e2c1a4d4c5e542442a7adb6c0bc86988342a58c4f29e3","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-06T04:52:17.506657Z","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:f9824d044619f5c6b24213f9f992c01a94ecb02f08cb82ec4a4265f5f2248c52","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-06T04:52:17.506657Z","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:b31931275c30dc0fb26943a08927d74c82c5fe7c1ba415c2ba7b70092309ac47","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-06T04:52:17.506657Z","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:19009ce17b1786024a58dc6995955c596f60b1e6449647343a6ea4b0eb8dceac","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-06T04:52:17.506657Z","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:72f088e4aaf15db28cdc586bd9104b7060292552ac0c20fa3adda20dfe6471b6","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-06T04:52:17.506657Z","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:e9440ffe387665e126dccd923b79e133367c94aa4d04818086f84401af520535","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-06T04:52:17.506657Z","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:51591722da74c7b2f25755362450c44ab1dcfa358331b76489a10b9691a201b7","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-06T04:52:17.506657Z","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:c6c81bf73bd5a7866f1455f60ad627996eef424ebeaf92e3200e1f6299ed6579","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-06T04:52:17.506657Z","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:62c4d4b75c372731506fbdba25f70d6b8b6225f94c1ea6bc7d220f73cebedbae","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-06T04:52:17.506657Z","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:72fd243fbe557cacc8f21213504466847371908305d8decc3ec5d6ce2b0807dc","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-06T04:52:17.506657Z","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:8c546de0eca1923590c916c3cd1e7c5430474281456b208f1b47b719536e129d","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-06T04:52:17.506657Z","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:2c4b22f05cd8b08f34e6f85a218203c6a4f4500e882d486119aa003ce80cfbc6","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-06T04:52:17.506657Z","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:e4e20fa50f054c0dc4ccfa4181108276d0909045c18efbcf69a2bda29c1931b1","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-06T04:52:17.506657Z","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:1e31ab27b7a98238e73eeb8c7b652ffe3c56dcea949263a2d03f0d06783eae71","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-07-06T16:39:04.459332Z","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-06T04:52:17.506657Z","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:c480fb0120fa51d907d177d3135aed288fa465a0ca4338fb3ea4c28ce706cdda","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-06T04:52:17.506657Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.27680."}