{"as_of":"2026-08-16T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09e8fb76092ee83cb2f7e42df724220a3c58e3ab963e5b2fc70ed663d80c1488","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:48:23.938414Z","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-16T06:30:59.297886+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-15T17:51:05.684119Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T17:51:06.516646Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"cited_work":{"arxiv_id":"2607.17880","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.17880","snapshot_observed_at":"2026-08-15T17:51:06.516646Z","title":"Mixture-of-Experts Serving","venue":"cs.DS","work_id":"79e56dcf-3ecc-4190-8950-5f313f038c53","year":2026},"citing_paper":{"arxiv_id":"2608.13057","last_updated":"2026-08-13T10:21:11Z","snapshot_observed_at":"2026-08-16T08:10:52.495246Z","submitted_at":"2026-08-13T10:21:11Z","title":"TEMPO: Makespan-Aware Expert-Parallel Load Balancing Across Memory- and Compute-Bound Regimes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:51:05.684119Z"},"links":{"cited_paper":"/paper/2607.17880","citing_paper":"/paper/2608.13057"},"observation_digest":"sha256:49ed8e38c6413c596c3a515e7cfd1549c9d36e0a68665a191b1e883def18e8ad","observation_id":"4cd430e3-9734-4038-98e0-98c33048b18f","resolution":{"observed_at":"2026-08-15T17:51:06.541624Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.17880/citation-record","integrity":"/paper/2607.17880/integrity","json":"/paper/2607.17880/citation-record.json","paper":"/paper/2607.17880"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.10925","last_updated":"2025-08-08T19:24:38Z","snapshot_observed_at":"2026-08-14T02:46:12.121034Z","submitted_at":"2025-08-08T19:24:38Z","title":"gpt-oss-120b & gpt-oss-20b Model Card","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10925","snapshot_observed_at":"2026-08-15T15:48:23.416951Z","title":"gpt-oss-120b & gpt-oss-20b model card.arXiv preprint arXiv:2508.10925, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.416951Z"},"links":{"cited_paper":"/paper/2508.10925","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:21e17973720c0f1a13e2f8ac21a7006766e0a123c04a33a09bceb9b1eb98d89f","observation_id":"4da8c282-ed38-402b-b9f9-6c8245885a0e","resolution":{"observed_at":"2026-08-15T15:48:23.416951Z","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-15T15:48:25.727447Z","title":"Taming Throughput-Latency tradeoff in LLM inference with Sarathi-Serve","venue":null,"work_id":"1dff201e-aba2-4dd9-bcd1-a12a6b0f16d6","year":2024},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.421639Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:d45adada7c8afac5e99ce70a213d5cff15e842884c0242141e75f28bcc8ab002","observation_id":"9e1e8c54-9aee-40d6-9ab2-bbd39ef51aa8","resolution":{"observed_at":"2026-08-15T15:48:25.770905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.578927Z","title":"A tale of two metrics: Simultaneous bounds on competitiveness and regret","venue":null,"work_id":"540ec166-9120-4cba-9faf-89c58c8696bf","year":2013},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.425367Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:a67bb374e94875518fbc7e34332bae4392669036cf80042358ff656ea8859d18","observation_id":"786cea2b-c888-4a5f-88e1-b1008924ba46","resolution":{"observed_at":"2026-08-15T15:48:25.673869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.429693Z","title":"Dimension-free bounds for chasing convex functions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.429693Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:a92061b7bca88dd429c848979895c6d27de5357333342dcf6778b7525b8557ef","observation_id":"ea427b73-279b-4452-8a90-afc5da6b36c2","resolution":{"observed_at":"2026-08-15T15:48:23.429693Z","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-15T15:48:25.559974Z","title":"Online algo- rithms for covering and packing problems with convex objectives","venue":null,"work_id":"606d9179-9de3-4dfe-aca3-cb2007577bc2","year":2016},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.434405Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:3f5c34d92c1ad3be74bef491f0dac2da9bbdba62475c4ff3fd5b3e77a2b92dc8","observation_id":"a38ad19f-8b7b-4b3a-b1f8-a1aed33f17d2","resolution":{"observed_at":"2026-08-15T15:48:25.563896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.546692Z","title":"Randomized competitive algorithms for generalized caching.SIAM Journal on Computing, 41(2):391–414, 2012","venue":null,"work_id":"dec24f73-8818-4bb5-b0e0-c09fdceed6ab","year":2012},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.438688Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:342806b267cfda86fb7736686da03d523e1eea7881600bfaa5282d8b998e5b8b","observation_id":"fd4d32d6-8a3b-4493-9df1-e9d56022e293","resolution":{"observed_at":"2026-08-15T15:48:25.550321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.534796Z","title":"A 2-competitive algorithm for online convex optimization with switching costs","venue":null,"work_id":"6fded259-546b-4cba-a25e-19a6ce69b40c","year":2015},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.443092Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:d9e144df43b68d045b9a000fa06257bf84a5290485d4531fa8d661e0c2cfffee","observation_id":"ca1b3255-af10-4425-8bc7-6e155426eb0f","resolution":{"observed_at":"2026-08-15T15:48:25.538932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.523162Z","title":"A polylog (n)-competitive algo- rithm for metrical task systems","venue":null,"work_id":"f0e8fc26-0980-4915-b4b0-6238ccd324df","year":1997},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.447373Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:9f2c2a01999b9871bc066337e141bdc8de46fccc2025eda0c3232924719f83b6","observation_id":"72c45e28-3f7d-4cea-95fa-151ebb330bb2","resolution":{"observed_at":"2026-08-15T15:48:25.527119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.333792Z","title":"Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.Journal of the ACM (JACM), 51(4):517–539, 2004","venue":null,"work_id":"c188d94f-d286-4edc-b7f0-ee9de51f7da9","year":2004},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.451468Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:87dc32bab840c92691448b3e04a156ac6190843657d76e086f2c5e42948ac85f","observation_id":"a043f6d3-6976-4f6d-8140-307777254f1b","resolution":{"observed_at":"2026-08-15T15:48:25.443957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.252675Z","title":"Finely-competitive paging","venue":null,"work_id":"f4fb8d16-a9f5-4f5f-b111-b84a8368e286","year":1999},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.455664Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:51e529677c77ca8f2670b8680795c08c5b20420355531b7951ff686932f184df","observation_id":"b2a74e08-b639-4e2a-b12e-173e8e161b31","resolution":{"observed_at":"2026-08-15T15:48:25.293830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.166925Z","title":"An optimal on-line algorithm for metrical task system.Journal of the ACM (JACM), 39(4):745–763, 1992","venue":null,"work_id":"f9cf7ef6-2b48-4995-bf35-fae61241dbfd","year":1992},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.459969Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:e3fb07be78d5e0e881fb2f2343b1f5cbd657a5ee62a2fb44f31108290476963e","observation_id":"74bfd8e3-fc73-467c-83f5-6b712d290abd","resolution":{"observed_at":"2026-08-15T15:48:25.204368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.115313Z","title":"K- server via multiscale entropic regularization","venue":null,"work_id":"0fe7d409-9364-4b89-8438-b35870954638","year":2018},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.464004Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:c7f53931cd777849864cbbb616e5c6f6bdaa12339349b0e1139de2c331f03e09","observation_id":"a9e9540a-7ca3-4459-8623-bc13191fdf9f","resolution":{"observed_at":"2026-08-15T15:48:25.118977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.102709Z","title":"Competitively chasing convex bodies","venue":null,"work_id":"4838b857-bc2e-4a77-8e9b-1da96093ba19","year":2019},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.468087Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:c6d2a2319ccf0f619590e2797c82b448cb6add3ad73badeac55285e3a8e427b2","observation_id":"25692a8a-85d9-4b85-a210-1ea18089a983","resolution":{"observed_at":"2026-08-15T15:48:25.107316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.091666Z","title":"Competitive analysis via regularization","venue":null,"work_id":"64a89848-beb5-4632-87bd-138a91946c60","year":2014},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.471963Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:0a7244497dc0a83e62bcc028f915b88f1a22cb5b9f9341842d6699191ec87714","observation_id":"ce2a5491-5f69-4cef-b071-08454d57978e","resolution":{"observed_at":"2026-08-15T15:48:25.095132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.078817Z","title":"k-servers with a smile: Online algorithms via projections","venue":null,"work_id":"adfd76c7-47ff-4c23-adff-29e156442c2f","year":2019},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.485996Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:d2a1d5e4f8a2153d0c7305e9586419a5397730533898e72be831f97ab5ccb97a","observation_id":"7a891bd2-2502-47a6-a7b6-01f8c6652fff","resolution":{"observed_at":"2026-08-15T15:48:25.083332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.065135Z","title":"Minimizing total completion time on batch processing machines.The International Journal Of Production Research, 31(9):2097–2121, 1993","venue":null,"work_id":"f96f406a-7bd2-4c85-867b-01221e0a0377","year":1993},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.611298Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:6255da55fedd5c3d1c16a841040dff6756802cd22e181ff698b4b5c077fda08d","observation_id":"655564b3-f37e-4c7d-b271-0b5dbdc3fffd","resolution":{"observed_at":"2026-08-15T15:48:25.070681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.619890Z","title":"Smoothed online convex optimization in high dimensions via online balanced descent","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.619890Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:d63af4f22923c416cb595bb7a1b8dae77ec8d36af432aeccb59f6c74e32d17de","observation_id":"a58bbc78-2e6e-48c8-a41d-a896110b4478","resolution":{"observed_at":"2026-08-15T15:48:23.619890Z","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-15T15:48:25.037274Z","title":"Pure entropic regularization for metrical task systems","venue":null,"work_id":"04f851bc-320f-4279-a552-c5a2d8bb34ad","year":2019},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.644639Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:abc7578ea9a542a3dab0403fb81d0491459381f8da70791fe290292331a1f43c","observation_id":"52f5d9b1-bb26-4abf-b22b-4f761b61ed85","resolution":{"observed_at":"2026-08-15T15:48:25.045098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.648070Z","title":"Deepseekmoe: Towards ultimate expert specializa- tion in mixture-of-experts language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.648070Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:843968ca1753f86c706de1c354d9bbc20786450a6af0194fdd7436885c4e39ec","observation_id":"def63396-bdd4-4aa8-957b-0a3a6396afb0","resolution":{"observed_at":"2026-08-15T15:48:23.648070Z","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-15T15:48:25.016225Z","title":"Primal dual gives almost optimal energy efficient online algorithms","venue":null,"work_id":"54228b1f-ea5f-4d78-88dd-5f513454cbc9","year":2014},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.651998Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:4e1185ce0e82380a2d150282455e29bf77c617892fc2c0d97a88b6ba7f21c63d","observation_id":"4948f036-9cc3-47b2-bf22-9f2f2d45a3de","resolution":{"observed_at":"2026-08-15T15:48:25.020026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:25.005320Z","title":"Online matching with concave returns","venue":null,"work_id":"f07b0214-bb1a-45b0-bfc1-1a1b1a464448","year":2012},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.655303Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:5b585f8f97997fbe80575b2e8216cc11c800b35bb5df2964d7d3f60c67edb262","observation_id":"3dae5166-e8cd-4de5-952a-ff413deba37c","resolution":{"observed_at":"2026-08-15T15:48:25.008814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.659451Z","title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity.Journal of Machine Learning Research, 23(120):1–39, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.659451Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:da5b40414c1e6cfd803c77cecdf8bcf616508700119ddca5f65053178540eee6","observation_id":"a0c4965a-5e57-4d8a-99f6-0f3ab50f6f36","resolution":{"observed_at":"2026-08-15T15:48:23.659451Z","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-15T15:48:24.864432Z","title":"Competitive paging algorithms.Journal of Algorithms, 12(4):685–699, 1991","venue":null,"work_id":"03a82961-fc90-4962-bc8d-648241c26547","year":1991},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.663889Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:85847df9163cccfe3511f38e0cf0aca8c3bbfdae60bdabcbda306b41f63cc948","observation_id":"af525856-accc-4003-8eb7-595d5ce46203","resolution":{"observed_at":"2026-08-15T15:48:24.957872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.697576Z","title":"On convex body chasing.Discrete & Computational Ge- ometry, 9(3):293–321, 1993","venue":null,"work_id":"81566f64-b1c9-4bf2-8ca4-31fd1e4e9627","year":1993},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.668284Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:648b7594a82306c51380a7b7496b22ee84d702f3869c534bcf415a4720704b5b","observation_id":"1003127d-8d49-4d2a-ae54-97fefb6baed8","resolution":{"observed_at":"2026-08-15T15:48:24.727799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06643","last_updated":"2025-02-10T16:34:36Z","snapshot_observed_at":"2026-08-13T11:48:16.813992Z","submitted_at":"2025-02-10T16:34:36Z","title":"MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06643","snapshot_observed_at":"2026-08-15T15:48:23.671881Z","title":"Moetuner: Optimized mixture of expert serving with balanced expert placement and token routing.arXiv preprint arXiv:2502.06643, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.671881Z"},"links":{"cited_paper":"/paper/2502.06643","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:7db9fe28b10526ec7567acb05cb4398b60238a1c1e890a1fd12851ba429ef4d0","observation_id":"26e15a36-4c77-430c-9d9e-9c576bc2df9c","resolution":{"observed_at":"2026-08-15T15:48:23.671881Z","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-15T15:48:24.683276Z","title":"Gemini 3 Pro model card, November 2025","venue":null,"work_id":"bd42194d-70e0-47f8-baa7-da80f842071b","year":2025},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.675602Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:61553ddffce4180cee45c7e8867b38129aaf860f5822d3c0cc88a2addca0cb46","observation_id":"759d6ed9-748b-4ee2-8f1e-0ec86a4d055b","resolution":{"observed_at":"2026-08-15T15:48:24.687894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.663966Z","title":"Scheduling semiconductor burn-in operations to minimize total flowtime.Operations research, 45(6):874–885, 1997","venue":null,"work_id":"5667ec3e-e083-4108-bb82-fec48edcc97d","year":1997},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.679215Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:756fb9aaa3e12e19967cfc18ef623720baae3462adba88cbf130d7a3cff7a6bc","observation_id":"336b506f-a1f2-4e56-a2dd-67110a9816b1","resolution":{"observed_at":"2026-08-15T15:48:24.669653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.648111Z","title":"Welfare maximization with production costs: A primal dual approach","venue":null,"work_id":"48e0237d-1dd5-49c3-8e08-8f9808633102","year":2014},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.683328Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:8ee51eacc8ce30b8da8a60bc349c85a53d753b44472dbcd37fcfe072b68c9c41","observation_id":"60cc2c7b-b1e2-480b-a56d-c8b2e4c77147","resolution":{"observed_at":"2026-08-15T15:48:24.653646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.687681Z","title":"Adaptive mixtures of local experts.Neural computation, 3(1):79–87, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.687681Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:3c250b4efac8893cfcbb69215356d9f7d23949a589cde8375f34014dfa5154ad","observation_id":"e1ed8e23-6e10-4601-8e34-b967e6fb34f3","resolution":{"observed_at":"2026-08-15T15:48:23.687681Z","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-15T15:48:23.690925Z","title":"Online scheduling for llm inference with kv cache constraints.arXiv preprint arXiv:2502.07115, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.690925Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:ac53b03ca4351af322d073eaebbc303e53ef8c75c8e298163dbf5fc770040556","observation_id":"4248654f-d24a-4415-90e8-79de1cbe1d87","resolution":{"observed_at":"2026-08-15T15:48:23.690925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04088","last_updated":"2024-01-08T18:47:34Z","snapshot_observed_at":"2026-08-13T19:43:49.936776Z","submitted_at":"2024-01-08T18:47:34Z","title":"Mixtral of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04088","snapshot_observed_at":"2026-08-15T15:48:23.695836Z","title":"Mixtral of experts.arXiv preprint arXiv:2401.04088, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.695836Z"},"links":{"cited_paper":"/paper/2401.04088","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:15a35145e93d6c1bf552d46018e7a75d21ab17bd83a79e98590d4975210e9968","observation_id":"cbb4dd47-c88e-4549-bedf-7cae33a5e157","resolution":{"observed_at":"2026-08-15T15:48:23.695836Z","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-15T15:48:24.622023Z","title":"Hierarchical mixtures of experts and the em algorithm","venue":null,"work_id":"95ddaf95-fa23-4be7-af2c-254d3a180759","year":1994},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.700992Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:dd5c4d1449fe350bdb3cd0d02bc67e23afb13021284d149dfe2c247f3e87046d","observation_id":"e138f387-f304-4b57-a737-d7dd9aa475ac","resolution":{"observed_at":"2026-08-15T15:48:24.626069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.533724Z","title":"Speed is as powerful as clairvoyance.Journal of the ACM (JACM), 47(4):617–643, 2000","venue":null,"work_id":"86e2ef07-141a-420a-83e0-49b3f65d2b17","year":2000},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.704836Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:782f50e073fb59fc3782fd30d483a4adb1fdb48ba9107d2927b6ecd1f7825037","observation_id":"fbe0ae2d-a7a0-4172-8429-307b3a11e12e","resolution":{"observed_at":"2026-08-15T15:48:24.606250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.22327","last_updated":"2026-06-24T14:02:53Z","snapshot_observed_at":"2026-08-14T07:05:03.431408Z","submitted_at":"2026-06-21T04:05:38Z","title":"Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice","version":2},"cited_work":{"arxiv_id":"2606.22327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.22327","snapshot_observed_at":"2026-08-15T15:48:23.998693Z","title":"Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice","venue":"cs.AI","work_id":"ef024c32-aa1c-4243-a986-89c973f754e0","year":2026},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.730473Z"},"links":{"cited_paper":"/paper/2606.22327","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:475cac1db7c580e7f7bb889a420313790a2617171d1b6d60bc70b859eaa56ede","observation_id":"4127e9a9-0509-4cde-afe4-9b64eda321ac","resolution":{"observed_at":"2026-08-15T15:48:24.044715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.424086Z","title":"Papadimitriou","venue":null,"work_id":"3e96ee74-5192-4cf5-9009-07c65558a1e6","year":1995},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.772280Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:feb6b9e351154c6291a9d560e1f9321d096282578a7fba1a9f9b120bed192670","observation_id":"9da8f409-90b9-4008-a9a0-5260e94b086f","resolution":{"observed_at":"2026-08-15T15:48:24.483584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.820300Z","title":"Efficient memory management for large language model serving with pagedattention","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.820300Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:e04a2383a6f405515ddbc89a51d2b2809ebaad8a0a3c2469a7e710b9653a789a","observation_id":"0183a152-81d7-4b22-8a12-d006161a25d4","resolution":{"observed_at":"2026-08-15T15:48:23.820300Z","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-15T15:48:24.385267Z","title":"Accelerating distributed MoE training and inference with lina","venue":null,"work_id":"db55ea05-dd01-48f8-9c4f-9243dec7c140","year":2023},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.860657Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:286befb3180be92ea94050060bdae3c20533d30a908b2f0003fd913bec459b18","observation_id":"400d3e83-fdb1-407f-9b9b-d11eb11f9c19","resolution":{"observed_at":"2026-08-15T15:48:24.389210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","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-15T15:48:23.886414Z","title":"Deepseek-v3 technical report.arXiv preprint arXiv:2412.19437, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.886414Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:a0fe02d0cd2c96883bf01f4a951a9a1af5d46fb3202f89a8b22f0dd7bf00d90f","observation_id":"4ba989a6-befe-4faa-9882-1e26c663c627","resolution":{"observed_at":"2026-08-15T15:48:23.886414Z","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-15T15:48:24.372851Z","title":"Manasse, Lyle A","venue":null,"work_id":"ac1f1ca5-9665-40f5-acc9-8591b5b6f621","year":1990},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.904175Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:6960509d97999f2a835f2df5ff228c92a698c8ba2b7fa533529c1834102e4bf6","observation_id":"c1e10450-6fb9-4896-9034-0e133bb5d944","resolution":{"observed_at":"2026-08-15T15:48:24.377074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.360020Z","title":"Almost-polynomial ratio eth-hardness of approximating densest k- subgraph","venue":null,"work_id":"2f530f41-e3e2-46a7-9e95-671792ee63bf","year":2017},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.908575Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:efd20e438934bee9b33d44b4f9ea7505b005c14c2006e095d417ed87c97d07a3","observation_id":"d992ddbb-3b98-45c8-a990-0c1c6c4b7215","resolution":{"observed_at":"2026-08-15T15:48:24.364378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.347590Z","title":"Nonclairvoyant scheduling.Theoretical computer science, 130(1):17–47, 1994","venue":null,"work_id":"156901fd-e4f7-4e55-8fd5-5242287c7776","year":1994},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.911733Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:02ee3cc87f933b3c8e6853195aca51462ab2cf38240d2a248bb84606d19a4e75","observation_id":"6958ac0b-6146-41ef-bb05-5022d4c02442","resolution":{"observed_at":"2026-08-15T15:48:24.352007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.334442Z","title":"Chasing convex bodies optimally","venue":null,"work_id":"dca035d7-3d71-4799-a923-7109682c341d","year":2020},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.915056Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:7abbc7d91357ad287530b294cc5514697c41e9f25e688713df913991212b37af","observation_id":"0cbdf1c4-7e39-41b1-9d46-e09073266e28","resolution":{"observed_at":"2026-08-15T15:48:24.338820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:23.918963Z","title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.918963Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:8861e3eedc26598a189372f622dd760f7b52f6a26589e92e297a367a55c4c431","observation_id":"90fe9938-959e-436e-8569-3747348ded41","resolution":{"observed_at":"2026-08-15T15:48:23.918963Z","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-15T15:48:24.311696Z","title":"Amortized efficiency of list update and paging rules","venue":null,"work_id":"ae326042-1f7f-406d-bf1b-84c52ab52213","year":1985},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.923267Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:5fba85d1797f818ed2730a4bb1c760efb7a655013a9104eb9901721c6ea33753","observation_id":"4875a2c9-4685-424d-8c54-d5b66cc25cca","resolution":{"observed_at":"2026-08-15T15:48:24.316182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.278293Z","title":"Scheduling a single batch processing machine with non-identical job sizes.The International Journal of Production Research, 32(7):1615–1635, 1994","venue":null,"work_id":"da6e67cb-fdbb-41cd-8b90-b1585627fb1a","year":1994},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.926760Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:40797fdb69080c8747779a0cc57e6751b36058ede5ce72dc2eb6854dae0b68f1","observation_id":"2e8f9ee3-575f-432b-a1ae-2c3c47199131","resolution":{"observed_at":"2026-08-15T15:48:24.293374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-08-15T15:48:23.929970Z","title":"Llm serving optimization with variable prefill and decode lengths.arXiv preprint arXiv:2508.06133, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.929970Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:4dcf4f4bccee06967ef81f6b01f808c63aac6d0cc4b09b3287ef0f9f1ef428df","observation_id":"7fb6e405-dcab-4fb9-be5a-386235643ee9","resolution":{"observed_at":"2026-08-15T15:48:23.929970Z","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-15T15:48:24.252682Z","title":"FastServe:Iteration-Level preemptive scheduling for large language model inference","venue":null,"work_id":"97d9b662-5b7b-4775-8d21-c121ee8871ad","year":2026},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.934062Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:13a7ab8f1d77ac81106e5fb12904c36ff8194ad5e803f5452c26741192ecea5e","observation_id":"25616e1c-cb30-4dc1-95a3-73c3e3102d75","resolution":{"observed_at":"2026-08-15T15:48:24.261846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:48:24.229184Z","title":"Orca: A distributed serving system for Transformer-Based generative models","venue":null,"work_id":"69bfea3e-ac94-43df-a9ec-8c49022406e6","year":2022},"citing_paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T15:48:23.938414Z"},"links":{"citing_paper":"/paper/2607.17880"},"observation_digest":"sha256:38b6dba6de2e85af89ebbb75216834aee5b7254c443f3973949a15ab9aa51295","observation_id":"77aadf28-6e2c-4cfa-b36e-87345503e3ef","resolution":{"observed_at":"2026-08-15T15:48:24.237415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.17880","last_updated":"2026-07-20T12:30:27Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T15:31:09.639662Z","submitted_at":"2026-07-20T12:30:27Z","title":"Mixture-of-Experts Serving"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":48},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 1 inbound Pith citation observation for arXiv:2607.17880."}