{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LD6MRH73F7UWKLKY3WAUWGYNH3","short_pith_number":"pith:LD6MRH73","schema_version":"1.0","canonical_sha256":"58fcc89ffb2fe9652d58dd814b1b0d3ec26d01348666f8822bc3769cd6b06a5e","source":{"kind":"arxiv","id":"2410.17748","version":2},"attestation_state":"computed","paper":{"title":"Can Uncertainty Quantification Improve Learned Index Benefit Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Hao Xiong, Tao Yu, Zhaonian Zou","submitted_at":"2024-10-23T10:23:53Z","abstract_excerpt":"Index tuning is crucial for optimizing database performance by selecting optimal indexes based on workload. The key to this process lies in an accurate and efficient benefit estimator. Traditional methods relying on what-if tools often suffer from inefficiency and inaccuracy. In contrast, learning-based models provide a promising alternative but face challenges such as instability, lack of interpretability, and complex management. To overcome these limitations, we adopt a novel approach: quantifying the uncertainty in learning-based models' results, thereby combining the strengths of both trad"},"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":"2410.17748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-10-23T10:23:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"60d88ab50e0a979ea605a9a140c7b3f834f2f48a5e6b940d046d528930fb7382","abstract_canon_sha256":"1e643570fd6bf27f2e3586ddcca8f63e7b178f07324eaa43c9899de0426189b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:36.837290Z","signature_b64":"OTN15AtdfgH+828EnylXQGVMa7MgK6RCrUmNGTLy85p5QT8091rHXcTESsXclw4TgmqeslPwMUJuG5TN2nCvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58fcc89ffb2fe9652d58dd814b1b0d3ec26d01348666f8822bc3769cd6b06a5e","last_reissued_at":"2026-07-05T12:02:36.836826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:36.836826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Uncertainty Quantification Improve Learned Index Benefit Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Hao Xiong, Tao Yu, Zhaonian Zou","submitted_at":"2024-10-23T10:23:53Z","abstract_excerpt":"Index tuning is crucial for optimizing database performance by selecting optimal indexes based on workload. The key to this process lies in an accurate and efficient benefit estimator. Traditional methods relying on what-if tools often suffer from inefficiency and inaccuracy. In contrast, learning-based models provide a promising alternative but face challenges such as instability, lack of interpretability, and complex management. To overcome these limitations, we adopt a novel approach: quantifying the uncertainty in learning-based models' results, thereby combining the strengths of both trad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17748","kind":"arxiv","version":2},"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/2410.17748/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":"2410.17748","created_at":"2026-07-05T12:02:36.836886+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17748v2","created_at":"2026-07-05T12:02:36.836886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17748","created_at":"2026-07-05T12:02:36.836886+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD6MRH73F7UW","created_at":"2026-07-05T12:02:36.836886+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD6MRH73F7UWKLKY","created_at":"2026-07-05T12:02:36.836886+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD6MRH73","created_at":"2026-07-05T12:02:36.836886+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14837","citing_title":"SQL-Factory: A Multi-Agent Framework for High-Quality and Large-Scale SQL Generation","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3","json":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3.json","graph_json":"https://pith.science/api/pith-number/LD6MRH73F7UWKLKY3WAUWGYNH3/graph.json","events_json":"https://pith.science/api/pith-number/LD6MRH73F7UWKLKY3WAUWGYNH3/events.json","paper":"https://pith.science/paper/LD6MRH73"},"agent_actions":{"view_html":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3","download_json":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3.json","view_paper":"https://pith.science/paper/LD6MRH73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17748&json=true","fetch_graph":"https://pith.science/api/pith-number/LD6MRH73F7UWKLKY3WAUWGYNH3/graph.json","fetch_events":"https://pith.science/api/pith-number/LD6MRH73F7UWKLKY3WAUWGYNH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3/action/storage_attestation","attest_author":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3/action/author_attestation","sign_citation":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3/action/citation_signature","submit_replication":"https://pith.science/pith/LD6MRH73F7UWKLKY3WAUWGYNH3/action/replication_record"}},"created_at":"2026-07-05T12:02:36.836886+00:00","updated_at":"2026-07-05T12:02:36.836886+00:00"}