{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3XBEKU5NRQWJCXJC7KOTF7NAZU","short_pith_number":"pith:3XBEKU5N","schema_version":"1.0","canonical_sha256":"ddc24553ad8c2c915d22fa9d32fda0cd225e69addccef55be5bd54bc615e4fa6","source":{"kind":"arxiv","id":"2401.02115","version":1},"attestation_state":"computed","paper":{"title":"Using LLM to select the right SQL Query from candidates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tao Xie, Zhenwen Li","submitted_at":"2024-01-04T07:50:24Z","abstract_excerpt":"Text-to-SQL models can generate a list of candidate SQL queries, and the best query is often in the candidate list, but not at the top of the list. An effective re-rank method can select the right SQL query from the candidate list and improve the model's performance. Previous studies on code generation automatically generate test cases and use them to re-rank candidate codes. However, automatic test case generation for text-to-SQL is an understudied field. We propose an automatic test case generation method that first generates a database and then uses LLMs to predict the ground truth, which i"},"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":"2401.02115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-01-04T07:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"ccc02f2dadeec07ce30c16fc100127defcff8a4ae83ddd17740b0095c7541641","abstract_canon_sha256":"d4a5cb2903e1e7e9656cf8e17fa19e61469d20829ce9766abab45e3aa05281a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:11.450974Z","signature_b64":"KZehO/uISI75SbvJfa8SIwpYsF8p6t0iNxY5JPSuqqL20TXXQ34BX74QPGRKPPZnAgJpYcD6Tqk60OYtPPg6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc24553ad8c2c915d22fa9d32fda0cd225e69addccef55be5bd54bc615e4fa6","last_reissued_at":"2026-07-05T07:30:11.450454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:11.450454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using LLM to select the right SQL Query from candidates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Tao Xie, Zhenwen Li","submitted_at":"2024-01-04T07:50:24Z","abstract_excerpt":"Text-to-SQL models can generate a list of candidate SQL queries, and the best query is often in the candidate list, but not at the top of the list. An effective re-rank method can select the right SQL query from the candidate list and improve the model's performance. Previous studies on code generation automatically generate test cases and use them to re-rank candidate codes. However, automatic test case generation for text-to-SQL is an understudied field. We propose an automatic test case generation method that first generates a database and then uses LLMs to predict the ground truth, which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02115","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/2401.02115/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":"2401.02115","created_at":"2026-07-05T07:30:11.450509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.02115v1","created_at":"2026-07-05T07:30:11.450509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02115","created_at":"2026-07-05T07:30:11.450509+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XBEKU5NRQWJ","created_at":"2026-07-05T07:30:11.450509+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XBEKU5NRQWJCXJC","created_at":"2026-07-05T07:30:11.450509+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XBEKU5N","created_at":"2026-07-05T07:30:11.450509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.12610","citing_title":"ScaleDoc: Scaling LLM-based Predicates over Large Document Collections","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04066","citing_title":"Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning","ref_index":199,"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":214,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU","json":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU.json","graph_json":"https://pith.science/api/pith-number/3XBEKU5NRQWJCXJC7KOTF7NAZU/graph.json","events_json":"https://pith.science/api/pith-number/3XBEKU5NRQWJCXJC7KOTF7NAZU/events.json","paper":"https://pith.science/paper/3XBEKU5N"},"agent_actions":{"view_html":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU","download_json":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU.json","view_paper":"https://pith.science/paper/3XBEKU5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.02115&json=true","fetch_graph":"https://pith.science/api/pith-number/3XBEKU5NRQWJCXJC7KOTF7NAZU/graph.json","fetch_events":"https://pith.science/api/pith-number/3XBEKU5NRQWJCXJC7KOTF7NAZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU/action/storage_attestation","attest_author":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU/action/author_attestation","sign_citation":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU/action/citation_signature","submit_replication":"https://pith.science/pith/3XBEKU5NRQWJCXJC7KOTF7NAZU/action/replication_record"}},"created_at":"2026-07-05T07:30:11.450509+00:00","updated_at":"2026-07-05T07:30:11.450509+00:00"}