{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WH6GQ4PNHE45TL7WFCXSECJFQW","short_pith_number":"pith:WH6GQ4PN","schema_version":"1.0","canonical_sha256":"b1fc6871ed3939d9aff628af22092585835b0c2a1dcc6a6a3ef080828d5a3bda","source":{"kind":"arxiv","id":"2302.06873","version":2},"attestation_state":"computed","paper":{"title":"Lero: A Learning-to-Rank Query Optimizer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Andreas Pfadler, Bolin Ding, Jingren Zhou, Rong Zhu, Wei Chen, Xingguang Chen, Ziniu Wu","submitted_at":"2023-02-14T07:31:11Z","abstract_excerpt":"A recent line of works apply machine learning techniques to assist or rebuild cost-based query optimizers in DBMS. While exhibiting superiority in some benchmarks, their deficiencies, e.g., unstable performance, high training cost, and slow model updating, stem from the inherent hardness of predicting the cost or latency of execution plans using machine learning models. In this paper, we introduce a learning-to-rank query optimizer, called Lero, which builds on top of a native query optimizer and continuously learns to improve the optimization performance. The key observation is that the relat"},"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":"2302.06873","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-02-14T07:31:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"42ba259dc31748537810872e5c9cc063b77040f526556d6a288837c9ef1bc247","abstract_canon_sha256":"2dc7aec262761802c6df9cf08ca6d5a135ccad24d8e56ffc7b6bfb9f942c60fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:20.257361Z","signature_b64":"1o+gpn7X2f+8IFicP51R54A28Nw/RQ0k6RWvaMqet32xDhqukHhUfgWIwL9aCv+/Xi5WwNe3MO+sApL//OFBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1fc6871ed3939d9aff628af22092585835b0c2a1dcc6a6a3ef080828d5a3bda","last_reissued_at":"2026-07-05T05:43:20.256924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:20.256924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lero: A Learning-to-Rank Query Optimizer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Andreas Pfadler, Bolin Ding, Jingren Zhou, Rong Zhu, Wei Chen, Xingguang Chen, Ziniu Wu","submitted_at":"2023-02-14T07:31:11Z","abstract_excerpt":"A recent line of works apply machine learning techniques to assist or rebuild cost-based query optimizers in DBMS. While exhibiting superiority in some benchmarks, their deficiencies, e.g., unstable performance, high training cost, and slow model updating, stem from the inherent hardness of predicting the cost or latency of execution plans using machine learning models. In this paper, we introduce a learning-to-rank query optimizer, called Lero, which builds on top of a native query optimizer and continuously learns to improve the optimization performance. The key observation is that the relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06873","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/2302.06873/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":"2302.06873","created_at":"2026-07-05T05:43:20.256980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06873v2","created_at":"2026-07-05T05:43:20.256980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06873","created_at":"2026-07-05T05:43:20.256980+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH6GQ4PNHE45","created_at":"2026-07-05T05:43:20.256980+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH6GQ4PNHE45TL7W","created_at":"2026-07-05T05:43:20.256980+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH6GQ4PN","created_at":"2026-07-05T05:43:20.256980+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW","json":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW.json","graph_json":"https://pith.science/api/pith-number/WH6GQ4PNHE45TL7WFCXSECJFQW/graph.json","events_json":"https://pith.science/api/pith-number/WH6GQ4PNHE45TL7WFCXSECJFQW/events.json","paper":"https://pith.science/paper/WH6GQ4PN"},"agent_actions":{"view_html":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW","download_json":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW.json","view_paper":"https://pith.science/paper/WH6GQ4PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06873&json=true","fetch_graph":"https://pith.science/api/pith-number/WH6GQ4PNHE45TL7WFCXSECJFQW/graph.json","fetch_events":"https://pith.science/api/pith-number/WH6GQ4PNHE45TL7WFCXSECJFQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW/action/storage_attestation","attest_author":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW/action/author_attestation","sign_citation":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW/action/citation_signature","submit_replication":"https://pith.science/pith/WH6GQ4PNHE45TL7WFCXSECJFQW/action/replication_record"}},"created_at":"2026-07-05T05:43:20.256980+00:00","updated_at":"2026-07-05T05:43:20.256980+00:00"}