{"as_of":"2026-08-07T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b6ff3db7f5e06bd4d05a5d41909fe8a91ad821c79a1e20168881d056997ba33","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T19:23:18.749419Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.12801/citation-record","integrity":"/paper/2508.12801/integrity","json":"/paper/2508.12801/citation-record.json","paper":"/paper/2508.12801"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-05T19:23:13.785696Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:13.785696Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:8c41f6f810e9a6e9462a14d32c792811252e0ab216ffaba094f1e919a3582ab6","observation_id":"3a84daf3-2bd3-414d-b815-78c0c5c8586e","resolution":{"observed_at":"2026-08-05T19:23:13.785696Z","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-05T19:23:22.404748Z","title":null,"venue":null,"work_id":"81bbe212-902f-4ff9-a73d-410bbd009d43","year":1958},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:13.904827Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:36bdab8c3d46457896b6bd4d0574064c7474de49c2ca3dca6f09fa7f72e2af4f","observation_id":"dff35de0-d0ef-4b14-8ad3-2bb28570dcce","resolution":{"observed_at":"2026-08-05T19:23:22.503105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06297","last_updated":"2016-01-07T22:41:10Z","snapshot_observed_at":"2026-08-04T23:18:10.428920Z","submitted_at":"2015-11-19T18:40:22Z","title":"Conditional Computation in Neural Networks for faster models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06297","snapshot_observed_at":"2026-08-05T19:23:13.973560Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:13.973560Z"},"links":{"cited_paper":"/paper/1511.06297","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:f2d41f3181c2ba382e262ee6f4307bb3b9b0c031af6c381de4df8c4bc37579c8","observation_id":"0525034e-e30d-4e06-a70e-1e2d32c63b28","resolution":{"observed_at":"2026-08-05T19:23:13.973560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11641","last_updated":"2019-11-26T15:31:46Z","snapshot_observed_at":"2026-07-06T08:40:06.727297Z","submitted_at":"2019-11-26T15:31:46Z","title":"PIQA: Reasoning about Physical Commonsense in Natural Language","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.11641","snapshot_observed_at":"2026-08-05T19:23:14.134754Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.134754Z"},"links":{"cited_paper":"/paper/1911.11641","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:cabdc9db390c486deaa079b0dc7f025ff9d6f2a2e92fa129efcbf99bf4672fc3","observation_id":"a4594ad4-627c-4a37-88bb-52e3e21b4da1","resolution":{"observed_at":"2026-08-05T19:23:14.134754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.06174","last_updated":"2016-04-22T19:21:36Z","snapshot_observed_at":"2026-08-04T13:01:58.606241Z","submitted_at":"2016-04-21T04:15:27Z","title":"Training Deep Nets with Sublinear Memory Cost","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.06174","snapshot_observed_at":"2026-08-05T19:23:14.289963Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.289963Z"},"links":{"cited_paper":"/paper/1604.06174","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:9126571d1d865287f7e18f363ca05df8be93c7ddf732c1d87f9abcd8b6df1666","observation_id":"d12634ab-fda4-428a-a796-6c0d8528a751","resolution":{"observed_at":"2026-08-05T19:23:14.289963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01169","last_updated":"2022-02-09T11:07:21Z","snapshot_observed_at":"2026-08-06T06:53:10.381665Z","submitted_at":"2022-02-02T17:58:52Z","title":"Unified Scaling Laws for Routed Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01169","snapshot_observed_at":"2026-08-05T19:23:14.375497Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.375497Z"},"links":{"cited_paper":"/paper/2202.01169","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:39de7ce1f929f551194c8cd7dd575a2d7586ff0fbaa7857293fadc965eee31f5","observation_id":"34ff5859-aeb5-41b2-86ff-da3779cdfef9","resolution":{"observed_at":"2026-08-05T19:23:14.375497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10044","last_updated":"2019-05-24T05:48:49Z","snapshot_observed_at":"2026-07-06T07:55:12.121264Z","submitted_at":"2019-05-24T05:48:49Z","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10044","snapshot_observed_at":"2026-08-05T19:23:14.454747Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.454747Z"},"links":{"cited_paper":"/paper/1905.10044","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:e435c1304c32fea19bff543acf44ce49bd4a39cce2255ec9a2d721b7ae722d1f","observation_id":"98d68ee4-56dc-49e5-bd09-798abf745e60","resolution":{"observed_at":"2026-08-05T19:23:14.454747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-05T19:23:14.496786Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.496786Z"},"links":{"cited_paper":"/paper/1803.05457","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:6b8b93d0a585e154a33e225b8ded2843dc31e8100f045c894327a683200e2a65","observation_id":"75e6cb8a-58da-4447-84e1-6b4e32ff2e8e","resolution":{"observed_at":"2026-08-05T19:23:14.496786Z","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-05T19:23:22.087608Z","title":null,"venue":null,"work_id":"9e435fe0-e690-4b7f-8688-728affd35c5f","year":2013},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.586647Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:c6e7b746b70774b1afe7d37b52354864cbfa0c36a76162a6b2c2ede3f5441eb3","observation_id":"743e25db-d338-4ee0-91eb-7390a384b230","resolution":{"observed_at":"2026-08-05T19:23:22.181176Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06066","last_updated":"2024-01-11T17:31:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","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-05T19:23:14.686180Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.686180Z"},"links":{"cited_paper":"/paper/2401.06066","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:af99d002f0768c1a0f7fad358f6d62849b95db999e2208309457a908e1818625","observation_id":"8200d928-f4fd-4a2a-9fb0-730625fa4cfb","resolution":{"observed_at":"2026-08-05T19:23:14.686180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-05T19:23:14.775987Z","title":"Zhang, Hanwei Xu, Hao Yang, Haowei Zhang, Honghui Ding, Huajian Xin, Huazuo Gao, Hui Li, Hui Qu, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.775987Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:25730aa01a2846c13f15ab7ff93dbe66fb571aa4482253fa51507f3f37f66f3b","observation_id":"ed9f62e5-98c0-40ad-8af3-27635e776ac4","resolution":{"observed_at":"2026-08-05T19:23:14.775987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-05T19:23:14.914750Z","title":"Zhang, Han Bao, Hanwei Xu, Haocheng Wang, Haowei Zhang, Honghui Ding, Huajian Xin, Huazuo Gao, Hui Li, Hui Qu, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:14.914750Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:bd2f4b7c41ca1218e7958291300a65efb923d11b32cae90db73263ff1438f048","observation_id":"688d252a-ae64-43a9-9246-4843614c4df1","resolution":{"observed_at":"2026-08-05T19:23:14.914750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.4314","last_updated":"2014-03-09T20:15:03Z","snapshot_observed_at":"2026-07-06T03:30:57.897408Z","submitted_at":"2013-12-16T11:15:10Z","title":"Learning Factored Representations in a Deep Mixture of Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.4314","snapshot_observed_at":"2026-08-05T19:23:15.019154Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.019154Z"},"links":{"cited_paper":"/paper/1312.4314","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:64c6d6ed761fe755c94e56053e859c694eb765b5930eaf66ea00d62d071007cf","observation_id":"3c030aa9-84f8-4ef6-b995-a080d0e21754","resolution":{"observed_at":"2026-08-05T19:23:15.019154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.03961","last_updated":"2022-06-16T20:36:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-01-11T16:11:52Z","title":"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.03961","snapshot_observed_at":"2026-08-05T19:23:15.151496Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.151496Z"},"links":{"cited_paper":"/paper/2101.03961","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:f8d439ef11b1c50dc5aa531f17d703eb6219d9ecb61219bfef25e1cc0c626f09","observation_id":"fe097c0b-a875-4aea-aaa9-40a37b4dc528","resolution":{"observed_at":"2026-08-05T19:23:15.151496Z","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-05T19:23:21.847607Z","title":null,"venue":null,"work_id":"91cf1ebe-8ca9-4ad3-acae-c9aa68028508","year":1956},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.255694Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:f5f4acf37e31d14081cb501a064167dc152171886785df9ea8c6e90b244f29d7","observation_id":"24d1feea-f582-4931-ac3f-306e7ec418a8","resolution":{"observed_at":"2026-08-05T19:23:21.964743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15841","last_updated":"2022-11-29T00:27:08Z","snapshot_observed_at":"2026-08-03T23:24:43.956833Z","submitted_at":"2022-11-29T00:27:08Z","title":"MegaBlocks: Efficient Sparse Training with Mixture-of-Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.15841","snapshot_observed_at":"2026-08-05T19:23:15.344590Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.344590Z"},"links":{"cited_paper":"/paper/2211.15841","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:ba5c8123f9ecf3dac5b4e68a6d8d0e3f9178f9046434c231831774cc02f9f8c6","observation_id":"9eb5650d-b3eb-45be-924d-73e7de6ca05d","resolution":{"observed_at":"2026-08-05T19:23:15.344590Z","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-05T19:23:15.436908Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.436908Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:b1f74a879b3619a78582890fb0c896d5e710d10eb8b4d3ebb71ca1af49cb44fb","observation_id":"b46af992-042d-4b5b-83a5-b7efaa31c42a","resolution":{"observed_at":"2026-08-05T19:23:15.436908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-05T19:23:15.537840Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.537840Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:2c6ac72f9c3e799cbef5937af343e017931bf61dbd3f4f626ba9eba55d6ed062","observation_id":"cd9eb29f-457f-47f6-ad7b-d07d7a34e5ed","resolution":{"observed_at":"2026-08-05T19:23:15.537840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06395","last_updated":"2024-06-03T08:54:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-04-09T15:36:50Z","title":"MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategies","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06395","snapshot_observed_at":"2026-08-05T19:23:15.596950Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.596950Z"},"links":{"cited_paper":"/paper/2404.06395","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:571ef5a42dcee2c6f67d26145e649e699916edd04c8af4e470e57e26e6f97c2a","observation_id":"ef4194f1-2772-439e-a3e6-cd4af1e0a261","resolution":{"observed_at":"2026-08-05T19:23:15.596950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.03382","last_updated":"2023-06-05T15:05:24Z","snapshot_observed_at":"2026-08-06T17:50:04.734688Z","submitted_at":"2022-06-07T15:20:20Z","title":"Tutel: Adaptive Mixture-of-Experts at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.03382","snapshot_observed_at":"2026-08-05T19:23:15.724137Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.724137Z"},"links":{"cited_paper":"/paper/2206.03382","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:833b4fa9e743d073e143e3865bfc9bcb6463579b0e9da6e8dc4b00e8f0584482","observation_id":"a88dcb9f-1370-4770-8cfa-fd63b42a0f18","resolution":{"observed_at":"2026-08-05T19:23:15.724137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07871","last_updated":"2024-02-12T18:33:47Z","snapshot_observed_at":"2026-08-01T16:05:25.800937Z","submitted_at":"2024-02-12T18:33:47Z","title":"Scaling Laws for Fine-Grained Mixture of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07871","snapshot_observed_at":"2026-08-05T19:23:15.826161Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.826161Z"},"links":{"cited_paper":"/paper/2402.07871","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:c2c3a89e188e7dde68c8f22e14a71d65af909106ec411a3e930e7d0738b2a904","observation_id":"7cb64e95-77f8-483e-8777-90264f295ad8","resolution":{"observed_at":"2026-08-05T19:23:15.826161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04683","last_updated":"2017-12-05T19:36:03Z","snapshot_observed_at":"2026-08-07T10:40:47.462532Z","submitted_at":"2017-04-15T19:31:41Z","title":"RACE: Large-scale ReAding Comprehension Dataset From Examinations","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04683","snapshot_observed_at":"2026-08-05T19:23:15.867059Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.867059Z"},"links":{"cited_paper":"/paper/1704.04683","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:63ea6bad3a1614b4735d3da7cb126093b79433afd209d4c9a6ee8aa579357540","observation_id":"d193dc80-b346-4930-83e3-eeb2e3429310","resolution":{"observed_at":"2026-08-05T19:23:15.867059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16668","last_updated":"2020-06-30T10:42:02Z","snapshot_observed_at":"2026-08-07T09:27:36.420559Z","submitted_at":"2020-06-30T10:42:02Z","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16668","snapshot_observed_at":"2026-08-05T19:23:15.952994Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:15.952994Z"},"links":{"cited_paper":"/paper/2006.16668","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:836c49a0dd089f6ff2cbf3dcfbf409afea01318892461592e655dc8dbad0ca6b","observation_id":"6c37180b-2587-4174-b8c9-8a8b854587ef","resolution":{"observed_at":"2026-08-05T19:23:15.952994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-05T19:23:16.033022Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.033022Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:44b6dc480269e067b91f179412d605d93c0f114878e300f9c86710598dad09c6","observation_id":"3764b196-072a-4c94-bd43-38ba39a919dd","resolution":{"observed_at":"2026-08-05T19:23:16.033022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.02068","last_updated":"2016-02-08T09:41:36Z","snapshot_observed_at":"2026-07-06T04:45:16.550592Z","submitted_at":"2016-02-05T15:49:02Z","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.02068","snapshot_observed_at":"2026-08-05T19:23:16.114751Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.114751Z"},"links":{"cited_paper":"/paper/1602.02068","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:1ab52b1f700c67b203fe602cd6f34a29a667111d373de52067d899ca8a48a2e3","observation_id":"ebf03aaf-046a-4d72-8a48-374b1a6a7b5d","resolution":{"observed_at":"2026-08-05T19:23:16.114751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02789","last_updated":"2018-09-08T11:47:16Z","snapshot_observed_at":"2026-07-06T06:59:57.168051Z","submitted_at":"2018-09-08T11:47:16Z","title":"Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02789","snapshot_observed_at":"2026-08-05T19:23:16.204781Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.204781Z"},"links":{"cited_paper":"/paper/1809.02789","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:b8296574d8279cd6b13308e41ac02adf5431e845309099952f84ea96adf4e654","observation_id":"98b0a343-cb84-43d9-aeaf-4bf3f99774c0","resolution":{"observed_at":"2026-08-05T19:23:16.204781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.02060","last_updated":"2025-03-03T01:25:46Z","snapshot_observed_at":"2026-07-29T16:11:06.082798Z","submitted_at":"2024-09-03T17:08:20Z","title":"OLMoE: Open Mixture-of-Experts Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.02060","snapshot_observed_at":"2026-08-05T19:23:16.296685Z","title":"Smith, Pang Wei Koh, Amanpreet Singh, and Hannaneh Hajishirzi","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.296685Z"},"links":{"cited_paper":"/paper/2409.02060","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:ecde23df1fa6e57b42b9533c996996f1f6c8b28fce9180caa4763c3772737a03","observation_id":"d1b77ca2-1384-4764-955d-56ecd81e5b3c","resolution":{"observed_at":"2026-08-05T19:23:16.296685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.06031","last_updated":"2016-06-20T09:37:17Z","snapshot_observed_at":"2026-08-05T16:27:22.031013Z","submitted_at":"2016-06-20T09:37:17Z","title":"The LAMBADA dataset: Word prediction requiring a broad discourse context","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.06031","snapshot_observed_at":"2026-08-05T19:23:16.414745Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.414745Z"},"links":{"cited_paper":"/paper/1606.06031","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:78c71f3896ade39a7104befa1c6a390a911ea391b4a51788e942ffd927f90607","observation_id":"bcae20bc-f7d1-4dce-9e72-0eed540e643d","resolution":{"observed_at":"2026-08-05T19:23:16.414745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05702","last_updated":"2019-06-12T18:20:25Z","snapshot_observed_at":"2026-08-06T10:52:04.671805Z","submitted_at":"2019-05-14T16:21:34Z","title":"Sparse Sequence-to-Sequence Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.05702","snapshot_observed_at":"2026-08-05T19:23:16.494919Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.494919Z"},"links":{"cited_paper":"/paper/1905.05702","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:29ef9a2cb51e01c0919f3203b02d108ea190c2fe05626aefa2c1ce68746089c9","observation_id":"8b0cad94-221f-4ad8-8074-0e2e724cecc7","resolution":{"observed_at":"2026-08-05T19:23:16.494919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10683","last_updated":"2023-09-19T15:14:48Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-23T17:37:36Z","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.10683","snapshot_observed_at":"2026-08-05T19:23:16.624748Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.624748Z"},"links":{"cited_paper":"/paper/1910.10683","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:b372d0db8a3e06e28c269d62e1a4344cfdf47c998f3e17a8b57b17bbf9d10497","observation_id":"a270fd48-fda4-4152-b4ae-8766634367c2","resolution":{"observed_at":"2026-08-05T19:23:16.624748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.02054","last_updated":"2020-05-13T06:45:15Z","snapshot_observed_at":"2026-07-06T08:27:00.558613Z","submitted_at":"2019-10-04T17:29:39Z","title":"ZeRO: Memory Optimizations Toward Training Trillion Parameter Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.02054","snapshot_observed_at":"2026-08-05T19:23:16.705810Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.705810Z"},"links":{"cited_paper":"/paper/1910.02054","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:1e63177cedc9b7e589e6c9088f593cb8e2669cdaf20d61136f513d0ec6bb093f","observation_id":"3a99ab27-0705-4d58-ae69-9bd39ff3ea98","resolution":{"observed_at":"2026-08-05T19:23:16.705810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05202","last_updated":"2020-02-12T19:57:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-02-12T19:57:13Z","title":"GLU Variants Improve Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05202","snapshot_observed_at":"2026-08-05T19:23:16.784745Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.784745Z"},"links":{"cited_paper":"/paper/2002.05202","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:ab2ceb3e41a4d8d6303b4eb407bc888dfd265c90e04512a21b6df0afd07c4e30","observation_id":"00bc1008-d53c-446f-8b87-9ebdcca97d99","resolution":{"observed_at":"2026-08-05T19:23:16.784745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06538","last_updated":"2017-01-23T18:10:00Z","snapshot_observed_at":"2026-07-06T05:27:13.416519Z","submitted_at":"2017-01-23T18:10:00Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.06538","snapshot_observed_at":"2026-08-05T19:23:16.882837Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.882837Z"},"links":{"cited_paper":"/paper/1701.06538","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:acd677215b1e9fc0f3f6af7c5099e846bbfbc0c03b8387a7697016d337e6baae","observation_id":"aac426b0-03f9-4f10-b8ae-7db2f2db92ef","resolution":{"observed_at":"2026-08-05T19:23:16.882837Z","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-05T19:23:21.584748Z","title":null,"venue":null,"work_id":"d0b822f9-2c50-4dd0-8743-f7cf767252fc","year":2024},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:16.981923Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:4c0d5417bb7da95376b5b4ee033c27feafb708f2e71d3dcfe5716050e7c93eb4","observation_id":"a8750048-2887-4a35-808e-88c2af22999a","resolution":{"observed_at":"2026-08-05T19:23:21.691337Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-07-06T11:01:58.137141Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-05T19:23:17.084460Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.084460Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:d7175f106d057e1356895a3f32883c6bc2c5cf00c3b7cffc44d39fb7d622fcc1","observation_id":"3a965890-12e4-425e-889e-947a111a2b6f","resolution":{"observed_at":"2026-08-05T19:23:17.084460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T19:23:17.181091Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.181091Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:e97f55fbad53e604a03fdaa7b5e6f96286b71cdafb3e6592dcd7079b3774d430","observation_id":"afa55547-18c3-4706-91c1-cb60d36d295c","resolution":{"observed_at":"2026-08-05T19:23:17.181091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-05T19:23:17.334859Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.334859Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:12d12c31e4cb9224883136b564956472416ba44e425aa01d69c943376ed51161","observation_id":"40a417fd-1b71-4af5-b74c-bc4bc8454064","resolution":{"observed_at":"2026-08-05T19:23:17.334859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-05T19:23:17.445183Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.445183Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:d150b470f56ad8069833400d0899cdbf77b13b874c6da8ba06063aa39ca79943","observation_id":"bfcd03ba-2f8d-4b79-895f-7b0c37f70972","resolution":{"observed_at":"2026-08-05T19:23:17.445183Z","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-05T19:23:21.370914Z","title":null,"venue":null,"work_id":"152e1c61-cc48-4b5d-84f1-6b790140ad7d","year":1994},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.594755Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:1e6d05d849a45f878accb906e52a172ad9f1f2cac12341c1a862c761c299c49c","observation_id":"3739a007-f77d-4c8c-a2a9-407e16ca58ed","resolution":{"observed_at":"2026-08-05T19:23:21.437477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14711","last_updated":"2025-02-27T16:33:09Z","snapshot_observed_at":"2026-08-01T15:56:04.576176Z","submitted_at":"2024-12-19T10:21:20Z","title":"ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14711","snapshot_observed_at":"2026-08-05T19:23:17.695452Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.695452Z"},"links":{"cited_paper":"/paper/2412.14711","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:8587def0b12795cedfc18740f21eb3053b706d697f385632bc2db4aefb08846c","observation_id":"9610377f-ff36-42ae-af6f-0c424901b020","resolution":{"observed_at":"2026-08-05T19:23:17.695452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06209","last_updated":"2017-07-19T17:28:46Z","snapshot_observed_at":"2026-08-06T06:05:27.671303Z","submitted_at":"2017-07-19T17:28:46Z","title":"Crowdsourcing Multiple Choice Science Questions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06209","snapshot_observed_at":"2026-08-05T19:23:17.845602Z","title":"Liu, and Matt Gardner","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.845602Z"},"links":{"cited_paper":"/paper/1707.06209","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:b93b4a128c493314a98ba5b248dc4ad8946cec2c5e8b6997f4ec5f8de04e6ac3","observation_id":"72bb7b20-467a-4879-9c77-e45e15147f38","resolution":{"observed_at":"2026-08-05T19:23:17.845602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-05T19:23:17.947661Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:17.947661Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:dadcb726f759ba94e7aa5448d5da77f471545823c72b4fdcab88591012a39df6","observation_id":"1e6ebbd7-6611-4993-994d-4360b3eb9222","resolution":{"observed_at":"2026-08-05T19:23:17.947661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07830","last_updated":"2019-05-19T23:57:23Z","snapshot_observed_at":"2026-07-31T00:09:56.948833Z","submitted_at":"2019-05-19T23:57:23Z","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.07830","snapshot_observed_at":"2026-08-05T19:23:18.034902Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.034902Z"},"links":{"cited_paper":"/paper/1905.07830","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:2de3526a48a1e0d8445ad228db338cd267925c0d6ba1e0c1a7e78769820ca952","observation_id":"695eecf0-023c-4c50-ae87-ae1a207282d6","resolution":{"observed_at":"2026-08-05T19:23:18.034902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.07467","last_updated":"2019-10-16T16:44:22Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-10-16T16:44:22Z","title":"Root Mean Square Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.07467","snapshot_observed_at":"2026-08-05T19:23:18.144753Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.144753Z"},"links":{"cited_paper":"/paper/1910.07467","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:90df5487afa7b3be1520004ea8f79dded9c1c86e78983d9ab4700baf70cee43e","observation_id":"8ceeae6d-5338-4f23-90ea-6c85b578fbba","resolution":{"observed_at":"2026-08-05T19:23:18.144753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.12885","last_updated":"2018-10-30T17:32:16Z","snapshot_observed_at":"2026-08-06T02:57:51.203477Z","submitted_at":"2018-10-30T17:32:16Z","title":"ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.12885","snapshot_observed_at":"2026-08-05T19:23:18.294756Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.294756Z"},"links":{"cited_paper":"/paper/1810.12885","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:b93a79a9c4d47f069519955f5bf4500e80e0af92fecf790acbba82b86f367a61","observation_id":"327408ca-12af-4463-8d1c-3f5e90055077","resolution":{"observed_at":"2026-08-05T19:23:18.294756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09368","last_updated":"2022-10-14T00:08:24Z","snapshot_observed_at":"2026-08-07T01:23:19.488468Z","submitted_at":"2022-02-18T17:46:11Z","title":"Mixture-of-Experts with Expert Choice Routing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09368","snapshot_observed_at":"2026-08-05T19:23:18.406835Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.406835Z"},"links":{"cited_paper":"/paper/2202.09368","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:dd6d3ecc4c77f9c25692a709d868afb0e40aba80f61a474d9e8122f353ccb510","observation_id":"8f9b061a-2a2b-4d8d-8f3b-d210d9417612","resolution":{"observed_at":"2026-08-05T19:23:18.406835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.08906","last_updated":"2022-04-29T23:24:20Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-02-17T21:39:10Z","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.08906","snapshot_observed_at":"2026-08-05T19:23:18.505657Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.505657Z"},"links":{"cited_paper":"/paper/2202.08906","citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:15d43da37860544c0eabef6c8e616af10351adb19e92e759d448a916fa0b7221","observation_id":"b20848b1-08c8-4486-9a51-c008c1573e61","resolution":{"observed_at":"2026-08-05T19:23:18.505657Z","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-05T19:23:18.644750Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.644750Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:12d4a1e002f1cbd205b938d42217b2bf8a929512237f80bc02024172e72cb048","observation_id":"b79ff314-beca-4ab8-8680-b83bdcefdc30","resolution":{"observed_at":"2026-08-05T19:23:18.644750Z","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-05T19:23:18.749419Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T19:23:18.749419Z"},"links":{"citing_paper":"/paper/2508.12801"},"observation_digest":"sha256:300623b3a0cf612efccf7ab1e549d17538e1c24bc4b88e1c498f65bdf060dc6b","observation_id":"b7eafaec-dcf9-433a-8a74-4cec20f1955c","resolution":{"observed_at":"2026-08-05T19:23:18.749419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.12801","last_updated":"2025-08-18T10:25:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T02:58:00.222739Z","submitted_at":"2025-08-18T10:25:42Z","title":"Maximum Score Routing For Mixture-of-Experts"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2508.12801."}