{"as_of":"2026-08-05T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ed2d6138ee01f0e6597d7e327224eaee7ae83ae8ebfa2a6b7da8d738b5e2212","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:50:27.381965Z","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-05-21T05:49:40.760821Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.15798","last_updated":"2025-05-25T14:46:33Z","snapshot_observed_at":"2026-07-06T20:55:47.967653Z","submitted_at":"2025-03-20T02:31:57Z","title":"Mixture of Lookup Experts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15798","snapshot_observed_at":"2026-08-04T14:50:27.381965Z","title":"Mixture of lookup experts.arXiv preprint arXiv:2503.15798,","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":2024,"source":"pdf_text","source_observed_at":"2026-08-04T14:50:27.381965Z"},"links":{"cited_paper":"/paper/2503.15798","citing_paper":"/paper/2510.02345"},"observation_digest":"sha256:09a21e2401482f1cb27b2bc305e00c10f49e289c451092e9590ddd600903a41c","observation_id":"4c2775ab-d0b7-4785-87a8-104764d258cc","resolution":{"observed_at":"2026-08-04T14:50:27.381965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15798","last_updated":"2025-05-25T14:46:33Z","snapshot_observed_at":"2026-07-06T20:55:47.967653Z","submitted_at":"2025-03-20T02:31:57Z","title":"Mixture of Lookup Experts","version":2},"cited_work":{"arxiv_id":"2503.15798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15798","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixture of lookup experts","venue":null,"work_id":"69e20527-7011-494a-a417-4ec1152fe125","year":2025},"citing_paper":{"arxiv_id":"2604.21724","last_updated":"2026-04-24T17:56:56Z","snapshot_observed_at":"2026-07-06T23:08:14.631453Z","submitted_at":"2026-04-23T14:27:10Z","title":"Beyond N-gram: Data-Aware X-GRAM Extraction for Efficient Embedding Parameter Scaling","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-09T22:28:26.681945Z"},"links":{"cited_paper":"/paper/2503.15798","citing_paper":"/paper/2604.21724"},"observation_digest":"sha256:476dcf0122dd4bbc9a6dff75f708d253b1b1f691fcbab263fa99de3859fe2f21","observation_id":"f9e32c79-72dd-4488-ad44-56a291bff89a","resolution":{"observed_at":"2026-05-09T22:29:06.677071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15798","last_updated":"2025-05-25T14:46:33Z","snapshot_observed_at":"2026-07-06T20:55:47.967653Z","submitted_at":"2025-03-20T02:31:57Z","title":"Mixture of Lookup Experts","version":2},"cited_work":{"arxiv_id":"2503.15798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15798","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixture of lookup experts","venue":null,"work_id":"69e20527-7011-494a-a417-4ec1152fe125","year":2025},"citing_paper":{"arxiv_id":"2605.06216","last_updated":"2026-05-07T13:16:18Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T13:16:18Z","title":"TIDE: Every Layer Knows the Token Beneath the Context","version":1},"reference_index":110,"source":"arxiv_source","source_observed_at":"2026-05-08T10:35:46.447739Z"},"links":{"cited_paper":"/paper/2503.15798","citing_paper":"/paper/2605.06216"},"observation_digest":"sha256:31c693db98798a8c1d92d2be31c78a26dcb76759797fce8802f3e893fbd8253d","observation_id":"84ec5e38-96d9-4e41-8d70-0c148486df36","resolution":{"observed_at":"2026-05-11T19:56:10.100865Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15798","last_updated":"2025-05-25T14:46:33Z","snapshot_observed_at":"2026-07-06T20:55:47.967653Z","submitted_at":"2025-03-20T02:31:57Z","title":"Mixture of Lookup Experts","version":2},"cited_work":{"arxiv_id":"2503.15798","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.15798","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mixture of lookup experts","venue":null,"work_id":"69e20527-7011-494a-a417-4ec1152fe125","year":2025},"citing_paper":{"arxiv_id":"2605.20948","last_updated":"2026-05-20T09:35:04Z","snapshot_observed_at":"2026-07-06T23:31:27.989406Z","submitted_at":"2026-05-20T09:35:04Z","title":"Memory Grafting: Scaling Language Model Pre-training via Offline Conditional Memory","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T05:49:14.789955Z"},"links":{"cited_paper":"/paper/2503.15798","citing_paper":"/paper/2605.20948"},"observation_digest":"sha256:1838683f0eaaf75e385a25d38af2af6e069983424a980c55f9d3f41976b0700c","observation_id":"14dd25b5-344b-4539-a8cb-183a162032ab","resolution":{"observed_at":"2026-05-21T05:49:40.762382Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.15798/citation-record","integrity":"/paper/2503.15798/integrity","json":"/paper/2503.15798/citation-record.json","paper":"/paper/2503.15798"},"outbound":[],"paper":{"arxiv_id":"2503.15798","last_updated":"2025-05-25T14:46:33Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:55:47.967653Z","submitted_at":"2025-03-20T02:31:57Z","title":"Mixture of Lookup 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.15798."}