{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:53SJYYP4QVXSBM3DKMFMU4GKYZ","short_pith_number":"pith:53SJYYP4","schema_version":"1.0","canonical_sha256":"eee49c61fc856f20b363530aca70cac66561154e019da2b25553596a40195a64","source":{"kind":"arxiv","id":"2507.02822","version":1},"attestation_state":"computed","paper":{"title":"SynapseRoute: An Auto-Route Switching Framework on Dual-State Large Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chuanyang Zheng, Jianing Qiu, Jiankai Sun, Jindong Hong, Lingjie Luo, Meng Li, Qian Xu, Shiqin Qiao, Wencheng Zhang, Yijun He, Yinfeng Li, Yong Gui","submitted_at":"2025-07-03T17:33:58Z","abstract_excerpt":"With the widespread adoption of large language models (LLMs) in practical applications, selecting an appropriate model requires balancing not only performance but also operational cost. The emergence of reasoning-capable models has further widened the cost gap between \"thinking\" (high reasoning) and \"non-thinking\" (fast, low-cost) modes. In this work, we reveal that approximately 58% of medical questions can be accurately answered by the non-thinking mode alone, without requiring the high-cost reasoning process. This highlights a clear dichotomy in problem complexity and suggests that dynamica"},"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":"2507.02822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-07-03T17:33:58Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1c571547248214ef4cf0149936c3dc8798ea993317c216120fa3709f27e0b6ff","abstract_canon_sha256":"38d518545db8e1e75fe938b2a89618bdc6eb98e2eb24ef80c7920df0b60bfa23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:35.083271Z","signature_b64":"ttijTbfc+hSxLqSAi4Il38cae4MByGwWu2EbwexAFjz8Imq8dTdPVH5DqIGfRK9B+42G5Oa6Jz5dIfT1D8XIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eee49c61fc856f20b363530aca70cac66561154e019da2b25553596a40195a64","last_reissued_at":"2026-07-05T11:31:35.082792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:35.082792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SynapseRoute: An Auto-Route Switching Framework on Dual-State Large Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chuanyang Zheng, Jianing Qiu, Jiankai Sun, Jindong Hong, Lingjie Luo, Meng Li, Qian Xu, Shiqin Qiao, Wencheng Zhang, Yijun He, Yinfeng Li, Yong Gui","submitted_at":"2025-07-03T17:33:58Z","abstract_excerpt":"With the widespread adoption of large language models (LLMs) in practical applications, selecting an appropriate model requires balancing not only performance but also operational cost. The emergence of reasoning-capable models has further widened the cost gap between \"thinking\" (high reasoning) and \"non-thinking\" (fast, low-cost) modes. In this work, we reveal that approximately 58% of medical questions can be accurately answered by the non-thinking mode alone, without requiring the high-cost reasoning process. This highlights a clear dichotomy in problem complexity and suggests that dynamica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02822","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/2507.02822/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":"2507.02822","created_at":"2026-07-05T11:31:35.082851+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02822v1","created_at":"2026-07-05T11:31:35.082851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02822","created_at":"2026-07-05T11:31:35.082851+00:00"},{"alias_kind":"pith_short_12","alias_value":"53SJYYP4QVXS","created_at":"2026-07-05T11:31:35.082851+00:00"},{"alias_kind":"pith_short_16","alias_value":"53SJYYP4QVXSBM3D","created_at":"2026-07-05T11:31:35.082851+00:00"},{"alias_kind":"pith_short_8","alias_value":"53SJYYP4","created_at":"2026-07-05T11:31:35.082851+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10805","citing_title":"Reasoning Is Not Free: Robust Adaptive Cost-Efficient Routing for LLM-as-a-Judge","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ","json":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ.json","graph_json":"https://pith.science/api/pith-number/53SJYYP4QVXSBM3DKMFMU4GKYZ/graph.json","events_json":"https://pith.science/api/pith-number/53SJYYP4QVXSBM3DKMFMU4GKYZ/events.json","paper":"https://pith.science/paper/53SJYYP4"},"agent_actions":{"view_html":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ","download_json":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ.json","view_paper":"https://pith.science/paper/53SJYYP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02822&json=true","fetch_graph":"https://pith.science/api/pith-number/53SJYYP4QVXSBM3DKMFMU4GKYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/53SJYYP4QVXSBM3DKMFMU4GKYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ/action/storage_attestation","attest_author":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ/action/author_attestation","sign_citation":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ/action/citation_signature","submit_replication":"https://pith.science/pith/53SJYYP4QVXSBM3DKMFMU4GKYZ/action/replication_record"}},"created_at":"2026-07-05T11:31:35.082851+00:00","updated_at":"2026-07-05T11:31:35.082851+00:00"}