{"as_of":"2026-08-04T22:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99ca9d5f1e9d5a1337db74ff3c15ab3bdcfc2e7826b5fbf6b7e8bfed8b685da1","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T02:17:50.474681Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:47:05.357916Z","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":[{"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-04T21:19:22.004473Z","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:2e3ac13845a95d82e0791c0711312fff1bfd862de45742f642a6f9b0ff508bc6","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.19280/citation-record","integrity":"/paper/2502.19280/integrity","json":"/paper/2502.19280/citation-record.json","paper":"/paper/2502.19280"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.13163","last_updated":"2024-12-18T21:26:14Z","snapshot_observed_at":"2026-07-06T20:08:43.596697Z","submitted_at":"2024-12-17T18:42:21Z","title":"C-FedRAG: A Confidential Federated Retrieval-Augmented Generation System","version":2},"cited_work":{"arxiv_id":"2412.13163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.13163","snapshot_observed_at":"2026-07-09T08:16:05.751209Z","title":"C-fedrag: A confidential federated retrieval-augmented generation system","venue":"cs.DC","work_id":"fc2b3879-fe7a-4f49-83d2-f9fe93a6de38","year":2024},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2412.13163","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:68bf74b4ca730cb67c0c269fcb0bb13c6654083292adb35679e13901a14d1228","observation_id":"ebf419d5-62b6-4669-bd0e-b9857f87899c","resolution":{"observed_at":"2026-05-23T02:22:25.538526Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On the effectiveness of one-shot federated ensembles in heterogeneous cross-silo settings","venue":null,"work_id":"ba3f3496-1fee-4503-b024-2e36922215bf","year":2024},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:85e66eb91e48a87a0810baef48b44db1075a0ef5fe8994dfe415acbea6daea17","observation_id":"ca0bd2ee-013a-4fb2-850b-60b22fdf3773","resolution":{"observed_at":"2026-05-23T09:02:48.904754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Classification-based resource selection","venue":null,"work_id":"521b3448-4aca-4bd2-ad94-e611175a41dd","year":2009},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:92c9cd75295db387ee4ce46dcfe2a31554bd431fb2411de1c4a94d1b23cdae3a","observation_id":"a1daf108-4146-43ec-b556-a7f0a0f02ca3","resolution":{"observed_at":"2026-05-23T09:02:48.908696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"An analysis of large language models: their impact and potential applications","venue":null,"work_id":"b867c2ef-6894-4f7e-80c1-95923158e6fa","year":2024},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:5dde4e0d95afd5e972949db76f42c593928dc2c3b9a980bf7e909247ba93862b","observation_id":"d4d3ec5c-db16-4322-b202-e1147ecacc3e","resolution":{"observed_at":"2026-05-23T09:02:48.916043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Information scattering","venue":null,"work_id":"0c2b6383-077c-4b70-81a0-a76d08b74e6e","year":2009},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:3a5580b150af1576a40fa91f51cb7c1986bdadb0c79d43fbf2e6f3dcf9eb0b65","observation_id":"fee499d6-5903-472d-8b00-603c670d955c","resolution":{"observed_at":"2026-05-23T09:02:48.963886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Wikipedia 2023-11 embed multilingual v3","venue":null,"work_id":"16ecb71c-d87f-4b60-b697-df2c023f31b2","year":2023},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:91101a3d699aa57584eb3364b2f4b8cd62aa575ce843f6d5a75c38f626a2a621","observation_id":"5717c3e9-1ac6-491e-8090-301ede9b6d2b","resolution":{"observed_at":"2026-05-23T09:02:48.956151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning to rank resources","venue":null,"work_id":"e2806bd7-241a-4a79-9aa6-760845a0bbc8","year":2017},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:96393a73d58a977a81f6fde899ea17bf11a1fd297f2a40ff9170bc9f587721fe","observation_id":"ccfb4d09-9596-428c-bdcb-4e92c083470a","resolution":{"observed_at":"2026-05-23T09:02:48.934480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"The faiss library","venue":null,"work_id":"f7586801-06e8-4122-a604-7f29af23aeb9","year":2024},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:46a8ea32761f518bfb8dcbeada8e6d0cf09bc942e22a2493216ec2549b4cf3ae","observation_id":"51722b96-20de-4d4d-b058-f6abf182dcfa","resolution":{"observed_at":"2026-05-23T09:05:30.913663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":"2407.21783","doi":"10.1016/s0749-0720(15","metadata_source":"pith","pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The Llama 3 Herd of Models","venue":"cs.AI","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:40a29c71513669159d3999672d41c9273534843479672b5cdcd348279c049670","observation_id":"73e26b40-1b17-4a0e-abb4-ae8d87136d4d","resolution":{"observed_at":"2026-05-23T02:22:25.527216Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17385","last_updated":"2024-02-27T10:24:50Z","snapshot_observed_at":"2026-07-06T17:36:05.934286Z","submitted_at":"2024-02-27T10:24:50Z","title":"Determinants of LLM-assisted Decision-Making","version":1},"cited_work":{"arxiv_id":"2402.17385","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.17385","snapshot_observed_at":"2026-07-04T03:59:33.533783Z","title":"Determinants of llm-assisted decision-making","venue":null,"work_id":"c883a5a1-aee0-4f2d-abeb-a4ff732681d5","year":2024},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2402.17385","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:6ec71e563bafbb85571c03c068b1c922cda480c6e39a6fdbb4881eed0df6958d","observation_id":"9470a493-de4f-4fb0-9122-97bbaed7668e","resolution":{"observed_at":"2026-05-23T02:22:25.522094Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Federated search tech- niques: an overview of the trends and state of the art","venue":null,"work_id":"ec000fb1-118c-420a-b086-4e3115a8a09d","year":2023},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:f442099828febfb62142c651232697784ef89f42a73c4bd1b93d0d900312ff8e","observation_id":"958b002d-225c-4de9-81c3-51d4a4dd6e56","resolution":{"observed_at":"2026-05-23T09:05:30.938835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"The ethics of chatgpt in medicine and healthcare: a systematic review on large language models (llms)","venue":null,"work_id":"b132114a-51df-4bcf-b0b5-5e8c1d2909d9","year":2024},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:afea4846ec89c92d3a475abfd2f250f13c53aed52a9c58decb7372eb2762e9c6","observation_id":"1ba33f53-463c-4cf3-b3c3-9543c25d2f0d","resolution":{"observed_at":"2026-05-23T09:02:48.931068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2310.11703","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T03:27:35.725146Z","title":"A comprehensive survey on vector database: Storage and retrieval technique, challenge","venue":null,"work_id":"c1bf7624-de3b-45b9-b247-eb38e99ca89a","year":2023},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:484214dddbfde88dd4359c5dca94a7aa00dc339e074e382070d89c121b33def9","observation_id":"acdb01d0-08c9-4fe1-a663-dceb4f86f587","resolution":{"observed_at":"2026-05-23T02:22:25.532250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Measuring massive multi- task language understanding","venue":null,"work_id":"dd1e8d0c-9122-4dac-8599-ccab811db08f","year":2021},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:5ceb2c5f7356225d036cf84f26e1369060ae348a555b5023b59468afcd095993","observation_id":"5ea3776e-ab07-4dbb-a6d9-dd8dfd06ecdf","resolution":{"observed_at":"2026-05-23T09:02:48.923622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Towards mitigating llm hallucination via self reflection","venue":null,"work_id":"643a123b-188b-462b-a620-775337b9db06","year":2023},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:c52a32800bbcd76af5ff0e779888d8144e6298d97906a8db9da052d6e892572d","observation_id":"b9181ff7-4158-4bca-8048-d2b04ae70173","resolution":{"observed_at":"2026-05-23T09:02:48.960463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Clinical Question-Answering over Distributed EHR Data","venue":null,"work_id":"8be11a5d-9f74-44e4-85e4-1ba04a5006cf","year":2024},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:4317ce5a6f669400df6fdcbbc49150f2e14a8bc452a98370395e7734d40c7858","observation_id":"8004d930-9e0c-401a-891a-92bd87321ecd","resolution":{"observed_at":"2026-05-23T09:05:30.934112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Comeau, Lana Yeganova, W","venue":null,"work_id":"21b2a6f8-30a1-43ce-af89-839f43bdc7f7","year":2023},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:5a93cbbf3b2029e06892bd500282c1c6700bbf87be4f1beec9e066141ae43acb","observation_id":"757af4f7-2042-4627-84b5-cbcf7ea4254a","resolution":{"observed_at":"2026-05-23T09:02:48.912260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Advances and open problems in federated learning","venue":null,"work_id":"fa743581-836f-4bb0-a311-ecfd2c672407","year":2021},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:4def70051553e9da8df64953cd2a0a58656793617e990d3121b80dad6240dc98","observation_id":"87004644-3554-4b66-be54-5457cbf11930","resolution":{"observed_at":"2026-05-23T09:05:30.908680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":"2001.08361","doi":"10.1145/3616855.3635845","metadata_source":"pith","pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Scaling Laws for Neural Language Models","venue":"cs.LG","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","year":2020},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:1d63d1b5598bb98937d72ff13a442321cb8e3f29340be052229817366865ed55","observation_id":"6266b01b-8ac3-473f-ad23-fc0484f200e1","resolution":{"observed_at":"2026-05-23T02:22:25.511048Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Performance evaluation of vector embeddings with retrieval-augmented generation","venue":null,"work_id":"71e93fe9-2a8b-4d92-a0ab-01f3f2f58ba0","year":2024},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:509fa2d0db34cede9772c15d3bf4bcc921325152a66ee4a977104d70ab11007f","observation_id":"6733abd7-1be8-4a47-815e-d9da2bc5c52d","resolution":{"observed_at":"2026-05-23T09:02:48.893852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"abc81d6b-4676-459d-8b7b-b66fd62f5e0a","year":2024},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:39e7c1be917cbb1c025e98221c1dcb30038a86015cde964a3e8d7f3c46eb4e7e","observation_id":"fed92c7d-444b-4439-add1-1bb3abe96543","resolution":{"observed_at":"2026-05-23T09:02:48.919557Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Retrieval-augmented generation for knowledge- intensive nlp tasks","venue":null,"work_id":"cc6c1740-92e6-4ace-8ae3-57e0f00accb5","year":2020},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:56da16968d0d61762afaf9316f816198769c760e14481394bedb3bb7f17f38f7","observation_id":"9ff3b185-af45-47bf-aea3-39e69daf288a","resolution":{"observed_at":"2026-05-23T09:05:30.943472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Approximate nearest neighbor search on high di- mensional data—experiments, analyses, and improvement","venue":null,"work_id":"79e8b598-944b-498b-96e6-dd153677aac1","year":2019},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:d92c70b97206b187f321bcead41422340e130d836d0ddec41ede4a75ef3fb411","observation_id":"ad4e0bbc-89ac-4bfd-9413-18fe88113385","resolution":{"observed_at":"2026-05-23T09:02:48.941664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Cache me if you can: The case for retrieval augmentation in federated learning","venue":null,"work_id":"f2cd709f-08d8-4ba6-80fa-ba4fad1ac741","year":null},"citing_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},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:c717707ae4252b5f11bc26dc54e4b8a41138521b35a1a5febee7615658ce0481","observation_id":"c70fc0a2-b297-41d7-86b6-59467d56fcba","resolution":{"observed_at":"2026-05-23T09:02:48.945158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Ollama: Get up and running with large language models","venue":null,"work_id":"e7e5a124-ecca-41d8-b964-9266c904b1a0","year":2025},"citing_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},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:48e7e906bd43a7d0955643ef6d3ecf4e938d0afdae41b0aca813cb63f70d8931","observation_id":"e15186a1-6ade-44c1-880c-67e47fa67fac","resolution":{"observed_at":"2026-05-23T09:05:30.929080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Maximizing rag efficiency: A compar- ative analysis of rag methods","venue":null,"work_id":"6f83eec2-2a1b-4882-9c23-fcf759ae60f2","year":2025},"citing_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},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:67551894af39aa7dae8114d3c34ce1f0effc0afe34bad2822d89231d90236421","observation_id":"176cdf3b-f1e2-4471-8839-6bd9e21e3b7f","resolution":{"observed_at":"2026-05-23T09:05:30.918815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.05838","last_updated":"2024-12-08T07:18:19Z","snapshot_observed_at":"2026-07-06T20:03:25.000927Z","submitted_at":"2024-12-08T07:18:19Z","title":"A Collaborative Multi-Agent Approach to Retrieval-Augmented Generation Across Diverse Data","version":1},"cited_work":{"arxiv_id":"2412.05838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.05838","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A collaborative multi-agent approach to retrieval-augmented generation across diverse data","venue":null,"work_id":"6e013075-4e60-45df-9d14-8172880030fd","year":2024},"citing_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},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2412.05838","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:ab7bb04871cffc36ba551e51c7c5cfce9e6ce541490dc2340e376f55cfaaab41","observation_id":"73b2f471-5569-4f38-b97c-c2fdd843f653","resolution":{"observed_at":"2026-05-23T02:22:25.501553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Know where to go: Make llm a relevant, responsible, and trustworthy searchers","venue":null,"work_id":"a13f13d4-c4cd-455b-aad0-5eaa252ce2e5","year":2025},"citing_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},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:6739a818b4f0c6006fcbd78c0bfdfd33b4358c6ec8cab2e948abbefd06ec9e09","observation_id":"27989195-6cd3-436e-80e7-a64f767867e1","resolution":{"observed_at":"2026-05-23T09:05:30.902342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Federated search","venue":null,"work_id":"90d4f6d6-a47c-40bb-a7aa-8d1605e58857","year":2011},"citing_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},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:942af7c97813d7eff8ee543750075f402d78f316ac96bb73c22603bd3f589e2f","observation_id":"e8ef39c1-8ac7-492d-a99c-48db938b9c41","resolution":{"observed_at":"2026-05-23T09:02:48.927342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Retrieval-qa-benchmark: A benchmark for evaluating retrieval-augmented qa systems","venue":null,"work_id":"ef9ac2d5-98ea-4362-80ac-4fceb1e411e2","year":2024},"citing_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},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:a8f2a8026da52b23c65a9d899c18aa6ac25d6a1a738e0e3818fbc2130bc33b6f","observation_id":"b7b9ec73-622e-4651-a969-a9abc3318af8","resolution":{"observed_at":"2026-05-23T09:02:48.952435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Feb4rag: Evaluating federated search in the context of retrieval augmented generation","venue":null,"work_id":"55142e6b-e78f-4c2d-87ce-9ee86d8a93c1","year":2024},"citing_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},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:a2e31ddf63f82b0aaf50b57e5781c07ceef911e7e8106dad4c905055211ad1b1","observation_id":"238cb503-c3a5-45a0-b36d-437d87d1c626","resolution":{"observed_at":"2026-05-23T09:02:48.897353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17645","last_updated":"2024-01-31T07:58:54Z","snapshot_observed_at":"2026-07-06T17:22:57.755410Z","submitted_at":"2024-01-31T07:58:54Z","title":"ReSLLM: Large Language Models are Strong Resource Selectors for Federated Search","version":1},"cited_work":{"arxiv_id":"2401.17645","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.17645","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Resllm: Large language models are strong resource selectors for federated search","venue":null,"work_id":"f3a90f40-0b8e-4cc9-aa0f-eeb66948668c","year":2024},"citing_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},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2401.17645","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:2c3c8b8d1ccea0d63c7ab606ac49b49264576b16bc24fc6683616005abeb0cde","observation_id":"8fd4bb09-1512-409c-9da9-a9dddf84e1ca","resolution":{"observed_at":"2026-05-23T02:22:25.506267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Ltrrs: a learning to rank based algorithm for resource selection in distributed information retrieval","venue":null,"work_id":"259e9773-8fe6-4091-ae2f-208f291027cd","year":2019},"citing_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},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:f6d576c8ab009fec90b141da26f804662e222e97dd5c20d06bc6988af6b6141a","observation_id":"bbc2b739-75c0-4583-abd2-081ab874d30d","resolution":{"observed_at":"2026-05-23T09:02:48.948804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Bench- marking retrieval-augmented generation for medicine","venue":null,"work_id":"d6b34130-9ea5-4af9-92e2-6387957a5738","year":2024},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:c2f16d159f17075791715eaeb767400b1190ba78313137885929c7df186851f5","observation_id":"6e2a78a2-76c4-482c-8dd0-9fdb6354df3a","resolution":{"observed_at":"2026-05-23T09:05:30.923851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13272","last_updated":"2024-10-17T06:57:29Z","snapshot_observed_at":"2026-07-06T19:35:04.087584Z","submitted_at":"2024-10-17T06:57:29Z","title":"FRAG: Toward Federated Vector Database Management for Collaborative and Secure Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":"2410.13272","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.13272","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Frag: Toward federated vector database management for collaborative and secure retrieval-augmented generation","venue":null,"work_id":"94e6b272-1081-4cd7-97e8-d096a966830d","year":2024},"citing_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},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"cited_paper":"/paper/2410.13272","citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:9a703f2938d5ac4a7666b1aadfc882eacf637109d390f04df63b73c6c2cb6649","observation_id":"246a9a8e-b927-48ce-9932-7ff15393d492","resolution":{"observed_at":"2026-05-23T02:22:25.517329Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Mixture-of- experts with expert choice routing","venue":null,"work_id":"c5902423-e7dc-456e-8796-544ac19fabea","year":2022},"citing_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},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T02:17:50.474681Z"},"links":{"citing_paper":"/paper/2502.19280"},"observation_digest":"sha256:a18b8020245b726eec194cab8478b2485a8e235153d468dada09c1c3bf1bd1c0","observation_id":"610adcba-1900-42b6-89bb-e73aa612b75d","resolution":{"observed_at":"2026-05-23T09:02:48.938047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.19280","last_updated":"2026-04-09T13:52:15Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":8,"verified_fuzzy":27},"total_outbound_references":36},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:2502.19280."}