{"as_of":"2026-08-13T22:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a8a92ee4ac4af4820506c7ab20dd2dcebaf6d583fc3242d5dc4cc6df474ac18","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:52:09.670315Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:50:27.875803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T12:43:25.630106Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":"2506.23266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-06-29T12:43:25.630106Z","title":"arXiv preprint arXiv:2506.23266 , year=","venue":null,"work_id":"6c7abbbb-d075-444c-a820-db193c9dd4fd","year":2025},"citing_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},"reference_index":119,"source":"pdf_text","source_observed_at":"2026-05-17T22:16:04.386706Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2408.07666"},"observation_digest":"sha256:9b9de1e7747f0fb8a1e2552ec93b28ad4b411e0bf50c6aa6f8481e45b7c28d18","observation_id":"433a73b8-7e44-4514-a606-9d264a6161c9","resolution":{"observed_at":"2026-05-17T22:16:04.898004Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-08-04T14:50:27.875803Z","title":"Sub-moe: Efficient mixture-of-expert llms compression via subspace expert merging.arXiv preprint arXiv:2506.23266,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.02345","last_updated":"2026-07-21T06:35:53Z","snapshot_observed_at":"2026-08-04T14:50:24.826478Z","submitted_at":"2025-09-27T10:45:58Z","title":"Breaking the MoE LLM Trilemma: Dynamic Expert Clustering with Structured Compression","version":4},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T14:50:27.875803Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2510.02345"},"observation_digest":"sha256:e92e8928776f53773d0888cf676a3ba58ead83c11afc6670513d2500e1163e85","observation_id":"6c0a9910-cf7e-472d-8cbc-5efe986b71f5","resolution":{"observed_at":"2026-08-04T14:50:27.875803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-08-03T23:41:52.889236Z","title":"Sub-moe: Efficient mixture-of-expert llms compression via subspace expert merging, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04805","last_updated":"2026-07-06T16:04:54Z","snapshot_observed_at":"2026-08-13T21:51:31.783499Z","submitted_at":"2025-11-06T20:53:02Z","title":"PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T23:41:52.889236Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2511.04805"},"observation_digest":"sha256:1f3913411ff45273825d295e2be0733bf2a187d4d2d6ca20f47850b85d3fa39f","observation_id":"aa53dd31-ba35-43bd-a312-d9718e0365cf","resolution":{"observed_at":"2026-08-03T23:41:52.889236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":"2506.23266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-06-29T12:43:25.630106Z","title":"arXiv preprint arXiv:2506.23266 , year=","venue":null,"work_id":"6c7abbbb-d075-444c-a820-db193c9dd4fd","year":2025},"citing_paper":{"arxiv_id":"2603.06003","last_updated":"2026-04-11T04:36:36Z","snapshot_observed_at":"2026-07-06T22:48:04.438669Z","submitted_at":"2026-03-06T08:02:58Z","title":"EvoESAP: Non-Uniform Expert Pruning for Sparse MoE","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-15T14:34:48.524592Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2603.06003"},"observation_digest":"sha256:a0efa0e2de29355d1ad58f7465bc02f270a34672ede59308a0b95c2105babfac","observation_id":"7f021178-66ab-4983-b88d-908922941285","resolution":{"observed_at":"2026-05-15T14:35:55.624299Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":"2506.23266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-06-29T12:43:25.630106Z","title":"arXiv preprint arXiv:2506.23266 , year=","venue":null,"work_id":"6c7abbbb-d075-444c-a820-db193c9dd4fd","year":2025},"citing_paper":{"arxiv_id":"2605.16349","last_updated":"2026-05-08T04:17:10Z","snapshot_observed_at":"2026-08-02T09:46:11.155553Z","submitted_at":"2026-05-08T04:17:10Z","title":"Geometric Asymmetry in MoE Specialization: Functional Decorrelation and Representational Overlap","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-20T23:45:19.279268Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2605.16349"},"observation_digest":"sha256:94c9dd8673f8dab250968727142cfbcd236037cf7bc70157aaf59beb5869ea84","observation_id":"5e930ae5-9ce4-44a2-a61a-c1a5805809b7","resolution":{"observed_at":"2026-05-20T23:49:15.477982Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"cited_work":{"arxiv_id":"2506.23266","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.23266","snapshot_observed_at":"2026-06-29T12:43:25.630106Z","title":"arXiv preprint arXiv:2506.23266 , year=","venue":null,"work_id":"6c7abbbb-d075-444c-a820-db193c9dd4fd","year":2025},"citing_paper":{"arxiv_id":"2605.28207","last_updated":"2026-06-06T13:23:43Z","snapshot_observed_at":"2026-08-12T22:12:45.184746Z","submitted_at":"2026-05-27T09:27:36Z","title":"Pruning and Distilling Mixture-of-Experts into Dense Language Models","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-29T12:39:25.535897Z"},"links":{"cited_paper":"/paper/2506.23266","citing_paper":"/paper/2605.28207"},"observation_digest":"sha256:d894f39f26f06bdacadd008d37c53795d2ac9ae8b7803e9c35c4eef1400b5b5a","observation_id":"3ec686f9-e5f0-4339-ad42-40ebbde49f3f","resolution":{"observed_at":"2026-06-29T12:43:25.631665Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.23266/citation-record","integrity":"/paper/2506.23266/integrity","json":"/paper/2506.23266/citation-record.json","paper":"/paper/2506.23266"},"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-06T21:52:14.179097Z","title":"The fifth pascal recognizing textual entailment challenge","venue":null,"work_id":"8f608cb3-932b-4861-a202-f092722fec9d","year":2009},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:01.700024Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:598c20d8b13f98f25c9f0d0b71a71d157eaec3df4531e0c70d9d9c6465469db3","observation_id":"4cbeb805-5288-4ccc-bc38-8fb592587ddb","resolution":{"observed_at":"2026-08-06T21:52:14.528001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-08-13T00:35:31.529133Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-08-06T21:52:01.836956Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:01.836956Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:ef47e01ac61ad831291d1ac1ee4bade4284ee04719105613280dbe61767778c6","observation_id":"685b225d-df9a-4871-b6b0-8023773023be","resolution":{"observed_at":"2026-08-06T21:52:01.836956Z","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-06T21:52:01.953614Z","title":"Retraining-free merging of sparse mixture-of-experts via hierarchical clustering","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:01.953614Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:0d71d92e935e877dc674c0c782d79f822d845a81b3b30445f8dc48ef29fe7f9f","observation_id":"82ad7fa7-bad8-4170-a5be-b601728e321e","resolution":{"observed_at":"2026-08-06T21:52:01.953614Z","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-06T21:52:13.921113Z","title":"BoolQ: Exploring the surprising difficulty of natural yes/no questions","venue":null,"work_id":"ce36710a-8a57-4774-9f8b-b52257350952","year":2019},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.117344Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:daed0fb3e16787f25c8bd28cb1a7f13947a24fa0e8b1c537486ff6e17c471919","observation_id":"9cf00e1a-b7fa-4242-be09-4bf9782e5fe7","resolution":{"observed_at":"2026-08-06T21:52:14.029551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.05457","last_updated":"2018-03-14T18:04:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2018-03-14T18:04:21Z","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.05457","snapshot_observed_at":"2026-08-06T21:52:02.308317Z","title":"Think you have solved question answering? try arc, the ai2 reasoning challenge","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.308317Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:718519be531eabdb39bc78577e3be86ce5847ddfa101bd3790c031b996a11158","observation_id":"6dd41cc4-0bb6-4dfb-82f6-f8cd02968f1c","resolution":{"observed_at":"2026-08-06T21:52:02.308317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06066","last_updated":"2024-01-11T17:31:42Z","snapshot_observed_at":"2026-08-13T15:18:04.411100Z","submitted_at":"2024-01-11T17:31:42Z","title":"DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06066","snapshot_observed_at":"2026-08-06T21:52:02.416225Z","title":"Deepseekmoe: Towards ultimate expert specialization in mixture-of-experts language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.416225Z"},"links":{"cited_paper":"/paper/2401.06066","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:a815112b33ac53c5dcecd15aa4ef8b161dc859dd56a88d39c65d14825d383869","observation_id":"7e22f0a7-798c-4b7f-8e1b-2d8ec1d18c51","resolution":{"observed_at":"2026-08-06T21:52:02.416225Z","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-06T21:52:13.727318Z","title":"Deepseek-v2: A strong, economical, and efficient mixture-of-experts language model, 2024","venue":null,"work_id":"455bf1d1-345d-4c2b-8559-733d8535c926","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.503692Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:c79d3166f4706a0c686d9f6dc83b452b8f028a717f2ac5f3c22e8b0226a53b61","observation_id":"cda31413-22d0-4219-9dba-e66f06ab1750","resolution":{"observed_at":"2026-08-06T21:52:13.806576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:13.571433Z","title":"Pruner-zero: Evolving symbolic pruning metric from scratch for large language models","venue":null,"work_id":"aa8fefbd-d528-4e06-b2ee-927432e87d9a","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.585104Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:a374e58bab852db4f73f6e2d058ec4048002a78b15219978ddc3dab3043d30c9","observation_id":"bc50fd45-23e2-49c1-a6a5-0d60b35fe4a5","resolution":{"observed_at":"2026-08-06T21:52:13.649148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:13.450396Z","title":"Stbllm: Breaking the 1-bit barrier with structured binary llms","venue":null,"work_id":"82045450-e4ea-4d6b-a83b-043061fc6a44","year":2025},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.659224Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:316b9fcd93639ba19670c848150a558e84e988644f1e804f5473e881f7e4aa67","observation_id":"ea242f90-6ca7-403e-a5e9-57c4b830ca95","resolution":{"observed_at":"2026-08-06T21:52:13.498247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:13.342574Z","title":"A framework for few-shot language model evaluation, 2024","venue":null,"work_id":"684cb552-cc4f-4236-aacf-b9deb53721a8","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.772171Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:4fab0c6a75b49d9877d8a12749664f3b4ceed1620c0b99d772e598692848db55","observation_id":"605e28bf-de5c-4909-baa3-d6fa1ab91d18","resolution":{"observed_at":"2026-08-06T21:52:13.394017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:13.212589Z","title":"Delta decompression for moe-based LLMs compression","venue":null,"work_id":"6f8bc459-33b5-422e-a729-d116ce24099c","year":2025},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.861777Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:f82ae1d174d86f3b93af3a0ebd4e13ab71ad857bab2c6db4899fbdc07d467a78","observation_id":"99a03fbc-7fe5-43ad-b49c-a756344c84a2","resolution":{"observed_at":"2026-08-06T21:52:13.286720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02500","last_updated":"2025-03-17T14:18:42Z","snapshot_observed_at":"2026-08-12T23:50:18.204689Z","submitted_at":"2024-06-04T17:18:40Z","title":"Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02500","snapshot_observed_at":"2026-08-06T21:52:02.958911Z","title":"Demystifying the compression of mixture-of- experts through a unified framework","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:02.958911Z"},"links":{"cited_paper":"/paper/2406.02500","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:c313fa630c1fd3f9dd26fd3ba8ae6c574d49b22914b8eb71bdc97f3379d88846","observation_id":"12f8360b-5c3d-45fa-adf9-feed04322a9a","resolution":{"observed_at":"2026-08-06T21:52:02.958911Z","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-06T21:52:13.099646Z","title":"Measuring massive multitask language understanding, 2021","venue":null,"work_id":"27956ce5-0182-4cb8-981a-2ea5fa288f9e","year":2021},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.058511Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:988d880ccf1c8bd416b94dbd802497c5cf02698b8c5fe0c3b23f8ba01d64a6dd","observation_id":"8bd3cfc2-66f3-4783-8686-5fd3e7403f31","resolution":{"observed_at":"2026-08-06T21:52:13.156053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.954684Z","title":"Manifold learning for parameter reduction","venue":null,"work_id":"d8f47150-1173-4dfa-b125-87e8f0ab6344","year":2019},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.145567Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:a7387cc1e680009b0c8f557c9f06d3878ddad29bd7143afe50722f2571f3c8ca","observation_id":"469665b2-edce-444e-8cfd-0da6fc610560","resolution":{"observed_at":"2026-08-06T21:52:13.029198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.855479Z","title":"Mixture compressor for mixture-of-experts LLMs gains more","venue":null,"work_id":"79ab073a-77f9-4403-894d-3e542220a897","year":2025},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.218727Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:2f92bd43445336c11ec4592d6709eaecffbbd0d97fbc6a061a8c7551ad7c179d","observation_id":"ccabf47d-9a88-4769-a8a5-5fe36342d666","resolution":{"observed_at":"2026-08-06T21:52:12.900921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.735712Z","title":"Ikotun, Absalom E","venue":null,"work_id":"35a8b442-dfa1-4d6a-82e8-74647d299a33","year":2023},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.303182Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:6c216a43182fec2c29d8ce28618ec86b9a6bc2fb10e139aba85e53b78a56b574","observation_id":"5a37e8ef-ace2-4d26-a204-3b1b635d6802","resolution":{"observed_at":"2026-08-06T21:52:12.791601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.611677Z","title":"Averaging weights leads to wider optima and better generalization","venue":null,"work_id":"26c35726-66aa-468f-8d10-17935f9effd4","year":2018},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.482828Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:817a6340adfc4c9df8bcd3011cbea25a3d67dda4fed34c06a6ff5b8f6c1f7fce","observation_id":"989650be-4358-4394-a7a5-2ba16045a54d","resolution":{"observed_at":"2026-08-06T21:52:12.673648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.422570Z","title":"Jiang, Alexandre Sablayrolles, Antoine Roux, Arthur Mensch, Blanche Savary, et al","venue":null,"work_id":"68ea7c0b-4563-4e35-b1bc-52b2a2663155","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:03.937724Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:942e89eb2a42a5387ffd2f5b65f9f401f2ac31cc82fb3cd11d6f074950ee4b43","observation_id":"de1f4d1f-1936-473a-9873-7c891012f5ba","resolution":{"observed_at":"2026-08-06T21:52:12.516835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.19429","last_updated":"2024-04-30T10:17:21Z","snapshot_observed_at":"2026-08-13T00:18:41.778908Z","submitted_at":"2024-04-30T10:17:21Z","title":"Lancet: Accelerating Mixture-of-Experts Training via Whole Graph Computation-Communication Overlapping","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.19429","snapshot_observed_at":"2026-08-06T21:52:05.302540Z","title":"Lancet: Accelerating Mixture-of-Experts Training via Whole Graph Computation-Communication Overlapping","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.302540Z"},"links":{"cited_paper":"/paper/2404.19429","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:d1e38f6c352dd3a080e9a2e20fdc75ffa644c7a23888d7a11c8f177163aa2552","observation_id":"532c7770-3639-4377-87d1-163dafee60e5","resolution":{"observed_at":"2026-08-06T21:52:05.302540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","snapshot_observed_at":"2026-08-12T22:48:03.774968Z","submitted_at":"2024-09-10T04:34:42Z","title":"STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.06211","snapshot_observed_at":"2026-08-06T21:52:05.432000Z","title":"Stun: Structured- then-unstructured pruning for scalable moe pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.432000Z"},"links":{"cited_paper":"/paper/2409.06211","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:6f0dad03dfacd6b83449566498ab542154eef1eefd080ff0c5e9d5118af9464e","observation_id":"060cca54-192b-4a22-a3ef-037cea81d0d4","resolution":{"observed_at":"2026-08-06T21:52:05.432000Z","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-06T21:52:12.343970Z","title":"Discovering sparsity allocation for layer-wise pruning of large language models","venue":null,"work_id":"c8258614-afd4-40bb-aa0c-0a9400bbf6e6","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.547614Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:516fc9bfb75cfb13c9797d1675b2eaa272e7095a8e49b658a292e3b5dd60b606","observation_id":"335a3b12-a8c6-4b12-858b-0f4adde417ec","resolution":{"observed_at":"2026-08-06T21:52:12.379512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.286888Z","title":"Branch-train-merge: Embarrassingly parallel training of expert language models","venue":null,"work_id":"3631aaa6-2624-4c87-872e-b05415cd33c7","year":2022},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.619505Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:a3577b43dab6965def53eb56fa0d423804c61d67ea36bb6b547345fd78ef1bf3","observation_id":"5864562e-7c48-4130-817c-ba5df65e76c6","resolution":{"observed_at":"2026-08-06T21:52:12.309242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.244166Z","title":"Merge, then compress: Demystify efficient SMoe with hints from its routing policy","venue":null,"work_id":"22ad1fe4-52d6-4fd1-a1f5-df51e6f932e4","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.681639Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:6241f1b1730c6b39e3434dfda908ebdff63e1fe9a61e31afb31a51018081b8c1","observation_id":"75196950-bf2a-460b-aea7-a0eb6af839e5","resolution":{"observed_at":"2026-08-06T21:52:12.278644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.141003Z","title":"Lee, Shengjie Sun, Wei Xue, and Yike Guo","venue":null,"work_id":"4571c2e4-ccaa-4098-be91-53b8ba9dcbba","year":null},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.789154Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:872c6e7a93d979c432e441940295ed66235875922951182adcf8fc41d3750668","observation_id":"1232bffa-8705-4ea2-8244-5898cac5653e","resolution":{"observed_at":"2026-08-06T21:52:12.193812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:12.025261Z","title":"Als: Adaptive layer sparsity for large language models via activation correlation assessment","venue":null,"work_id":"b6677bf4-31cb-486f-bf2c-77ce1bfe5ace","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.883884Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:469f72ea10064a4e5a340c01e2ba5a1189892b44361e90e61cc71a97378daad5","observation_id":"8bcdba04-2eb9-40f5-8850-00eba842dc72","resolution":{"observed_at":"2026-08-06T21:52:12.083104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16330","last_updated":"2025-05-17T04:23:58Z","snapshot_observed_at":"2026-08-12T23:36:27.754697Z","submitted_at":"2024-06-24T05:57:55Z","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16330","snapshot_observed_at":"2026-08-06T21:52:05.975099Z","title":"Pruning via merging: Compressing llms via manifold alignment based layer merging","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:05.975099Z"},"links":{"cited_paper":"/paper/2406.16330","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:4a56ca51971bdc59fa8547a335da8997a75af97274e71098cbac13515d9fbcff","observation_id":"805f692e-1b38-41e8-8255-d813c251de55","resolution":{"observed_at":"2026-08-06T21:52:05.975099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00945","last_updated":"2024-07-01T03:57:35Z","snapshot_observed_at":"2026-08-12T23:31:38.587681Z","submitted_at":"2024-07-01T03:57:35Z","title":"Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00945","snapshot_observed_at":"2026-08-06T21:52:06.051660Z","title":"Efficient expert pruning for sparse mixture-of-experts language models: Enhancing performance and reducing inference costs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.051660Z"},"links":{"cited_paper":"/paper/2407.00945","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:8c58114cfdc73f367f6777a04788955bbf4aa31fb52004bb002951034fdc271d","observation_id":"7660d774-09ea-415c-9f92-5a4c5e66991e","resolution":{"observed_at":"2026-08-06T21:52:06.051660Z","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-06T21:52:11.921047Z","title":"Not all experts are equal: Efficient expert pruning and skipping for mixture-of- experts large language models","venue":null,"work_id":"dfbd7630-b798-4fd8-9f48-d91f54c68eac","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.119024Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:ceda7b48bea8c17f2fe1588d131754921f9d0e1c896a5c9caa77057b98b52021","observation_id":"977bd942-0be7-4686-87be-32a1fc2a61cb","resolution":{"observed_at":"2026-08-06T21:52:11.977167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:06.181625Z","title":"Can a suit of armor conduct electricity? a new dataset for open book question answering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.181625Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:9f05cf72e2e5a9d8f5311f4da747369bc465f3d93d770470939e2d3dc0405b6b","observation_id":"d47c490c-7550-4743-839a-d7353713cd21","resolution":{"observed_at":"2026-08-06T21:52:06.181625Z","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-06T21:52:11.806071Z","title":"Seer-moe: Sparse expert efficiency through regularization for mixture-of-experts, 2024","venue":null,"work_id":"b416bd8b-3e48-4b56-aff6-e8d1d42f418c","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.294964Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:7dfe3906af36ecc953cb95ac94f1d3745dc9e17de613b12c8705af6806a81a19","observation_id":"e04a2f89-af66-46dc-9663-7d3abf7f2d28","resolution":{"observed_at":"2026-08-06T21:52:11.874556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00918","last_updated":"2026-07-25T23:45:29Z","snapshot_observed_at":"2026-08-12T22:09:43.489754Z","submitted_at":"2024-11-01T14:04:36Z","title":"LIBMoE: A Library for comprehensive benchmarking Mixture of Experts in Large Language Models","version":5},"cited_work":{"arxiv_id":"2411.00918","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.00918","snapshot_observed_at":"2026-08-06T21:52:09.932810Z","title":"LIBMoE: A Library for comprehensive benchmarking Mixture of Experts in Large Language Models","venue":"cs.CL","work_id":"9bfaf970-9acd-4da2-a91f-0eef8b464498","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.379550Z"},"links":{"cited_paper":"/paper/2411.00918","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:364e57ecc325e0fbfce922776f0c9580ab0ed5cf3821aeb8a25d03ff47f50706","observation_id":"251c96d4-4a0f-4673-b87a-39a89bf6e3bd","resolution":{"observed_at":"2026-08-06T21:52:09.978004Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.690098Z","title":"Winogrande: An adversarial winograd schema challenge at scale","venue":null,"work_id":"276e0593-d599-4e97-b4ea-8d80a0e49340","year":2019},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.500545Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:b1e62b8dd5d3663f780326422d8e4100ef293891ab492a84c2fabac41254b3e2","observation_id":"1b87261e-35a5-451d-9d22-cd73f26d36ed","resolution":{"observed_at":"2026-08-06T21:52:11.749991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01483","last_updated":"2024-09-02T22:35:03Z","snapshot_observed_at":"2026-08-12T22:52:47.648145Z","submitted_at":"2024-09-02T22:35:03Z","title":"Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01483","snapshot_observed_at":"2026-08-06T21:52:06.633945Z","title":"Revisiting smoe language models by evaluating inefficiencies with task specific expert pruning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.633945Z"},"links":{"cited_paper":"/paper/2409.01483","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:051906b4f03fb66dbffee90a2327c084ff2568916c78a10c853dd4665bc452de","observation_id":"1a310a93-f10e-49ba-9a9e-eae1d95de0b7","resolution":{"observed_at":"2026-08-06T21:52:06.633945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.10034","last_updated":"2024-08-12T09:23:13Z","snapshot_observed_at":"2026-08-13T15:40:12.871571Z","submitted_at":"2022-05-20T09:09:27Z","title":"MoESys: A Distributed and Efficient Mixture-of-Experts Training and Inference System for Internet Services","version":3},"cited_work":{"arxiv_id":"2205.10034","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.10034","snapshot_observed_at":"2026-08-06T21:52:09.794643Z","title":"MoESys: A Distributed and Efficient Mixture-of-Experts Training and Inference System for Internet Services","venue":"cs.DC","work_id":"4af1a3e6-a9ae-455e-b45c-10c9a33c3081","year":2022},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.765791Z"},"links":{"cited_paper":"/paper/2205.10034","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:adf9fa8c6ccac79da03bf941da1adb3530021781693f441c55587f3b9fbe8667","observation_id":"9598610f-07a4-4393-9bf6-397d0a7b4a0d","resolution":{"observed_at":"2026-08-06T21:52:09.856666Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.571114Z","title":"Model fusion via optimal transport","venue":null,"work_id":"56bf8510-a5d8-478e-b645-53aa3c723d3d","year":2020},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.846447Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:90d35827adfdc35e5ddf823ab7c38d5ed7a8fa1f1e0054d5f10180875504cda9","observation_id":"d69d7939-d2ed-48ca-aaac-6870caef5b32","resolution":{"observed_at":"2026-08-06T21:52:11.625157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.443615Z","title":"Powerinfer: Fast large language model serving with a consumer-grade gpu, 2023","venue":null,"work_id":"4ee4b8bb-331c-471f-8c6f-c47b0c935043","year":2023},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:06.980361Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:5642ae3e525b276750682dbb9a25bd788589b73e0ce19d269c19ecb074e904d3","observation_id":"8c5ebc5b-1e73-40fb-9cc8-085a1bf9339f","resolution":{"observed_at":"2026-08-06T21:52:11.503690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.356532Z","title":"Optimizing mode connectivity via neuron alignment","venue":null,"work_id":"40eb6167-b373-4808-885f-cea34cb0baf2","year":2020},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:07.095636Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:6565cfe813e922f90b18b3592102505c922ed871e39b199cfdafda8e0cbc6310","observation_id":"d209a50e-0fc9-4fac-bd72-4afea493e781","resolution":{"observed_at":"2026-08-06T21:52:11.395508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.226411Z","title":"Qwen1.5-moe: Matching 7b model performance with 1/3 activated parameters\", February 2024","venue":null,"work_id":"f6eceac6-4eaf-4186-8290-fda6e7671191","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:07.161675Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:2b965271438333c029ea55c9ead43c852b58be014bcfa7fbb0c77b65916f6ef3","observation_id":"0a3c2a72-6a81-4faf-bb84-1449b67e2d80","resolution":{"observed_at":"2026-08-06T21:52:11.284321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:11.100265Z","title":"A global geometric framework for nonlinear dimensionality reduction","venue":null,"work_id":"9df3c691-9dca-4771-80d1-eb5ae7e227d5","year":2000},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:07.362394Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:092ddbe0568f1ff8db0b5ec26de19924e3b184b58d511ec68feb08a3295f7154","observation_id":"7b2e7a2c-5630-4a6d-9701-0b023011084d","resolution":{"observed_at":"2026-08-06T21:52:11.169066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:10.946890Z","title":"Parameter efficient neural networks with singular value decomposed kernels","venue":null,"work_id":"389d1f83-0670-4474-a2b5-5a5c651251e0","year":2021},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:07.889514Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:f1ff2fefeaf7b506a16918b75b9c9bb1d352d1c8136166639e3f2eca6d9283cf","observation_id":"25d94ba9-1b3f-481b-b2f5-46273b36c9bb","resolution":{"observed_at":"2026-08-06T21:52:11.035586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07378","last_updated":"2025-03-16T03:27:33Z","snapshot_observed_at":"2026-08-13T18:13:07.594457Z","submitted_at":"2024-03-12T07:31:18Z","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07378","snapshot_observed_at":"2026-08-06T21:52:09.016078Z","title":"Svd-llm: Truncation-aware singular value decomposition for large language model compression","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.016078Z"},"links":{"cited_paper":"/paper/2403.07378","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:021a58771a5abefe7f51559e45e057d4aa5bd1e58a5b82784113a52ac2e39934","observation_id":"f9d01e2e-d6f0-440a-9805-27ff984b3b5c","resolution":{"observed_at":"2026-08-06T21:52:09.016078Z","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-06T21:52:10.739148Z","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","venue":null,"work_id":"88b010b9-8706-4c54-803f-3f8d2ce6463f","year":null},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.120012Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:53a1c63005705ea361784e0a04e5e0b396b816868b2248342887f8f8d6af8530","observation_id":"b8c5a085-80f0-4a44-8a31-38ea07511d2b","resolution":{"observed_at":"2026-08-06T21:52:10.829276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12013","last_updated":"2024-10-15T19:22:27Z","snapshot_observed_at":"2026-08-12T22:22:24.990640Z","submitted_at":"2024-10-15T19:22:27Z","title":"MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12013","snapshot_observed_at":"2026-08-06T21:52:09.202720Z","title":"Moe-pruner: Pruning mixture-of-experts large language model using the hints from its router","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.202720Z"},"links":{"cited_paper":"/paper/2410.12013","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:e7e64ca3ead208984804da5f9861241b1243fe8777c75872aba532f0fdceaae9","observation_id":"8a9c4c16-8373-497e-ab30-db5d5a85d8f2","resolution":{"observed_at":"2026-08-06T21:52:09.202720Z","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-06T21:52:10.559473Z","title":"Moe-infinity: Activation-aware expert offloading for efficient moe serving, 2024","venue":null,"work_id":"1139c344-3c64-4830-bcf9-bb5d14fa11d2","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.336313Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:765f6df61c0d0ee6faa6d976e6b58d2f13666ab5080e63f5a0a1717ce4c01af3","observation_id":"4a382819-d242-4b61-a129-5b03a08f677a","resolution":{"observed_at":"2026-08-06T21:52:10.652432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-06T21:52:09.444898Z","title":"Qwen2.5 technical report.arXiv preprint arXiv:2412.15115, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.444898Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:eee04a50b8efb95fd67fac0ef9d813a8b730380f97e0ea3cfc96cbff3a46d2c4","observation_id":"7f1675b5-920c-4afd-b93d-fdf397cf57a1","resolution":{"observed_at":"2026-08-06T21:52:09.444898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01016","last_updated":"2024-11-01T20:37:58Z","snapshot_observed_at":"2026-08-12T22:09:27.312734Z","submitted_at":"2024-11-01T20:37:58Z","title":"MoE-I$^2$: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01016","snapshot_observed_at":"2026-08-06T21:52:09.523179Z","title":"Moe-i2: Compressing mixture of experts models through inter-expert pruning and intra-expert low-rank decomposition","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.523179Z"},"links":{"cited_paper":"/paper/2411.01016","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:4593f5b92b25b4f6b34322f19721ba54c900619f707fd2c3cedbbf8a62d8463b","observation_id":"0272af74-5132-471d-816a-2bfd2ee463fa","resolution":{"observed_at":"2026-08-06T21:52:09.523179Z","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-06T21:52:10.381686Z","title":"Hellaswag: Can a machine really finish your sentence? In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics , 2019","venue":null,"work_id":"ece63237-62a8-4844-a0ea-605c44aada5b","year":2019},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.609171Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:5820058b9ab32d861b7797190e9f84accd70b2555303da44fdbaee38f39d69ad","observation_id":"20950d3a-8daf-4794-85bf-442e0f6280c8","resolution":{"observed_at":"2026-08-06T21:52:10.464408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:52:10.249896Z","title":"HyperMoE: Towards better mixture of experts via transferring among experts","venue":null,"work_id":"39947ac9-f9a7-49ec-831d-75d98830aa86","year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:09.670315Z"},"links":{"citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:2ef4d4ad1b88f50d7cc239b29a9bc79221f496f6ab7767fc6317a38123cecac6","observation_id":"252b6627-c9de-4db3-874a-0f97c2f97b0d","resolution":{"observed_at":"2026-08-06T21:52:10.328961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T20:07:08.324519Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":2,"verified_fuzzy":31},"total_outbound_references":48},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 6 inbound Pith citation observations for arXiv:2506.23266."}