{"as_of":"2026-08-16T23:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cdf68201d1b4cc59ffb66b8a219e7bfddf56ef04db690bf930c82f42d409eb8","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:59:45.856627Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:01:02.089133Z","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-06-30T18:04:58.457046Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.12379","snapshot_observed_at":"2026-08-09T17:01:02.089133Z","title":"Training-free llm merging for multi-task learning.arXiv preprint arXiv:2506.12379,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01015","last_updated":"2026-06-23T02:24:17Z","snapshot_observed_at":"2026-08-15T15:11:48.357266Z","submitted_at":"2025-02-03T03:18:26Z","title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic","version":5},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T17:01:02.089133Z"},"links":{"cited_paper":"/paper/2506.12379","citing_paper":"/paper/2502.01015"},"observation_digest":"sha256:cc798b9f416fe66b8d327c46748b890f7a9d92589e297b9f5498eda899fca10c","observation_id":"cace174b-83f9-46be-815e-3eb04997b0a0","resolution":{"observed_at":"2026-08-09T17:01:02.089133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"cited_work":{"arxiv_id":"2506.12379","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.12379","snapshot_observed_at":"2026-06-30T18:04:58.457046Z","title":"Training-free llm merging for multi-task learning.arXiv preprint arXiv:2506.12379","venue":null,"work_id":"f78cb9b4-b543-48c5-91d3-24997529d650","year":null},"citing_paper":{"arxiv_id":"2605.19409","last_updated":"2026-05-23T16:39:38Z","snapshot_observed_at":"2026-08-14T20:55:24.540334Z","submitted_at":"2026-05-19T06:03:20Z","title":"Unlocking the Potential of Continual Model Merging: An ODE Perspective","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T07:36:04.114811Z"},"links":{"cited_paper":"/paper/2506.12379","citing_paper":"/paper/2605.19409"},"observation_digest":"sha256:db3292b8066e73b1ff274e6004b632a6d1172540d586f0636db5e454f890e4f8","observation_id":"200bd5f8-a453-4e1a-82ad-fc468bf71c97","resolution":{"observed_at":"2026-05-20T07:38:09.356200Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"cited_work":{"arxiv_id":"2506.12379","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.12379","snapshot_observed_at":"2026-06-30T18:04:58.457046Z","title":"Training-free llm merging for multi-task learning.arXiv preprint arXiv:2506.12379","venue":null,"work_id":"f78cb9b4-b543-48c5-91d3-24997529d650","year":null},"citing_paper":{"arxiv_id":"2605.19409","last_updated":"2026-05-23T16:39:38Z","snapshot_observed_at":"2026-08-14T20:55:24.540334Z","submitted_at":"2026-05-19T06:03:20Z","title":"Unlocking the Potential of Continual Model Merging: An ODE Perspective","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:04.249711Z"},"links":{"cited_paper":"/paper/2506.12379","citing_paper":"/paper/2605.19409"},"observation_digest":"sha256:cad676461ef1620ca850cc951d34a49b62b3dbccea1f7c15024b740f416b619f","observation_id":"0db9d878-deea-42b9-89d1-772ecd255e28","resolution":{"observed_at":"2026-05-21T08:34:05.518847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"cited_work":{"arxiv_id":"2506.12379","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.12379","snapshot_observed_at":"2026-06-30T18:04:58.457046Z","title":"Training-free llm merging for multi-task learning.arXiv preprint arXiv:2506.12379","venue":null,"work_id":"f78cb9b4-b543-48c5-91d3-24997529d650","year":null},"citing_paper":{"arxiv_id":"2605.19409","last_updated":"2026-05-23T16:39:38Z","snapshot_observed_at":"2026-08-14T20:55:24.540334Z","submitted_at":"2026-05-19T06:03:20Z","title":"Unlocking the Potential of Continual Model Merging: An ODE Perspective","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T17:55:17.067856Z"},"links":{"cited_paper":"/paper/2506.12379","citing_paper":"/paper/2605.19409"},"observation_digest":"sha256:8b9ce0d6530579895417a06c674f51aaf7ac0ec2a3565a45b5141903862578b5","observation_id":"10ea15d3-43a7-4751-b92f-23d4dd925f26","resolution":{"observed_at":"2026-06-30T18:04:58.458596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.12379/citation-record","integrity":"/paper/2506.12379/integrity","json":"/paper/2506.12379/citation-record.json","paper":"/paper/2506.12379"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.13187","last_updated":"2025-01-27T10:19:44Z","snapshot_observed_at":"2026-08-16T14:08:13.299258Z","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-07T00:59:40.413805Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.413805Z"},"links":{"cited_paper":"/paper/2403.13187","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:13ed59ee4253f5686538396692a7588f53ad5af599f7a28757e4cd9c46011644","observation_id":"3f7e8a81-eee5-42dc-b672-dbc6ed454980","resolution":{"observed_at":"2026-08-07T00:59:40.413805Z","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-07T00:59:50.637742Z","title":null,"venue":null,"work_id":"138674c3-a456-44b1-b047-3e8b3e7e6482","year":2025},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.496470Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:1a3eedf90ddaf19c808cc1aae6682647b7e1776a50dabe495bb82a2129eee130","observation_id":"0ca3c1e2-3712-4707-b0c7-24ea09af6aa0","resolution":{"observed_at":"2026-08-07T00:59:50.750761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T00:59:50.369955Z","title":"Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, et al","venue":null,"work_id":"8b93cf9a-9802-4267-a686-f0b933408632","year":2020},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.622782Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:fecac5bf09de18fb09dce504f6b8b444a306c0a78ddad7d9f64b4fffcd06403f","observation_id":"464c4d5c-5347-4fd5-84c1-080c860fc0a1","resolution":{"observed_at":"2026-08-07T00:59:50.532962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09774","last_updated":"2024-09-15T08:41:01Z","snapshot_observed_at":"2026-08-16T17:16:03.185095Z","submitted_at":"2023-11-16T10:56:24Z","title":"HuatuoGPT-II, One-stage Training for Medical Adaption of LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.09774","snapshot_observed_at":"2026-08-07T00:59:40.779232Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.779232Z"},"links":{"cited_paper":"/paper/2311.09774","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:deae015eda9c5341492abf30f62b3acb77f22dc8ccb1684c1a8616fda20feafc","observation_id":"41b7fd76-718e-4cb3-9e46-987b190f6ed4","resolution":{"observed_at":"2026-08-07T00:59:40.779232Z","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-07T00:59:50.087040Z","title":null,"venue":null,"work_id":"6eba1d32-72b4-4f9f-a2a2-0d9de369ee3a","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:40.911888Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:09d4f7619953623b76e7583b9525c5159f9921ff7ed3d0951777a1e6c381e6e7","observation_id":"cd9e3fc5-f635-442e-9456-c2018683c7be","resolution":{"observed_at":"2026-08-07T00:59:50.217416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08177","last_updated":"2024-02-23T02:22:36Z","snapshot_observed_at":"2026-08-16T18:14:14.086565Z","submitted_at":"2023-04-17T11:39:53Z","title":"Efficient and Effective Text Encoding for Chinese LLaMA and Alpaca","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08177","snapshot_observed_at":"2026-08-07T00:59:41.030921Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.030921Z"},"links":{"cited_paper":"/paper/2304.08177","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:f3d3216f46e03eeafc6a339da75e85e7d89479a8ec5709737a985af273912246","observation_id":"47bb9d8c-164a-4a44-8560-30bc4f240ec0","resolution":{"observed_at":"2026-08-07T00:59:41.030921Z","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":"10.1007/s12559-016-9415-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Cognitive Computation","work_id":"49147f8f-e2c7-4a2a-ace5-50f3832cd566","year":2016},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.192182Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:3ef5a59ceb8bfc24cf4dfacd6fbe984989dcc5dbd15d5d84ff3b27aa657d1b46","observation_id":"fde0c2a7-2f8d-4429-a4a1-95dc020fa8b0","resolution":{"observed_at":"2026-08-07T00:59:46.314400Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-07T06:19:26.615762+00:00","source":"paper_reference_links","state":"open"},"event_date":"2016-07-29","event_type":"correction","notice_doi":"10.1007/s12559-016-9421-9","provenance":{"observed_at":"2026-07-11T03:04:21.867244+00:00","source":"crossref","source_record_id":"10.1007/s12559-016-9421-9->10.1007/s12559-016-9415-7:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:41.329347Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.329347Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:35a428a8263d4bdf90cc8e2c83f697a5daf3d3d6103f45a5fc19eb689567bdad","observation_id":"dca28ca4-e8eb-4f96-af6b-18cdfef15495","resolution":{"observed_at":"2026-08-07T00:59:41.329347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11617","last_updated":"2024-06-17T15:02:45Z","snapshot_observed_at":"2026-08-16T13:42:13.876178Z","submitted_at":"2024-06-17T15:02:45Z","title":"DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11617","snapshot_observed_at":"2026-08-07T00:59:41.483804Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.483804Z"},"links":{"cited_paper":"/paper/2406.11617","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:04f7f54fc19d59831c356bbca36395fc6a30a2b849e46db25d79a8fbddc00531","observation_id":"0295ef78-2b82-4d7b-b1fc-64e0c0ea7739","resolution":{"observed_at":"2026-08-07T00:59:41.483804Z","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-07T00:59:41.674673Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.674673Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:932974b9a2a11097c77f8b57eb5ed5e3c7830650d58a998deae26176eb154cfe","observation_id":"7dce1c3c-ffa7-4ec0-94e6-c9b468103d81","resolution":{"observed_at":"2026-08-07T00:59:41.674673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T00:59:41.797125Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.797125Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:ef547b05081aad5d88886b44a78ff6a8f2cf67110b850ec4b4f0f46a8fbbcbd1","observation_id":"8ab9bdfe-4877-4d8d-8157-a3fa60f13729","resolution":{"observed_at":"2026-08-07T00:59:41.797125Z","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-07T00:59:49.799761Z","title":null,"venue":null,"work_id":"5312d75d-5ead-496e-86de-eff8233e1f56","year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:41.919195Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:eb4a1800a627611c1ad3f49f152c29ad45890ed83da49250103a9da7e90313df","observation_id":"3545ca7f-8415-49ab-8234-14f3d32212ba","resolution":{"observed_at":"2026-08-07T00:59:49.931704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:42.091370Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.091370Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:11980528b851d2d733c75e85bae3f8c242fb0520a8f22103b9da88ddc52c6501","observation_id":"92c98190-a23d-4783-a2b0-e1e6482aedd3","resolution":{"observed_at":"2026-08-07T00:59:42.091370Z","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-07T00:59:42.204000Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.204000Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:810fe2c09ef298389173b49e343e0454bc1e96aac9195384f6a846498cd3b736","observation_id":"5992bddb-f536-40a4-b437-06c2a5b1961f","resolution":{"observed_at":"2026-08-07T00:59:42.204000Z","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-07T00:59:49.479164Z","title":null,"venue":null,"work_id":"afc5332e-61cf-4fcc-a3ec-58bddc3d55a6","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.391525Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:0c7bdf165bec296eaeb1c39a391f047c5fc97c1b65df021b35841cb11c3bc221","observation_id":"cba3f8c6-523f-42ca-98c2-8c8318ac1d12","resolution":{"observed_at":"2026-08-07T00:59:49.660360Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T00:59:49.234220Z","title":null,"venue":null,"work_id":"5f4987b6-fef1-4798-8eca-9ae3c9969ac4","year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.542441Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:084a0647444dd3e6f4af93b433216800e4bf79fd71e46aaed6a3e3a39c0d7ce6","observation_id":"54fe6159-9e15-4a71-9e45-90b520cb1e21","resolution":{"observed_at":"2026-08-07T00:59:49.339241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.13081","last_updated":"2020-09-28T05:07:51Z","snapshot_observed_at":"2026-08-15T11:16:02.015660Z","submitted_at":"2020-09-28T05:07:51Z","title":"What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Exams","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.13081","snapshot_observed_at":"2026-08-07T00:59:42.750007Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.750007Z"},"links":{"cited_paper":"/paper/2009.13081","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:03472f825a44eed2c2803fe76f1f863d04f63f4a5f0abf7bad08299a09f66d84","observation_id":"412fc1b9-2293-46ee-9947-367ed30b5131","resolution":{"observed_at":"2026-08-07T00:59:42.750007Z","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-07T00:59:49.004416Z","title":null,"venue":null,"work_id":"7fa131ff-d2c2-4259-8a4e-1f2b47f6681b","year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:42.926150Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:f4deaac847ab1d0725fba0c36e0cc702ba82610437ebe046e22d5a09f022d3ba","observation_id":"9aa5eeb2-6e81-4b28-883f-55fbccff1c71","resolution":{"observed_at":"2026-08-07T00:59:49.107184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:43.144515Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.144515Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:1d45608e889f992801252ef43fe7a971651f66d90c65e9306b046b1c7f532c51","observation_id":"9d13bef9-4aa9-4ef2-9744-47ae8b484cf1","resolution":{"observed_at":"2026-08-07T00:59:43.144515Z","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-07T00:59:43.278430Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.278430Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:54b9b296f3e9747c62973a9d5ace7dda1638cef088488ec59929df4da179b401","observation_id":"ba737b1d-9c2c-4276-8435-3ab6d91129ba","resolution":{"observed_at":"2026-08-07T00:59:43.278430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03030","last_updated":"2023-10-23T02:55:08Z","snapshot_observed_at":"2026-08-16T15:26:27.816441Z","submitted_at":"2023-06-05T16:48:41Z","title":"Benchmarking Large Language Models on CMExam -- A Comprehensive Chinese Medical Exam Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03030","snapshot_observed_at":"2026-08-07T00:59:43.421977Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.421977Z"},"links":{"cited_paper":"/paper/2306.03030","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:c63af8e45407d362ba4520f77f2f299f316e1598afb8be53478b047980ea5f80","observation_id":"af74d540-bebd-48dc-b5e1-7345a0cdcffa","resolution":{"observed_at":"2026-08-07T00:59:43.421977Z","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-07T00:59:48.717221Z","title":null,"venue":null,"work_id":"cdb8be29-92bb-4063-a8f5-5028c66e882f","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.520393Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:37436b186f2672c741480ff563d9a21af58fafcf6cd0f30dfba1d6974925553e","observation_id":"95013eb2-b63c-4af0-8c7d-fecb7b370821","resolution":{"observed_at":"2026-08-07T00:59:48.838686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:43.656059Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.656059Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:d9a00637f90e04934ee8eb9e55b667800544550301a5ab773ca740e4633476a6","observation_id":"6f40e59a-07a9-4d14-b73a-ada4fd2e88a3","resolution":{"observed_at":"2026-08-07T00:59:43.656059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02803","last_updated":"2025-01-27T04:30:43Z","snapshot_observed_at":"2026-08-16T14:21:32.621197Z","submitted_at":"2024-02-05T08:25:22Z","title":"Large Language Model Distilling Medication Recommendation Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02803","snapshot_observed_at":"2026-08-07T00:59:43.753283Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.753283Z"},"links":{"cited_paper":"/paper/2402.02803","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:e45baab4dff8a165f8da25267a612032539c9e9a2f4a2f1c7b907a0f89041b14","observation_id":"a8e8256b-3d49-4968-bf31-508eb7679497","resolution":{"observed_at":"2026-08-07T00:59:43.753283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16235","last_updated":"2024-09-24T16:51:36Z","snapshot_observed_at":"2026-08-16T13:15:47.369330Z","submitted_at":"2024-09-24T16:51:36Z","title":"EuroLLM: Multilingual Language Models for Europe","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.16235","snapshot_observed_at":"2026-08-07T00:59:43.833765Z","title":"Guerreiro, Ricardo Rei, Duarte M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.833765Z"},"links":{"cited_paper":"/paper/2409.16235","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:0802f1abe7cf56561b8d4c337bc2118f21c26d1cd3649ec58e9015351336537c","observation_id":"e25fa407-5a23-4fe7-8284-d1fa209b0dd6","resolution":{"observed_at":"2026-08-07T00:59:43.833765Z","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-07T00:59:48.457816Z","title":null,"venue":null,"work_id":"68578297-17be-4bb1-9bab-9535d89c4fe7","year":2022},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:43.967642Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:7cd87377a3d6b60327c9f5556cd9b347e0de6f714c28eee7d91df7fc0681ce59","observation_id":"eac4a4f3-c51a-444b-ba58-5b5e07ac9ac5","resolution":{"observed_at":"2026-08-07T00:59:48.587450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-16T19:40:28.523700Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T00:59:44.156771Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.156771Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:0421fd29c246764c74a7faa45412336833038a4291c6d6dce2073f36ce61a7df","observation_id":"22a08fa2-9fac-490f-ab86-d7f7052b9c96","resolution":{"observed_at":"2026-08-07T00:59:44.156771Z","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-07T00:59:44.284997Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.284997Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:2045207d3e976defc991813fe6df389941f79b71b7fe7d0807d2b3a3ae9dd7f6","observation_id":"232e7520-1c8d-4d62-acb8-3359773579af","resolution":{"observed_at":"2026-08-07T00:59:44.284997Z","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-07T00:59:48.251011Z","title":null,"venue":null,"work_id":"493edd4c-c2fb-4c9a-97f8-6cbce250f15d","year":2020},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.300692Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:45129f4b8e1523338a7231b955b63dd73e8f60b53a4299fbe80ccc600afe0b3c","observation_id":"60390bdb-d7a4-4189-8d0f-d2f6a62a79a8","resolution":{"observed_at":"2026-08-07T00:59:48.357574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:44.319300Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.319300Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:8a9b987230851f569e313d68fc7a60330af373b60755bc79a16fb1f23f5a4dbc","observation_id":"6fdf5a43-cdca-4e0f-a1d7-755f2c01e4c5","resolution":{"observed_at":"2026-08-07T00:59:44.319300Z","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-07T00:59:48.056496Z","title":null,"venue":null,"work_id":"e56041e6-ce5e-4be4-a7f5-01ff19f1a747","year":2018},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.433860Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:eeab65980f2ead847cd0365feb6100fc0074bb017a1809816506835c2962b9e1","observation_id":"a42e5a03-4224-427c-a010-99e4fe2b4d53","resolution":{"observed_at":"2026-08-07T00:59:48.173746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:44.496648Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.496648Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:c60f31ff7b023a7a715e4fbe21f403cdc6cc6ce2d68898f9edf74a699d5cd72e","observation_id":"852ba09f-222a-43e3-8d76-9aa870e1a432","resolution":{"observed_at":"2026-08-07T00:59:44.496648Z","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-07T00:59:44.612540Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.612540Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:1f8baf847c10e45b7bffd1b78a71283bd8a9ab7793237c7e397ed5c8a3874dc9","observation_id":"54904452-77d2-4d31-a070-544df2c27354","resolution":{"observed_at":"2026-08-07T00:59:44.612540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.03525","last_updated":"2023-02-09T04:11:23Z","snapshot_observed_at":"2026-08-16T15:57:04.374078Z","submitted_at":"2023-02-07T15:15:58Z","title":"Multi-Task Deep Recommender Systems: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.03525","snapshot_observed_at":"2026-08-07T00:59:44.690359Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.690359Z"},"links":{"cited_paper":"/paper/2302.03525","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:b8cab78dea82eb07bbdbaf80973cc11f1bd53cfa4e602b59f1341bc9691c4bb4","observation_id":"c6e0c2ac-244d-4361-be83-6c1b126f93a0","resolution":{"observed_at":"2026-08-07T00:59:44.690359Z","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-07T00:59:47.829897Z","title":null,"venue":null,"work_id":"98d5158a-da6c-43f3-bc0c-2eb628a3361c","year":2022},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.757799Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:7bac3ea94a98dd33b0b96fa1b5831fc2c544fff89e2fc04dcb5c4961999f0240","observation_id":"c3ff35b6-f63d-43df-bcde-74094370770a","resolution":{"observed_at":"2026-08-07T00:59:47.939986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T00:59:47.602063Z","title":null,"venue":null,"work_id":"dcf74748-ac69-4d7a-b555-e1d8563beca3","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.833710Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:07917427c72653a58a371dd164a09acbbec9247c34901b8cb50c3eb9f462cc70","observation_id":"a3767371-136c-4fc2-90d2-aca9a384d3fd","resolution":{"observed_at":"2026-08-07T00:59:47.710454Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2024.findings-emnlp.456","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"0c118d00-324d-4b16-a25d-489221141b96","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.916521Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:c1c913b2ebae0bec6b37a081967ef59fe3c2080ed0c3eefad7cd90516cfc22a5","observation_id":"8bcdbad8-00a6-449b-a49c-0100840f2667","resolution":{"observed_at":"2026-08-07T00:59:46.100195Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:44.986319Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:44.986319Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:23ada6b97381c2f549f0cd5363f5ed20c2fa2e49bacf8f9a7818f77e21683a34","observation_id":"3096d75c-e392-4fe9-9404-33f507e0c717","resolution":{"observed_at":"2026-08-07T00:59:44.986319Z","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-07T00:59:45.060859Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.060859Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:b38aa6fd5398c7fe6a4cb20dc7d041f427e096d8daa78dee02e12360023c17af","observation_id":"fea92d26-62a8-43bf-8de9-497464ef44d1","resolution":{"observed_at":"2026-08-07T00:59:45.060859Z","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-07T00:59:47.341242Z","title":"Raffel, and Mohit Bansal","venue":null,"work_id":"5a83d564-f431-4a33-bde3-9eb15f91e9d5","year":2023},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.156918Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:059442ca804e6ea78895eca131d8590342ff80c73dfad5e2b9509f9e1bf94cb9","observation_id":"d00292e3-cc12-413c-8faf-aa7b996d5eb9","resolution":{"observed_at":"2026-08-07T00:59:47.488514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-08-16T18:57:50.930866Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-07T00:59:45.245697Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.245697Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:36da5ff53be976d19589717b374f6ba6a7d5f60527863b384323a2d9e40cfbec","observation_id":"b18324c0-9e0c-450f-bd30-1d08c79ecc47","resolution":{"observed_at":"2026-08-07T00:59:45.245697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.07666","last_updated":"2025-12-31T04:06:49Z","snapshot_observed_at":"2026-08-07T23:28:24.025478Z","submitted_at":"2024-08-14T16:58:48Z","title":"Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunities","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.07666","snapshot_observed_at":"2026-08-07T00:59:45.321709Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.321709Z"},"links":{"cited_paper":"/paper/2408.07666","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:8dc7beba60b013c33bb04eac65968f795540d508141572aaa04a1d3843f49c36","observation_id":"85d8d101-6822-4197-be66-ae1f04fbaecf","resolution":{"observed_at":"2026-08-07T00:59:45.321709Z","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-07T00:59:47.114514Z","title":null,"venue":null,"work_id":"e605975a-b3b5-42e5-8daa-a7254dfc7b5e","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.439350Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:659c4f1b72d61a66d91e3398b0c314ede929d75bae45299542d07ade5fee5a84","observation_id":"73141bcd-5b72-4b61-9c86-db1795431c18","resolution":{"observed_at":"2026-08-07T00:59:47.194739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T00:59:46.942201Z","title":null,"venue":null,"work_id":"801236a4-f142-4d7f-9c11-8ae3101cb304","year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.505391Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:d20a4d084aff0aea789e5cc776b4f7924025737264f793513f49c24b92332522","observation_id":"17fb2222-0459-43e5-bc86-69653abce074","resolution":{"observed_at":"2026-08-07T00:59:47.014261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:59:45.588245Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.588245Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:2beeca89d530e11c49b23881119c1bb50a1d4253b3472a2e23afd31929a3d196","observation_id":"a9c04548-9de8-44d9-a8e6-bde90823eabd","resolution":{"observed_at":"2026-08-07T00:59:45.588245Z","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-07T00:59:45.684289Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.684289Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:37d12641f510beb5de5efa299e3748745a2bfeb2be3d6b67737bc6befe7e2d73","observation_id":"0f9f7e96-10a2-4514-a9aa-81ad5e7a0673","resolution":{"observed_at":"2026-08-07T00:59:45.684289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.18223","last_updated":"2026-03-18T05:34:39Z","snapshot_observed_at":"2026-08-14T10:40:26.323157Z","submitted_at":"2023-03-31T17:28:46Z","title":"A Survey of Large Language Models","version":19},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.18223","snapshot_observed_at":"2026-08-07T00:59:45.731046Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.731046Z"},"links":{"cited_paper":"/paper/2303.18223","citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:2f96ed2e804f68e082b347047ad6d7e5d89123b63885738ceaf265781bb9f400","observation_id":"46e35be3-299c-4252-87c6-aa831a0d478b","resolution":{"observed_at":"2026-08-07T00:59:45.731046Z","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-07T00:59:45.782117Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.782117Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:227847d89b0f932094c33377385b0f118dd40e21ac771feed92b3ca42d6d1f76","observation_id":"30834b9a-a3e3-4d36-8918-fc7f5217dcf1","resolution":{"observed_at":"2026-08-07T00:59:45.782117Z","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-07T00:59:45.856627Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:59:45.856627Z"},"links":{"citing_paper":"/paper/2506.12379"},"observation_digest":"sha256:2f7359df2883ea3ce213eaf9ca78d29426a0a07a7454ee0ca79b66ece5025d8b","observation_id":"160eeda4-35dd-4990-aa4d-d3369614fb4e","resolution":{"observed_at":"2026-08-07T00:59:45.856627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.12379","last_updated":"2025-06-14T07:21:11Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T03:58:36.146121Z","submitted_at":"2025-06-14T07:21:11Z","title":"Training-free LLM Merging for Multi-task Learning"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":49},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2506.12379."}