{"as_of":"2026-08-09T19:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e796e699de540e40ac263fe6ad78eb2b37913b1f2ac3b8aa105709364750c47b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:50:27.001013Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2212.05191","last_updated":"2022-12-10T03:44:16Z","snapshot_observed_at":"2026-07-06T14:28:56.301970Z","submitted_at":"2022-12-10T03:44:16Z","title":"SMILE: Scaling Mixture-of-Experts with Efficient Bi-level Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.05191","snapshot_observed_at":"2026-08-04T14:50:27.001013Z","title":"Smile: Scaling mixture-of-experts with efficient bi-level routing.arXiv preprint arXiv:2212.05191,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.02345","last_updated":"2026-07-21T06:35:53Z","snapshot_observed_at":"2026-08-04T14:50:24.826478Z","submitted_at":"2025-09-27T10:45:58Z","title":"Breaking the MoE LLM Trilemma: Dynamic Expert Clustering with Structured Compression","version":4},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-04T14:50:27.001013Z"},"links":{"cited_paper":"/paper/2212.05191","citing_paper":"/paper/2510.02345"},"observation_digest":"sha256:480da0d116f8ce4614afb9ede0fa91f8de1a60c836a5f257d8cd6eba70db9986","observation_id":"5d2835ae-e076-4e3f-bdba-cb21a34e07ed","resolution":{"observed_at":"2026-08-04T14:50:27.001013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2212.05191/citation-record","integrity":"/paper/2212.05191/integrity","json":"/paper/2212.05191/citation-record.json","paper":"/paper/2212.05191"},"outbound":[],"paper":{"arxiv_id":"2212.05191","last_updated":"2022-12-10T03:44:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T14:28:56.301970Z","submitted_at":"2022-12-10T03:44:16Z","title":"SMILE: Scaling Mixture-of-Experts with Efficient Bi-level Routing"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2212.05191."}