{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VIW7X2BLTFUKWNMWYWLHZQZ36V","short_pith_number":"pith:VIW7X2BL","schema_version":"1.0","canonical_sha256":"aa2dfbe82b9968ab3596c5967cc33bf546aa7342cb9511588a9028cdc05a7542","source":{"kind":"arxiv","id":"2507.00188","version":1},"attestation_state":"computed","paper":{"title":"LIMAO: A Framework for Lifelong Modular Learned Query Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ibrahim Sabek, Qihan Zhang, Shaolin Xie","submitted_at":"2025-06-30T18:58:20Z","abstract_excerpt":"Query optimizers are crucial for the performance of database systems. Recently, many learned query optimizers (LQOs) have demonstrated significant performance improvements over traditional optimizers. However, most of them operate under a limited assumption: a static query environment. This limitation prevents them from effectively handling complex, dynamic query environments in real-world scenarios. Extensive retraining can lead to the well-known catastrophic forgetting problem, which reduces the LQO generalizability over time. In this paper, we address this limitation and introduce LIMAO (Li"},"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":"2507.00188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-06-30T18:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"af0b5f93a51f1c38ee5bd1ca25aebfca5ed17fe0919f0e3f7e91c59ffbaecf9c","abstract_canon_sha256":"e974acbad32ae61363433f2a848b9d84a94342dbbded6c00ff446823f2ca123b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:38.809563Z","signature_b64":"HkwXKNdt8zS0AKsRGmpgNIwg2W1qUQCRiViSMukPFMhOvlTaAiJ1vKvH3F5kptkPtOGpWbQkuOPEG+VoRg/dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2dfbe82b9968ab3596c5967cc33bf546aa7342cb9511588a9028cdc05a7542","last_reissued_at":"2026-07-05T11:29:38.808977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:38.808977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LIMAO: A Framework for Lifelong Modular Learned Query Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ibrahim Sabek, Qihan Zhang, Shaolin Xie","submitted_at":"2025-06-30T18:58:20Z","abstract_excerpt":"Query optimizers are crucial for the performance of database systems. Recently, many learned query optimizers (LQOs) have demonstrated significant performance improvements over traditional optimizers. However, most of them operate under a limited assumption: a static query environment. This limitation prevents them from effectively handling complex, dynamic query environments in real-world scenarios. Extensive retraining can lead to the well-known catastrophic forgetting problem, which reduces the LQO generalizability over time. In this paper, we address this limitation and introduce LIMAO (Li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00188","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/2507.00188/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":"2507.00188","created_at":"2026-07-05T11:29:38.809051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00188v1","created_at":"2026-07-05T11:29:38.809051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00188","created_at":"2026-07-05T11:29:38.809051+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIW7X2BLTFUK","created_at":"2026-07-05T11:29:38.809051+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIW7X2BLTFUKWNMW","created_at":"2026-07-05T11:29:38.809051+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIW7X2BL","created_at":"2026-07-05T11:29:38.809051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08021","citing_title":"SynQL: A Controllable and Scalable Rule-Based Framework for SQL Workload Synthesis for Performance Benchmarking","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V","json":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V.json","graph_json":"https://pith.science/api/pith-number/VIW7X2BLTFUKWNMWYWLHZQZ36V/graph.json","events_json":"https://pith.science/api/pith-number/VIW7X2BLTFUKWNMWYWLHZQZ36V/events.json","paper":"https://pith.science/paper/VIW7X2BL"},"agent_actions":{"view_html":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V","download_json":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V.json","view_paper":"https://pith.science/paper/VIW7X2BL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00188&json=true","fetch_graph":"https://pith.science/api/pith-number/VIW7X2BLTFUKWNMWYWLHZQZ36V/graph.json","fetch_events":"https://pith.science/api/pith-number/VIW7X2BLTFUKWNMWYWLHZQZ36V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V/action/storage_attestation","attest_author":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V/action/author_attestation","sign_citation":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V/action/citation_signature","submit_replication":"https://pith.science/pith/VIW7X2BLTFUKWNMWYWLHZQZ36V/action/replication_record"}},"created_at":"2026-07-05T11:29:38.809051+00:00","updated_at":"2026-07-05T11:29:38.809051+00:00"}