{"as_of":"2026-08-08T11:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19150be4dab8149fa09254ea420bbd54f20455cde2cd7adeaf58c3c4e05d0028","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:52:05.432000Z","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.517162Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","snapshot_observed_at":"2026-07-06T19:12:57.997252Z","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-07T02:39:39.049338Z","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:2c16ea309956db2b51da20277d69d3fba817d6ed8eecb5d5fe8feb32a5eeac7d","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":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","snapshot_observed_at":"2026-07-06T19:12:57.997252Z","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-03T23:41:52.885793Z","title":"Stun: Structured-then-unstructured pruning for scalable moe pruning, 2025 b","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-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":18,"source":"arxiv_source","source_observed_at":"2026-08-03T23:41:52.885793Z"},"links":{"cited_paper":"/paper/2409.06211","citing_paper":"/paper/2511.04805"},"observation_digest":"sha256:393a93ffaa53257ad4441ca36c54e95ba9da72267ccdb910e96b1992254d202f","observation_id":"e5a99e4a-4446-4a66-978b-cd849d8a7891","resolution":{"observed_at":"2026-08-03T23:41:52.885793Z","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-07-06T19:12:57.997252Z","submitted_at":"2024-09-10T04:34:42Z","title":"STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning","version":2},"cited_work":{"arxiv_id":"2409.06211","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.06211","snapshot_observed_at":"2026-07-02T11:36:55.517162Z","title":"arXiv preprint arXiv:2409.06211 , year=","venue":null,"work_id":"60ee95e0-743b-49a5-93ae-6169c620a62c","year":2024},"citing_paper":{"arxiv_id":"2604.06542","last_updated":"2026-04-08T00:41:11Z","snapshot_observed_at":"2026-08-07T12:38:09.617087Z","submitted_at":"2026-04-08T00:41:11Z","title":"Does a Global Perspective Help Prune Sparse MoEs Elegantly?","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-10T19:06:25.626026Z"},"links":{"cited_paper":"/paper/2409.06211","citing_paper":"/paper/2604.06542"},"observation_digest":"sha256:e3a571197300e0b5e07cc16566992471e6a78fb166749f844287c352d11bfe78","observation_id":"e761fc29-ef85-401f-b006-6b2e62986b66","resolution":{"observed_at":"2026-05-10T23:30:50.738657Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","snapshot_observed_at":"2026-07-06T19:12:57.997252Z","submitted_at":"2024-09-10T04:34:42Z","title":"STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning","version":2},"cited_work":{"arxiv_id":"2409.06211","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.06211","snapshot_observed_at":"2026-07-02T11:36:55.517162Z","title":"arXiv preprint arXiv:2409.06211 , year=","venue":null,"work_id":"60ee95e0-743b-49a5-93ae-6169c620a62c","year":2024},"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":42,"source":"arxiv_source","source_observed_at":"2026-06-28T03:11:23.755739Z"},"links":{"cited_paper":"/paper/2409.06211","citing_paper":"/paper/2606.05538"},"observation_digest":"sha256:2a41835e91170d07d66bea7b815d8b5a7753e55bd39ee6266533172846de46ca","observation_id":"2587000c-ea08-4b28-aefe-604cfce0a32b","resolution":{"observed_at":"2026-07-02T11:36:55.518743Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","snapshot_observed_at":"2026-07-06T19:12:57.997252Z","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-07-11T08:35:22.347459Z","title":"Available: https://arxiv.org/abs/2409.06211","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.05116","last_updated":"2026-07-06T14:06:25Z","snapshot_observed_at":"2026-08-02T18:01:37.878392Z","submitted_at":"2026-07-06T14:06:25Z","title":"Communication-Aware Placement and Pruning for Efficient Mixture-of-Experts Inference","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T08:35:22.347459Z"},"links":{"cited_paper":"/paper/2409.06211","citing_paper":"/paper/2607.05116"},"observation_digest":"sha256:f23329c7212fa14339e3705f796a28806b8ef5564017554405d9fd29c5a06cb1","observation_id":"8437a902-e1e2-49ae-a5a6-226c29c016d7","resolution":{"observed_at":"2026-07-11T08:35:22.347459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.06211/citation-record","integrity":"/paper/2409.06211/integrity","json":"/paper/2409.06211/citation-record.json","paper":"/paper/2409.06211"},"outbound":[],"paper":{"arxiv_id":"2409.06211","last_updated":"2025-07-21T09:16:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:12:57.997252Z","submitted_at":"2024-09-10T04:34:42Z","title":"STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2409.06211."}