{"as_of":"2026-08-10T04:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15d64ec6d601a74bd8644d6263468df7dc42d1e18dcbe0696b0a954ccfc148de","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:40:07.770441Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T04:07:58.031100Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T10:41:30.818614Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"cited_work":{"arxiv_id":"2502.10051","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10051","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.10051 , year=","venue":null,"work_id":"aaac8145-954f-438e-b342-ebdf56799e76","year":null},"citing_paper":{"arxiv_id":"2605.03426","last_updated":"2026-05-05T07:02:50Z","snapshot_observed_at":"2026-07-06T23:16:20.322265Z","submitted_at":"2026-05-05T07:02:50Z","title":"Replacing Parameters with Preferences: Federated Alignment of Heterogeneous Vision-Language Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-07T04:07:58.031100Z"},"links":{"cited_paper":"/paper/2502.10051","citing_paper":"/paper/2605.03426"},"observation_digest":"sha256:e7e26b7d4e6831ad67077fc003ab764d8a2235dee2271bc478da317a022ef3b2","observation_id":"145e7cb0-b5f6-4e30-9d15-b51cffea940a","resolution":{"observed_at":"2026-05-12T10:41:30.821685Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.10051/citation-record","integrity":"/paper/2502.10051/integrity","json":"/paper/2502.10051/citation-record.json","paper":"/paper/2502.10051"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T19:40:08.128872Z","title":"Clustering analyzes provide evidence for these nuanced task differences, ensuring more accurate and context- sensitive model selection","venue":null,"work_id":"6293539f-e5af-4845-aa2b-43f232c87dd6","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.417651Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:fae322d84d5289ea66c0359619338a8f5492ab793a34faa9a90812e52988a2bb","observation_id":"799687ca-c507-4d8f-a89a-a92c1e4c29aa","resolution":{"observed_at":"2026-08-07T19:40:08.153485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.094077Z","title":"perceptive router","venue":null,"work_id":"1166d121-8ce5-4e1a-9a75-18c50b4c0d76","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.453163Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:0d33666e8dd11bf7b034b482236a1514465bf2503950378b124b068e0e360225","observation_id":"92cdd388-b2d7-4a1d-8fce-a00f38db3ba0","resolution":{"observed_at":"2026-08-07T19:40:08.106726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.083017Z","title":", pn} ⊂Rd represent a set ofn prompts embedded in ad-dimensional space","venue":null,"work_id":"de2cd81d-a06d-448f-aee4-98ac3db51996","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.475314Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:cc409040d1aa44a829d4549cd1c59d187376144b1880e6691004998dc765afdf","observation_id":"be4576b1-2b6c-4129-ad66-dae8d7ad9cbe","resolution":{"observed_at":"2026-08-07T19:40:08.087001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.072270Z","title":"This grouping helps analyze how the 6 prompts within each cluster are distributed across benchmarks","venue":null,"work_id":"9cc93b89-5710-4527-a459-9f4ba7bc7a8c","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.479457Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:eb58564cc947e6b7f941a560896f1bb47125e9e72c113b870a00229ebc87f5be","observation_id":"6bae5da5-5a09-4a67-bd4b-76a1c13562b8","resolution":{"observed_at":"2026-08-07T19:40:08.076168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.061900Z","title":"For example: To identify the benchmark that dominates clusterk, we select the indexj∗(k) that satisfies: j∗(k) = arg max 1≤j≤p Dk,j","venue":null,"work_id":"b08819a2-94a8-4394-8146-fe3eeef1f1f3","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.484372Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:8d4700e17abcb3e3dc13b3154020593a847762397aaef897bfd854c20f327cce","observation_id":"1c538959-9798-46e5-ab9e-b1c20260e4b6","resolution":{"observed_at":"2026-08-07T19:40:08.065684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.051257Z","title":"(a) Silhouette Scores: • The scores showed variability, but generally improved with more clusters","venue":null,"work_id":"30e1120c-efbf-4513-b0ce-0017dd6ae530","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.488837Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:49db410caf47dcef89bb2cf4eb3496a990fef5b1008b1039b363f673fb8c864e","observation_id":"9249269d-5645-4529-86dc-26f7d729571f","resolution":{"observed_at":"2026-08-07T19:40:08.054786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.040524Z","title":null,"venue":null,"work_id":"46326120-f632-4e00-87f7-b99523f7006b","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.493504Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:958377274e919a28286297175c34c2a701639278b20cab0e53755ad0f292d7a6","observation_id":"75d2e14f-92d9-4b75-a7ee-3ee0cc1a3fbe","resolution":{"observed_at":"2026-08-07T19:40:08.044202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.029536Z","title":null,"venue":null,"work_id":"644e7b91-5fc5-43b3-a989-639d663d6371","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.497407Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:c821f2a059fe0cbf2bec2de6f613c3457d2d087362cc5d99052b9187157da8b4","observation_id":"e8987dee-b34b-48a2-8d46-74c3b995c304","resolution":{"observed_at":"2026-08-07T19:40:08.033372Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-07T19:40:08.017828Z","title":"2Token generation speeds were calculated by dividing the total number of tokens generated by the total processing time (in seconds)","venue":null,"work_id":"03583021-8ee0-48f1-a153-e92d25ba5d56","year":null},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.501740Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:a469fdd7910437366bfa1986b964d8a85590493aa2e0caa6f04885edba2e7ce5","observation_id":"b40306ad-b9c4-495d-b8d2-a61437e7a84f","resolution":{"observed_at":"2026-08-07T19:40:08.021834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-07T19:40:07.505389Z","title":"B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P.,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.505389Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:ffe345a9d6cd7191c6ffb615081e78e2309d5059b7e21e9eb406095eb39dd621","observation_id":"89a4b51a-aa24-4873-8d33-7ff8d4cf09fa","resolution":{"observed_at":"2026-08-07T19:40:07.505389Z","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-07T19:40:08.007017Z","title":"& Petrov, S","venue":null,"work_id":"187a6d0b-9a4f-4288-8a27-6f459b0084d5","year":2022},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.509748Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:26c515b47c2481c56d1c9c218decde95c337e934192fb23863371b00cbc2523a","observation_id":"83450dd8-4dbc-4702-ac0f-d543268d553e","resolution":{"observed_at":"2026-08-07T19:40:08.010590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-07T19:40:07.513900Z","title":"N., Kaiser, Ł., & Polosukhin, I","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.513900Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:486d892a0b3827b63e939e9098ce5c6a298b0cb458c9aa3d079267bbbe8b2530","observation_id":"76bd4c48-1ade-4646-aa8b-06d478f2fc60","resolution":{"observed_at":"2026-08-07T19:40:07.513900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00173","last_updated":"2018-01-16T08:54:12Z","snapshot_observed_at":"2026-08-08T10:21:14.704361Z","submitted_at":"2017-12-30T18:27:35Z","title":"Theory of Deep Learning III: explaining the non-overfitting puzzle","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00173","snapshot_observed_at":"2026-08-07T19:40:07.518385Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.518385Z"},"links":{"cited_paper":"/paper/1801.00173","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:c594659a4a1aa792ea31c50263d9c560004ee11c60752c03a80918e5c74748c1","observation_id":"8f302d72-f1b1-4472-a43b-44949bc5e6c1","resolution":{"observed_at":"2026-08-07T19:40:07.518385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10834","last_updated":"2025-04-22T03:55:14Z","snapshot_observed_at":"2026-08-02T06:57:44.337097Z","submitted_at":"2024-07-15T15:45:07Z","title":"MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10834","snapshot_observed_at":"2026-08-07T19:40:07.522465Z","title":"H., Hoang, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.522465Z"},"links":{"cited_paper":"/paper/2407.10834","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:6f3b03958de2bf73caf647192c89386025f022657c2543b940d2dc59c44c45a6","observation_id":"8bb3a688-d4b9-484b-a919-1b8a14181cbd","resolution":{"observed_at":"2026-08-07T19:40:07.522465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-09T17:54:32.510507Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-07T19:40:07.526867Z","title":"(2024).OptLLM: Optimal Assignment of Queries to Large Language Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.526867Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:f6a81e2dff8d2e0ba5ae00aa74c60ad398edbd27c22dd6af116b90f334ade3d5","observation_id":"7d929815-5c15-4dd3-ba47-416a6795dd12","resolution":{"observed_at":"2026-08-07T19:40:07.526867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19886","last_updated":"2024-09-30T02:31:40Z","snapshot_observed_at":"2026-08-02T16:15:10.316578Z","submitted_at":"2024-09-30T02:31:40Z","title":"RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19886","snapshot_observed_at":"2026-08-07T19:40:07.531641Z","title":"T., & Zhang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.531641Z"},"links":{"cited_paper":"/paper/2409.19886","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:5696ebd1ead2fd613e95041e5c932c93b15d5570c07cf2a1aaf5d5905bff625d","observation_id":"88387d0c-629c-4c2e-9046-5f4c330faecc","resolution":{"observed_at":"2026-08-07T19:40:07.531641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-07T19:40:07.536163Z","title":"E., Kadous, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.536163Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:76337a1c587e868911d59e1ca9663e2c5d795e93572ecabcb8c6b6cd82939487","observation_id":"8dacfba8-0858-4a5f-bf66-5d06a39deab9","resolution":{"observed_at":"2026-08-07T19:40:07.536163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12963","last_updated":"2025-01-19T15:59:56Z","snapshot_observed_at":"2026-07-06T16:35:48.413898Z","submitted_at":"2023-10-19T17:57:39Z","title":"AutoMix: Automatically Mixing Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12963","snapshot_observed_at":"2026-08-07T19:40:07.540624Z","title":"P., Mishra, S., Zhou, P., Gupta, A., Rajagopal, D., Kappaganthu, K., Yang, Y., Upadhyay, S., Faruqui, M., & Mausam","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.540624Z"},"links":{"cited_paper":"/paper/2310.12963","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:e797995ff0daadc367d787320ca1d7e19daf6ceff4373dc4023c37407bd51cc2","observation_id":"91be5564-90b9-4087-adf9-5667b03707f3","resolution":{"observed_at":"2026-08-07T19:40:07.540624Z","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-07T19:40:07.995328Z","title":"K., Srivatsa, K","venue":null,"work_id":"aa611fcc-e9dd-49ec-9e5c-81ae143db3da","year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.544556Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:e04d60ede4f4aa5e52e903b02a490a52d08049d13c7cd7ff8b4fae995247038c","observation_id":"973b8148-f3d5-4df6-bd80-1f6ed67cc6ab","resolution":{"observed_at":"2026-08-07T19:40:07.999676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02223","last_updated":"2024-10-16T22:23:00Z","snapshot_observed_at":"2026-08-08T02:19:27.944517Z","submitted_at":"2024-10-03T05:43:24Z","title":"EmbedLLM: Learning Compact Representations of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02223","snapshot_observed_at":"2026-08-07T19:40:07.549291Z","title":"(2024).EmbedLLM: Learning Compact Representations of Large Language Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.549291Z"},"links":{"cited_paper":"/paper/2410.02223","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:db5df9370d132af9a9ea586f9710485769a8ff300464ac791403d291d693b8b4","observation_id":"7c8b9c3b-9cc4-47fc-b92a-da029a633017","resolution":{"observed_at":"2026-08-07T19:40:07.549291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04692","last_updated":"2024-12-06T01:06:37Z","snapshot_observed_at":"2026-08-06T06:12:24.052718Z","submitted_at":"2024-12-06T01:06:37Z","title":"Smoothie: Label Free Language Model Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04692","snapshot_observed_at":"2026-08-07T19:40:07.553449Z","title":"F., Chow, T., Khare, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.553449Z"},"links":{"cited_paper":"/paper/2412.04692","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:d72763c7f3bb6d19cf2935ead21d444c54e6a5712f87d7496dc6352060d032d4","observation_id":"5d81322d-e1ce-4900-a9a5-bbd43f1a676d","resolution":{"observed_at":"2026-08-07T19:40:07.553449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03834","last_updated":"2025-03-17T15:08:47Z","snapshot_observed_at":"2026-08-05T19:53:12.719014Z","submitted_at":"2024-10-04T18:02:48Z","title":"GraphRouter: A Graph-based Router for LLM Selections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03834","snapshot_observed_at":"2026-08-07T19:40:07.568042Z","title":"(2024).GraphRouter: A Graph-Based Router for LLM Selections","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.568042Z"},"links":{"cited_paper":"/paper/2410.03834","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:da307c633945c6c02c99aea51c93705dd7aab112b8598b09c0dbfa2138898d8b","observation_id":"460dcfb4-ea89-4434-a933-4f160c106803","resolution":{"observed_at":"2026-08-07T19:40:07.568042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10814","last_updated":"2024-10-16T02:00:24Z","snapshot_observed_at":"2026-08-09T03:34:24.233039Z","submitted_at":"2024-10-14T17:59:44Z","title":"Your Mixture-of-Experts LLM Is Secretly an Embedding Model For Free","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10814","snapshot_observed_at":"2026-08-07T19:40:07.609676Z","title":"(2024).Your Mixture-of-Experts LLM is Secretly an Embedding Model for Free","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.609676Z"},"links":{"cited_paper":"/paper/2410.10814","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:2a2ca9dc5bf506100847ddd4a13bb640a9309b4b4f0cb0d029c2a9588ac07b95","observation_id":"1e55ed76-1e29-4eb2-9450-f90455ede7fd","resolution":{"observed_at":"2026-08-07T19:40:07.609676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03046","last_updated":"2023-10-03T22:16:13Z","snapshot_observed_at":"2026-07-06T16:27:51.438846Z","submitted_at":"2023-10-03T22:16:13Z","title":"EcoAssistant: Using LLM Assistant More Affordably and Accurately","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03046","snapshot_observed_at":"2026-08-07T19:40:07.647788Z","title":"H., & Wang, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.647788Z"},"links":{"cited_paper":"/paper/2310.03046","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:f9beaa51393dbdb2b106a9f9c28dbd7b48cb654ebe0c007f99b66f6c9451235b","observation_id":"8b76a67a-5d4a-49b6-a023-efee868e85c9","resolution":{"observed_at":"2026-08-07T19:40:07.647788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-06T08:57:12.331150Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-07T19:40:07.685952Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.685952Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:dc7aeeceff3c4412332750d49d003922d6646c767e2558d473f29b68fd6232ef","observation_id":"91febde8-3983-47fe-8c9f-78dcbfbc7317","resolution":{"observed_at":"2026-08-07T19:40:07.685952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.11601","last_updated":"2023-08-23T17:34:17Z","snapshot_observed_at":"2026-07-06T16:09:09.018523Z","submitted_at":"2023-08-22T17:48:24Z","title":"Tryage: Real-time, intelligent Routing of User Prompts to Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.11601","snapshot_observed_at":"2026-08-07T19:40:07.745899Z","title":"N., & Thomson, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.745899Z"},"links":{"cited_paper":"/paper/2308.11601","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:32486ba8f6ca866f5bb41103bc33c5762e20727cbc8206f837b25e1e373730d3","observation_id":"27168892-f13b-41cc-9baa-4c8bb3748042","resolution":{"observed_at":"2026-08-07T19:40:07.745899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02561","last_updated":"2023-06-30T21:39:54Z","snapshot_observed_at":"2026-08-05T15:27:19.717152Z","submitted_at":"2023-06-05T03:32:26Z","title":"LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02561","snapshot_observed_at":"2026-08-07T19:40:07.766237Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.766237Z"},"links":{"cited_paper":"/paper/2306.02561","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:a95b6412f462c7d70eae6dd7103bb3614ceb5ddf578b60143a1ad72fd227595b","observation_id":"cca31f8b-28f7-4787-952c-a5dcb5af890a","resolution":{"observed_at":"2026-08-07T19:40:07.766237Z","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-07T19:40:07.980857Z","title":"(2023).FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","venue":null,"work_id":"77cc5a2b-8bca-475b-82b5-9ea2c7c56783","year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.770441Z"},"links":{"citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:eb6d9a1e3ad912ddaa9115208219fc1589ec2cd4fce31283a4d23bf99f020808","observation_id":"01a10894-d239-4929-8d14-b6fc7f6a81bf","resolution":{"observed_at":"2026-08-07T19:40:07.986887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2502.10051."}