{"as_of":"2026-08-10T14:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:333c71853813cfcb770114adb1b6f47f8b5667129219029d16394b77f0f45977","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:34:34.523185Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"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.09757/citation-record","integrity":"/paper/2607.09757/integrity","json":"/paper/2607.09757/citation-record.json","paper":"/paper/2607.09757"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T04:34:34.280334Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.280334Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:9062018bbac6db92cac356edb2c66f81c21d7cfb035bd62a3196a7d203af6f61","observation_id":"78a0c3a8-f0b5-45c3-b16c-f5b40f4a3484","resolution":{"observed_at":"2026-08-04T04:34:34.280334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02155","last_updated":"2022-03-04T07:04:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-03-04T07:04:42Z","title":"Training language models to follow instructions with human feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02155","snapshot_observed_at":"2026-08-04T04:34:34.286446Z","title":"arXiv preprint arXiv:2203.02155 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.286446Z"},"links":{"cited_paper":"/paper/2203.02155","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:35834bdb6fa63c2b8df121a836e6a5d21ba1328d62a4a860d0766559253b52ba","observation_id":"59432255-39f7-44fa-9f3a-7ebd883e02d7","resolution":{"observed_at":"2026-08-04T04:34:34.286446Z","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-04T04:34:34.295365Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.295365Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:2c6da9f3c4e2309a6b38c69ccb1913cc88b0d043b84805e25372a58ff346eb9c","observation_id":"c65b4026-4d16-4690-a1b1-d4006959b29a","resolution":{"observed_at":"2026-08-04T04:34:34.295365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04366","last_updated":"2022-02-02T16:39:23Z","snapshot_observed_at":"2026-08-09T04:45:04.547249Z","submitted_at":"2021-10-08T20:22:26Z","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04366","snapshot_observed_at":"2026-08-04T04:34:34.300109Z","title":"arXiv preprint arXiv:2110.04366 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.300109Z"},"links":{"cited_paper":"/paper/2110.04366","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:b69a2c1abd23d27583284c816db5efdd782249d7c0166e18939b0fd88fbbe7bc","observation_id":"2e99583f-6963-4a48-aea9-da720f810be0","resolution":{"observed_at":"2026-08-04T04:34:34.300109Z","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-04T04:34:34.306939Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.306939Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:98a3528056653939d4556e4cceecb9886cff79967d9fe67f70f02c3c384834ef","observation_id":"760b5aa8-8ff3-4dce-bd5b-4dd1b194f3fe","resolution":{"observed_at":"2026-08-04T04:34:34.306939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10512","last_updated":"2023-12-20T20:56:14Z","snapshot_observed_at":"2026-07-06T15:05:16.471478Z","submitted_at":"2023-03-18T22:36:25Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10512","snapshot_observed_at":"2026-08-04T04:34:34.311785Z","title":"arXiv preprint arXiv:2303.10512 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.311785Z"},"links":{"cited_paper":"/paper/2303.10512","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:fe806aa2f014904f5ef53dbf88f6cdb55a59738cda0e6e8530f3314ff799eb49","observation_id":"696783cf-01b8-49f4-b255-fda7100f96fb","resolution":{"observed_at":"2026-08-04T04:34:34.311785Z","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-04T04:34:34.317528Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.317528Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:727ceafd89c336648f774da51f72cd5d4ba92d2813490dc4ec08a6e1593f5aa9","observation_id":"d17f3282-d109-435e-a045-5045a4a3c202","resolution":{"observed_at":"2026-08-04T04:34:34.317528Z","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-04T04:34:34.324126Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.324126Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:72c3e98863d0eb82d0197825aeddd204038a99a29b6d8eec8227c4d5d5c1f6c6","observation_id":"7eebae89-bf44-4b24-bed1-04f13656cedd","resolution":{"observed_at":"2026-08-04T04:34:34.324126Z","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-04T04:34:34.331665Z","title":"Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.331665Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:5d59ec829f76f82a8c7079b8b7e06914d9d25d290ef8d9bb62c8c9839fc3b28a","observation_id":"9865af6e-6bbe-42ad-b2f2-e350b4191efa","resolution":{"observed_at":"2026-08-04T04:34:34.331665Z","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-04T04:34:34.337035Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.337035Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:1abe42b4f5807d80c8e8c94647b9013db5e9d42874871997070babbd5911fc4e","observation_id":"1766e5d5-da54-403a-8901-85b249d29baa","resolution":{"observed_at":"2026-08-04T04:34:34.337035Z","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-04T04:34:34.343609Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.343609Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:e129a6143cdd7e56342e8bb6549f8599b3334a11977cf6d32484b62e457f0a59","observation_id":"1d9ac0e5-73d6-4b9e-943c-ba712f084eaa","resolution":{"observed_at":"2026-08-04T04:34:34.343609Z","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-04T04:34:34.356334Z","title":"arXiv preprint arXiv:2502.12171 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.356334Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:27b9d34da4671fdd64691bc6577645778d70a599fef555d0c87be8b9eeae918e","observation_id":"f00d3acf-912e-4b74-ac8c-0127428e5490","resolution":{"observed_at":"2026-08-04T04:34:34.356334Z","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-04T04:34:34.361047Z","title":"The journal of machine learning research , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.361047Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:d498a4a33c53c9f2c5f23ee21bcfa258c2fd757f797523e4cd1124541e13590c","observation_id":"51dde5a3-b5d5-45de-a211-173611a4b749","resolution":{"observed_at":"2026-08-04T04:34:34.361047Z","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-04T04:34:34.366479Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.366479Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:2cd6a5b56f2fc445beef8aa362bd5a750d1076e3f6c915e584939f095e57115a","observation_id":"a93453ce-c711-46c2-a09a-13dc231c9d4e","resolution":{"observed_at":"2026-08-04T04:34:34.366479Z","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-04T04:34:34.371624Z","title":"Expositiones mathematicae , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.371624Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:42d662b984fc6976eb26d8f2476187ef8ffa50d17d9763cbe6bac30f31784113","observation_id":"0dc51248-52dc-431b-aa73-38f07949bb14","resolution":{"observed_at":"2026-08-04T04:34:34.371624Z","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-04T04:34:34.376799Z","title":"The Thirteenth International Conference on Learning Representations , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.376799Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:4bbed5097c45f5650283d8f7e362365fc662dcf17c62b1b8677881dccf875fb7","observation_id":"3753b30c-3996-4caf-bee6-02f920ed0569","resolution":{"observed_at":"2026-08-04T04:34:34.376799Z","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-04T04:34:34.382828Z","title":"Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.382828Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:ad4fc91944aeb19a06c6a47ed2aa3c968ca3f85c9211f55cfd485ceed44a5884","observation_id":"dd95a7ef-6071-47af-a05b-b93aa0c9d73f","resolution":{"observed_at":"2026-08-04T04:34:34.382828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11454","last_updated":"2024-01-16T18:59:22Z","snapshot_observed_at":"2026-08-09T04:48:28.604919Z","submitted_at":"2023-10-17T17:59:46Z","title":"VeRA: Vector-based Random Matrix Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11454","snapshot_observed_at":"2026-08-04T04:34:34.389121Z","title":"arXiv preprint arXiv:2310.11454 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.389121Z"},"links":{"cited_paper":"/paper/2310.11454","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:f60340657daf0dc170f286115f0aa292f1f4aac8a0c4b73e0509777d38095066","observation_id":"fc2e790e-8e3e-4314-9227-d7cb8688571a","resolution":{"observed_at":"2026-08-04T04:34:34.389121Z","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-04T04:34:34.395200Z","title":"arXiv preprint arXiv:2505.20355 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.395200Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:e2122eddfc811e779a29752f86b1a70d48564da15aac97106a2023497495b3c8","observation_id":"7c8b5639-6a72-4e5a-afed-2ddd00cd81fa","resolution":{"observed_at":"2026-08-04T04:34:34.395200Z","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-04T04:34:34.400554Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.400554Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:93dbdb39aafee767993ac3546bdea3a601d56445d571feb4bf0375afdcd67db7","observation_id":"26827199-b145-41bd-8fd5-5f0f6ad42598","resolution":{"observed_at":"2026-08-04T04:34:34.400554Z","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-04T04:34:34.408926Z","title":"Proceedings of the AAAI conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.408926Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:6a334f9a6308b7af7bd08351a482a5435b0476c880cebb14e98817c1c0cbd7e7","observation_id":"88e5c133-b9d5-4197-ba97-2f0b22ddd5ee","resolution":{"observed_at":"2026-08-04T04:34:34.408926Z","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-04T04:34:34.415516Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.415516Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:391623733e8888cd30db2da612b67c3e00f84db5d12f05ef8bc047ad7244dfd9","observation_id":"769b8bbc-a4d8-4834-ab31-3f07a038f85c","resolution":{"observed_at":"2026-08-04T04:34:34.415516Z","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-04T04:34:34.421415Z","title":"Proceedings of the 57th annual meeting of the association for computational linguistics , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.421415Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:b996631eff0409ce928693992ddd7bf194078daa9dcb885dd39ff0bf420b021d","observation_id":"7df267bc-d461-47a5-a0db-408ad09a3313","resolution":{"observed_at":"2026-08-04T04:34:34.421415Z","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-04T04:34:34.427331Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.427331Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:12e742fe8dc3498815ee9f5ef74c32665bbef05059a20113b6b4adf09315b3de","observation_id":"a3f1cfa0-99f5-4ada-aa50-830fe38731fa","resolution":{"observed_at":"2026-08-04T04:34:34.427331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-04T04:34:34.432376Z","title":"arXiv preprint arXiv:1803.05457 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.432376Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:b562968e4c9fdf30b57fade7b39c1d53805a45f6c345dbf10896318e7377a143","observation_id":"6a6cc4be-e6ae-4162-8c89-6bb20ceca8e8","resolution":{"observed_at":"2026-08-04T04:34:34.432376Z","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-04T04:34:34.437111Z","title":"Proceedings of the 2018 conference on empirical methods in natural language processing , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.437111Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:d5e2613242bc786370de2af97996b4fed4f3777b43d28474ac94994eb0dd8282","observation_id":"738229c4-f5e1-4129-b3e4-2f766448dcb1","resolution":{"observed_at":"2026-08-04T04:34:34.437111Z","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-04T04:34:34.443631Z","title":"Zenodo , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.443631Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:ce999931baf83ca4e58c51952279d854fd91d1b3129f79a4d45f70f1b72c63b9","observation_id":"5c6ddd94-4980-427d-8786-dc973ae6035d","resolution":{"observed_at":"2026-08-04T04:34:34.443631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-04T04:34:34.448040Z","title":"arXiv preprint arXiv:2505.09388 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.448040Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:436f74fffb792611aaf1fd748adc795e83d5b984cdf4057254d373f368158ee9","observation_id":"6a9c1ae8-dbde-48c9-a08a-a2cdda96f176","resolution":{"observed_at":"2026-08-04T04:34:34.448040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-04T04:34:34.454859Z","title":"arXiv preprint arXiv:2310.06825 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.454859Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:cf83f7af010cbea9c3449278ca6f45d442c2b675770575ccffd4e489650d91be","observation_id":"559adfb3-23e3-48c5-b9b3-ba544483ade3","resolution":{"observed_at":"2026-08-04T04:34:34.454859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-04T04:34:34.462171Z","title":"arXiv preprint arXiv:2501.12948 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.462171Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:73dc6b4cd696ed964d7d65739d54c05a5d38a8894559194062062a1bd2d5132c","observation_id":"faee15f8-ae38-4e9f-8dd0-58d17ae906ca","resolution":{"observed_at":"2026-08-04T04:34:34.462171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-04T04:34:34.468543Z","title":"arXiv preprint arXiv:2103.03874 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.468543Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:05bd1258ee9c9790ceb1f45b6fb48e7b6fd8476e3cd628f355decd05e55f0861","observation_id":"7401c8c2-4f98-4fa5-b906-6a44fd312f61","resolution":{"observed_at":"2026-08-04T04:34:34.468543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-04T04:34:34.475495Z","title":"arXiv preprint arXiv:2110.14168 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.475495Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:855ecb0abb1d1a2d4b2d432b87c83fa4220d81b537f03deb7b922d00b5c4071f","observation_id":"7218c2b7-7917-4260-9481-d926a5d89f9d","resolution":{"observed_at":"2026-08-04T04:34:34.475495Z","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-04T04:34:34.480684Z","title":"Proceedings of the 2018 EMNLP workshop BlackboxNLP: Analyzing and interpreting neural networks for NLP , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.480684Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:e70c8296cba85012102025ec0eca86d09f33c1fbdc511db34e5d0f54d1b12bf4","observation_id":"a1d76d2e-8f07-4db3-ad74-5278e6996720","resolution":{"observed_at":"2026-08-04T04:34:34.480684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03732","last_updated":"2023-11-28T03:23:20Z","snapshot_observed_at":"2026-08-08T21:34:35.024914Z","submitted_at":"2023-11-28T03:23:20Z","title":"A Rank Stabilization Scaling Factor for Fine-Tuning with LoRA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03732","snapshot_observed_at":"2026-08-04T04:34:34.486940Z","title":"arXiv preprint arXiv:2312.03732 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.486940Z"},"links":{"cited_paper":"/paper/2312.03732","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:30e4e15dc9d0a144bcd7b40cb5ac0aa77aef013f0723f028f7a273332590e0be","observation_id":"455273d7-9820-4383-ad90-a708dd6a119a","resolution":{"observed_at":"2026-08-04T04:34:34.486940Z","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-04T04:34:34.494016Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.494016Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:698e3752b16db40b9ec0776b55c88195125a852f976a3138672b145793d25d1f","observation_id":"ba52f39a-0c7c-4c80-8812-2dec748e080f","resolution":{"observed_at":"2026-08-04T04:34:34.494016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03303","last_updated":"2026-05-09T05:30:15Z","snapshot_observed_at":"2026-08-08T14:14:26.000056Z","submitted_at":"2023-08-07T05:12:27Z","title":"LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03303","snapshot_observed_at":"2026-08-04T04:34:34.499526Z","title":"arXiv preprint arXiv:2308.03303 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.499526Z"},"links":{"cited_paper":"/paper/2308.03303","citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:148ed1a355939ca930d6e4665411e46c1bea9a35dca35c1992693ccc66705588","observation_id":"5bf00fb3-5a5b-494b-bb28-606af656d52d","resolution":{"observed_at":"2026-08-04T04:34:34.499526Z","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-04T04:34:34.513136Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.513136Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:a501fdc2d5cc94da427c14f58292bcbdb4379ebadf242646b04f842fc95a9cc3","observation_id":"b2421158-1660-4121-b6e4-048eff7edf33","resolution":{"observed_at":"2026-08-04T04:34:34.513136Z","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-04T04:34:34.518170Z","title":"2007 15th European signal processing conference , pages=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.518170Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:be484d609a1b383a5e21a2f32bfdd401278ea674b64e857a0b7605e44eb6b76a","observation_id":"155217e2-d801-4714-a5e4-9e5352192559","resolution":{"observed_at":"2026-08-04T04:34:34.518170Z","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-04T04:34:34.523185Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T04:34:34.523185Z"},"links":{"citing_paper":"/paper/2607.09757"},"observation_digest":"sha256:5609466ecf3f992daf2c03ef4120a2c4413a384e12837912e6029f3505908a99","observation_id":"f9770e85-e868-471c-a70a-d04771f26294","resolution":{"observed_at":"2026-08-04T04:34:34.523185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09757","last_updated":"2026-08-01T14:09:44Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-06T23:11:23.484259Z","submitted_at":"2026-07-05T13:58:38Z","title":"RSRA: Training-Free Probing of Representation Sensitivity for Efficient LoRA Rank Allocation"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"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 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2607.09757."}