{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NVNDM6JK3VU3TZFXNP7QFD7H3L","short_pith_number":"pith:NVNDM6JK","schema_version":"1.0","canonical_sha256":"6d5a36792add69b9e4b76bff028fe7dac18e96f956840be779d946eeb1388487","source":{"kind":"arxiv","id":"2404.12872","version":1},"attestation_state":"computed","paper":{"title":"LLM-R2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.DB","authors_text":"Gao Cong, Haitao Yuan, Huiming Wang, Lidong Bing, Zhaodonghui Li","submitted_at":"2024-04-19T13:17:07Z","abstract_excerpt":"Query rewrite, which aims to generate more efficient queries by altering a SQL query's structure without changing the query result, has been an important research problem. In order to maintain equivalence between the rewritten query and the original one during rewriting, traditional query rewrite methods always rewrite the queries following certain rewrite rules. However, some problems still remain. Firstly, existing methods of finding the optimal choice or sequence of rewrite rules are still limited and the process always costs a lot of resources. Methods involving discovering new rewrite rul"},"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":"2404.12872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-04-19T13:17:07Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"01effa75cc9e0cb7eabe13b70865e7cf25210d4c8f130d6b1a31a2c89df6b191","abstract_canon_sha256":"485288f93cbc3348d179a1fc33076e5df630ba80d0c1b8a066593c4e898c15b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:00.008951Z","signature_b64":"Vnl4JcTYTuTGVIoVjO3o25DOxbDrAbLQZNuT4S5h0ugu0qShra3dRF0HIb4yfsLjSZVgREw4n/25ZaFRrhalCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d5a36792add69b9e4b76bff028fe7dac18e96f956840be779d946eeb1388487","last_reissued_at":"2026-07-05T08:10:00.008488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:00.008488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-R2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.DB","authors_text":"Gao Cong, Haitao Yuan, Huiming Wang, Lidong Bing, Zhaodonghui Li","submitted_at":"2024-04-19T13:17:07Z","abstract_excerpt":"Query rewrite, which aims to generate more efficient queries by altering a SQL query's structure without changing the query result, has been an important research problem. In order to maintain equivalence between the rewritten query and the original one during rewriting, traditional query rewrite methods always rewrite the queries following certain rewrite rules. However, some problems still remain. Firstly, existing methods of finding the optimal choice or sequence of rewrite rules are still limited and the process always costs a lot of resources. Methods involving discovering new rewrite rul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12872","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/2404.12872/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":"2404.12872","created_at":"2026-07-05T08:10:00.008546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.12872v1","created_at":"2026-07-05T08:10:00.008546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12872","created_at":"2026-07-05T08:10:00.008546+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVNDM6JK3VU3","created_at":"2026-07-05T08:10:00.008546+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVNDM6JK3VU3TZFX","created_at":"2026-07-05T08:10:00.008546+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVNDM6JK","created_at":"2026-07-05T08:10:00.008546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23280","citing_title":"BCTuner: LLM-Guided Monte Carlo Tree Search for Efficient Blockchain Knob Tuning","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2503.04338","citing_title":"In-depth Analysis of Graph-based RAG in a Unified Framework","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26644","citing_title":"When to Vote, When to Rewrite: Disagreement-Guided Strategy Routing for Test-Time Scaling","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09944","citing_title":"PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L","json":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L.json","graph_json":"https://pith.science/api/pith-number/NVNDM6JK3VU3TZFXNP7QFD7H3L/graph.json","events_json":"https://pith.science/api/pith-number/NVNDM6JK3VU3TZFXNP7QFD7H3L/events.json","paper":"https://pith.science/paper/NVNDM6JK"},"agent_actions":{"view_html":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L","download_json":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L.json","view_paper":"https://pith.science/paper/NVNDM6JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.12872&json=true","fetch_graph":"https://pith.science/api/pith-number/NVNDM6JK3VU3TZFXNP7QFD7H3L/graph.json","fetch_events":"https://pith.science/api/pith-number/NVNDM6JK3VU3TZFXNP7QFD7H3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L/action/storage_attestation","attest_author":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L/action/author_attestation","sign_citation":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L/action/citation_signature","submit_replication":"https://pith.science/pith/NVNDM6JK3VU3TZFXNP7QFD7H3L/action/replication_record"}},"created_at":"2026-07-05T08:10:00.008546+00:00","updated_at":"2026-07-05T08:10:00.008546+00:00"}