{"as_of":"2026-08-17T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8d63ac4e02412c16852b7a7dc0f3d761f43b6e1e8e0da3996bbc11e4f841976","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:56:26.322963Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2506.12597/citation-record","integrity":"/paper/2506.12597/integrity","json":"/paper/2506.12597/citation-record.json","paper":"/paper/2506.12597"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.08477","last_updated":"2024-07-01T15:29:16Z","snapshot_observed_at":"2026-08-16T14:10:13.281554Z","submitted_at":"2024-03-13T12:46:03Z","title":"Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts","version":3},"cited_work":{"arxiv_id":"2403.08477","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.08477","snapshot_observed_at":"2026-08-07T00:56:26.631642Z","title":"Unleashing the Power of Meta-tuning for Few-shot Generalization Through Sparse Interpolated Experts","venue":"cs.CV","work_id":"16c065f2-014e-4d65-955e-dd2d9d6aeab1","year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.165504Z"},"links":{"cited_paper":"/paper/2403.08477","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:115e97aae938a4f9b746e381a3eca33fdea244bdbd5e84379916b594d7a53c66","observation_id":"149c82aa-8745-4c92-8d97-b58920982af5","resolution":{"observed_at":"2026-08-07T00:56:26.637318Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-13T15:18:04.411100Z","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-07T00:56:26.169776Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.169776Z"},"links":{"cited_paper":"/paper/2401.06066","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:e3913e465788eb3649bb3d8fc38a5036b52c7b48bff5b070a387d6cb060d0b94","observation_id":"08f5f164-3286-4cd0-bf08-4dfada968dee","resolution":{"observed_at":"2026-08-07T00:56:26.169776Z","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-07T00:56:26.173553Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.173553Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:5bfe923d006739f70a3bd87991105e3100c4572b014079fccacab97ef7047069","observation_id":"c05f71a8-b585-47f4-8f2f-e9659ff16cf2","resolution":{"observed_at":"2026-08-07T00:56:26.173553Z","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-07T00:56:26.932056Z","title":null,"venue":null,"work_id":"9d2fc878-740a-4f1f-b22d-0bb60c484c12","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.177157Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6308b21e826b7cd1cb22a28c5010b4b85c39427f2100c360a5060e0a012dc652","observation_id":"a468245e-e4d9-40b5-ace0-ae185c811aa7","resolution":{"observed_at":"2026-08-07T00:56:26.935993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.921522Z","title":null,"venue":null,"work_id":"031ed795-8b1b-4f6e-b5b3-4a5baed143bd","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.180300Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:9dc11c6c49e62430b721423598c3c50b3f753008ed1f7d89c962d3ea475857df","observation_id":"86705620-1c32-4167-b7fa-4a806b28cea5","resolution":{"observed_at":"2026-08-07T00:56:26.924768Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14761","last_updated":"2024-10-22T22:46:15Z","snapshot_observed_at":"2026-08-16T15:05:43.757767Z","submitted_at":"2023-08-25T17:59:59Z","title":"Unified Concept Editing in Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14761","snapshot_observed_at":"2026-08-07T00:56:26.183703Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.183703Z"},"links":{"cited_paper":"/paper/2308.14761","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6ee4d355c9055f788278d727fad9a2dcc96f93d0408c44310eaf05ad12c5033d","observation_id":"04641c3b-d6ca-4277-b074-c9090b6004c8","resolution":{"observed_at":"2026-08-07T00:56:26.183703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07524","last_updated":"2025-06-16T02:29:18Z","snapshot_observed_at":"2026-08-16T13:10:53.411712Z","submitted_at":"2024-10-10T01:36:03Z","title":"Upcycling Large Language Models into Mixture of Experts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07524","snapshot_observed_at":"2026-08-07T00:56:26.187530Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.187530Z"},"links":{"cited_paper":"/paper/2410.07524","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:07167b4fceeeec2a30b35884c2115436c5127f482e512f1ce85e2a1551bcc88c","observation_id":"f319c1af-7c8e-430a-851d-df31903dabd4","resolution":{"observed_at":"2026-08-07T00:56:26.187530Z","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-07T00:56:26.191044Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.191044Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:b26bfa2a9dd2192162d17ca673e23ff9231a2fe3e92cb64761695cee8ee4b1b8","observation_id":"afbeef49-3f5a-424d-82e1-b10230b0c9a2","resolution":{"observed_at":"2026-08-07T00:56:26.191044Z","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-07T00:56:26.194043Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.194043Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:16359423411f5322193d0e6fd60c09f0f153474f58505f02a9338b446d73482a","observation_id":"addb035f-f311-45ef-a9a3-e45ab9129239","resolution":{"observed_at":"2026-08-07T00:56:26.194043Z","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-07T00:56:26.197160Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.197160Z"},"links":{"cited_paper":"/paper/2401.04088","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:26496e7261755641f526705927d598e50b942602b5f2f21a1aa083859aa52a87","observation_id":"34a1f377-4fba-4a06-b4ff-4a8aa7f44336","resolution":{"observed_at":"2026-08-07T00:56:26.197160Z","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-07T00:56:26.911861Z","title":null,"venue":null,"work_id":"5c9a812b-1329-41dd-a62d-fb21c468e08d","year":2025},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.200522Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:4d1ab55e65a8b15e069212f56549d66e2facca639914c29e80d0bb4560ec5a88","observation_id":"7a3948d6-9e35-432d-ba15-12a32fc67d56","resolution":{"observed_at":"2026-08-07T00:56:26.914955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.902321Z","title":null,"venue":null,"work_id":"a8575d07-309b-49b0-a26c-11909ce26221","year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.203882Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:da0a00d674fae4e0c7d61302ce795c3c1568857461050d68a801350bf17c5cf8","observation_id":"e306f15e-8ee5-4e34-bfe8-ac65b6b1ef88","resolution":{"observed_at":"2026-08-07T00:56:26.905350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15124","last_updated":"2025-04-14T22:39:09Z","snapshot_observed_at":"2026-08-17T14:11:00.232598Z","submitted_at":"2024-11-22T18:44:04Z","title":"Tulu 3: Pushing Frontiers in Open Language Model Post-Training","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15124","snapshot_observed_at":"2026-08-07T00:56:26.207286Z","title":"Miranda, Alisa Liu, Nouha Dziri, Shane Lyu, Yuling Gu, Saumya Malik, Victoria Graf, Jena D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.207286Z"},"links":{"cited_paper":"/paper/2411.15124","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:684a7563cd30f3bc8d9a8749ef69b276dcfea610fc7948b3ecd753435af05a59","observation_id":"c7feb77a-938b-4778-b57d-76161f1a37c5","resolution":{"observed_at":"2026-08-07T00:56:26.207286Z","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-07T00:56:26.892039Z","title":null,"venue":null,"work_id":"1e43b3b8-ea0f-4ed0-a88d-22fad4a4ef27","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.210869Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:5053ee506cabc94d0ef006f3d30f11b7ca406a7b73146445190d21442ca90597","observation_id":"571ce800-ed7a-464f-8da7-aeb9edfc39dc","resolution":{"observed_at":"2026-08-07T00:56:26.895834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.882514Z","title":null,"venue":null,"work_id":"0ee3f5d0-2823-476f-a18e-d356ccf99b98","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.213718Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:434fd15915f703d16ac5486be1532b679e679a230433a61dfa11cc5c4280f4b4","observation_id":"a7c89fc9-ecf0-4ffb-9250-5964a5255230","resolution":{"observed_at":"2026-08-07T00:56:26.885549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03306","last_updated":"2022-08-05T17:46:38Z","snapshot_observed_at":"2026-08-16T16:40:53.472876Z","submitted_at":"2022-08-05T17:46:38Z","title":"Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.03306","snapshot_observed_at":"2026-08-07T00:56:26.216747Z","title":"Smith, and Luke Zettlemoyer","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.216747Z"},"links":{"cited_paper":"/paper/2208.03306","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:8a63f68a342b72e06243f03b923d543ecad40e1bb738e2941ddd2059a92611fd","observation_id":"3719c411-dbc3-4766-89de-cea2be10bd24","resolution":{"observed_at":"2026-08-07T00:56:26.216747Z","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-07T00:56:26.220009Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.220009Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:d9e2db398ee3c5b6460d1649e50e5da1cdcfe84509d0954ad0dad068d7e98d31","observation_id":"06ab21f3-8a81-42d4-b4bf-34df1d34692b","resolution":{"observed_at":"2026-08-07T00:56:26.220009Z","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-07T00:56:26.867039Z","title":null,"venue":null,"work_id":"92c62224-9af7-4989-a8c9-4b5964a5f93c","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.223176Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:a989466fa3e7caf782298fd91828378f3c8b93522339b91236ea7a5f33aa17c1","observation_id":"ddd21e82-93eb-4014-868c-6bd10bfbb128","resolution":{"observed_at":"2026-08-07T00:56:26.869992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.857601Z","title":null,"venue":null,"work_id":"050e160c-798c-4e9c-b969-358f06d82549","year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.226230Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:741a6f45ed5d7dee759b24371f600f8e5275e65c939538f722dc8d8d01ca3ca4","observation_id":"68b1ddf7-46b2-4752-bfa7-3cad691ca982","resolution":{"observed_at":"2026-08-07T00:56:26.860655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.847238Z","title":"Longpre, Le Hou, Tu Vu, Albert Webson, Hyung Won Chung, Yi Tay, Denny Zhou, Quoc V","venue":null,"work_id":"459b5bd9-8b83-444d-95d3-203909d13998","year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.229640Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:2c0344dc4573937f759fb4e41af9ecd242c5f726696870e3c4f577a0089d8afb","observation_id":"56dc006e-b720-4ad4-bf2f-317ad163b71b","resolution":{"observed_at":"2026-08-07T00:56:26.850939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.836951Z","title":null,"venue":null,"work_id":"eb762be9-16a7-4491-b756-4a7dfac045bd","year":2018},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.232783Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:9b4d137dc0c30c5cbf651ba39c814e9c0e7e27460341793047d3562bb915d9dc","observation_id":"ace95fe6-310d-4def-86a7-67c27d7afe79","resolution":{"observed_at":"2026-08-07T00:56:26.840163Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.235982Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.235982Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:ded76021dbd55dd4ef83e61b9c555a9a69131f4f1c28c94c60cfde42e00b287e","observation_id":"6317c8fb-f912-42b2-9886-aab04fcdfe72","resolution":{"observed_at":"2026-08-07T00:56:26.235982Z","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-08-13T17:20:44.002518Z","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-07T00:56:26.239312Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.239312Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:100d585811936e7077dab4bdfbed3ac205a1411a029ce590fcd6adf2fd8e49c8","observation_id":"9478a347-d516-4dde-8e24-7d92ce2c30e1","resolution":{"observed_at":"2026-08-07T00:56:26.239312Z","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-07T00:56:26.820891Z","title":"Smith, Pang Wei Koh, Amanpreet Singh, and Hannaneh Hajishirzi","venue":null,"work_id":"64b6da89-2de4-42e6-b1f5-6f979e217610","year":2025},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.242941Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:5d60f95b5668d031f48a456a03442349979df4f87a64427db96629e2b9d47b99","observation_id":"dd339a99-6fb6-45d0-8bee-25a18c27eca0","resolution":{"observed_at":"2026-08-07T00:56:26.824394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03745","last_updated":"2024-05-13T16:20:29Z","snapshot_observed_at":"2026-08-16T15:26:08.420515Z","submitted_at":"2023-06-06T15:04:31Z","title":"Soft Merging of Experts with Adaptive Routing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03745","snapshot_observed_at":"2026-08-07T00:56:26.245959Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.245959Z"},"links":{"cited_paper":"/paper/2306.03745","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:4b8ee960ae689eb9f5ce1bea23442a46a6880227e153c7125d86b0354763a267","observation_id":"137ca168-5574-4685-b399-198c2827b237","resolution":{"observed_at":"2026-08-07T00:56:26.245959Z","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-07T00:56:26.811034Z","title":null,"venue":null,"work_id":"9b18a2d6-e7c5-4e10-80e2-0d69ed3d4c54","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.249091Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:fad13ea8ac003b8dc4b5eea2b9a23ffd528df9b3d8c8e02da250dbd5c6af8899","observation_id":"f4a34708-bb41-4b75-8027-039bc05d1dc7","resolution":{"observed_at":"2026-08-07T00:56:26.814425Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T00:56:26.252088Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.252088Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:5d5d36d84b3b492209fd6cdeec2f8b30269e10a2ab31cb3cf75a3b3815b49f51","observation_id":"3d89c436-4280-438d-bf2e-53d2f74dfbd2","resolution":{"observed_at":"2026-08-07T00:56:26.252088Z","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-07T00:56:26.801522Z","title":null,"venue":null,"work_id":"48e551f8-7323-4129-9253-9a55c8bbc428","year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.256592Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:87117b279dd7160913a948592be29b0e608e5e66394695d9b83b8508e1f86c59","observation_id":"169c8a84-72d2-4473-890c-1141831418f2","resolution":{"observed_at":"2026-08-07T00:56:26.804741Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.00951","last_updated":"2024-05-27T11:44:51Z","snapshot_observed_at":"2026-08-17T03:37:21.034861Z","submitted_at":"2023-08-02T05:20:55Z","title":"From Sparse to Soft Mixtures of Experts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00951","snapshot_observed_at":"2026-08-07T00:56:26.259692Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.259692Z"},"links":{"cited_paper":"/paper/2308.00951","citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6d8f795ca2eb1e0028e8139d4dab596edeb03cb4fed1d8d5adb7949b1bbd980e","observation_id":"e8015542-df26-4d4a-a1ad-cf5adccf0d39","resolution":{"observed_at":"2026-08-07T00:56:26.259692Z","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-07T00:56:26.263039Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.263039Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:f4265de6341b8c9bc833331344c3d73065978015d25a5a932142f9ab93bb36b0","observation_id":"8b74e893-f092-483e-9130-678f0c3ff61f","resolution":{"observed_at":"2026-08-07T00:56:26.263039Z","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-07T00:56:26.266052Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.266052Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:4fb979d540a5eb445851dbb87cbdd889aa281d721b2b2ddef6bb8467ef8135f4","observation_id":"9af0e932-39e9-41d3-9c30-5b1931fbff25","resolution":{"observed_at":"2026-08-07T00:56:26.266052Z","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-07T00:56:26.778454Z","title":null,"venue":null,"work_id":"1597ec83-b480-47a5-a569-c93b0143eec7","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.269064Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:e60900f44adc9b00e820f74fb0d40344e2215079b763e7c6e1e1587f79020313","observation_id":"de30317a-177e-40db-b944-d448d40d4dcc","resolution":{"observed_at":"2026-08-07T00:56:26.781660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.767797Z","title":null,"venue":null,"work_id":"915079cd-1132-4ffd-844c-cb45dcbe6929","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.272094Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:7206b52098992d114f4057b1fa451acedee06300c0a787971c81ca612b2bba04","observation_id":"1bd67fd6-7f49-4961-8510-8f4c92c7284e","resolution":{"observed_at":"2026-08-07T00:56:26.771305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.757244Z","title":null,"venue":null,"work_id":"cfc45eef-a87e-4da2-b410-e128c13aa99a","year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.275218Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:de237f96897047f61d73e02f34ea1988f2008c8da75e10d7d4dd515138dc00ee","observation_id":"a364da58-bbbf-4045-9c88-17074e739d5e","resolution":{"observed_at":"2026-08-07T00:56:26.760452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.747402Z","title":null,"venue":null,"work_id":"f2c02825-ca42-43bf-9981-ee81e2decf5a","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.278180Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:d1dc0df38360cdc95e867f52a39513bf7eca6f3683b270eba08ac13fdd7f62de","observation_id":"e99227d8-ae31-4c6f-8a92-c05a7699a4b9","resolution":{"observed_at":"2026-08-07T00:56:26.750930Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.737946Z","title":null,"venue":null,"work_id":"17bf46ff-1f35-497b-bcc0-27bf81d2b5f8","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.281515Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:a6211e91c20e98749de5a79facdef5caf69ae3182d643269396c7435cbc7d19a","observation_id":"0a4acaf1-2dbe-4bb8-9f69-2ba0d9bd2844","resolution":{"observed_at":"2026-08-07T00:56:26.740948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.727890Z","title":null,"venue":null,"work_id":"315e7cb2-585d-49ad-8f2f-8091fd173e41","year":2017},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.284484Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6b0cfaee56e3a51192603f49c4c10b124c1ecb112e689e2b4da568d1228d249d","observation_id":"e8d75ded-17f7-46e5-ab6f-33da8687c56e","resolution":{"observed_at":"2026-08-07T00:56:26.731217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.287419Z","title":"do anything now","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.287419Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:3c169952c1bd2a1bab687b683c221a1bf349816b86fd12b6d38ae212e6a653e5","observation_id":"417420f8-d794-4090-925c-a19c80a992dd","resolution":{"observed_at":"2026-08-07T00:56:26.287419Z","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-07T00:56:26.718133Z","title":null,"venue":null,"work_id":"7abdb830-eaf5-46b5-a277-0b3805e2a1ca","year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.290250Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:207ed4e57ec796620b4ce11b69b6f71929f3765e69890b6020ef3bd10ca84285","observation_id":"3dbf04da-ca96-44a0-a203-13cc4b4ba0a8","resolution":{"observed_at":"2026-08-07T00:56:26.721214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.293136Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.293136Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:faf487ad73b91c1125268675347c252b8d0996659957fcc9577d1ffe24a1f5c4","observation_id":"7055f918-2695-4c36-bd5c-1fb899ec8518","resolution":{"observed_at":"2026-08-07T00:56:26.293136Z","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-07T00:56:26.702415Z","title":null,"venue":null,"work_id":"b71ecd19-9e27-41cc-bd37-326e01b95742","year":2021},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.295972Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:c21dbb1a386dff2a5d677b50a10bf8a0fa0df88376ef6ab40dfc41b1fa9bdf3b","observation_id":"05c77475-dae2-4707-8628-d59de23ac906","resolution":{"observed_at":"2026-08-07T00:56:26.705510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.298812Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.298812Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:bf0c1c76b87601e72ca02b0ae3e175f047f7b42387fa5ff9b8c9c3432e55cf88","observation_id":"0b12d88d-019e-42f3-b733-57bc96bdddd1","resolution":{"observed_at":"2026-08-07T00:56:26.298812Z","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-07T00:56:26.301643Z","title":"Dai, and Quoc V Le","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.301643Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:04bcf3b1b3ba61cf6ad894c9e901f3e682964dc75135df75ec8281254c069a72","observation_id":"8a44a49d-941a-4be7-9d51-c667967a9faa","resolution":{"observed_at":"2026-08-07T00:56:26.301643Z","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-07T00:56:26.679247Z","title":null,"venue":null,"work_id":"61af3282-87f1-4404-8fc0-7a792f5a164c","year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.304899Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:1b6aee093090c800617666a5cdf4b0d6cf27d18b0d0fa3129a9ab73e761ebc15","observation_id":"480ba3c4-dd69-4e54-a5e9-306b6103418c","resolution":{"observed_at":"2026-08-07T00:56:26.682568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.307893Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.307893Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6662d03ad7bbe4968f279fb89353518318db2839a40b52b5b462925fbdcf6e80","observation_id":"e44eb459-445e-4bb7-8298-4d9a097ce14d","resolution":{"observed_at":"2026-08-07T00:56:26.307893Z","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-07T00:56:26.669049Z","title":"Dai, Zhifeng Chen, Quoc V Le, and James Laudon","venue":null,"work_id":"94f80106-3055-43af-a9a6-41c568e935cc","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.310734Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:6f3bec24fed9595fbe375caeecd8560a91796bcb85549bb2f9e984b8d4ecccc5","observation_id":"0022e5f7-a073-497f-922b-a169a6603577","resolution":{"observed_at":"2026-08-07T00:56:26.672354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.313533Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.313533Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:bcbf70ef3331a4e5a1174f35cadebf09a9b74c4997a202a21bbf44ed1d3ba6d4","observation_id":"46269db3-6e0d-42bc-8364-39ea5eb65405","resolution":{"observed_at":"2026-08-07T00:56:26.313533Z","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-07T00:56:26.659408Z","title":null,"venue":null,"work_id":"3c976f99-de4b-470c-8362-b932d6349f68","year":2022},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.316574Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:41830d2cf2eb630bbb3f50337fa4384a753a19a7d5e0ee4f031d42467f5c5493","observation_id":"d3d37a27-da43-4a5f-8db2-814a41fd46e3","resolution":{"observed_at":"2026-08-07T00:56:26.662474Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T00:56:26.319425Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.319425Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:04025b849d1d49c22ef469118478a7ef403250b4b9fc5e84081176f4069329a0","observation_id":"92ea5d89-01ab-425f-b3dd-3260b0259696","resolution":{"observed_at":"2026-08-07T00:56:26.319425Z","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-07T00:56:26.322963Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:26.322963Z"},"links":{"citing_paper":"/paper/2506.12597"},"observation_digest":"sha256:865e84dbc246ca59074ae79a8ea922ee458c110cce6e9bbcf00529b79b130b02","observation_id":"1b686803-41ef-4caf-b2d1-f237f030afc1","resolution":{"observed_at":"2026-08-07T00:56:26.322963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.12597","last_updated":"2025-06-14T18:34:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T16:57:01.919763Z","submitted_at":"2025-06-14T18:34:38Z","title":"Automatic Expert Discovery in LLM Upcycling via Sparse Interpolated Mixture-of-Experts"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":50},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2506.12597."}