{"as_of":"2026-08-10T16:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6987a5c97cea8e5fbbb9168fac9e9e5723df7d60304d1d2466462dc4bcd43ab0","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:47:07.368333Z","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-10T06:31:04.303077+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/2608.00030/citation-record","integrity":"/paper/2608.00030/integrity","json":"/paper/2608.00030/citation-record.json","paper":"/paper/2608.00030"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.16004","last_updated":"2023-06-28T08:24:14Z","snapshot_observed_at":"2026-08-04T21:56:42.195495Z","submitted_at":"2023-06-28T08:24:14Z","title":"Query Understanding in the Age of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.16004","snapshot_observed_at":"2026-08-04T01:47:04.667006Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:04.667006Z"},"links":{"cited_paper":"/paper/2306.16004","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:fc97bd9ddaf2b681dbae35ed01252e3e828f918c184bc4c3fece7ff8abc0e44d","observation_id":"84d7ea81-c540-4a2b-b6f6-7041899f4e16","resolution":{"observed_at":"2026-08-04T01:47:04.667006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.02153","last_updated":"2025-09-15T22:15:00Z","snapshot_observed_at":"2026-08-05T18:56:11.132981Z","submitted_at":"2025-06-02T18:35:16Z","title":"Small Language Models are the Future of Agentic AI","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.02153","snapshot_observed_at":"2026-08-04T01:47:04.816033Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:04.816033Z"},"links":{"cited_paper":"/paper/2506.02153","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:5cde65b147092db6b06a13645f86cfdd5914571cccd9f87a2f6a3565f3c13838","observation_id":"3c428a47-8f82-42bf-977f-e2fd81cabda1","resolution":{"observed_at":"2026-08-04T01:47:04.816033Z","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-04T01:47:04.917052Z","title":"Broder, Marcus Fontoura, Evgeniy Gabrilovich, Amruta Joshi, Vanja Josifovski, and Tong Zhang","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:04.917052Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:54363ebc03443c79233bb3f53cdda0b6b6c61cb7c51405773c2db10c804bf9fa","observation_id":"568ca4db-ee97-4e0b-849d-4bf7c2441de9","resolution":{"observed_at":"2026-08-04T01:47:04.917052Z","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-04T01:47:04.978873Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:04.978873Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:3dedce45a8f3d4e7afcddd9787357b8f302578932aa669f641a4a5ea35947796","observation_id":"86ff3da1-17e1-4f4f-8a89-6ab70b8504d5","resolution":{"observed_at":"2026-08-04T01:47:04.978873Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.17161","last_updated":"2025-05-26T17:16:45Z","snapshot_observed_at":"2026-08-09T18:26:12.869738Z","submitted_at":"2025-01-28T18:59:44Z","title":"SFT Memorizes, RL Generalizes: A Comparative Study of Foundation Model Post-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.17161","snapshot_observed_at":"2026-08-04T01:47:05.041912Z","title":"Le, Sergey Levine, and Yi Ma","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.041912Z"},"links":{"cited_paper":"/paper/2501.17161","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:662e01a023a87e893d676ca2e9445749757cf244679b4faa100f7c66b5658028","observation_id":"5f0eded6-07d6-4520-8287-2f4d5031047b","resolution":{"observed_at":"2026-08-04T01:47:05.041912Z","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-04T01:47:05.161276Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.161276Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:5898d58ec2dab9ee69025f959ccf02801105104d0eca0bef4c7515c95a1db3eb","observation_id":"bec712e5-d7e0-4a2a-a131-e2f5ae673d3f","resolution":{"observed_at":"2026-08-04T01:47:05.161276Z","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-04T01:47:05.290105Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.290105Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:cb77a0af77faab36ceb707a686ed0c9d8c8a98bbe7374b72b2066bb95e4f5281","observation_id":"5d5da7f4-60b0-445d-b150-542749e5d9a2","resolution":{"observed_at":"2026-08-04T01:47:05.290105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.19280","last_updated":"2026-04-09T13:52:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-26T16:36:24Z","title":"Efficient Federated Search for Retrieval-Augmented Generation using Lightweight Routing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.19280","snapshot_observed_at":"2026-08-04T01:47:05.357916Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.357916Z"},"links":{"cited_paper":"/paper/2502.19280","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:f14186908a1b8f08f162e9cf5e8d94a5df0dfa975b507dcaaf736606e40d419e","observation_id":"4167787f-eb90-453f-86ea-271275a01dc0","resolution":{"observed_at":"2026-08-04T01:47:05.357916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-06T21:57:22.791105Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-08-04T01:47:05.422162Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.422162Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:720334cf667ee41a09a57343a317e3f86d950c4bd6436dcc15c5d80ea1892276","observation_id":"1b1901da-cf11-4cba-9206-7e4b1dc29e0f","resolution":{"observed_at":"2026-08-04T01:47:05.422162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00223","last_updated":"2025-04-12T03:17:26Z","snapshot_observed_at":"2026-08-07T17:38:11.374070Z","submitted_at":"2025-02-28T22:16:42Z","title":"DeepRetrieval: Hacking Real Search Engines and Retrievers with Large Language Models via Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00223","snapshot_observed_at":"2026-08-04T01:47:05.477346Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.477346Z"},"links":{"cited_paper":"/paper/2503.00223","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:b7a74ae34eed74c93098e58caf0e7dd4d5566bad5e8d49572cebaf3f4acd6601","observation_id":"2bdcbb89-4ab5-40b4-a29a-d9886aa44c2b","resolution":{"observed_at":"2026-08-04T01:47:05.477346Z","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-04T01:47:05.635843Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.635843Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:e7199d176b00aed6618edda71617f91968d25224a6f46cb45db76a55c0305508","observation_id":"e05e17e1-22ca-4892-b525-0cb832406e0b","resolution":{"observed_at":"2026-08-04T01:47:05.635843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13743","last_updated":"2026-04-18T06:14:23Z","snapshot_observed_at":"2026-08-03T01:16:09.064686Z","submitted_at":"2025-06-16T17:53:18Z","title":"LTRR: Learning To Rank Retrievers for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13743","snapshot_observed_at":"2026-08-04T01:47:05.692892Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.692892Z"},"links":{"cited_paper":"/paper/2506.13743","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:4535343ce7ed74c9f2bdc511abcd03e029b6914fea47b4c8e53ed2ddde5292c5","observation_id":"b2ea4b2e-6072-49b4-8327-739ae8376442","resolution":{"observed_at":"2026-08-04T01:47:05.692892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11122","last_updated":"2024-04-17T07:10:28Z","snapshot_observed_at":"2026-08-10T11:24:04.849337Z","submitted_at":"2024-04-17T07:10:28Z","title":"Small Language Models are Good Too: An Empirical Study of Zero-Shot Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.11122","snapshot_observed_at":"2026-08-04T01:47:05.758277Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.758277Z"},"links":{"cited_paper":"/paper/2404.11122","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:52ca2515c4c37c19ac972e358408b4cf85cc43930fa6323346ef15e306fa9c93","observation_id":"20891b2e-6ec9-4627-b6bb-e4cfd5fa0d4c","resolution":{"observed_at":"2026-08-04T01:47:05.758277Z","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-04T01:47:05.818465Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.818465Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:cb9c5ea7b347d1545bf67fc71c3981863ec387ab340a27620731330cd5902801","observation_id":"91fa108a-a902-46bc-9169-90d53b2fe3ea","resolution":{"observed_at":"2026-08-04T01:47:05.818465Z","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-04T01:47:05.890384Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.890384Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:6c44ee87616cf9ca708efd103f9aa34baddb8b4401b7a3243a199e500485189f","observation_id":"8f2233be-a68c-4e42-8769-18abcb4754aa","resolution":{"observed_at":"2026-08-04T01:47:05.890384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-04T07:01:53.877122Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07793","snapshot_observed_at":"2026-08-04T01:47:06.006371Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.006371Z"},"links":{"cited_paper":"/paper/2501.07793","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:078963c904a659aecbb5dca372af6f2c2912523b545786163c2a154184de1182","observation_id":"6369dc63-9656-481d-b9ff-d8bc01428622","resolution":{"observed_at":"2026-08-04T01:47:06.006371Z","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-04T01:47:06.125033Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.125033Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:d2762bb0ced48b92f7ee1d2acb61a415418cb54f6056c412d564278fb7303269","observation_id":"f9523861-e594-4d14-bd89-9a9c9df4c2e8","resolution":{"observed_at":"2026-08-04T01:47:06.125033Z","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-04T01:47:06.190305Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.190305Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:580b938ae72cc05787b3bd52607a2ccd892257e651cff08090250dc4e48a872c","observation_id":"1fd7941b-501e-461b-b80f-ace7e90cb472","resolution":{"observed_at":"2026-08-04T01:47:06.190305Z","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-04T01:47:06.283735Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.283735Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:56e7aae3f35068a2ce21c1bbb00b29bf7f61c87f1a28a06ffbffee933eb1be1c","observation_id":"6153d1c9-0cff-4b9f-ae3d-6e93d9fc4015","resolution":{"observed_at":"2026-08-04T01:47:06.283735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05465","last_updated":"2026-05-14T16:52:31Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-03T19:53:57Z","title":"Small Language Models (SLMs) Can Still Pack a Punch: A survey (updated 2026)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05465","snapshot_observed_at":"2026-08-04T01:47:06.347770Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.347770Z"},"links":{"cited_paper":"/paper/2501.05465","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:e92e6bdd33b67a4cc95495203dbd2dd8ace08d2368119f18fab65aece4c9eed6","observation_id":"de35d113-0d5d-4101-85fb-c45ad8328c0b","resolution":{"observed_at":"2026-08-04T01:47:06.347770Z","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-04T01:47:06.489295Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.489295Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:a2f022756eb432cedd6ca83ad1ee74ccd730e0ab6fe926456a239d6809c5f2e9","observation_id":"c7161bd2-9cf3-4c28-8447-1b6a994db6f2","resolution":{"observed_at":"2026-08-04T01:47:06.489295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08035","last_updated":"2025-04-01T10:19:16Z","snapshot_observed_at":"2026-07-06T18:44:28.967181Z","submitted_at":"2024-07-10T20:32:50Z","title":"FsPONER: Few-shot Prompt Optimization for Named Entity Recognition in Domain-specific Scenarios","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08035","snapshot_observed_at":"2026-08-04T01:47:06.575966Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.575966Z"},"links":{"cited_paper":"/paper/2407.08035","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:6f6ec89492bf7a717084b63f5dd0ff2a09488fe5a5202ddffce526383651522f","observation_id":"c952776e-10c2-463f-a0c0-d7baf806f1ce","resolution":{"observed_at":"2026-08-04T01:47:06.575966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16200","last_updated":"2025-04-01T20:20:47Z","snapshot_observed_at":"2026-08-06T06:29:16.034179Z","submitted_at":"2024-02-25T21:25:06Z","title":"IR2: Information Regularization for Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16200","snapshot_observed_at":"2026-08-04T01:47:06.653088Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.653088Z"},"links":{"cited_paper":"/paper/2402.16200","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:a4b9a437c26079e396fbe1b8c7619e4a4342ccb5860e9e948c0d22a3ed137760","observation_id":"1afa0641-5fbf-40da-bacf-98bbea75718f","resolution":{"observed_at":"2026-08-04T01:47:06.653088Z","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-04T01:47:06.779243Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.779243Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:f8bdc586dd35d55e57c5bdc61f5ae928e700587a52ceaf7280b6b13bbf5cdbc2","observation_id":"7ca63376-0a8d-437b-8ca5-62023bb08de7","resolution":{"observed_at":"2026-08-04T01:47:06.779243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1304.6480","last_updated":"2013-04-24T04:08:23Z","snapshot_observed_at":"2026-07-06T03:11:51.813034Z","submitted_at":"2013-04-24T04:08:23Z","title":"A Theoretical Analysis of NDCG Type Ranking Measures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.6480","snapshot_observed_at":"2026-08-04T01:47:07.012322Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:07.012322Z"},"links":{"cited_paper":"/paper/1304.6480","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:7dd298216e5c79c5e0b1c28a9704344b68fe12ec39b58f0dd636cba94f9afad3","observation_id":"829ac22a-ca31-46aa-8fcd-64e0ac3ade9a","resolution":{"observed_at":"2026-08-04T01:47:07.012322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22334","last_updated":"2025-07-23T07:37:08Z","snapshot_observed_at":"2026-08-08T13:10:29.457567Z","submitted_at":"2025-05-28T13:21:38Z","title":"Advancing Multimodal Reasoning via Reinforcement Learning with Cold Start","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22334","snapshot_observed_at":"2026-08-04T01:47:07.116263Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:07.116263Z"},"links":{"cited_paper":"/paper/2505.22334","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:8b81cbfc773e1079fee027320ef86b9192a2c568214bfc0871f6a973adb1c4e9","observation_id":"c8eb2883-164b-4563-af06-d99077909789","resolution":{"observed_at":"2026-08-04T01:47:07.116263Z","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-04T01:47:07.231307Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:07.231307Z"},"links":{"citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:241f78496bc620e1052590504f09a48464f6e31c060709a20c2dda55836ce411","observation_id":"7c1d23ee-b30b-4dae-9ad8-8aca0ceb1f63","resolution":{"observed_at":"2026-08-04T01:47:07.231307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-04T01:47:07.368333Z","title":"Xing, Hao Zhang, Joseph E","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:07.368333Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:19646f7bb547aae33733f56bd33ffc287e8ad9b3b7fd3e23a28eda4210b25c63","observation_id":"1005f142-69bb-40aa-91db-d0f16ba8b618","resolution":{"observed_at":"2026-08-04T01:47:07.368333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17080","last_updated":"2023-05-26T16:41:03Z","snapshot_observed_at":"2026-08-10T12:42:03.974351Z","submitted_at":"2023-05-26T16:41:03Z","title":"Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.17080","snapshot_observed_at":"2026-08-04T01:47:05.229375Z","title":"arXiv:2305.17080 [cs.CL] https://arxiv.org/abs/2305.17080","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.229375Z"},"links":{"cited_paper":"/paper/2305.17080","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:9d904443cef406eeb9a841f7f30fca205280d24c316c779f0eb6e3e0f985b6dd","observation_id":"e7823c70-5430-448f-a01a-1fd9126100f8","resolution":{"observed_at":"2026-08-04T01:47:05.229375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2608.00030."}