{"as_of":"2026-08-09T15:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e69efdf91d4f6a5fb99f90b575cecff34b9adc90c6ea2b05decd3740800849f","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T22:03:02.083797Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.07571/citation-record","integrity":"/paper/2509.07571/integrity","json":"/paper/2509.07571/citation-record.json","paper":"/paper/2509.07571"},"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-04T22:03:02.824051Z","title":"2024 aime problems and solutions.,","venue":null,"work_id":"16f01048-b0ab-43f5-a767-1472e0124648","year":2024},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:00.639561Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:1d30d036d47486c44fef6127175149e7db47fcc5b4ffc1bc00bd6faf002c406d","observation_id":"cc2ee3ef-b17f-4ffe-b16c-96da318de0ac","resolution":{"observed_at":"2026-08-04T22:03:02.832551Z","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.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-04T22:03:01.025641Z","title":"Graphrouter: A graph-based router for llm selections","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.025641Z"},"links":{"cited_paper":"/paper/2410.03834","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:5a7d50225079767551ccaec428128a2c0448b73fd140515ca1d88f38063ffdc9","observation_id":"947731c4-965f-4e2b-9e7c-1fe948c15337","resolution":{"observed_at":"2026-08-04T22:03:01.025641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14855","last_updated":"2025-03-10T06:44:48Z","snapshot_observed_at":"2026-08-07T18:00:58.665687Z","submitted_at":"2025-02-20T18:58:07Z","title":"Prompt-to-Leaderboard","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14855","snapshot_observed_at":"2026-08-04T22:03:01.095225Z","title":"Prompt-to-leaderboard.arXiv preprint arXiv:2502.14855,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.095225Z"},"links":{"cited_paper":"/paper/2502.14855","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:7d49c9bd08a97714311a9b0bea090e5f865861d9ee85e994291ce12be4267197","observation_id":"dba8262f-292c-4ebd-8fb1-086bea6ec619","resolution":{"observed_at":"2026-08-04T22:03:01.095225Z","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-04T22:03:01.267557Z","title":"Moa: Mixture of sparse attention for automatic large language model compression.arXiv preprint arXiv:2406.14909,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.267557Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:ff63a4b0ca42067b9abb145451200d4478f1601ce28133bb2a36ba07bead3d70","observation_id":"cd0bffdc-56ff-4d57-a439-9dfb52469129","resolution":{"observed_at":"2026-08-04T22:03:01.267557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-04T22:03:01.383236Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.383236Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:e0a09f3a2e163e91c5d0b530570f42255a43ddc6a1e2d099ddf8b468f5e5bd84","observation_id":"17981650-791e-4faf-9a9c-b5d55ce5a1c6","resolution":{"observed_at":"2026-08-04T22:03:01.383236Z","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-04T22:03:01.454561Z","title":"Joyagents-r1: Joint evolution dynamics for versatile multi-llm agents with reinforcement learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.454561Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:8e72322ef57cf488921434843f8fb9b40878af9db367405d05c10decb4d810ba","observation_id":"eed67855-1450-49ca-a21c-63eba076fd49","resolution":{"observed_at":"2026-08-04T22:03:01.454561Z","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-04T22:03:02.775297Z","title":"Large language models for code: Security hardening and adver- sarial testing","venue":null,"work_id":"b637a6ea-c21c-4d79-afd8-4451c90ccf5c","year":2023},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.571554Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:7a9df13ac621372f69a3fe0ba43bfd84d4a502b0b352d324dec73a0c71a879da","observation_id":"fc08265a-3e68-4fb9-ace3-59ab41ce5ec3","resolution":{"observed_at":"2026-08-04T22:03:02.783669Z","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":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-04T22:03:01.990619Z","title":"Livecodebench: Holistic and contamination free evaluation of large language models for code.arXiv preprint arXiv:2403.07974,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.990619Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:869d72218cf62c60e16790c449e32130e55275bc934e9909855f9dab51050914","observation_id":"5c46c619-221d-4146-945c-599208f33f64","resolution":{"observed_at":"2026-08-04T22:03:01.990619Z","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-04T22:03:01.998475Z","title":"Llm-blender: Ensembling large language models with pairwise ranking and generative fusion.arXiv preprint arXiv:2306.02561,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.998475Z"},"links":{"cited_paper":"/paper/2306.02561","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:16d773f3baa99e99d91508b6fc6dcaebdd80d27de805e1984f086ea1d3b3a572","observation_id":"9747c1c0-3807-410f-bf75-e47dc570bee1","resolution":{"observed_at":"2026-08-04T22:03:01.998475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-04T22:03:02.019440Z","title":"Deepseek-v3 technical report.arXiv preprint arXiv:2412.19437,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.019440Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:0558dbe3424bde75f5c46673fae05e8c26596ae7238243b29b69c908eb80f706","observation_id":"b24de13b-efe0-40b4-9fce-a042c67f8316","resolution":{"observed_at":"2026-08-04T22:03:02.019440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-04T22:03:02.028525Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models.arXiv preprint arXiv:2311.08692,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.028525Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:86042ff01bbc6f28efcdaa1754845331f9c622b1d87a80bbbd6a0fda7bdad7f1","observation_id":"0fad8384-2d4d-479b-a8f4-f7cce359867c","resolution":{"observed_at":"2026-08-04T22:03:02.028525Z","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-04T22:03:02.034792Z","title":"Isaac Ong, Amjad Almahairi, Vincent Wu, Wei-Lin Chiang, Tianhao Wu, Joseph E Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.034792Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:b0dcdb77083293dec89cca55931d1391420103e88ac0e1f04a3f7203bcf2f954","observation_id":"e52c4210-4464-4e91-9f07-b3b560336fcc","resolution":{"observed_at":"2026-08-04T22:03:02.034792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04692","last_updated":"2024-06-07T07:04:10Z","snapshot_observed_at":"2026-08-07T21:51:22.136369Z","submitted_at":"2024-06-07T07:04:10Z","title":"Mixture-of-Agents Enhances Large Language Model Capabilities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04692","snapshot_observed_at":"2026-08-04T22:03:02.041305Z","title":"Mixture-of-agents enhances large language model capabilities.arXiv preprint arXiv:2406.04692,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.041305Z"},"links":{"cited_paper":"/paper/2406.04692","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:57d1e7b89551ac6cc23358fd601442bcbbbc4b2db93f4bb7cafa27fde953feb9","observation_id":"5d71bac7-d295-42be-a65b-64ed46c6434e","resolution":{"observed_at":"2026-08-04T22:03:02.041305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04368","last_updated":"2024-11-07T01:58:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-11-07T01:58:42Z","title":"Measuring short-form factuality in large language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04368","snapshot_observed_at":"2026-08-04T22:03:02.053966Z","title":"Measuring short-form factuality in large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.053966Z"},"links":{"cited_paper":"/paper/2411.04368","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:f3f86d2f738f83e72a8148503addab38fa5c55bd4f31719499e76095c5e1a00c","observation_id":"798a97a3-3e8d-496f-93ff-410cba03e8bd","resolution":{"observed_at":"2026-08-04T22:03:02.053966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-04T22:03:02.062492Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.062492Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:9428f30a1ce5470c9d280bdcf2742e52bf8b8cb8b709044ec500131e9924f8e3","observation_id":"e93d2225-9b55-41f0-8a99-be042e25e16b","resolution":{"observed_at":"2026-08-04T22:03:02.062492Z","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-04T22:03:02.071125Z","title":"Be- yond gpt-5: Making llms cheaper and better via performance-efficiency optimized routing.arXiv preprint arXiv:2508.12631, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.071125Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:83d3eb44b7715507cdc1bc6c9bb7e2426737fbd3e8022a833705ccb0d6327f85","observation_id":"7f093be1-2537-4ba9-9226-99e65d6d887c","resolution":{"observed_at":"2026-08-04T22:03:02.071125Z","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-04T22:03:02.716195Z","title":"macro- level category signals","venue":null,"work_id":"e819736c-b49a-4f26-a447-923217ad9a3e","year":2001},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.083797Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:8c33e7dbe160e1f82af5cba996c33a0f7fe1b53cc1a245457670b28f61296968","observation_id":"79f1ef38-4279-43f6-b99c-9bd97c1b82ce","resolution":{"observed_at":"2026-08-04T22:03:02.725078Z","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":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-04T22:03:01.677545Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:01.677545Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:98d3b655871c5dae4f98dab4354dd13a1845e7052c99078195d4ef243b7487c9","observation_id":"c20b88c8-e6cb-47fd-9621-5b7a1295e591","resolution":{"observed_at":"2026-08-04T22:03:01.677545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-08-08T18:42:25.777499Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-08-04T22:03:00.916850Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing.arXiv preprint arXiv:2404.14618,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:00.916850Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:69baae3b30b76f47a894c29f42225bbd851bd87bd3b192403f6290c9e2619ffc","observation_id":"e048fe38-e460-433f-9515-8b4fc77ff1c0","resolution":{"observed_at":"2026-08-04T22:03:00.916850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00674","last_updated":"2025-02-02T05:23:29Z","snapshot_observed_at":"2026-07-06T20:29:40.670401Z","submitted_at":"2025-02-02T05:23:29Z","title":"Rethinking Mixture-of-Agents: Is Mixing Different Large Language Models Beneficial?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00674","snapshot_observed_at":"2026-08-04T22:03:02.011254Z","title":"Rethinking mixture-of-agents: Is mixing differ- ent large language models beneficial?arXiv preprint arXiv:2502.00674,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.011254Z"},"links":{"cited_paper":"/paper/2502.00674","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:ca2d6733e7910972e513176c06794b65207d74fbad18704c575db20183b0ac4b","observation_id":"d26b3cd4-b532-4037-adf7-807fa791a3a4","resolution":{"observed_at":"2026-08-04T22:03:02.011254Z","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-04T22:03:02.743518Z","title":"Message type identification of binary network protocols using continuous segment similarity","venue":null,"work_id":"ce2c2ad7-875c-4b57-8326-c4f1d2e6ac2e","year":2020},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.003532Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:24f04f247398a7faac6126aa28f46e79fea8dc9db2a192b2d7b4d26fdbe231d0","observation_id":"558360f0-b6b8-42be-96e9-02961abfdf66","resolution":{"observed_at":"2026-08-04T22:03:02.750286Z","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":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-08-04T22:03:00.687862Z","title":"Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capa- bilities.arXiv preprint arXiv:2507.06261,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:00.687862Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:549ee5eba5e024a927aec6d16f4adbe26d2d7645c7fd58c317ba2348f3c7d9f8","observation_id":"1583596b-2d35-40ad-9718-7674abcabe0e","resolution":{"observed_at":"2026-08-04T22:03:00.687862Z","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-04T22:03:00.800450Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:00.800450Z"},"links":{"citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:00dcb87cc7a91b13b4b1a784fdd90d1bf9fb7dcaec77eb08711b996b6172ec2d","observation_id":"7b884cbd-b944-4c55-8898-713e06f2bd58","resolution":{"observed_at":"2026-08-04T22:03:00.800450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","latest_version":2,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2509.07571."}