{"work":{"id":"b6bdc57b-e826-4754-86c0-3e37778b253a","openalex_id":null,"doi":null,"arxiv_id":"2402.14800","raw_key":null,"title":"Not all experts are equal: Efficient expert pruning and skipping for mixture-of-experts large lan- guage models.arXiv preprint arXiv:2402.14800,","authors":null,"authors_text":"Lu, X","year":2024,"venue":null,"abstract":null,"external_url":"https://arxiv.org/abs/2402.14800","cited_by_count":null,"metadata_source":"arxiv_reference","metadata_fetched_at":"2026-05-25T05:36:39.864580+00:00","pith_arxiv_id":null,"created_at":"2026-05-10T00:39:48.312717+00:00","updated_at":"2026-05-25T05:36:39.864580+00:00","title_quality_ok":true,"display_title":"Not all experts are equal: Efficient expert pruning and skipping for mixture-of-experts large language models","render_title":"Not all experts are equal: Efficient expert pruning and skipping for mixture-of-experts large language models"},"hub":{"state":{"work_id":"b6bdc57b-e826-4754-86c0-3e37778b253a","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":15,"external_cited_by_count":null,"distinct_field_count":3,"first_pith_cited_at":"2024-04-22T15:53:08+00:00","last_pith_cited_at":"2026-05-21T22:23:38+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-05-31T15:42:46.364273+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":5}],"polarity_counts":[{"context_polarity":"background","n":5}],"runs":{},"summary":{},"graph":{},"authors":[]}}