{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UAL547SGQ7II2PFTP4LUSZ2TSX","short_pith_number":"pith:UAL547SG","schema_version":"1.0","canonical_sha256":"a017de7e4687d08d3cb37f1749675395e61563052dde570aacc888e862de6ed3","source":{"kind":"arxiv","id":"1904.03711","version":1},"attestation_state":"computed","paper":{"title":"Neo: A Learned Query Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chi Zhang, Hongzi Mao, Mohammad Alizadeh, Nesime Tatbul, Olga Papaemmanouil, Parimarjan Negi, Ryan Marcus, Tim Kraska","submitted_at":"2019-04-07T19:00:45Z","abstract_excerpt":"Query optimization is one of the most challenging problems in database systems. Despite the progress made over the past decades, query optimizers remain extremely complex components that require a great deal of hand-tuning for specific workloads and datasets. Motivated by this shortcoming and inspired by recent advances in applying machine learning to data management challenges, we introduce Neo (Neural Optimizer), a novel learning-based query optimizer that relies on deep neural networks to generate query executions plans. Neo bootstraps its query optimization model from existing optimizers a"},"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":"1904.03711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-07T19:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"7976ec466d94b2a3cc0d1a35c163d7917caecda0baab78fe313ba40f713d05c3","abstract_canon_sha256":"2c5980e3bd818e20449d4e87f7b7d4b3d8bbc1dc32ed9d7f9bf3c64d0342200b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:50.270389Z","signature_b64":"v7UrQB5xGGsSeWuKxgBODaX14dNJHMgl9d4rg4/WU1RS8GidephqTx54zF7oacDf/RilMdDhJAfytQ7alhuLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a017de7e4687d08d3cb37f1749675395e61563052dde570aacc888e862de6ed3","last_reissued_at":"2026-07-05T00:53:50.269908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:50.269908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neo: A Learned Query Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chi Zhang, Hongzi Mao, Mohammad Alizadeh, Nesime Tatbul, Olga Papaemmanouil, Parimarjan Negi, Ryan Marcus, Tim Kraska","submitted_at":"2019-04-07T19:00:45Z","abstract_excerpt":"Query optimization is one of the most challenging problems in database systems. Despite the progress made over the past decades, query optimizers remain extremely complex components that require a great deal of hand-tuning for specific workloads and datasets. Motivated by this shortcoming and inspired by recent advances in applying machine learning to data management challenges, we introduce Neo (Neural Optimizer), a novel learning-based query optimizer that relies on deep neural networks to generate query executions plans. Neo bootstraps its query optimization model from existing optimizers a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03711","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/1904.03711/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":"1904.03711","created_at":"2026-07-05T00:53:50.269964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03711v1","created_at":"2026-07-05T00:53:50.269964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03711","created_at":"2026-07-05T00:53:50.269964+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAL547SGQ7II","created_at":"2026-07-05T00:53:50.269964+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAL547SGQ7II2PFT","created_at":"2026-07-05T00:53:50.269964+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAL547SG","created_at":"2026-07-05T00:53:50.269964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01748","citing_title":"GATE: GPU-Accelerated Traffic Engineering for the WAN","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14725","citing_title":"RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX","json":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX.json","graph_json":"https://pith.science/api/pith-number/UAL547SGQ7II2PFTP4LUSZ2TSX/graph.json","events_json":"https://pith.science/api/pith-number/UAL547SGQ7II2PFTP4LUSZ2TSX/events.json","paper":"https://pith.science/paper/UAL547SG"},"agent_actions":{"view_html":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX","download_json":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX.json","view_paper":"https://pith.science/paper/UAL547SG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03711&json=true","fetch_graph":"https://pith.science/api/pith-number/UAL547SGQ7II2PFTP4LUSZ2TSX/graph.json","fetch_events":"https://pith.science/api/pith-number/UAL547SGQ7II2PFTP4LUSZ2TSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX/action/storage_attestation","attest_author":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX/action/author_attestation","sign_citation":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX/action/citation_signature","submit_replication":"https://pith.science/pith/UAL547SGQ7II2PFTP4LUSZ2TSX/action/replication_record"}},"created_at":"2026-07-05T00:53:50.269964+00:00","updated_at":"2026-07-05T00:53:50.269964+00:00"}