{"as_of":"2026-08-20T10:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa373c6f9d3d6e0b07cb6849943fc73f9f3e5e3df175fa2461e5a5d10492463e","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:08:39.277258Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:20:32.042228Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T13:52:15.425238Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16815","snapshot_observed_at":"2026-08-11T19:24:43.683639Z","title":"Free-merging: Fourier transform for model merging with lightweight experts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06712","last_updated":"2024-12-09T18:01:13Z","snapshot_observed_at":"2026-08-19T04:15:00.429910Z","submitted_at":"2024-12-09T18:01:13Z","title":"How to Merge Your Multimodal Models Over Time?","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-11T19:24:43.683639Z"},"links":{"cited_paper":"/paper/2411.16815","citing_paper":"/paper/2412.06712"},"observation_digest":"sha256:d4966eef5541b7a2c086c334d5a0df043f3969451c89d5048d1ea712ba8c7114","observation_id":"afd550d9-91c3-4ba7-903a-991abcb9eacb","resolution":{"observed_at":"2026-08-11T19:24:43.683639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16815","snapshot_observed_at":"2026-08-15T23:20:32.042228Z","title":", author Wang, H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04969","last_updated":"2025-05-08T06:01:11Z","snapshot_observed_at":"2026-08-18T21:11:34.127975Z","submitted_at":"2025-05-08T06:01:11Z","title":"General Transform: A Unified Framework for Adaptive Transform to Enhance Representations","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T23:20:32.042228Z"},"links":{"cited_paper":"/paper/2411.16815","citing_paper":"/paper/2505.04969"},"observation_digest":"sha256:d0eda19f9d25813488f8cd03493a6e50dc93c62cd9c3b1b2eaee4dcde8aa5cde","observation_id":"8be6a11b-4d0f-4a04-9ec6-dbf87b26fff7","resolution":{"observed_at":"2026-08-15T23:20:32.042228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16815","snapshot_observed_at":"2026-08-15T20:56:48.554329Z","title":"Zheng and H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11344","last_updated":"2025-05-16T15:11:19Z","snapshot_observed_at":"2026-08-20T07:59:38.475098Z","submitted_at":"2025-05-16T15:11:19Z","title":"Dynamic Base model Shift for Delta Compression","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T20:56:48.554329Z"},"links":{"cited_paper":"/paper/2411.16815","citing_paper":"/paper/2505.11344"},"observation_digest":"sha256:8ac4ef859185744d4203a73c8bb8547dab82aabb6dd2dac3ea07f35ef3d104f4","observation_id":"4c0f2020-0713-4cf3-8170-d83a95147f46","resolution":{"observed_at":"2026-08-15T20:56:48.554329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16815","snapshot_observed_at":"2026-08-07T15:18:17.248316Z","title":"Free-merging: Fourier transform for model merging with lightweight experts.arXiv preprint arXiv:2411.16815, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15875","last_updated":"2025-05-21T16:34:37Z","snapshot_observed_at":"2026-08-20T02:17:10.220910Z","submitted_at":"2025-05-21T16:34:37Z","title":"Decouple and Orthogonalize: A Data-Free Framework for LoRA Merging","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T15:18:17.248316Z"},"links":{"cited_paper":"/paper/2411.16815","citing_paper":"/paper/2505.15875"},"observation_digest":"sha256:3365e2bc20e03481bc57a17984618ffd52116ca569181a0ca5fe109184bf30d0","observation_id":"223daaed-73e4-4506-8e68-3e28830c3994","resolution":{"observed_at":"2026-08-07T15:18:17.248316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"cited_work":{"arxiv_id":"2411.16815","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.16815","snapshot_observed_at":"2026-08-07T13:52:15.425238Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","venue":"cs.CV","work_id":"2702dba5-d768-4f50-9b3d-61fe25ba26b9","year":2024},"citing_paper":{"arxiv_id":"2505.20925","last_updated":"2025-05-27T09:15:03Z","snapshot_observed_at":"2026-08-17T23:21:15.835136Z","submitted_at":"2025-05-27T09:15:03Z","title":"Multi-objective Large Language Model Alignment with Hierarchical Experts","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T13:52:14.549357Z"},"links":{"cited_paper":"/paper/2411.16815","citing_paper":"/paper/2505.20925"},"observation_digest":"sha256:9a051d0a3c494cbf2f244c3bcb3e94b6abb2487b8e753f3165d77d7c3cedc3e8","observation_id":"5e538471-fcb1-43a1-a86b-e68204ac7541","resolution":{"observed_at":"2026-08-07T13:52:15.496167Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.16815/citation-record","integrity":"/paper/2411.16815/integrity","json":"/paper/2411.16815/citation-record.json","paper":"/paper/2411.16815"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:08:42.357921Z","title":"Git re-basin: Merging models modulo permutation symmetries","venue":null,"work_id":"c454e59d-4eba-409e-9a58-74923cb9bbf4","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.462842Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:2852565142edc2a97a6e76c1cf8a7d73036a992e4b17c6a5a5f37cbf78d95368","observation_id":"15021d09-8266-4357-b897-20b80465b8ad","resolution":{"observed_at":"2026-08-12T13:08:42.416511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-12T13:08:37.572492Z","title":"Qwen technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.572492Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:324025a00405d127b5ec8637bb2174b64b67e6431e159b8e57e36bfba21e4264","observation_id":"ca70d7e9-d626-46da-8c41-9f4e0aaa9985","resolution":{"observed_at":"2026-08-12T13:08:37.572492Z","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-12T13:08:42.290167Z","title":"Fourier image trans- former","venue":null,"work_id":"55db1db4-6716-42ef-8161-a0b3d7e2f7b3","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.669595Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:21eb49757a1b5ca80422c798b32bfea003aeeb843b5141c82f329e9fda10af99","observation_id":"a59a476f-4651-4705-b2a8-03276404ff8a","resolution":{"observed_at":"2026-08-12T13:08:42.298306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:42.267942Z","title":"Multi-task learning in natural language processing: An overview","venue":null,"work_id":"0d04cc5f-c00a-467a-b635-f9b7b59fdd72","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.678088Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:50c13561ff22e90c3e978bfbc1732ce14dc56eb8e33dd96fb07dbc91bffbc43c","observation_id":"8f031660-6e44-4c7e-a8ac-5fe1e0b3cb5f","resolution":{"observed_at":"2026-08-12T13:08:42.273605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:42.166228Z","title":"Rethinking fast fourier convolution in image inpainting","venue":null,"work_id":"7bc204ca-cc51-48ad-9623-a9f78d12ff2f","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.685938Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:c4df8e1ffebcc0f3b8823cad5adec629713e21c44be77e7d2d0c5b185512d97d","observation_id":"f17b93c2-9fef-4e44-9c57-dec3d96fce1b","resolution":{"observed_at":"2026-08-12T13:08:42.202691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:42.141785Z","title":"Scaling instruction- finetuned language models","venue":null,"work_id":"b91c289e-5b15-4889-afc1-b0989fe8f902","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.693723Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:85cddba80d3387c4883d93738cef6b4d853515fa4ca6bdff3bccbbfc77d39895","observation_id":"7c330554-b154-42b2-abcc-8403f89d692c","resolution":{"observed_at":"2026-08-12T13:08:42.148770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-18T21:12:09.108009Z","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-12T13:08:37.704435Z","title":"Model breadcrumbs: Scaling multi-task model merging with sparse masks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.704435Z"},"links":{"cited_paper":"/paper/2312.06795","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:60142751d9aa6ca75951370c71a719cf0adb51b7d6367fd5fe0f96119daac38b","observation_id":"5fef34bd-6176-4887-9a71-f18b2eeb32fb","resolution":{"observed_at":"2026-08-12T13:08:37.704435Z","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-18T06:57:37.961263Z","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-12T13:08:37.711730Z","title":"Della-merging: Reducing interference in model merg- ing through magnitude-based sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.711730Z"},"links":{"cited_paper":"/paper/2406.11617","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:94a9fa8a79116444e5da548719d31d93b133ce6d02a102b3e38c01308b9a21dc","observation_id":"12fd938c-9a93-43e8-bd0e-cba9fd437180","resolution":{"observed_at":"2026-08-12T13:08:37.711730Z","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-12T13:08:42.102667Z","title":"BERT: Pre-training of deep bidirectional trans- formers for language understanding","venue":null,"work_id":"9ff84816-f249-44b5-8a05-f3761517def4","year":2019},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.720644Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:5970749f25540b8884592b828e284e4adbc2c1d1df8f96e567dd962e84221b0b","observation_id":"0c2893d2-a6b3-41eb-9579-9f1234102cfc","resolution":{"observed_at":"2026-08-12T13:08:42.125430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.998356Z","title":"Parameter-efficient fine-tuning of large-scale pre-trained language models.Nature Machine In- telligence, 5(3):220–235, 2023","venue":null,"work_id":"b02eb584-95be-4037-b34a-53797b19d5ec","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.810722Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:08eff4b85ccd69f18321db843802c84fc4f41a46e4031947804093aec519e53e","observation_id":"8f1fad8b-2dd9-474a-b48f-423784b27649","resolution":{"observed_at":"2026-08-12T13:08:42.034938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:37.885956Z","title":"A survey on ensemble learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.885956Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:f1d08937e7a16077fbecf6568af58bf37c7a9b8e8037077a1a076c79d4607873","observation_id":"e64356d8-45e1-4225-b6f2-66cc1790d9d2","resolution":{"observed_at":"2026-08-12T13:08:37.885956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02396","last_updated":"2024-10-03T11:17:58Z","snapshot_observed_at":"2026-08-18T21:12:07.984829Z","submitted_at":"2024-10-03T11:17:58Z","title":"Parameter Competition Balancing for Model Merging","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02396","snapshot_observed_at":"2026-08-12T13:08:37.893520Z","title":"Parameter competition balancing for model merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.893520Z"},"links":{"cited_paper":"/paper/2410.02396","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:d54a73b5a3c871648d5ea9c16418c699d4e0ca904fb83b1f3ff74f0ec0a6dd90","observation_id":"8a443479-8860-4d97-9f30-dfa2bd580ce6","resolution":{"observed_at":"2026-08-12T13:08:37.893520Z","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-12T13:08:37.901351Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.901351Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:60a37794485395c39043b31a32c4c4d0df19ca532ba4dfde4b33e5593990b334","observation_id":"da4473a3-d22a-40ba-afb1-e1c9753a0527","resolution":{"observed_at":"2026-08-12T13:08:37.901351Z","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-12T13:08:41.963673Z","title":"Fast fourier transforms: a tutorial review and a state of the art","venue":null,"work_id":"fcc376b8-5009-40d5-ace4-4742e32673ff","year":1990},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.910905Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:7ab808d5ae284a6c25108ed3376529ff376fc14153b07aa7dfca3e29de914d58","observation_id":"225873bd-2fd0-4186-9bde-3664e46302f6","resolution":{"observed_at":"2026-08-12T13:08:41.972431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.867113Z","title":"Ensem- ble deep learning: A review","venue":null,"work_id":"9274f283-08fb-4914-9c1c-12c59b0bfb2c","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.918316Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:2e069571fd5c6b45e13066108a2ce3410f6c1e2edd0842af3a6e2834b8bca1dc","observation_id":"b8f7cd27-2dc0-4c36-9293-ee35557edc02","resolution":{"observed_at":"2026-08-12T13:08:41.909945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00081","last_updated":"2025-04-04T10:10:41Z","snapshot_observed_at":"2026-08-18T21:12:13.526160Z","submitted_at":"2024-11-26T22:53:06Z","title":"Task Singular Vectors: Reducing Task Interference in Model Merging","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00081","snapshot_observed_at":"2026-08-12T13:08:37.962480Z","title":"Task singular vectors: Reducing task interference in model merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:37.962480Z"},"links":{"cited_paper":"/paper/2412.00081","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:f6b5aedc0ebdc80393d51857b76c92869e4e10d685dc70945d72abdf7578c436","observation_id":"3598c8c2-7c47-46a6-aea1-ab7ab0c252cb","resolution":{"observed_at":"2026-08-12T13:08:37.962480Z","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-12T13:08:41.760150Z","title":"Loss surfaces, mode connectivity, and fast ensembling of dnns","venue":null,"work_id":"6108593f-ac73-425b-85a7-7cda797b1de0","year":2018},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.072989Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:b2f3caa245b18d29c482d715200a7efca9a9321d083f2205b1ea4ef1a3edcc25","observation_id":"b6f1fb53-e2e7-4990-9bfe-8435c3e536c5","resolution":{"observed_at":"2026-08-12T13:08:41.796206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.732638Z","title":"Digital image process- ing","venue":null,"work_id":"471bda67-7a97-4aeb-8da4-8827cadd4cbd","year":1987},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.079387Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:ee600b15be42ee47a938cfd0ade27dadc129e741ca20cafab3f689ac163f20ab","observation_id":"8443a03f-ff92-4e36-a55d-2173e8fce7dd","resolution":{"observed_at":"2026-08-12T13:08:41.739638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.655195Z","title":"Lora: Low- rank adaptation of large language models","venue":null,"work_id":"a822f25e-1d92-4161-b10e-0d05dbeeb60b","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.087658Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:c42a70fc3e847dd516919e442760ebaf1ca5a17eacf624fbcb155c582ddcf760","observation_id":"50c724bf-b66a-4ead-a891-919c93132470","resolution":{"observed_at":"2026-08-12T13:08:41.665448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17461","last_updated":"2024-09-27T11:34:05Z","snapshot_observed_at":"2026-08-18T21:12:08.403194Z","submitted_at":"2024-05-23T05:25:45Z","title":"EMR-Merging: Tuning-Free High-Performance Model Merging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17461","snapshot_observed_at":"2026-08-12T13:08:38.106220Z","title":"Emr-merging: Tuning- free high-performance model merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.106220Z"},"links":{"cited_paper":"/paper/2405.17461","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:d474714d7ed11d9fc88459e6826301944c409a841c3b16e47300f6484c074cad","observation_id":"96c710da-ac04-403a-80b0-b0b19762bc28","resolution":{"observed_at":"2026-08-12T13:08:38.106220Z","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-13T03:27:01.609831Z","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-12T13:08:38.185125Z","title":"Editing models with task arithmetic","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.185125Z"},"links":{"cited_paper":"/paper/2212.04089","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:6fcf9e8e12666331e81c8f2d63505d849267fbb531dfb22aa20f7fc78f46e2f7","observation_id":"5637f7d7-a3c1-4d79-95bf-1d63ebd22a89","resolution":{"observed_at":"2026-08-12T13:08:38.185125Z","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-12T13:08:41.630273Z","title":"Llm- blender: Ensembling large language models with pairwise ranking and generative fusion","venue":null,"work_id":"ea9f6ed9-86ca-4034-8907-e89dd10ce942","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.230067Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:89f5091c3afc4614bc0ba7a9a1286b36fcfb52dde74703387d3c932bb7672e24","observation_id":"c3c0e048-2764-49db-818a-7ca1e8d79696","resolution":{"observed_at":"2026-08-12T13:08:41.637683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09849","last_updated":"2025-05-21T23:53:00Z","snapshot_observed_at":"2026-08-16T16:07:30.940052Z","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-12T13:08:38.237216Z","title":"Dataless knowledge fusion by merging weights of language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.237216Z"},"links":{"cited_paper":"/paper/2212.09849","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:781a51cdecf59b29081e4b118e2078f936f31f0b7e4a839bd0c06107076fafa8","observation_id":"43266ccc-0257-4917-92e4-3a61ddf8c1d4","resolution":{"observed_at":"2026-08-12T13:08:38.237216Z","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-12T13:08:41.581692Z","title":"Gshard: Scaling giant models with conditional computation and automatic sharding","venue":null,"work_id":"c3d8fdb8-d40c-4aa9-aad3-f1b4b389da32","year":2021},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.244798Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:d35c948067e6acc7105463269956ceef291916e608dd62ccaa79f45f4ecccdd0","observation_id":"8837bfd7-d6ab-47aa-bf52-5371f12635f3","resolution":{"observed_at":"2026-08-12T13:08:41.616060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:38.252691Z","title":"Visualizing the loss landscape of neural nets","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.252691Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:04247510dc1c2f1410f8c6df7c092e479496e977c2122a60456d13d027484ce9","observation_id":"e95dcd52-bec8-413e-810e-065d19115ef4","resolution":{"observed_at":"2026-08-12T13:08:38.252691Z","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-12T13:08:41.492869Z","title":"Few- shot parameter-efficient fine-tuning is better and cheaper than in-context learning","venue":null,"work_id":"0c40318c-efef-4319-801e-3b22d095bb2b","year":1950},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.261130Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:11117873999fdb03555ccb690494258f5c4853e24e7c38322d25cc489ad5dcb7","observation_id":"9acd215b-03f7-43c3-b53a-c7cabcd24f9d","resolution":{"observed_at":"2026-08-12T13:08:41.499308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.466294Z","title":"Bitdelta: Your fine-tune may only be worth one bit.Advances in Neural Information Processing Systems, 37:13579–13600, 2024","venue":null,"work_id":"aa2fc0e3-fc79-4e31-a195-e7bd1ca9ffda","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.267117Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:a44e06e9a991cdfd97c953518263a4e53ecea7b2f070a032e7e373564128fd80","observation_id":"5b54e3af-d1c0-4c5d-ae61-f474ee5dd8d9","resolution":{"observed_at":"2026-08-12T13:08:41.473490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.416777Z","title":"Hierarchical prompt learning for multi-task learning","venue":null,"work_id":"f6b9514c-5726-4d3a-8846-3c887065367c","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.328665Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:12fadf48e04360c89b5fb13a951aa3c5b676a202bcb9168382e4ad0ed57e8398","observation_id":"4ddf6e5a-a08a-4a13-b0dc-4ef0a8a659f6","resolution":{"observed_at":"2026-08-12T13:08:41.452687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15479","last_updated":"2024-10-14T04:14:26Z","snapshot_observed_at":"2026-08-18T21:12:08.698517Z","submitted_at":"2024-06-17T02:31:55Z","title":"Twin-Merging: Dynamic Integration of Modular Expertise in Model Merging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15479","snapshot_observed_at":"2026-08-12T13:08:38.416595Z","title":"Twin-merging: Dynamic integra- tion of modular expertise in model merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.416595Z"},"links":{"cited_paper":"/paper/2406.15479","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:c0ee4bb06db5774f19ed97cfcdc88a57140d6ba6dfb70e2f9cb76afcac13c84c","observation_id":"486cf8df-0b07-4b8a-89fa-5ca3edb5c3ef","resolution":{"observed_at":"2026-08-12T13:08:38.416595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09583","last_updated":"2025-06-04T08:58:56Z","snapshot_observed_at":"2026-08-02T06:48:43.121988Z","submitted_at":"2023-08-18T14:23:21Z","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09583","snapshot_observed_at":"2026-08-12T13:08:38.452507Z","title":"Wizardmath: Empowering mathematical reasoning for large language models via rein- forced evol-instruct","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.452507Z"},"links":{"cited_paper":"/paper/2308.09583","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:99dcab44ad9890c907b037bd6645c7c87439c35b1cc61d1a641de439337a5226","observation_id":"a5320055-63df-4bed-9b4d-3c3cdfc50001","resolution":{"observed_at":"2026-08-12T13:08:38.452507Z","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-12T13:08:41.366468Z","title":"Wizardcoder: Empowering code large language models with evol-instruct","venue":null,"work_id":"68a4db82-b5f2-420f-ae28-0bd7152e014d","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.460532Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:15544411242b18bf17c8080511459d2fe2a16f30c3cd845cb0ab91ca2b238eaa","observation_id":"974c7a0b-19b8-462d-833d-9ef581df1e50","resolution":{"observed_at":"2026-08-12T13:08:41.375743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.337313Z","title":"Llm-pruner: On the structural pruning of large language models","venue":null,"work_id":"ab2ca3fe-fc85-43eb-bdc8-7a84b1c908e7","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.469306Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:e0cfe12dd0408f362d14d31a8dc376578cc5c98bb5b5ee5403cbdb709e1b5d0d","observation_id":"7927ea5b-0bfd-47ed-a7b3-024af96c1e05","resolution":{"observed_at":"2026-08-12T13:08:41.345032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.310138Z","title":"Merging models with fisher-weighted averaging","venue":null,"work_id":"47b766ac-a828-4593-9af5-1e7c8f760e0a","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.476469Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:14898c1cdddbf25daf2131fd46734fac714574f937349ec95c0161f27fda1bf9","observation_id":"c8b1d1d2-6215-4610-83d9-ed41f782f04c","resolution":{"observed_at":"2026-08-12T13:08:41.320066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.238544Z","title":"What is being transferred in transfer learning? Advances in neural information processing systems, 33:512–523, 2020","venue":null,"work_id":"e382b901-daf7-48fd-b426-958436f54dc1","year":2020},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.483404Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:39fe095052584204d768683de8c26d7e22c0422f6d8a5b726c8d37fc3207e2e1","observation_id":"bdfbcb51-1319-41b9-b365-8dd8b7e9d61c","resolution":{"observed_at":"2026-08-12T13:08:41.245881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:41.093759Z","title":"Fourierformer: Transformer meets generalized fourier integral theorem","venue":null,"work_id":"76317e6d-50e1-4426-a52a-474062975fc4","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.561178Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:3358f0f15ad6e0a935f167822895af19482b237a163c55ee060aca8772893209","observation_id":"3430deeb-3383-4c8b-857e-5e62d490180a","resolution":{"observed_at":"2026-08-12T13:08:41.206143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00054","last_updated":"2024-11-24T14:47:13Z","snapshot_observed_at":"2026-08-19T18:24:53.467232Z","submitted_at":"2024-11-24T14:47:13Z","title":"Less is More: Efficient Model Merging with Binary Task Switch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00054","snapshot_observed_at":"2026-08-12T13:08:38.614160Z","title":"Less is more: Efficient model merging with binary task switch","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.614160Z"},"links":{"cited_paper":"/paper/2412.00054","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:5c15dd8f24d9188f8cf23873855c168df1d4f6a7ff89316bd0481486dbcc2dcb","observation_id":"f3674d06-30a5-4351-97ee-7d1cc350fdd0","resolution":{"observed_at":"2026-08-12T13:08:38.614160Z","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-12T13:08:41.071375Z","title":"Learning transferable visual models from natural language supervi- sion","venue":null,"work_id":"9f4ebc55-c6c4-460b-b477-6c17f4b24007","year":2021},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.639306Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:de9b2652097787fd70db2c03414662a0284dfa51340e6d22c060b62f17958dbe","observation_id":"f2edb696-4104-42c2-a176-feabf7597309","resolution":{"observed_at":"2026-08-12T13:08:41.079076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.969554Z","title":"Multitask prompted training enables zero-shot task generalization","venue":null,"work_id":"c45275d4-bdc2-4a34-a3e1-bddb5c4c4556","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.646593Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:0a8f7e86e59eb5d91d364be6097c2e745308696caab53a9c04ca1d7b651082c3","observation_id":"3f9e8347-8f74-4a62-86a5-ff1906adfefa","resolution":{"observed_at":"2026-08-12T13:08:41.041151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.938796Z","title":"Outra- geously large neural networks: The sparsely-gated mixture- of-experts layer","venue":null,"work_id":"efee1287-3325-436b-9966-81a39b3a8bb0","year":2016},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.657564Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:75f52952e51855fed0afe044d58c4f7e3ebc3959bc5920b6608622308ee139b5","observation_id":"52a7a6d4-d291-43d0-93eb-8712c16e0e5e","resolution":{"observed_at":"2026-08-12T13:08:40.952061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-12T13:08:38.664185Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.664185Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:8fbd79e48f5c92b5107c8075b86f05a09619b6b9d25a118e1872395b6b206465","observation_id":"5ca6c777-e527-41a2-b60d-163b7f16c024","resolution":{"observed_at":"2026-08-12T13:08:38.664185Z","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-12T13:08:38.671312Z","title":"Multi-task learning for dense prediction tasks: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.671312Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:345442e0f162a7b04d48722eaea04182b28690e00a9b90fb1574577e43513f30","observation_id":"fa2770e7-0b39-484c-97f7-3bacb143fb32","resolution":{"observed_at":"2026-08-12T13:08:38.671312Z","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-12T13:08:40.786249Z","title":"Image as a foreign language: Beit pretraining for vision and vision- language tasks","venue":null,"work_id":"ca89461d-26f8-435e-9a9b-fd0785d1de08","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.678484Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:23e0ee75d4d276f0ef4e664e54a36cce81ee9b5d013cce7183021e947f949859","observation_id":"b30ed5ba-223d-47c6-b8e1-51c97cfdc15c","resolution":{"observed_at":"2026-08-12T13:08:40.843606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-12T13:08:38.686474Z","title":"Huggingface’s transformers: State-of-the-art natu- ral language processing","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.686474Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:6a596572584105263796c65478fd492e9e88eb48a231343d62695c854ccb90a0","observation_id":"67eb4443-fe2f-48eb-b2ef-03afec2b7b6a","resolution":{"observed_at":"2026-08-12T13:08:38.686474Z","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-12T13:08:40.697999Z","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing in- ference time","venue":null,"work_id":"a8b95fae-cf67-412c-8e3e-945820b7066a","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.699162Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:5ff5bef0f8914ed9baa3216866919da6101d8f135f39212245bc4a46e7fd4f85","observation_id":"2da925d8-cb0f-4ddd-bea6-bb6df8adb6af","resolution":{"observed_at":"2026-08-12T13:08:40.706983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.676150Z","title":"\\π-tuning: Transferring multimodal foundation models with optimal multi-task inter- polation","venue":null,"work_id":"979a4698-6879-420a-98a1-b50e4f50fbac","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.842741Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:ca89a1500047b5c14316c4fcb4f700b27401e8506adbd28d12205ee59ee2d8c1","observation_id":"5a66d25c-85de-489a-8f5f-5ecd708a33e9","resolution":{"observed_at":"2026-08-12T13:08:40.683970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.555252Z","title":"Wizardlm: Empowering large pre-trained language models to follow complex instructions","venue":null,"work_id":"48e4afcb-f9e3-464c-aa9a-5a445a8f79d6","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.860380Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:e22b27a6528a3f135472a1fbb383eb35eabb2f58e63f95c711a97d1807176095","observation_id":"e2759dc5-2685-421c-b987-309f3716d885","resolution":{"observed_at":"2026-08-12T13:08:40.632375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.454041Z","title":"Random masking finds win- ning tickets for parameter efficient fine-tuning","venue":null,"work_id":"4a80ccc0-ad5a-4aeb-b19f-5a9b5fd00ab4","year":null},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.868338Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:eb3f268c98cbee3f6ad4f0a3eb9109db301b51f88cc069ffc4032851e3111274","observation_id":"18d5ffd5-b2f7-467c-b4f2-f9e2362ea380","resolution":{"observed_at":"2026-08-12T13:08:40.463223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.426985Z","title":"Ties-merging: Resolving interference when merging models","venue":null,"work_id":"49fc5396-4dc9-45b9-87ac-798a695863c1","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.876915Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:e66adcec0fcead1046cff051037e02a5eed572a88bcf6fb9673b89d965ab24aa","observation_id":"acc9e028-d344-49c6-a548-b693596d0d18","resolution":{"observed_at":"2026-08-12T13:08:40.434802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-12T13:08:38.883766Z","title":"Model merging in llms, mllms, and beyond: Methods, theories, applications and opportunities","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.883766Z"},"links":{"cited_paper":"/paper/2408.07666","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:0b1fad81aa0c6383e66dfb3c2cb3c09ddeaaaa709b2ce8fadcaebc8983f84ebc","observation_id":"df3227ac-e180-4d4a-87cc-3ddc9b6c2945","resolution":{"observed_at":"2026-08-12T13:08:38.883766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02705","last_updated":"2024-05-28T09:35:17Z","snapshot_observed_at":"2026-08-18T21:12:09.405537Z","submitted_at":"2024-02-05T03:39:39Z","title":"Representation Surgery for Multi-Task Model Merging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02705","snapshot_observed_at":"2026-08-12T13:08:38.891099Z","title":"Representa- tion surgery for multi-task model merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.891099Z"},"links":{"cited_paper":"/paper/2402.02705","citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:6e070ad85e63cab55a5ac9ec6acdb8e195d406fb00d1d9a7f95066dba49e9860","observation_id":"ae79c53d-88d2-4e84-a059-4623a7cd27a8","resolution":{"observed_at":"2026-08-12T13:08:38.891099Z","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-12T13:08:40.302576Z","title":"Representation surgery for multi-task model merging","venue":null,"work_id":"f7683b25-f10b-4582-938e-8b1f1bd9dae3","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.898210Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:50363cb481b814d7770156077c2ae3f3ddda25315a306138ca7421c05aa12e16","observation_id":"812d3e96-2dd2-429e-9a70-7b4bacc81082","resolution":{"observed_at":"2026-08-12T13:08:40.308134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.281606Z","title":"Adamerging: Adaptive model merging for multi-task learning","venue":null,"work_id":"5fb21345-6eb4-4697-b7a1-6462939ffb4b","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:38.964144Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:4653e4c13a64397a42d888cc72f8a33cfcb8d6083d71241963f792f109d4d9ae","observation_id":"9b355d8f-7d08-40d7-b4a1-23a48aa68ed4","resolution":{"observed_at":"2026-08-12T13:08:40.287978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.255203Z","title":"Language models are super mario: Absorbing abilities from homologous models as a free lunch","venue":null,"work_id":"598d1d02-e98b-4c05-be5d-9faba7b5ac9a","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.032130Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:5b4287cff05e733f65a1a3fee4a38e1f45803c2cf4fc5383e5cdeac56b9e041f","observation_id":"e1747939-6adc-4737-8b44-739c078e2286","resolution":{"observed_at":"2026-08-12T13:08:40.266974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.143337Z","title":"Fuse to forget: Bias reduction and selective memorization through model fusion","venue":null,"work_id":"fad42b59-a4f7-414d-9bb8-9d33095b5bae","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.098737Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:4dac3a9141e2a001d327fd7c75008bf0fb4f3c9c0f8c99c04b8bc7701acf02c7","observation_id":"4df862f3-1465-41c1-a456-d63b7850d821","resolution":{"observed_at":"2026-08-12T13:08:40.192468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:40.113963Z","title":"Compos- ing parameter-efficient modules with arithmetic operation","venue":null,"work_id":"87dd6b45-05f7-4e20-a9aa-5967510fd501","year":2023},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.105681Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:9b2e1a84dc814c6246dd748e246a5ffd26c4b3cb14b2b5f40aaa03abff99e35f","observation_id":"9798c221-8091-40c0-b00c-ce72a8333a82","resolution":{"observed_at":"2026-08-12T13:08:40.121232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:39.974994Z","title":"A survey on multi-task learning","venue":null,"work_id":"6c1551d9-8e9b-427c-a18d-dd0757074a17","year":2021},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.112724Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:cf8fb3cfffd6bf024ac4f9567e6a05f242e0fcd1405c0750140d2e8b79746205","observation_id":"7d89f581-f093-4a69-9099-3a921a623128","resolution":{"observed_at":"2026-08-12T13:08:40.036552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:39.948979Z","title":"Mixture-of-experts with expert choice routing","venue":null,"work_id":"e0fbfb84-64ba-4e7e-8994-d9dc5ddc7490","year":2022},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.122852Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:aeba89364c6c506952918736f5c89841ed3f3fd516f08b5502f14dfa9d14fc9e","observation_id":"79f63ec1-f434-4056-8ace-af5b3048e20b","resolution":{"observed_at":"2026-08-12T13:08:39.955950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:39.889581Z","title":"Metagpt: Merging large language models using model exclusive task arithmetic","venue":null,"work_id":"13549782-57bb-4036-90f7-d145ca533a19","year":2024},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.200157Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:bde8c7b04e1d10c1f14c9d889009d308f52c634127d8a0cedaa651e1a8c93045","observation_id":"186ff9cf-80d4-44bc-a896-856c265b30cc","resolution":{"observed_at":"2026-08-12T13:08:39.927320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T13:08:39.825400Z","title":"A robustly optimized BERT pre-training approach with post-training","venue":null,"work_id":"eccf0988-3780-470b-984c-de7e42bc4a18","year":2021},"citing_paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T13:08:39.277258Z"},"links":{"citing_paper":"/paper/2411.16815"},"observation_digest":"sha256:c5bac62b19cfbec7e93f6af668b87180f53819578b266dd4b6047225aa8f2836","observation_id":"2bda4e98-ad93-4de0-ad8d-e0a9a928357c","resolution":{"observed_at":"2026-08-12T13:08:39.836045Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16815","last_updated":"2025-07-28T16:47:52Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-18T21:11:15.214835Z","submitted_at":"2024-11-25T15:35:01Z","title":"FREE-Merging: Fourier Transform for Efficient Model Merging"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":39},"total_outbound_references":59},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 5 inbound Pith citation observations for arXiv:2411.16815."}