{"as_of":"2026-08-10T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a9bb83c2b6219c89e1441acd4c3e32c5b9888633d979b5c3acc57d9997ab1374","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:52:07.458601Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T19:23:54.128784Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":"2404.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-06-29T19:23:54.128784Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":"190c67f2-7d8f-48c0-af65-75443b7d0920","year":2024},"citing_paper":{"arxiv_id":"2406.00515","last_updated":"2024-11-10T22:02:27Z","snapshot_observed_at":"2026-07-29T20:40:25.374189Z","submitted_at":"2024-06-01T17:48:15Z","title":"A Survey on Large Language Models for Code Generation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-13T20:18:06.304134Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2406.00515"},"observation_digest":"sha256:edd089a7de6d63d674d791eca4d395b5ca07c6158843f6e3195ac5365a3b436f","observation_id":"c3b62ff0-2423-4cb8-b710-8a6971dab586","resolution":{"observed_at":"2026-05-13T20:18:06.709437Z","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":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-08-08T14:52:07.458601Z","title":"Shortcut-connected expert par- allelism for accelerating mixture-of-experts","venue":null,"work_id":null,"year":2024},"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":2,"source":"pdf_text","source_observed_at":"2026-08-08T14:52:07.458601Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2502.06643"},"observation_digest":"sha256:2db62f17665a713aff76a89727cebcc65dc3931fb75098d111ff7a2a63a91088","observation_id":"59daacf8-d7e6-4005-b239-25fded76cfef","resolution":{"observed_at":"2026-08-08T14:52:07.458601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-08-06T21:52:01.836956Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23266","last_updated":"2025-06-29T14:43:50Z","snapshot_observed_at":"2026-08-10T07:17:47.646480Z","submitted_at":"2025-06-29T14:43:50Z","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:52:01.836956Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2506.23266"},"observation_digest":"sha256:288cf3a4a543a80797a69e1b8de4756f0d9a8f002413f99991ba5d10f8efb95d","observation_id":"685b225d-df9a-4871-b6b0-8023773023be","resolution":{"observed_at":"2026-08-06T21:52:01.836956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":"2404.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-06-29T19:23:54.128784Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":"190c67f2-7d8f-48c0-af65-75443b7d0920","year":2024},"citing_paper":{"arxiv_id":"2508.21613","last_updated":"2026-04-20T07:16:46Z","snapshot_observed_at":"2026-07-30T02:14:25.450050Z","submitted_at":"2025-08-29T13:22:11Z","title":"Chameleon: Adaptive Fault Tolerance for Distributed Training via Real-time Policy Selection","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T20:39:32.123038Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2508.21613"},"observation_digest":"sha256:75d888ba7b0e2ed5d2f3288c4c20a183bda0ecfbad2a0aaa74362853f7a77c98","observation_id":"42bc76e4-b3cf-475d-bf2b-430ed40f5930","resolution":{"observed_at":"2026-05-18T20:41:50.619868Z","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":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-08-04T19:16:55.265118Z","title":"Shortcut-connected expert parallelism for accelerating mixture- of-experts,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09420","last_updated":"2025-09-11T13:01:55Z","snapshot_observed_at":"2026-08-09T22:37:32.561623Z","submitted_at":"2025-09-11T13:01:55Z","title":"HD-MoE: Hybrid and Dynamic Parallelism for Mixture-of-Expert LLMs with 3D Near-Memory Processing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T19:16:55.265118Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2509.09420"},"observation_digest":"sha256:c41fed24aa426d94a476e02b26f3e21f065d325c5d7325cf2cb73f90a8ea2c4b","observation_id":"b511cd5d-fc47-4c18-b843-9628e6c05bcf","resolution":{"observed_at":"2026-08-04T19:16:55.265118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":"2404.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-06-29T19:23:54.128784Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":"190c67f2-7d8f-48c0-af65-75443b7d0920","year":2024},"citing_paper":{"arxiv_id":"2605.05225","last_updated":"2026-06-05T13:47:55Z","snapshot_observed_at":"2026-08-02T06:50:35.896043Z","submitted_at":"2026-04-19T07:25:39Z","title":"MACS: Modality-Aware Capacity Scaling for Efficient Multimodal MoE Inference","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-11T01:29:26.298131Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2605.05225"},"observation_digest":"sha256:e63dcfd536769e33a9acbe7eacba9c0786ea6464389cc5f1b48a3b4e53ab1e12","observation_id":"1994da47-e34b-458d-a432-33f09c4263a5","resolution":{"observed_at":"2026-05-11T01:45:52.013040Z","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":"2404.05019","last_updated":"2025-05-29T04:25:16Z","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts","version":3},"cited_work":{"arxiv_id":"2404.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05019","snapshot_observed_at":"2026-06-29T19:23:54.128784Z","title":"Shortcut-connected expert parallelism for accelerating mixture-of-experts","venue":null,"work_id":"190c67f2-7d8f-48c0-af65-75443b7d0920","year":2024},"citing_paper":{"arxiv_id":"2605.26842","last_updated":"2026-05-26T10:56:20Z","snapshot_observed_at":"2026-08-02T04:41:45.987582Z","submitted_at":"2026-05-26T10:56:20Z","title":"MONA: Muon Optimizer with Nesterov Acceleration for Scalable Language Model Training","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-29T19:15:49.229099Z"},"links":{"cited_paper":"/paper/2404.05019","citing_paper":"/paper/2605.26842"},"observation_digest":"sha256:b293f3f00ad5046e206baf694134fdc18243688489340269779efa5d977bdbcb","observation_id":"32feb5ce-7ebc-45a8-9254-9b3bb704d926","resolution":{"observed_at":"2026-06-29T19:23:54.130290Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2404.05019/citation-record","integrity":"/paper/2404.05019/integrity","json":"/paper/2404.05019/citation-record.json","paper":"/paper/2404.05019"},"outbound":[],"paper":{"arxiv_id":"2404.05019","last_updated":"2025-05-29T04:25:16Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:56:49.318298Z","submitted_at":"2024-04-07T17:17:23Z","title":"Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Experts"},"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 7 inbound Pith citation observations for arXiv:2404.05019."}