{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MABOV7LNGUGCQXU2AHDBFBEJYM","short_pith_number":"pith:MABOV7LN","schema_version":"1.0","canonical_sha256":"6002eafd6d350c285e9a01c6128489c30a9883e89b8d07040fd872412c37b21d","source":{"kind":"arxiv","id":"2412.02372","version":2},"attestation_state":"computed","paper":{"title":"HERO: Hint-Based Efficient and Reliable Query Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Sergey Iazov, Sergey Zinchenko","submitted_at":"2024-12-03T10:58:34Z","abstract_excerpt":"We propose a novel model for learned query optimization which provides query hints leading to better execution plans. The model addresses the three key challenges in learned hint-based query optimization: reliable hint recommendation (ensuring non-degradation of query latency), efficient hint exploration, and fast inference. We provide an in-depth analysis of existing NN-based approaches to hint-based optimization and experimentally confirm the named challenges for them. Our alternative solution consists of a new inference schema based on an ensemble of context-aware models and a graph storage"},"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":"2412.02372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-03T10:58:34Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"78f3daedc25ae727397e6e60ddf0f99c6b983d4c344639a8ce5e5d359a2ea81f","abstract_canon_sha256":"34d186e3b95f372056e19ba6b73b3fb01605725c2d47d462e18ada6207404ec3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:55.365699Z","signature_b64":"b8U6h/nR6Q19iAir+eYIZs821p9YVL65F9tcYr1ApV3IKHiqw0t6NO1DwXqsC4ngbcohFwlJ+fCvEqMWnFEiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6002eafd6d350c285e9a01c6128489c30a9883e89b8d07040fd872412c37b21d","last_reissued_at":"2026-07-05T09:44:55.365215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:55.365215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HERO: Hint-Based Efficient and Reliable Query Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Sergey Iazov, Sergey Zinchenko","submitted_at":"2024-12-03T10:58:34Z","abstract_excerpt":"We propose a novel model for learned query optimization which provides query hints leading to better execution plans. The model addresses the three key challenges in learned hint-based query optimization: reliable hint recommendation (ensuring non-degradation of query latency), efficient hint exploration, and fast inference. We provide an in-depth analysis of existing NN-based approaches to hint-based optimization and experimentally confirm the named challenges for them. Our alternative solution consists of a new inference schema based on an ensemble of context-aware models and a graph storage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02372","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/2412.02372/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":"2412.02372","created_at":"2026-07-05T09:44:55.365270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02372v2","created_at":"2026-07-05T09:44:55.365270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02372","created_at":"2026-07-05T09:44:55.365270+00:00"},{"alias_kind":"pith_short_12","alias_value":"MABOV7LNGUGC","created_at":"2026-07-05T09:44:55.365270+00:00"},{"alias_kind":"pith_short_16","alias_value":"MABOV7LNGUGCQXU2","created_at":"2026-07-05T09:44:55.365270+00:00"},{"alias_kind":"pith_short_8","alias_value":"MABOV7LN","created_at":"2026-07-05T09:44:55.365270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05853","citing_title":"Training-Free Query Optimization via LLM-Based Plan Similarity","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM","json":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM.json","graph_json":"https://pith.science/api/pith-number/MABOV7LNGUGCQXU2AHDBFBEJYM/graph.json","events_json":"https://pith.science/api/pith-number/MABOV7LNGUGCQXU2AHDBFBEJYM/events.json","paper":"https://pith.science/paper/MABOV7LN"},"agent_actions":{"view_html":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM","download_json":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM.json","view_paper":"https://pith.science/paper/MABOV7LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02372&json=true","fetch_graph":"https://pith.science/api/pith-number/MABOV7LNGUGCQXU2AHDBFBEJYM/graph.json","fetch_events":"https://pith.science/api/pith-number/MABOV7LNGUGCQXU2AHDBFBEJYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM/action/storage_attestation","attest_author":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM/action/author_attestation","sign_citation":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM/action/citation_signature","submit_replication":"https://pith.science/pith/MABOV7LNGUGCQXU2AHDBFBEJYM/action/replication_record"}},"created_at":"2026-07-05T09:44:55.365270+00:00","updated_at":"2026-07-05T09:44:55.365270+00:00"}