{"as_of":"2026-08-09T04:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d8d32f5abf4c3551d32569ab77c70f82d9292eea767db007991312f99268eb0","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T00:07:44.901131Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:42:21.281499Z","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-07T15:42:25.856629Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"cited_work":{"arxiv_id":"2502.04411","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.04411","snapshot_observed_at":"2026-08-07T15:42:25.856629Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","venue":"cs.LG","work_id":"3c6af1aa-b4fb-4d6d-a896-75ac891d4fd5","year":2025},"citing_paper":{"arxiv_id":"2505.14136","last_updated":"2025-07-30T13:53:32Z","snapshot_observed_at":"2026-08-07T15:37:27.738096Z","submitted_at":"2025-05-20T09:39:54Z","title":"Local Mixtures of Experts: Essentially Free Test-Time Training via Model Merging","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:42:21.281499Z"},"links":{"cited_paper":"/paper/2502.04411","citing_paper":"/paper/2505.14136"},"observation_digest":"sha256:8aa832b59fd9ae1cd1844fb1451fabb4bf87c3c1c53fc2188a7879ae901981af","observation_id":"1c92c14e-10c5-49a3-bdaf-8a6e5ac0f3ab","resolution":{"observed_at":"2026-08-07T15:42:25.897996Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04411/citation-record","integrity":"/paper/2502.04411/integrity","json":"/paper/2502.04411/citation-record.json","paper":"/paper/2502.04411"},"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-09T00:08:00.310614Z","title":"This direction discusses the layer-wise training dynamics to help shed some light on the paramter conflicts and the layer-wise adaptivity","venue":null,"work_id":"f6f3d9c5-5259-43be-b92e-08b48355dd01","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.813777Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:5e7bd4dfc0890a4ff5e5b1ec6d3908dd55bb7b4c6409ab937c3fbf578b470a0b","observation_id":"483bf4fc-fefb-4e89-93be-dbab75ed237f","resolution":{"observed_at":"2026-08-09T00:08:00.315838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00978","last_updated":"2026-04-25T06:58:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-01T17:59:10Z","title":"AWQ: Activation-aware Weight Quantization for LLM Compression and Acceleration","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00978","snapshot_observed_at":"2026-08-09T00:07:44.756545Z","title":"URL https: //doi.org/10.48550/arXiv.2306.00978","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.756545Z"},"links":{"cited_paper":"/paper/2306.00978","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:30610aeb55c5669de6a92cf00fd6c92d53585dee9db890d0345f1b1419831423","observation_id":"c68ab02e-1e63-4fcf-84af-ec0db929c478","resolution":{"observed_at":"2026-08-09T00:07:44.756545Z","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-09T00:08:00.280147Z","title":"This direction reviews some works of the OOD Detection and Generalization, shedding light on deployment of the model merging on the out-of-distribution data","venue":null,"work_id":"e0093a07-01b1-424d-80eb-46b751349fa3","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.835838Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:fad8879932b84e9863853e13df9e0141b43d1ceec87622ede71ed530f09684eb","observation_id":"5009eaff-405f-4126-a582-dddb75a201bd","resolution":{"observed_at":"2026-08-09T00:08:00.285288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.263985Z","title":"This direction shortly review some works about the model compression, in which many methods can be directly applied into our framework to further reduce the memory costs","venue":null,"work_id":"8f36d50c-0839-4dfb-9886-62bde5bbfef5","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.842109Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:3ed8826db4d6c09394df8e66c8858d825faeac159ec11cef5b1d5b081989fc7c","observation_id":"f20b0999-19a1-4ec7-8474-383bc9c45146","resolution":{"observed_at":"2026-08-09T00:08:00.269075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.248079Z","title":"This direction reviews some works about how to generate new synthetic data to improve the model merging performance","venue":null,"work_id":"d11663cc-1681-4256-aa8e-0111ca6e8114","year":1996},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.849064Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:3e4a08a6490a2d90e4280c51a1c2088457e5ca967cad64091c366f1686fd0754","observation_id":"fc5054f5-9f2e-4326-9339-8da2185b5a97","resolution":{"observed_at":"2026-08-09T00:08:00.253268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.295515Z","title":"This direction reviews some works of the Bayesian deep learning, discussing the uncertainty and Bayesian model averaging","venue":null,"work_id":"fbc8e590-fae5-49af-8c03-ac291f3f0862","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.827619Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:beca3a6119eb7095cd9b4e1a1f0178a7b3d5a2698e1792ef0d49a9444c620e85","observation_id":"4724ec05-0d08-4f15-84e1-b6ac32657a74","resolution":{"observed_at":"2026-08-09T00:08:00.300506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.230685Z","title":"The importance measurement is based on the calibration dataset","venue":null,"work_id":"eed1bb08-c7b4-45d2-9cd0-5a415c42f37a","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.861094Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:1650eac872fd7c97424955e652822a80a7a71133b79ae1da7bc82e8dcd900323","observation_id":"db261900-342a-414c-a30b-d80cc00bd639","resolution":{"observed_at":"2026-08-09T00:08:00.236265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.212993Z","title":"Because that the importance measurement is based on the calibration dataset, the computation costs is almost similar to conduct the complete forward process of the different models","venue":null,"work_id":"c89a687d-3013-4af9-a597-943467d498c5","year":null},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.871244Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:ca1eca57bd90e8aa91b9430603b4d6ec075f8a4223452f9cc4b280a4b5a037a1","observation_id":"897a805d-bc96-41dd-9267-796c0d212292","resolution":{"observed_at":"2026-08-09T00:08:00.218277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.196949Z","title":"While methods in these importance based weighted averaging methods can improve the merging performance, they still face the parameter conflicts between different models","venue":null,"work_id":"33c9edd6-e3d3-4f6d-82b8-9c475b168608","year":2023},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.878322Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:7282d6f2f158a5a2e542bf4eef756725e2671af7238acf7db1683bcc24316c66","observation_id":"d0db58af-b2ee-4cd3-9132-10c31bf29d1e","resolution":{"observed_at":"2026-08-09T00:08:00.201980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:08:00.164034Z","title":"Structured pruning is hardware-agnostic, facilitating accelerated inference but may degrade performance due to the removal of critical components, often necessitating fine-tuning","venue":null,"work_id":"fdfc4b5f-51f3-4ea6-9295-4644eedae39c","year":2019},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.893185Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:cdd1612be3c99ea480646358b7b91e5b15e07734231b846234dbeb8eb83e959d","observation_id":"c17616e8-d1bd-4f59-8c54-99374b0869be","resolution":{"observed_at":"2026-08-09T00:08:00.170118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14830","last_updated":"2024-02-16T23:44:38Z","snapshot_observed_at":"2026-08-01T01:16:04.260529Z","submitted_at":"2024-02-16T23:44:38Z","title":"Orca-Math: Unlocking the potential of SLMs in Grade School Math","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14830","snapshot_observed_at":"2026-08-09T00:07:44.763265Z","title":"Mitra, A., Khanpour, H., Rosset, C., and Awadallah, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":1282,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.763265Z"},"links":{"cited_paper":"/paper/2402.14830","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:ba9fc7676e54cedfee8ed230db278287159030dced25d63eccd0c8c023b9ae49","observation_id":"408ff6a9-4b73-4360-b7bf-bb04dfb2628b","resolution":{"observed_at":"2026-08-09T00:07:44.763265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20306","last_updated":"2024-03-29T17:22:48Z","snapshot_observed_at":"2026-07-06T17:53:11.000124Z","submitted_at":"2024-03-29T17:22:48Z","title":"Towards Greener LLMs: Bringing Energy-Efficiency to the Forefront of LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.20306","snapshot_observed_at":"2026-08-09T00:07:44.773160Z","title":"org/CorpusID:16660598","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.773160Z"},"links":{"cited_paper":"/paper/2403.20306","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:b8bca12f2d58670e23d60496c0fb750439f28155fb8e9b0ffc3147c92e230948","observation_id":"cea28681-5299-4da2-a716-a8839777ab30","resolution":{"observed_at":"2026-08-09T00:07:44.773160Z","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-09T00:08:00.146405Z","title":"Romeo and Juliet","venue":null,"work_id":"c5d09e7d-cd57-4ef2-89c7-67505327783d","year":1990},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.901131Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:34f7dee66f4ee263740fda1a4f42e22cc77d01b95f93899af19d0cdc284d4dfe","observation_id":"b6117664-0a1e-4563-9f3a-43fb714b81aa","resolution":{"observed_at":"2026-08-09T00:08:00.152253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-09T00:07:44.782058Z","title":"You, J., Chung, J.-W., and Chowdhury, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.782058Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:fcdc84c7dfd5789d18bf69446b7484049fe7da8e3d22167379b6dcd9bd54ae02","observation_id":"a2d4e280-b888-4203-9b75-300dca636753","resolution":{"observed_at":"2026-08-09T00:07:44.782058Z","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-09T00:08:00.180885Z","title":"overlapping local updates","venue":null,"work_id":"5d72580b-d2f3-4856-8f7f-10155ecf7e8f","year":2018},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.885706Z"},"links":{"citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:86e30249d08d3fe2efa879b0bbfe2adaffcd95b0eb9d9205ecab6d49f335ec5f","observation_id":"8011329e-b147-42bc-9335-0495b0c8aba4","resolution":{"observed_at":"2026-08-09T00:08:00.185843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-07-06T04:04:16.777653Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-09T00:07:44.743046Z","title":"Frantar, E., Ashkboos, S., Hoefler, T., and Alistarh, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.743046Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:36fed0d2cd0096a19b5e145227dd402897ad9517796fe2f46cd2d7010688e44a","observation_id":"8a801fd8-184c-49c4-aa10-8ee180a2805d","resolution":{"observed_at":"2026-08-09T00:07:44.743046Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05517","last_updated":"2025-05-19T06:50:53Z","snapshot_observed_at":"2026-08-05T14:11:37.629456Z","submitted_at":"2024-08-10T11:00:13Z","title":"SWIFT:A Scalable lightWeight Infrastructure for Fine-Tuning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05517","snapshot_observed_at":"2026-08-09T00:07:44.801485Z","title":"Zhao, Y ., Huang, J., Hu, J., Wang, X., Mao, Y ., Zhang, D., Jiang, Z., Wu, Z., Ai, B., Wang, A., Zhou, W., and Chen, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.801485Z"},"links":{"cited_paper":"/paper/2408.05517","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:1c7944db209cdf3f4dff9b868972977bba1738a679def7df71b83bcb19d5c75c","observation_id":"24c95ae2-2e04-4bdf-904f-724de1f7ce38","resolution":{"observed_at":"2026-08-09T00:07:44.801485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00770","last_updated":"2024-06-02T15:09:00Z","snapshot_observed_at":"2026-07-06T18:24:01.251445Z","submitted_at":"2024-06-02T15:09:00Z","title":"Automatic Instruction Evolving for Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00770","snapshot_observed_at":"2026-08-09T00:07:44.792827Z","title":"Zelikman, E., Wu, Y ., Mu, J., and Goodman, N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing","version":3},"reference_index":7261,"source":"pdf_text","source_observed_at":"2026-08-09T00:07:44.792827Z"},"links":{"cited_paper":"/paper/2406.00770","citing_paper":"/paper/2502.04411"},"observation_digest":"sha256:4ff261efa000b96d4868fc24ef72848c471f4ece8e953b28da3671ae458dd138","observation_id":"8b8f76b3-7278-4b7b-962c-88c3e9f66f7c","resolution":{"observed_at":"2026-08-09T00:07:44.792827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.04411","last_updated":"2026-07-20T03:20:46Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T23:55:09.230979Z","submitted_at":"2025-02-06T11:26:30Z","title":"Mediator: Memory-efficient LLM Merging with Less Parameter Conflicts and Uncertainty Based Routing"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":18},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2502.04411."}