{"as_of":"2026-08-21T23:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:557a46c5239ffc3438fd10e8b8c81e63f2786564ef78e6254989cf9ead2442c0","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T08:54:28.745567Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2607.10836/citation-record","integrity":"/paper/2607.10836/integrity","json":"/paper/2607.10836/citation-record.json","paper":"/paper/2607.10836"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Emergent Abilities of Large Language Models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:eff7b4a8f2af5aa22c6d7ca51d40be62d2e484b1604d8c35c8b888079f7cdf31","observation_id":"14766d52-753a-4c30-a7b0-62f363c2d073","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversations,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:60beab735910b265b0633d24336f847bc6cb0a257a3ccd8e7f7fa63e46ce9a45","observation_id":"cac922d4-2928-4a06-b15e-fe852566747e","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:59a568ed671f56a7d959ead3e77b20395d9c796d3a8a0cdb56097e9426f55e48","observation_id":"046456bc-afe3-4531-9443-9401d052b7dc","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"CAMEL: Communicative Agents for","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:313c8b262755c065275aa05df68b07f1aa7eff67ea581f35b3432b06e8513e8f","observation_id":"c799ed1c-ce8b-47ac-a8ae-d940056d80a2","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"ChatDev: Communicative Agents for Software Development,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:53cc75b9da95221140d3120c149639b42d19b372e359078b56aa4a0e4ae55c82","observation_id":"e1193235-ed56-4500-a18a-2b984a997e3a","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Improving Factuality and Reasoning in Language Models through Multiagent Debate,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:3f40d77e929210400075b44a96fd38831534d07ac9f4e56df1d6a5eb6c10abd1","observation_id":"4ee937eb-8c25-4769-8cb9-7b3db2088de4","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debate,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:3ce383411c3e66075b6399cea4b51ce27cf12393506a0b309be9568530e8398f","observation_id":"fc23c948-0e57-40ce-9bbe-236009e23d6a","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Self-Refine: Iterative Refinement with Self-Feedback,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:ae675d4373a4e9590195fe834055ae1e2addc4878c7671c09532f1f0220e4642","observation_id":"edd4c73e-3b9a-438d-b3c0-ac557a5dd13f","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:eda7598d38fe56529e22879cdca04e4e548db9beca6a941d143e1135c91dba4c","observation_id":"b5cb2774-d3d7-46e9-9f07-af0d04f5edfc","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:842b5e5b4e18732f05d89fabb7eda3471938945234e050798e6ca207d69a5b6b","observation_id":"13614990-8794-474b-b8ef-f16fc2bc8de2","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:3cc39d57f275b674029b30ae56255c75359d47ceace84846a43c0c2ed310c684","observation_id":"421b9df5-1977-4c76-a895-983e5c7f2285","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Mixture-of-Agents Enhances Large Language Model Capabilities,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:62c23fc16bed8bdfa9565999168401a9eaff593e1fa81c2f67ea145bc175c259","observation_id":"cd792f5a-52b4-4cdd-8db8-298016971e1b","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"EvoAgent: Towards Automatic Multi-Agent Generation via Evolutionary Algorithms,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:fb674e186bb8bbc674574f5785ef1ec2cb6577e839a0a5808b180695f288461d","observation_id":"7095c262-278f-4ffe-9c75-6278f9f61bc3","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Multi-Agent Collaboration via Evolving Orchestration,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:2bf1f8a04857c17bd7a3d53da24492e913e10da046887bf4b7be541e3e45d443","observation_id":"08ea4cea-cbc2-435c-b1c2-029d40d732b9","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"MAPoRL: Multi-agent post-co-training for collaborative large language models with reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:40d5130d45f21c6e88c0b652eccdaa406b8b4fa23e1d209f30bae4996ffd6530","observation_id":"27c99fae-8f38-4cee-b78a-32db15a301a6","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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":"10.1609/aaai.v40i38.40487","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LLM Collaboration with Multi-Agent Reinforcement Learning,","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"0c0b53d7-2614-479d-b78e-542e91b1ad65","year":2026},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:b4c7f3830d5e629df979c3d7864ded1087a9b74ae04e0748a58d39491d348485","observation_id":"ad63f6ec-3524-4002-a839-362e8c5b3d24","resolution":{"observed_at":"2026-07-14T09:00:22.830314Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-14T18:50:19.838597+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T18:50:19.838597+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08983","last_updated":"2017-02-21T16:21:21Z","snapshot_observed_at":"2026-08-19T09:41:48.169666Z","submitted_at":"2016-03-29T22:09:00Z","title":"Adaptive Computation Time for Recurrent Neural Networks","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.08983","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Adaptive computation time for recurrent neural networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/1603.08983","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:739f93829c65eae367bd9dcf3988cf03da0f44da5db882ec7bdf126e6fdcf5eb","observation_id":"551cc81e-9b33-4241-871d-58c02d697a64","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Universal Transformers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:215f2d3afdcc03dd1892b2579855ee0e6cc848b3049e61d72b9b894529aeb11e","observation_id":"1d555918-74a6-45c5-8ad6-02de052156e5","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Depth-Adaptive Transformer,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:a4367bcce30b07259bb2e05bec010d7bdad3c51d5a1d550c6a70de59df93aafb","observation_id":"0db80d4e-fecf-4c8f-bc42-b35017df48b2","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Confident Adaptive Language Modeling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:9f57c68b3772e34474119470baf1de7763039e9c87d547b147d6003ac8b4737b","observation_id":"1c381568-52aa-49b6-9488-ba25bb48516b","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02258","last_updated":"2024-04-02T19:28:11Z","snapshot_observed_at":"2026-08-21T19:20:25.456685Z","submitted_at":"2024-04-02T19:28:11Z","title":"Mixture-of-Depths: Dynamically allocating compute in transformer-based language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02258","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Mixture of depths: Dynamically allocating compute in transformer language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2404.02258","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:7cf551fe63f18f525e262008c28e845b67e43740272f6ddf7e057b98f5ca9a55","observation_id":"a913da61-7762-4a13-aad3-c5f30e1f7e51","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:a443800fe0a701237e0e7df761cb0473a2f0390736ae3a2fa198bde96dccd50b","observation_id":"d588121d-3a35-4c50-a354-ffbf391c2001","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"RouteLLM: Learning to Route LLMs from Preference Data,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:7c18cdd0621f9c3209ed135b1710ad1d35d87fcc864a85d1bff6b026d1d1b231","observation_id":"aa2a2a9a-c502-45a3-ae9a-27bc8ee74ebd","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Learning Multiagent Communication with Backpropagation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:d8fc0880fd02d5553d8779922f592bfab5d92996d2547299f7d238f70da3b137","observation_id":"35ed2e96-5f59-44d2-ac5c-a7afe539cb4b","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Learning to Communicate with Deep Multi-Agent Reinforcement Learning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:73c3c2f6d46799779862f37c78c3ea47c01ac5c782f108b51b4315e4cd6d876b","observation_id":"c8efba77-711d-43bf-a186-9ad5c478dc65","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Learning Attentional Communication for Multi-Agent Cooperation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:4e889b72901dfaa2f1072f9c1932a4e04935cf06b66d9beec9317d92e1ecc24e","observation_id":"2325a7af-293a-4517-babc-76d4d0b31406","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Individualized Controlled Continuous Communication Model for Multiagent Cooperative and Competitive Tasks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:20fe1129a81264efa93b0a9f6e754624efd308a64f5a2244bc6ab91de2219e97","observation_id":"d0abeed8-3df7-4e9b-9816-01a612873baa","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"TarMAC: Targeted Multi-Agent Communication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:94c84b1281aad037a0ba4bcd7c947127cb6b54581f7726a32ffcb376c69e4d6c","observation_id":"79034a76-c26d-4933-ada1-8cc80017e631","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"DeepSeekMath: Pushing the limits of mathematical reasoning in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:1fd27d60e98330b59a0c76c51721f7d1a54af1f84ad56782d892348fd4593ca1","observation_id":"8e389bc5-13fb-4400-a2b8-479906a58cbe","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Categorical Reparameterization with Gumbel-Softmax,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:4c3e087c3227031e960eed7c572e71a9d525e154a82c91bf8373054ec22f6d59","observation_id":"2adc4ae9-2605-4836-9740-13e50c728df6","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Training language models to follow instructions with human feedback,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:6bde37590db832f94c4f815bd47f2166ce8e7d8b4ad091f30878163a0419fcf9","observation_id":"c16c44db-6866-46f9-ba1c-5164d5d92851","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-20T07:04:06.309989Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Proximal policy optimization algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:6f722fdc3e8e021818b9644b79d5f4cbd354dc061c7e05f4874c65dee1bc1a8d","observation_id":"71393bbe-ffa8-4d29-8e6d-c126655bc63e","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-08-15T12:33:55.451951Z","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-07-14T08:54:28.745567Z","title":"DeepSeek-R1: Incentivizing reasoning capability in LLMs via reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:c43b950b7e970b2c02d0b099b3e3b23861bbbf0ad50e052d8df64d4548416c22","observation_id":"98fbea01-23ea-479e-90c4-1e3f439f9bd6","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:497e6f7468e720b2ffb6aa0aac69c08007be59f16d4265705f704e2b78cf8add","observation_id":"acb15d91-ea7a-44b0-8ee8-a956c166a3af","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"On Calibration of Modern Neural Networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:4eb51ff9af6ed500d90a1a24bf04c999ea03999bef97c610f8ab0afc58cad343","observation_id":"f7cb2fc0-fb97-453f-9160-8ed667ee1e55","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Calibration of Pre-trained Transformers,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:b0bd5d9e8ba97e182c69fee6ff582af8fb5b6a5ada6d1e1a2b3aa8cd46a46e5b","observation_id":"54d2ea48-8afb-42df-972a-32e80db37c10","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Training verifiers to solve math word problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:ffee3b6173d922703e544a42421fdd5a784ed0910bdd865601cf2f5f6d574a17","observation_id":"59078031-9797-41ec-97f2-bfe1e5a4990f","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"MMLU-Pro: A More Robust and Chal- lenging Multi-Task Language Understanding Benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:a2c13f71c606f30b1f5130e5fa065b89ec4419cba3e931955ced3645b6a079b5","observation_id":"87936b66-db57-4a84-9815-22c1f10a694b","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:e282a6bf9e7890e7657ae6bf63875cad4f4f4a1d0b6863e879354f7d8fe954e1","observation_id":"dc80fc7e-1909-460b-8ebb-28726f02369e","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Beyond benchmarks: Matharena as an evaluation platform for mathematics with LLMs,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:f19017800110c0d8782ed312c3e9daec34e7a62f453e569b132c5443e9903a1f","observation_id":"174ff51d-5415-4a03-bce0-7b223ae5a067","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Chain-of- Thought Prompting Elicits Reasoning in Large Language Models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:692d80e3d6102d393c2af74dffd88902b9bb3d422dcc45b81b598b5caf926daf","observation_id":"985b484b-80ac-4712-a9e9-bc825beb715c","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Phi-3 Technical Report: A Highly Capable Language Model Locally on Y our Phone,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:b97a7d56e5a80806a4e1ae9132841557d89290c40c71ac880ff6cf3f1a3d56a3","observation_id":"096fe2c4-3a54-4ec2-89d4-0d7f26de04ad","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"The Llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:1ee87732e311878588a0be3efb01f82648b58c8e0e325d9b94f5a8fd2dd8be5d","observation_id":"f20e2f64-eb8a-4fc2-be10-b06c081432f4","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04088","last_updated":"2024-01-08T18:47:34Z","snapshot_observed_at":"2026-08-13T19:43:49.936776Z","submitted_at":"2024-01-08T18:47:34Z","title":"Mixtral of Experts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04088","snapshot_observed_at":"2026-07-14T08:54:28.745567Z","title":"Mixtral of experts,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"cited_paper":"/paper/2401.04088","citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:51c1ee46c784046e045f0a6a7d603cae12cb8f762bdba18660806962632bacfd","observation_id":"546f589d-26b0-4f35-8c14-f693d00ceb6a","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:0306d975439f327fd78afe73e1442c2735f94546e4063d960e4f948ad7dd0e66","observation_id":"2849201e-50e2-433c-9bfe-3c81ec07fd34","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","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-07-14T08:54:28.745567Z","title":"Switch transformers: scaling to trillion parameter models with simple and efficient sparsity,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T08:54:28.745567Z"},"links":{"citing_paper":"/paper/2607.10836"},"observation_digest":"sha256:9d31b730ecaaca36cb977cf140098b39e3a9e627cb693f70a9270138a4171d2b","observation_id":"f8cbc323-1226-43f5-a30d-0ec833959651","resolution":{"observed_at":"2026-07-14T08:54:28.745567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10836","last_updated":"2026-07-12T16:58:21Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T19:04:56.334747Z","submitted_at":"2026-07-12T16:58:21Z","title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":46},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.10836."}