{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XTXHSKF2RDMKV3GA3UXMHP3FMV","short_pith_number":"pith:XTXHSKF2","schema_version":"1.0","canonical_sha256":"bcee7928ba88d8aaecc0dd2ec3bf656555dfd4175eae4957cb06d48f25587a41","source":{"kind":"arxiv","id":"2412.10138","version":3},"attestation_state":"computed","paper":{"title":"ROUTE: Robust Multitask Tuning and Collaboration for Text-to-SQL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chao Chen, Dezhong Peng, Jieping Ye, Peng Hu, Yang Qin, Ze Chen, Zhihang Fu","submitted_at":"2024-12-13T13:41:18Z","abstract_excerpt":"Despite the significant advancements in Text-to-SQL (Text2SQL) facilitated by large language models (LLMs), the latest state-of-the-art techniques are still trapped in the in-context learning of closed-source LLMs (e.g., GPT-4), which limits their applicability in open scenarios. To address this challenge, we propose a novel RObust mUltitask Tuning and collaboration mEthod (ROUTE) to improve the comprehensive capabilities of open-source LLMs for Text2SQL, thereby providing a more practical solution. Our approach begins with multi-task supervised fine-tuning (SFT) using various synthetic traini"},"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":"2412.10138","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-12-13T13:41:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"164fdd8f6e5c23435ae58e26e73b1cbf5d8764c3df23001e8ff4d582f9265810","abstract_canon_sha256":"67bece3188cda729be54b4247aa7f236a90c7682bca94ed5ce0bd1dc67f31a62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:05.275582Z","signature_b64":"cV7YsttNn2Xmm7Kq0e0GpbaB6doRGK+QfMTrg2DVDlIBRJ1DqgVyV9GKnqmV5uCKWlgbBipunTiGGY8aiMOuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcee7928ba88d8aaecc0dd2ec3bf656555dfd4175eae4957cb06d48f25587a41","last_reissued_at":"2026-07-05T11:09:05.275118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:05.275118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ROUTE: Robust Multitask Tuning and Collaboration for Text-to-SQL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chao Chen, Dezhong Peng, Jieping Ye, Peng Hu, Yang Qin, Ze Chen, Zhihang Fu","submitted_at":"2024-12-13T13:41:18Z","abstract_excerpt":"Despite the significant advancements in Text-to-SQL (Text2SQL) facilitated by large language models (LLMs), the latest state-of-the-art techniques are still trapped in the in-context learning of closed-source LLMs (e.g., GPT-4), which limits their applicability in open scenarios. To address this challenge, we propose a novel RObust mUltitask Tuning and collaboration mEthod (ROUTE) to improve the comprehensive capabilities of open-source LLMs for Text2SQL, thereby providing a more practical solution. Our approach begins with multi-task supervised fine-tuning (SFT) using various synthetic traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10138","kind":"arxiv","version":3},"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/2412.10138/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":"2412.10138","created_at":"2026-07-05T11:09:05.275191+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10138v3","created_at":"2026-07-05T11:09:05.275191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10138","created_at":"2026-07-05T11:09:05.275191+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTXHSKF2RDMK","created_at":"2026-07-05T11:09:05.275191+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTXHSKF2RDMKV3GA","created_at":"2026-07-05T11:09:05.275191+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTXHSKF2","created_at":"2026-07-05T11:09:05.275191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04066","citing_title":"Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04065","citing_title":"Free Energy-Driven Reinforcement Learning with Adaptive Advantage Shaping for Unsupervised Reasoning in LLMs","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV","json":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV.json","graph_json":"https://pith.science/api/pith-number/XTXHSKF2RDMKV3GA3UXMHP3FMV/graph.json","events_json":"https://pith.science/api/pith-number/XTXHSKF2RDMKV3GA3UXMHP3FMV/events.json","paper":"https://pith.science/paper/XTXHSKF2"},"agent_actions":{"view_html":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV","download_json":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV.json","view_paper":"https://pith.science/paper/XTXHSKF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10138&json=true","fetch_graph":"https://pith.science/api/pith-number/XTXHSKF2RDMKV3GA3UXMHP3FMV/graph.json","fetch_events":"https://pith.science/api/pith-number/XTXHSKF2RDMKV3GA3UXMHP3FMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV/action/storage_attestation","attest_author":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV/action/author_attestation","sign_citation":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV/action/citation_signature","submit_replication":"https://pith.science/pith/XTXHSKF2RDMKV3GA3UXMHP3FMV/action/replication_record"}},"created_at":"2026-07-05T11:09:05.275191+00:00","updated_at":"2026-07-05T11:09:05.275191+00:00"}