{"as_of":"2026-08-10T06:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:636554ff2d442048fb51d5f0efd286fef662b6d570f5815051510cd5e6167824","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:52:07.528858Z","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-07-02T11:36:55.530752Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2411.08982","last_updated":"2026-05-18T20:44:06Z","snapshot_observed_at":"2026-07-06T19:50:01.724540Z","submitted_at":"2024-11-13T19:18:08Z","title":"Lynx: Enabling Efficient MoE Inference through Dynamic Batch-Aware Expert Selection","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T17:04:13.905401Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2411.08982"},"observation_digest":"sha256:7d37727c12c8bad3b5aed8018e341f11f26bcb670fe543e03d6e586815836472","observation_id":"dd981604-a46f-48da-9f9a-c38957b7304a","resolution":{"observed_at":"2026-05-23T17:05:42.971649Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-08-08T14:52:07.528858Z","title":"Merge, then compress: Demystify efficient smoe with hints from its routing policy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06643","last_updated":"2025-02-10T16:34:36Z","snapshot_observed_at":"2026-08-09T20:43:08.168062Z","submitted_at":"2025-02-10T16:34:36Z","title":"MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T14:52:07.528858Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2502.06643"},"observation_digest":"sha256:3a4fbc3a57bdbd010bae0fad69903733422255e7670dddd913c785c3e348dbe1","observation_id":"6d5107b5-56e6-41e1-b2cd-ef4883e8de01","resolution":{"observed_at":"2026-08-08T14:52:07.528858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-08-04T17:57:25.113322Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10377","last_updated":"2025-09-12T16:09:39Z","snapshot_observed_at":"2026-08-08T01:06:20.404584Z","submitted_at":"2025-09-12T16:09:39Z","title":"Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T17:57:25.113322Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2509.10377"},"observation_digest":"sha256:314eb43f28b9d8bdd72d27579870567f222f34153ffa80cb6ae92c298a33571a","observation_id":"1d054ccb-b942-499f-a29d-6e18b595ffc3","resolution":{"observed_at":"2026-08-04T17:57:25.113322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2509.25041","last_updated":"2026-05-06T06:43:02Z","snapshot_observed_at":"2026-08-03T04:43:05.899007Z","submitted_at":"2025-09-29T16:57:33Z","title":"GRACE-MoE: Grouping and Replication with Locality-Aware Routing for Efficient Distributed MoE Inference","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T12:01:32.788979Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2509.25041"},"observation_digest":"sha256:088198716bfd365907279c121f038107df5735ed055891896713a546a54dcb17","observation_id":"ee872ec2-f586-4638-b6d0-197f4682f767","resolution":{"observed_at":"2026-05-18T12:02:35.580056Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-08-03T23:41:52.892552Z","title":"Merge, then compress: Demystify efficient smoe with hints from its routing policy, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.04805","last_updated":"2026-07-06T16:04:54Z","snapshot_observed_at":"2026-08-07T10:51:08.099986Z","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":20,"source":"arxiv_source","source_observed_at":"2026-08-03T23:41:52.892552Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2511.04805"},"observation_digest":"sha256:ca9f76999356f8baaa431a0c3ae20e2ece3505e67e7d9c9f4ae1d116ca682d27","observation_id":"d48c4271-7f56-4a8e-b8f5-47e105aec39a","resolution":{"observed_at":"2026-08-03T23:41:52.892552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"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":32,"source":"pdf_text","source_observed_at":"2026-05-15T14:34:48.524592Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2603.06003"},"observation_digest":"sha256:fcae6a0e59c4a6450230bc1071d81a72bf8035910262de6929ef5edb7dbf888a","observation_id":"7af7e47b-0204-48a3-bcdd-4ed22d06387b","resolution":{"observed_at":"2026-05-15T14:35:55.555503Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.08738","last_updated":"2026-05-18T06:29:11Z","snapshot_observed_at":"2026-07-06T23:20:57.084438Z","submitted_at":"2026-05-09T06:50:35Z","title":"SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-12T03:34:10.370956Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.08738"},"observation_digest":"sha256:4cc645927556bfa586b1703342cb7c32735bfb8bf498afb5411c58395f150b99","observation_id":"bc706dc3-c8f6-4aa0-9d76-e4d0ba795fc8","resolution":{"observed_at":"2026-05-12T07:16:28.312598Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.08738","last_updated":"2026-05-18T06:29:11Z","snapshot_observed_at":"2026-07-06T23:20:57.084438Z","submitted_at":"2026-05-09T06:50:35Z","title":"SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-20T23:22:51.808346Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.08738"},"observation_digest":"sha256:05e433f9374923c3648acf001ce77bd456efc9afed1a6f1e7fd3aea46e7ce2b4","observation_id":"9dd30c1c-c65b-4529-898e-91e9491c072f","resolution":{"observed_at":"2026-05-20T23:23:51.266327Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.13997","last_updated":"2026-05-13T18:07:12Z","snapshot_observed_at":"2026-07-06T23:25:29.856145Z","submitted_at":"2026-05-13T18:07:12Z","title":"HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-15T05:54:32.496951Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.13997"},"observation_digest":"sha256:4e9f2cbc7f9738690aecb33fec9f2bc89cd11b9e1928536f46d91a475c08d4d3","observation_id":"63d7ec45-8099-4597-b10d-d5bbac4a1bbe","resolution":{"observed_at":"2026-05-15T05:55:04.761542Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.18643","last_updated":"2026-06-08T03:38:38Z","snapshot_observed_at":"2026-07-06T23:29:29.105126Z","submitted_at":"2026-05-18T16:50:48Z","title":"Post-Trained MoE Can Skip Half Experts via Self-Distillation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-20T12:00:35.496822Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.18643"},"observation_digest":"sha256:89fa474a5a72671305af58d46f56450e5dad9f965d8b057e881a45514b387f07","observation_id":"a9d852be-85ed-499f-9570-b6a922a7f85a","resolution":{"observed_at":"2026-05-20T12:03:15.167297Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.18643","last_updated":"2026-06-08T03:38:38Z","snapshot_observed_at":"2026-07-06T23:29:29.105126Z","submitted_at":"2026-05-18T16:50:48Z","title":"Post-Trained MoE Can Skip Half Experts via Self-Distillation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T18:22:45.702572Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.18643"},"observation_digest":"sha256:a598732255791d29f396113285fa497d8090c15cd62ae51a010acdfdafba6bda","observation_id":"5687dfb1-6f63-4e98-b8ce-53de53f3cf1a","resolution":{"observed_at":"2026-06-30T18:25:00.063104Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2605.29350","last_updated":"2026-05-28T04:44:22Z","snapshot_observed_at":"2026-08-06T11:38:38.477791Z","submitted_at":"2026-05-28T04:44:22Z","title":"ConMoE: Expert-Pool Consolidation via Prototype Reassignment for MoE Compression","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T07:55:57.959580Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2605.29350"},"observation_digest":"sha256:50fbc75dce6e14557847dd55bfe796b6ab302d8bb77c318133393f602e57c126","observation_id":"4c53275d-7919-4f72-8e76-dc8be3760d04","resolution":{"observed_at":"2026-06-29T08:03:14.589238Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":"2310.01334","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-07-02T11:36:55.530752Z","title":"org/CorpusID:220265858","venue":null,"work_id":"53109bb0-589e-4b43-9058-81145a26f667","year":2026},"citing_paper":{"arxiv_id":"2606.05538","last_updated":"2026-06-04T00:43:20Z","snapshot_observed_at":"2026-08-04T07:21:00.293449Z","submitted_at":"2026-06-04T00:43:20Z","title":"Less is MoE: Trimming Experts in Domain-Specialist Language Models","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-28T03:11:23.755739Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2606.05538"},"observation_digest":"sha256:4281fa927ab7348fbc4479092be3b12f3e9b12513f1885d7c6c5beaee72d7d7d","observation_id":"71624156-0df2-4337-9e75-bd989715d315","resolution":{"observed_at":"2026-07-02T11:36:55.532343Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01334","snapshot_observed_at":"2026-08-02T07:56:24.689820Z","title":"Merge, then compress: Demystify efficient smoe with hints from its routing policy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08601","last_updated":"2026-07-18T12:48:55Z","snapshot_observed_at":"2026-08-05T20:42:37.906676Z","submitted_at":"2026-07-09T15:32:54Z","title":"It Takes a MAESTRO To Prune Bad Experts","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:24.689820Z"},"links":{"cited_paper":"/paper/2310.01334","citing_paper":"/paper/2607.08601"},"observation_digest":"sha256:2755d421f825f496aacf8a127eec085e2996aa6e39e36ab113379b3ed7e27096","observation_id":"37323293-24c3-4318-90ca-f853c871c272","resolution":{"observed_at":"2026-08-02T07:56:24.689820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.01334/citation-record","integrity":"/paper/2310.01334/integrity","json":"/paper/2310.01334/citation-record.json","paper":"/paper/2310.01334"},"outbound":[],"paper":{"arxiv_id":"2310.01334","last_updated":"2024-03-14T11:01:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T02:42:46.388949Z","submitted_at":"2023-10-02T16:51:32Z","title":"Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2310.01334."}