{"as_of":"2026-08-06T21:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:727598ddb033b9c22aedaac37861269cd0c3e8cd27c6296568b0c38e91bd8bef","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:07:37.681809Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2507.07140/citation-record","integrity":"/paper/2507.07140/integrity","json":"/paper/2507.07140/citation-record.json","paper":"/paper/2507.07140"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.10801","last_updated":"2024-10-14T17:58:01Z","snapshot_observed_at":"2026-08-04T00:12:25.212763Z","submitted_at":"2024-10-14T17:58:01Z","title":"Mix Data or Merge Models? Optimizing for Diverse Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10801","snapshot_observed_at":"2026-08-06T19:07:32.674276Z","title":"Mix data or merge models? optimizing for diverse multi-task learning, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:32.674276Z"},"links":{"cited_paper":"/paper/2410.10801","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:1468d5bdf507e50126e4b2a7abbfd9e7d2d83260bb5fea40a635beb17a38731b","observation_id":"f9d611b4-073d-4b41-b586-b39883496d2a","resolution":{"observed_at":"2026-08-06T19:07:32.674276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14219","last_updated":"2024-08-30T21:17:17Z","snapshot_observed_at":"2026-07-06T18:03:47.096406Z","submitted_at":"2024-04-22T14:32:33Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14219","snapshot_observed_at":"2026-08-06T19:07:32.743441Z","title":null,"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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:32.743441Z"},"links":{"cited_paper":"/paper/2404.14219","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:0c28ae51a73403c999936722c35310ff48b173e794cab47af50c8a3b2a8f0c87","observation_id":"873f1282-6e97-4d27-a97a-19a5480acb26","resolution":{"observed_at":"2026-08-06T19:07:32.743441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-07-06T17:47:22.458338Z","submitted_at":"2024-03-19T22:56:53Z","title":"Evolutionary Optimization of Model Merging Recipes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13187","snapshot_observed_at":"2026-08-06T19:07:32.863487Z","title":"Evolutionary optimization of model merging recipes, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:32.863487Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:35ade63006eac91e2d16afa1f915495fccf57ca6e800bdf97ec9963a64773cc7","observation_id":"a42f5d32-6a7d-4e88-949d-d0a5587b942e","resolution":{"observed_at":"2026-08-06T19:07:32.863487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:39.656330Z","title":"Composable sparse fine-tuning for cross-lingual transfer","venue":null,"work_id":"c52f6af8-02ad-40c7-b4c2-514228028a10","year":2022},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.012136Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:40aa72dfe45db5f454075bef5a159fb4dce7ea1eac8fb6c25f1a41dec1c33e82","observation_id":"f44d5d83-0698-4983-b47a-901f446f1a26","resolution":{"observed_at":"2026-08-06T19:07:39.769681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16405","last_updated":"2024-02-02T14:53:14Z","snapshot_observed_at":"2026-07-31T08:14:11.199709Z","submitted_at":"2024-01-29T18:43:49Z","title":"Scaling Sparse Fine-Tuning to Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16405","snapshot_observed_at":"2026-08-06T19:07:33.147050Z","title":null,"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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.147050Z"},"links":{"cited_paper":"/paper/2401.16405","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:33a6feeff3ae8b86d7a73caccdd21c0e7c4ba6339c20ed1f3fa23c2762bcb8aa","observation_id":"0a4aeed2-eebd-48aa-bb2f-dd851460e72e","resolution":{"observed_at":"2026-08-06T19:07:33.147050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.15579","last_updated":"2021-12-31T18:10:02Z","snapshot_observed_at":"2026-07-06T12:23:52.936803Z","submitted_at":"2021-12-31T18:10:02Z","title":"Single-Shot Pruning for Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2112.15579","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.15579","snapshot_observed_at":"2026-08-06T19:07:38.066874Z","title":"Single-Shot Pruning for Offline Reinforcement Learning","venue":"cs.LG","work_id":"009bea8f-acee-42c0-b7d1-d4d08bc46ef3","year":2021},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.293425Z"},"links":{"cited_paper":"/paper/2112.15579","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:3fdc3682a6ebb390d0ef21de86ec4c31a8a99b69c7d314266c0777949e9772d8","observation_id":"36385d74-c133-4369-81ba-6fef5e81fe05","resolution":{"observed_at":"2026-08-06T19:07:38.097396Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:39.408232Z","title":"Efficient reinforcement learning by discovering neural pathways","venue":null,"work_id":"5de43b51-4d8e-4735-9527-c1cbc6339d27","year":2024},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.473475Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:396a158015e176149b0f32639ac985d03e0186e8169bd336abccbd1e0023700e","observation_id":"4d175b7d-4c45-4c75-88ea-fad93b4ac589","resolution":{"observed_at":"2026-08-06T19:07:39.559979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06795","last_updated":"2024-08-10T00:02:00Z","snapshot_observed_at":"2026-07-06T17:00:04.276081Z","submitted_at":"2023-12-11T19:10:55Z","title":"Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Masks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06795","snapshot_observed_at":"2026-08-06T19:07:33.590533Z","title":"Model breadcrumbs: Scaling multi-task model merging with sparse masks, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.590533Z"},"links":{"cited_paper":"/paper/2312.06795","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:f67857daeb309ac0a364236815a308282b78d52eda14c9a2232bbcb32b76739e","observation_id":"0a200b22-e91f-44ed-bfdd-2ef043505fa8","resolution":{"observed_at":"2026-08-06T19:07:33.590533Z","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-06T19:07:33.744974Z","title":"Qlora: Efficient finetuning of quantized llms","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.744974Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:09a4f3bfe805d38c74e7244267d00e258a6cd7b3b423e815237221295195144f","observation_id":"89154af1-fb03-4652-bc71-4af87a22ee19","resolution":{"observed_at":"2026-08-06T19:07:33.744974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11134","last_updated":"2021-07-23T14:12:42Z","snapshot_observed_at":"2026-07-06T08:39:52.703032Z","submitted_at":"2019-11-25T18:58:53Z","title":"Rigging the Lottery: Making All Tickets Winners","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.11134","snapshot_observed_at":"2026-08-06T19:07:33.894102Z","title":"Rigging the lottery: Making all tickets winners, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:33.894102Z"},"links":{"cited_paper":"/paper/1911.11134","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:145e803b0143de482de8cb7072f6ef1b10ee03a39d83804f8999a36c17126f11","observation_id":"01b6fea3-c96b-42cc-8038-fa1ffd9faca2","resolution":{"observed_at":"2026-08-06T19:07:33.894102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-05T23:54:27.386622Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-06T19:07:34.082327Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.082327Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:0e07aa4e74a85ec6bcea6fa9791b8237e13d15963a770a89a176e4cc0e1eb891","observation_id":"83882ea9-f38f-4f9b-bca8-e41c350caf86","resolution":{"observed_at":"2026-08-06T19:07:34.082327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:39.137995Z","title":"Megablocks: Efficient sparse training with mixture-of-experts","venue":null,"work_id":"e86c5325-f874-4f18-abbb-2a53edf54a90","year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.210302Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:bef1af7df5223fdc6ba3f06d7cd4c8f7be57363cc5a28ea815e4b4aed39521f2","observation_id":"617e4b26-cff8-42b1-a678-748c1759ce21","resolution":{"observed_at":"2026-08-06T19:07:39.250152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14608","last_updated":"2024-09-16T02:54:50Z","snapshot_observed_at":"2026-08-04T09:07:42.158421Z","submitted_at":"2024-03-21T17:55:50Z","title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14608","snapshot_observed_at":"2026-08-06T19:07:34.323945Z","title":"Parameter-efficient fine-tuning for large models: A comprehensive survey","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.323945Z"},"links":{"cited_paper":"/paper/2403.14608","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:d715c0e863661c3744943c6f3aee85aeba8f61f13f14502f45ed0ec4d230ece5","observation_id":"519cc976-3acb-4590-8975-e6daab49537a","resolution":{"observed_at":"2026-08-06T19:07:34.323945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12354","last_updated":"2024-07-04T18:33:00Z","snapshot_observed_at":"2026-08-03T17:12:16.534784Z","submitted_at":"2024-02-19T18:33:49Z","title":"LoRA+: Efficient Low Rank Adaptation of Large Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12354","snapshot_observed_at":"2026-08-06T19:07:34.472679Z","title":"Lora+: Efficient low rank adaptation of large models (jul 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.472679Z"},"links":{"cited_paper":"/paper/2402.12354","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:7dd955e02f47cce579b110f396a126c4c2ea1bdcb2cbdffcb6bd3448bf03f520","observation_id":"fb63afb6-739a-42e3-b842-07325d5ccdd1","resolution":{"observed_at":"2026-08-06T19:07:34.472679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.04284","last_updated":"2022-11-10T12:48:10Z","snapshot_observed_at":"2026-08-04T23:39:13.695099Z","submitted_at":"2022-10-09T15:28:48Z","title":"SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.04284","snapshot_observed_at":"2026-08-06T19:07:34.638624Z","title":"Sparseadapter: An easy approach for improving the parameter-efficiency of adapters, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.638624Z"},"links":{"cited_paper":"/paper/2210.04284","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:618068c9d070ad3ff6f9f330ac3012a9fee26058d6c43b3ab9aec406d46fa7de","observation_id":"625ccb9f-17b6-4c3b-bf11-0e810c029c37","resolution":{"observed_at":"2026-08-06T19:07:34.638624Z","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-07-06T02:11:23.670680Z","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-06T19:07:34.921046Z","title":"Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen - Zhu, Yuanzhi Li, Shean Wang, and Weizhu Chen","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:34.921046Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:907d979cc81b8fd2300a7805d9ce4f927de794e8c634d3497c3f6c01b0eb38cc","observation_id":"98a45260-4bb8-44e8-9fad-257b6f4218ad","resolution":{"observed_at":"2026-08-06T19:07:34.921046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08582","last_updated":"2025-01-15T05:07:06Z","snapshot_observed_at":"2026-07-06T20:21:13.914417Z","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","version":1},"cited_work":{"arxiv_id":"2501.08582","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.08582","snapshot_observed_at":"2026-08-06T19:07:37.883698Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","venue":"cs.CL","work_id":"fe03c2eb-9b0d-4004-8fa3-0fd6d237ee4c","year":2025},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.037623Z"},"links":{"cited_paper":"/paper/2501.08582","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:a120a37ccb727e2b3ae1ee92104b98c37ff0b7bcebf4d72a3bd9498c448f89b9","observation_id":"c8f65f69-f06c-48e7-ab45-8b75940b8964","resolution":{"observed_at":"2026-08-06T19:07:37.936654Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13269","last_updated":"2024-08-19T03:31:19Z","snapshot_observed_at":"2026-07-06T15:58:08.777051Z","submitted_at":"2023-07-25T05:39:21Z","title":"LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Composition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13269","snapshot_observed_at":"2026-08-06T19:07:35.140559Z","title":"Lorahub: Efficient cross-task generalization via dynamic lora composition, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.140559Z"},"links":{"cited_paper":"/paper/2307.13269","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:72bafdae1cbb6ca303e17f5ca6729b6466c54f5899e215e44b6b2503e2eb1756","observation_id":"88e4e900-82aa-4c00-815d-1a88128a8f51","resolution":{"observed_at":"2026-08-06T19:07:35.140559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04089","last_updated":"2023-03-31T15:27:01Z","snapshot_observed_at":"2026-08-03T22:12:27.993418Z","submitted_at":"2022-12-08T05:50:53Z","title":"Editing Models with Task Arithmetic","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04089","snapshot_observed_at":"2026-08-06T19:07:35.237210Z","title":"Editing models with task arithmetic, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.237210Z"},"links":{"cited_paper":"/paper/2212.04089","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:a1cb26cd5cda4581cf19f2e31408cfe8651f36fb49e214c2c27230fd0b132d8e","observation_id":"6bd7a445-bd8c-48f8-be62-dd6a9e60ae37","resolution":{"observed_at":"2026-08-06T19:07:35.237210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09849","last_updated":"2025-05-21T23:53:00Z","snapshot_observed_at":"2026-08-02T07:25:54.611134Z","submitted_at":"2022-12-19T20:46:43Z","title":"Dataless Knowledge Fusion by Merging Weights of Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.09849","snapshot_observed_at":"2026-08-06T19:07:35.417963Z","title":"Dataless knowledge fusion by merging weights of language models, 2023 b","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.417963Z"},"links":{"cited_paper":"/paper/2212.09849","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:8011408809553e2fd4e58917d2ce594d5a88dd2d8b3cc8d068ea95f7335b70c0","observation_id":"ab92cd52-95cd-4d80-b70d-75f0b44cf24d","resolution":{"observed_at":"2026-08-06T19:07:35.417963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.02340","last_updated":"2019-02-23T07:45:29Z","snapshot_observed_at":"2026-07-06T07:06:10.289386Z","submitted_at":"2018-10-04T17:39:58Z","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.02340","snapshot_observed_at":"2026-08-06T19:07:35.495317Z","title":"Snip: Single-shot network pruning based on connection sensitivity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.495317Z"},"links":{"cited_paper":"/paper/1810.02340","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:570a48bc022ea02a49d27563dd079f939a02bd1719cfd4f88996dd19d5f2a7db","observation_id":"830802d7-d547-4ad1-924b-a2d151df5b4a","resolution":{"observed_at":"2026-08-06T19:07:35.495317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09353","last_updated":"2024-07-09T05:59:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-14T17:59:34Z","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09353","snapshot_observed_at":"2026-08-06T19:07:35.593691Z","title":"Dora: Weight-decomposed low-rank adaptation","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.593691Z"},"links":{"cited_paper":"/paper/2402.09353","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:ca90208605f697efa21d09471cc26f24287e5d37781023e645bc6da060994f9a","observation_id":"bc78394e-25e5-41a8-a878-a3b35ea1801f","resolution":{"observed_at":"2026-08-06T19:07:35.593691Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06243","last_updated":"2024-04-28T20:05:02Z","snapshot_observed_at":"2026-07-06T16:45:51.193825Z","submitted_at":"2023-11-10T18:59:54Z","title":"Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06243","snapshot_observed_at":"2026-08-06T19:07:35.695120Z","title":"Parameter-efficient orthogonal finetuning via butterfly factorization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.695120Z"},"links":{"cited_paper":"/paper/2311.06243","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:597c9a3776588b30edc121082e701b357b870794ad2b45968c751418d30ed03a","observation_id":"257409a9-3286-4c5f-907f-8f7083e32b2c","resolution":{"observed_at":"2026-08-06T19:07:35.695120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13688","last_updated":"2023-02-14T16:33:33Z","snapshot_observed_at":"2026-08-05T20:18:14.325590Z","submitted_at":"2023-01-31T15:03:44Z","title":"The Flan Collection: Designing Data and Methods for Effective Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13688","snapshot_observed_at":"2026-08-06T19:07:35.794165Z","title":"Le, Barret Zoph, Jason Wei, and Adam Roberts","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.794165Z"},"links":{"cited_paper":"/paper/2301.13688","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:c83f1b7117c263d204adabbdde489d0475770ec9e75d7343af39ac1209801b15","observation_id":"307412f8-9ec6-4604-949b-9008ea4e6bba","resolution":{"observed_at":"2026-08-06T19:07:35.794165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.09832","last_updated":"2022-08-26T16:43:05Z","snapshot_observed_at":"2026-07-06T12:09:59.122020Z","submitted_at":"2021-11-18T17:59:35Z","title":"Merging Models with Fisher-Weighted Averaging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.09832","snapshot_observed_at":"2026-08-06T19:07:35.903087Z","title":"Merging models with fisher-weighted averaging, 2022 a","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.903087Z"},"links":{"cited_paper":"/paper/2111.09832","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:281738414b5a9f6c82690ce4fe22ebf2b47ba69f1327047bf2dbe75b23103ca6","observation_id":"78c09d55-878c-42a8-8687-8b6c916a760e","resolution":{"observed_at":"2026-08-06T19:07:35.903087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:38.961848Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":"0f54de0a-73c0-44c6-b35a-00fa5363e7bd","year":2022},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:35.999888Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:ff85729bdeff963798722dcd7f22cb35aa9c03c5545fa837612052082e4ff735","observation_id":"9f34d01b-83f9-4c29-8a5a-83aa9597af52","resolution":{"observed_at":"2026-08-06T19:07:39.040806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:38.700391Z","title":"Skeletonization: A technique for trimming the fat from a network via relevance assessment","venue":null,"work_id":"5e9ff82f-c02f-48fc-9f3f-7fe6778c23de","year":1988},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.104125Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:105eeaf26bd11ad3ce234549cad2e6d8b4a820457a2e1502a36f794c4a00f503","observation_id":"4bfd8cdd-3df4-4e9f-aca3-5eda233f5b46","resolution":{"observed_at":"2026-08-06T19:07:38.871794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05859","last_updated":"2024-06-20T20:31:51Z","snapshot_observed_at":"2026-07-06T17:27:33.275341Z","submitted_at":"2024-02-08T17:43:22Z","title":"Learning to Route Among Specialized Experts for Zero-Shot Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05859","snapshot_observed_at":"2026-08-06T19:07:36.198112Z","title":"Learning to route among specialized experts for zero-shot generalization","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.198112Z"},"links":{"cited_paper":"/paper/2402.05859","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:fe3dc12ebb5d3ef45b72e3038cd1321661985dac0cdd60e59f78a79bcc7a3a16","observation_id":"4983760f-3925-4083-a3e1-6006985844dd","resolution":{"observed_at":"2026-08-06T19:07:36.198112Z","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-07-06T18:16:03.617132Z","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-06T18:59:51.035240Z","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:9692bd5455b1f7c45c473b8c300a7b092f5913d18f28d020bb79269be40c61a2","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":"2406.16797","last_updated":"2024-06-25T13:46:41Z","snapshot_observed_at":"2026-08-06T08:17:30.657677Z","submitted_at":"2024-06-24T16:58:23Z","title":"Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16797","snapshot_observed_at":"2026-08-06T19:07:36.343498Z","title":"Lottery ticket adaptation: Mitigating destructive interference in llms, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.343498Z"},"links":{"cited_paper":"/paper/2406.16797","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:39fbcf49336f280229d54c82fc57f3fa50e83667459b5afb616d96d1f9c9ea90","observation_id":"d36ed58d-7f22-42d9-8b79-14e400ec324c","resolution":{"observed_at":"2026-08-06T19:07:36.343498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13025","last_updated":"2024-12-02T06:40:50Z","snapshot_observed_at":"2026-07-06T19:34:55.594468Z","submitted_at":"2024-10-16T20:33:06Z","title":"LoRA Soups: Merging LoRAs for Practical Skill Composition Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13025","snapshot_observed_at":"2026-08-06T19:07:36.431399Z","title":"Lora soups: Merging loras for practical skill composition tasks","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.431399Z"},"links":{"cited_paper":"/paper/2410.13025","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:7f66488c049e9b8d58a049e8a01fdfacf85628817ada7a20c450f3dbabf192ff","observation_id":"d67e5d15-9a07-4467-a930-2bacbae67ced","resolution":{"observed_at":"2026-08-06T19:07:36.431399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:38.458582Z","title":"Controlling text-to-image diffusion by orthogonal finetuning","venue":null,"work_id":"e6dbe57c-10be-49f9-a316-d8e23563948d","year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.534997Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:fc03fe2e3f46efcab6d9c9ecf103160c5b1f93546fe2c02fbdd2551ac6b94cf3","observation_id":"e641931a-8c7e-4af0-a8a9-a0e1545a3be8","resolution":{"observed_at":"2026-08-06T19:07:38.546969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10683","last_updated":"2023-09-19T15:14:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-23T17:37:36Z","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.10683","snapshot_observed_at":"2026-08-06T19:07:36.623726Z","title":null,"venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.623726Z"},"links":{"cited_paper":"/paper/1910.10683","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:ba066ed0db5e5966cccb38af8335c3cd9f4c75f32c4d6c540d3e983f909d3487","observation_id":"989c74ad-b698-4d7d-94bc-83483ee7b220","resolution":{"observed_at":"2026-08-06T19:07:36.623726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:38.311380Z","title":"Overcoming catastrophic forgetting with hard attention to the task","venue":null,"work_id":"41477cb8-8877-400b-a382-70876bc224e9","year":2018},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.737547Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:470f97fb0cde89654a8f9570a63ce29b91c73f0931f8844841ca2ff93e478773","observation_id":"35dbe9c3-5361-4e5d-805c-286c03ba797a","resolution":{"observed_at":"2026-08-06T19:07:38.383453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:07:38.203426Z","title":"In defense of structural sparse adapters for concurrent llm serving","venue":null,"work_id":"894e92fb-8f78-449a-8300-6c4daf71febf","year":2024},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.825133Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:1ff7892a05dbc13b63806516f7f07c62672f24ff4b7a435ccc7621943a7bf644","observation_id":"78c19b63-ec63-4cc5-b92e-c26be8272c4f","resolution":{"observed_at":"2026-08-06T19:07:38.249909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07376","last_updated":"2020-08-07T00:02:33Z","snapshot_observed_at":"2026-08-03T13:48:05.558970Z","submitted_at":"2020-02-18T05:14:47Z","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07376","snapshot_observed_at":"2026-08-06T19:07:36.919868Z","title":"Picking winning tickets before training by preserving gradient flow","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:36.919868Z"},"links":{"cited_paper":"/paper/2002.07376","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:fd3e4903077e1ba8521d282993e187cb462886db23dbf7862d0811a120f014ae","observation_id":"d9b71dcf-fa57-483c-9ff7-06ddaa2c2f24","resolution":{"observed_at":"2026-08-06T19:07:36.919868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04468","last_updated":"2016-12-06T14:39:05Z","snapshot_observed_at":"2026-07-06T05:10:50.385049Z","submitted_at":"2016-09-14T22:42:23Z","title":"Sampling Generative Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04468","snapshot_observed_at":"2026-08-06T19:07:37.039608Z","title":"Sampling generative networks, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.039608Z"},"links":{"cited_paper":"/paper/1609.04468","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:8867d73cba211de5f8446859886c32e2d9a3ed3f615f95c1687e2e3abe27f7f5","observation_id":"bfd30180-3b91-4856-86ee-e03327149355","resolution":{"observed_at":"2026-08-06T19:07:37.039608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05482","last_updated":"2022-07-01T23:48:19Z","snapshot_observed_at":"2026-07-06T12:46:30.292996Z","submitted_at":"2022-03-10T17:03:49Z","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05482","snapshot_observed_at":"2026-08-06T19:07:37.115621Z","title":"Morcos, Hongseok Namkoong, Ali Farhadi, Yair Carmon, Simon Kornblith, and Ludwig Schmidt","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.115621Z"},"links":{"cited_paper":"/paper/2203.05482","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:8b2a3a5ae38566e539f97bfa94666e51d9cfafe23d19113234cc693c4670c58c","observation_id":"c0f772ff-fac1-4aef-8a0b-cbd2781dd05e","resolution":{"observed_at":"2026-08-06T19:07:37.115621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.01708","last_updated":"2023-10-27T01:09:31Z","snapshot_observed_at":"2026-07-06T15:37:16.278040Z","submitted_at":"2023-06-02T17:31:32Z","title":"TIES-Merging: Resolving Interference When Merging Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.01708","snapshot_observed_at":"2026-08-06T19:07:37.170618Z","title":"Ties-merging: Resolving interference when merging models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.170618Z"},"links":{"cited_paper":"/paper/2306.01708","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:8cffe2d619eba82b4821917a103092f5dd5f799eec4df6ebb65e8d52488d00bc","observation_id":"b2e3f8ca-f941-44e3-aa8b-fc336d3312d8","resolution":{"observed_at":"2026-08-06T19:07:37.170618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07057","last_updated":"2025-08-09T02:28:21Z","snapshot_observed_at":"2026-08-06T03:12:19.951717Z","submitted_at":"2024-08-13T17:49:00Z","title":"A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07057","snapshot_observed_at":"2026-08-06T19:07:37.247810Z","title":"A survey on model moerging: Recycling and routing among specialized experts for collaborative learning","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.247810Z"},"links":{"cited_paper":"/paper/2408.07057","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:e16c0f4e79e4b0181d62a6ea5416fac53a5bb170b389e959bd8813862e9ffed8","observation_id":"a49c98b7-3b4b-404a-9598-85c85b8697e7","resolution":{"observed_at":"2026-08-06T19:07:37.247810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03617","last_updated":"2024-10-04T17:17:19Z","snapshot_observed_at":"2026-07-06T19:27:52.298292Z","submitted_at":"2024-10-04T17:17:19Z","title":"What Matters for Model Merging at Scale?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03617","snapshot_observed_at":"2026-08-06T19:07:37.304965Z","title":"What matters for model merging at scale?, 2024 b","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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.304965Z"},"links":{"cited_paper":"/paper/2410.03617","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:3a43f13225e247272518eb40383397f7571e238ce5e1299839702984bf1c6fcd","observation_id":"50f6427a-6a53-420d-a4f3-e1483cba258f","resolution":{"observed_at":"2026-08-06T19:07:37.304965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02575","last_updated":"2024-05-28T06:42:31Z","snapshot_observed_at":"2026-08-05T09:56:02.040968Z","submitted_at":"2023-10-04T04:26:33Z","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02575","snapshot_observed_at":"2026-08-06T19:07:37.383490Z","title":"Adamerging: Adaptive model merging for multi-task learning, 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-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.383490Z"},"links":{"cited_paper":"/paper/2310.02575","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:129d85a1226ef0002c03da601dc8fb2934128790db41d9a369d09d2fdaab5a03","observation_id":"b5e36ff9-2e9a-47f3-9c58-af6506c4c686","resolution":{"observed_at":"2026-08-06T19:07:37.383490Z","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-06T19:07:37.441923Z","title":"Adalora: Adaptive budget allocation for parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.441923Z"},"links":{"cited_paper":"/paper/2303.10512","citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:edf32e7360b023579207e413be5e8362b8ac1975648d0571ef2a3f3ea687b914","observation_id":"95ac8e9d-fa23-4d8e-a8a8-f2e31c924a3e","resolution":{"observed_at":"2026-08-06T19:07:37.441923Z","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-06T19:07:37.526938Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.526938Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:4e7994d8a49ccd441dd20f866b7ba336de94779ef0dc19c483801e19e1bbf9bb","observation_id":"cf925502-7073-4148-bf15-b5970342807c","resolution":{"observed_at":"2026-08-06T19:07:37.526938Z","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-06T19:07:37.576678Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.576678Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:2ea602632848489efd7834293a579d34da33fab0d260441db5946b9d3cb6eb63","observation_id":"d6737e9d-bfc4-44ee-a718-eb5c31a0a94b","resolution":{"observed_at":"2026-08-06T19:07:37.576678Z","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-06T19:07:37.627106Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.627106Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:80e542d27da4dad05c1b2d5801ae38875b8dbffbae9756ea1cccf37445d81817","observation_id":"e875e3c5-309c-4a6c-8d57-415d2cdd90e7","resolution":{"observed_at":"2026-08-06T19:07:37.627106Z","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-06T19:07:37.681809Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T19:07:37.681809Z"},"links":{"citing_paper":"/paper/2507.07140"},"observation_digest":"sha256:8cf01a3633ccf13aa66d73fb409bce1a4b6a54fb285ccaac91b000c58b0f8ea8","observation_id":"f813b2b1-a548-412e-8891-fffe12749886","resolution":{"observed_at":"2026-08-06T19:07:37.681809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.07140","last_updated":"2025-07-14T04:57:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T18:59:51.035240Z","submitted_at":"2025-07-09T03:25:45Z","title":"Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":47},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2507.07140."}