{"as_of":"2026-08-16T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0cd6c7578957be6cfef74ef8177c3f89eebf15f50a719e8126cb4c378855147d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":17,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:32:08.535235Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T00:49:19.546040Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-09T13:58:45.714214Z","title":"Towards modular llms by building and reusing a library of loras, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01976","last_updated":"2025-09-10T02:45:51Z","snapshot_observed_at":"2026-08-16T00:59:01.476829Z","submitted_at":"2025-02-04T03:36:44Z","title":"CITER: Collaborative Inference for Efficient Large Language Model Decoding with Token-Level Routing","version":6},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T13:58:45.714214Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2502.01976"},"observation_digest":"sha256:64c1967e05d34bd3b510f55aa98764183ab9a1f39dd960e48719e243fe2d4af9","observation_id":"a652f26c-b1cb-4b0b-a80b-24eb071c407c","resolution":{"observed_at":"2026-08-09T13:58:45.714214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-08T22:50:37.432514Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04315","last_updated":"2025-02-11T14:01:39Z","snapshot_observed_at":"2026-08-12T23:47:21.951876Z","submitted_at":"2025-02-06T18:57:06Z","title":"ChameleonLLM: Batch-Aware Dynamic Low-Rank Adaptation via Inference-Time Clusters","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T22:50:37.432514Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2502.04315"},"observation_digest":"sha256:8e278aaa51eb46a6a677ae16a5ede1a8367aef2dd787f7bd148b7579c8af2251","observation_id":"367181da-64e1-402b-b301-d28d59ab3c03","resolution":{"observed_at":"2026-08-08T22:50:37.432514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-08T10:26:45.492458Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08141","last_updated":"2025-02-12T05:48:26Z","snapshot_observed_at":"2026-08-15T06:50:09.744191Z","submitted_at":"2025-02-12T05:48:26Z","title":"LowRA: Accurate and Efficient LoRA Fine-Tuning of LLMs under 2 Bits","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T10:26:45.492458Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2502.08141"},"observation_digest":"sha256:0e80a82a6578fc6ae8d96661150305cfef9b3ff6829d57865d37b34d8e07c9ca","observation_id":"b7df3e0d-a8b4-4939-b669-b7335141063e","resolution":{"observed_at":"2026-08-08T10:26:45.492458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-07T13:10:27.491205Z","title":"Towards modular LLMs by building and reusing a library of LoRAs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22602","last_updated":"2025-05-28T17:16:24Z","snapshot_observed_at":"2026-08-13T13:23:48.683644Z","submitted_at":"2025-05-28T17:16:24Z","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:27.491205Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2505.22602"},"observation_digest":"sha256:ac85e3712b6094ab233d68811bf30a8dd58209b9597c8a01749c128344797361","observation_id":"b808e1df-d611-43fa-8a56-b1935e86bb42","resolution":{"observed_at":"2026-08-07T13:10:27.491205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-07T06:05:29.219122Z","title":"M., Charlin, L., Roux, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06105","last_updated":"2025-06-09T14:19:59Z","snapshot_observed_at":"2026-08-12T19:22:14.414860Z","submitted_at":"2025-06-06T14:11:27Z","title":"Text-to-LoRA: Instant Transformer Adaption","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T06:05:29.219122Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2506.06105"},"observation_digest":"sha256:de45604e59f7dc4e5aae568251d275355fdeb8bfcdfbe536ed74b40c97634680","observation_id":"7dbae7d0-058e-40ae-8a2b-a7a6c2ffb988","resolution":{"observed_at":"2026-08-07T06:05:29.219122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2507.00029","last_updated":"2026-05-13T05:28:39Z","snapshot_observed_at":"2026-08-11T06:15:13.326412Z","submitted_at":"2025-06-17T14:58:54Z","title":"LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T09:05:25.236355Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2507.00029"},"observation_digest":"sha256:8e9931360f5f54b2423a391924c6277871d0dd4db9395d6080685cabdf53db3a","observation_id":"88458a20-99da-4f58-81a9-df33295bcd7c","resolution":{"observed_at":"2026-05-19T09:07:14.646430Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-06T19:07:36.276971Z","title":"Towards modular llms by building and reusing a library of loras, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-13T12:08:44.034823Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.276971Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:7aaf456d6379dc98121a56fac1640b67cf4477a6477d27b8a5e78d493696722b","observation_id":"776300d9-f182-427f-8620-b207e5d9aa6b","resolution":{"observed_at":"2026-08-06T19:07:36.276971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-06T01:01:50.310297Z","title":"M.; Charlin, L.; Roux, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.03999","last_updated":"2025-08-06T01:26:43Z","snapshot_observed_at":"2026-08-13T08:37:24.080295Z","submitted_at":"2025-08-06T01:26:43Z","title":"Tensorized Clustered LoRA Merging for Multi-Task Interference","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T01:01:50.310297Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2508.03999"},"observation_digest":"sha256:6d284ac472facf1ae4bd1e11d1d0691a5c7af7db43014f07fc93c8b856c889a3","observation_id":"9e6bd5cf-26a5-4870-b2b4-5459f594ace3","resolution":{"observed_at":"2026-08-06T01:01:50.310297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-15T16:32:08.535235Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.04442","last_updated":"2025-09-04T17:59:06Z","snapshot_observed_at":"2026-08-15T16:27:18.700545Z","submitted_at":"2025-09-04T17:59:06Z","title":"Delta Activations: A Representation for Finetuned Large Language Models","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T16:32:08.535235Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2509.04442"},"observation_digest":"sha256:df401c205a5ee55faaabdb9b4ba7c67bf47116bb8e34e154a7d208afc9a5f963","observation_id":"4f33eaa1-5338-4145-9c2b-c29133b949d0","resolution":{"observed_at":"2026-08-15T16:32:08.535235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2511.01831","last_updated":"2026-04-06T20:32:02Z","snapshot_observed_at":"2026-08-13T03:15:39.262968Z","submitted_at":"2025-11-03T18:39:32Z","title":"Routing-Based Continual Learning for Multimodal Large Language Models","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-18T00:52:36.700027Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2511.01831"},"observation_digest":"sha256:f7411ad197873f00956d6ff722df76852e66de7fce00bb5a782ececd956f77e7","observation_id":"c1a0fbaa-dfa0-4a14-b9f0-ad0a30c19137","resolution":{"observed_at":"2026-05-18T00:55:35.384602Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2605.01973","last_updated":"2026-06-16T07:40:16Z","snapshot_observed_at":"2026-08-08T12:26:45.887142Z","submitted_at":"2026-05-03T17:13:45Z","title":"Learn-To-Learn on Arbitrary Textual Conditioning: A Hypernetwork-Driven Meta-Gated LLM","version":1},"reference_index":136,"source":"arxiv_source","source_observed_at":"2026-05-09T17:12:38.030543Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2605.01973"},"observation_digest":"sha256:58a77fc231d87072032af51a222011fe9a7c5d198a78e8fc03308f9ef92273a5","observation_id":"82f1aa77-ab98-4e32-9fee-b4c4c0163181","resolution":{"observed_at":"2026-05-11T16:21:10.407784Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2605.01973","last_updated":"2026-06-16T07:40:16Z","snapshot_observed_at":"2026-08-08T12:26:45.887142Z","submitted_at":"2026-05-03T17:13:45Z","title":"Learn-To-Learn on Arbitrary Textual Conditioning: A Hypernetwork-Driven Meta-Gated LLM","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-30T23:58:47.224343Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2605.01973"},"observation_digest":"sha256:d9794c73c1c48f59d5635672de39848eee8c42a21d35114c038720792f41f300","observation_id":"f77c2b8f-75fe-4c14-a324-b4b952f2896c","resolution":{"observed_at":"2026-07-01T00:25:10.420368Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2606.19079","last_updated":"2026-06-17T13:50:51Z","snapshot_observed_at":"2026-08-06T12:44:16.039483Z","submitted_at":"2026-06-17T13:50:51Z","title":"ARIADNE: Agnostic Routing for Inference-time Adapter DyNamic sElection","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-26T20:53:11.180717Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2606.19079"},"observation_digest":"sha256:617ada679431e7634b1979300a6cbdc0159db104a2340eb4925611b258a4ad87","observation_id":"b846104a-7f52-4533-8067-1dfb814d7dcd","resolution":{"observed_at":"2026-07-04T00:49:19.549027Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-02T09:39:41.028505Z","title":"InNeurIPS 2023 Workshop on Instruction Tuning and Instruction Fol- lowing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.31413","last_updated":"2026-07-30T09:24:19Z","snapshot_observed_at":"2026-08-15T21:18:52.603400Z","submitted_at":"2026-06-30T09:40:38Z","title":"Learning to Select, Not Relearn: Hard-Routed Mixtures of Reasoning LoRAs","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T09:39:41.028505Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2606.31413"},"observation_digest":"sha256:336dac17316a15101a75afa4461eb01a48148061011be76e19a1184391b83d53","observation_id":"cb0fcaed-2f1e-4773-8cca-52035dc41c69","resolution":{"observed_at":"2026-08-02T09:39:41.028505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":"2405.11157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-04T00:49:19.546040Z","title":"Towards modular llms by building and reusing a library of loras","venue":null,"work_id":"94e0bb6b-f0e4-4b08-a875-18faa2dcddd8","year":2024},"citing_paper":{"arxiv_id":"2606.31432","last_updated":"2026-07-02T08:43:43Z","snapshot_observed_at":"2026-07-07T00:05:07.912609Z","submitted_at":"2026-06-30T09:59:05Z","title":"Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-03T22:08:53.025783Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2606.31432"},"observation_digest":"sha256:01719fa54fa09cd64d12f9d9857de48164afd93dd3b7b93285379a60388ef423","observation_id":"08e3d267-79ae-4a73-a159-ba703a7c9d32","resolution":{"observed_at":"2026-07-03T22:08:58.529129Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-07-11T21:34:44.701020Z","title":"Ostapenko, Z","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04118","last_updated":"2026-07-05T05:11:24Z","snapshot_observed_at":"2026-08-13T08:09:32.907295Z","submitted_at":"2026-07-05T05:11:24Z","title":"Parametric Memory Decoding for Zero-Shot Routing in LoRA-Based External Parametric Memory","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T21:34:44.701020Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2607.04118"},"observation_digest":"sha256:08002c0c9949a2de09042740ce4d649e139547cfa6e96ef0538e2562fc9ca2b5","observation_id":"9276bf34-cf50-452e-ad5b-48422d68444d","resolution":{"observed_at":"2026-07-11T21:34:44.701020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11157","snapshot_observed_at":"2026-08-02T05:16:36.867664Z","title":"Towards modular llms by building and reusing a library of loras.arXiv preprint arXiv:2405.11157,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13425","last_updated":"2026-07-15T04:03:24Z","snapshot_observed_at":"2026-08-03T17:12:53.669172Z","submitted_at":"2026-07-15T04:03:24Z","title":"Data-Efficient Adaptation of LLMs via Attention Head Reweighting","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T05:16:36.867664Z"},"links":{"cited_paper":"/paper/2405.11157","citing_paper":"/paper/2607.13425"},"observation_digest":"sha256:4390657ec01559612471cc506edee616bd76fe714930cfea73b060e3bb6fbcfa","observation_id":"eba88f4f-c4ec-4189-9331-6250b8d9c8e6","resolution":{"observed_at":"2026-08-02T05:16:36.867664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.11157/citation-record","integrity":"/paper/2405.11157/integrity","json":"/paper/2405.11157/citation-record.json","paper":"/paper/2405.11157"},"outbound":[],"paper":{"arxiv_id":"2405.11157","last_updated":"2024-05-18T03:02:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T10:07:01.414577Z","submitted_at":"2024-05-18T03:02:23Z","title":"Towards Modular LLMs by Building and Reusing a Library of LoRAs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 17 inbound Pith citation observations for arXiv:2405.11157."}