{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JJHWDBOODOLK5LWRRQYMTCVXXT","short_pith_number":"pith:JJHWDBOO","schema_version":"1.0","canonical_sha256":"4a4f6185ce1b96aeaed18c30c98ab7bcf043e518d4bc9e81264843d4bbd9bc2c","source":{"kind":"arxiv","id":"2607.10836","version":1},"attestation_state":"computed","paper":{"title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sudipto Ghosh, Tanmoy Chakraborty","submitted_at":"2026-07-12T16:58:21Z","abstract_excerpt":"Multi-agent ensembling multiplies active parameters and inference cost without answering three basic questions: which agents to consult, how deeply a query should traverse a hierarchy of agents, and when inter-agent communication is worth its cost. We present GRADE (Gated Routing and Adaptive Depth for Efficient Reasoning), a hierarchical multi-agent system in which four lightweight learned gates jointly govern agent selection, hierarchy depth, inter-agent communication, and branch pruning. Training uses CoGRPO (Collaborative Group-Relative Policy Optimization), a novel critic-free recipe that"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.10836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-12T16:58:21Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"29518bf222b63598d6b28a1069dca412296be01f89d6f7ae05a76107420999ac","abstract_canon_sha256":"91c6511da1bdee599bf7e17b7753c53dee90afd7310040ccf01d8dfc004b05e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:42.698382Z","signature_b64":"98k5xIogPoYt5sH/V8yGD6+tjnltIwB+2mp2YXJ22e3+KcCYp7USOGKa1BZ8oxHHj2yi6NttsMBjQwWrJFaPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a4f6185ce1b96aeaed18c30c98ab7bcf043e518d4bc9e81264843d4bbd9bc2c","last_reissued_at":"2026-07-14T01:21:42.697556Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:42.697556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Route, Communicate, and Reason: Gated Routing and Adaptive Depth for Efficient Multi-Agent Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sudipto Ghosh, Tanmoy Chakraborty","submitted_at":"2026-07-12T16:58:21Z","abstract_excerpt":"Multi-agent ensembling multiplies active parameters and inference cost without answering three basic questions: which agents to consult, how deeply a query should traverse a hierarchy of agents, and when inter-agent communication is worth its cost. We present GRADE (Gated Routing and Adaptive Depth for Efficient Reasoning), a hierarchical multi-agent system in which four lightweight learned gates jointly govern agent selection, hierarchy depth, inter-agent communication, and branch pruning. Training uses CoGRPO (Collaborative Group-Relative Policy Optimization), a novel critic-free recipe that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10836","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.10836/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.10836","created_at":"2026-07-14T01:21:42.697985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10836v1","created_at":"2026-07-14T01:21:42.697985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10836","created_at":"2026-07-14T01:21:42.697985+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJHWDBOODOLK","created_at":"2026-07-14T01:21:42.697985+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJHWDBOODOLK5LWR","created_at":"2026-07-14T01:21:42.697985+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJHWDBOO","created_at":"2026-07-14T01:21:42.697985+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT","json":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT.json","graph_json":"https://pith.science/api/pith-number/JJHWDBOODOLK5LWRRQYMTCVXXT/graph.json","events_json":"https://pith.science/api/pith-number/JJHWDBOODOLK5LWRRQYMTCVXXT/events.json","paper":"https://pith.science/paper/JJHWDBOO"},"agent_actions":{"view_html":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT","download_json":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT.json","view_paper":"https://pith.science/paper/JJHWDBOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10836&json=true","fetch_graph":"https://pith.science/api/pith-number/JJHWDBOODOLK5LWRRQYMTCVXXT/graph.json","fetch_events":"https://pith.science/api/pith-number/JJHWDBOODOLK5LWRRQYMTCVXXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT/action/storage_attestation","attest_author":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT/action/author_attestation","sign_citation":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT/action/citation_signature","submit_replication":"https://pith.science/pith/JJHWDBOODOLK5LWRRQYMTCVXXT/action/replication_record"}},"created_at":"2026-07-14T01:21:42.697985+00:00","updated_at":"2026-07-14T01:21:42.697985+00:00"}