{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VJZZW2N2KX5DPD2QI7VJIAEJO5","short_pith_number":"pith:VJZZW2N2","schema_version":"1.0","canonical_sha256":"aa739b69ba55fa378f5047ea94008977722f4c1ea84e1926457878a75ab1abe3","source":{"kind":"arxiv","id":"2403.14902","version":1},"attestation_state":"computed","paper":{"title":"Hydro: Adaptive Query Processing of ML Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Aubhro Sengupta, Gaurav Tarlok Kakkar, Hyesoon Kim, Jiashen Cao, Joy Arulraj","submitted_at":"2024-03-22T01:17:07Z","abstract_excerpt":"Query optimization in relational database management systems (DBMSs) is critical for fast query processing. The query optimizer relies on precise selectivity and cost estimates to effectively optimize queries prior to execution. While this strategy is effective for relational DBMSs, it is not sufficient for DBMSs tailored for processing machine learning (ML) queries. In ML-centric DBMSs, query optimization is challenging for two reasons. First, the performance bottleneck of the queries shifts to user-defined functions (UDFs) that often wrap around deep learning models, making it difficult to 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":"2403.14902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-03-22T01:17:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9d43de67096945c237c8bae9544c07b2ef93eb1e5c98a80044204c7cacd87117","abstract_canon_sha256":"b269e3fa4d2efd7bf1d9e54fa28fc5a1c16237a22135a2ba7282447c15b3ad09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:27.512864Z","signature_b64":"FCA4IxLkCSM705w0ZqpWlgS/YYrEP62bZTdDhzJWZdwZT3okic10mjwAM+N/KIGgExF9UL7oCCWFEQPmofyOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa739b69ba55fa378f5047ea94008977722f4c1ea84e1926457878a75ab1abe3","last_reissued_at":"2026-07-05T07:59:27.512348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:27.512348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hydro: Adaptive Query Processing of ML Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Aubhro Sengupta, Gaurav Tarlok Kakkar, Hyesoon Kim, Jiashen Cao, Joy Arulraj","submitted_at":"2024-03-22T01:17:07Z","abstract_excerpt":"Query optimization in relational database management systems (DBMSs) is critical for fast query processing. The query optimizer relies on precise selectivity and cost estimates to effectively optimize queries prior to execution. While this strategy is effective for relational DBMSs, it is not sufficient for DBMSs tailored for processing machine learning (ML) queries. In ML-centric DBMSs, query optimization is challenging for two reasons. First, the performance bottleneck of the queries shifts to user-defined functions (UDFs) that often wrap around deep learning models, making it difficult to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14902","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/2403.14902/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":"2403.14902","created_at":"2026-07-05T07:59:27.512410+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14902v1","created_at":"2026-07-05T07:59:27.512410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14902","created_at":"2026-07-05T07:59:27.512410+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJZZW2N2KX5D","created_at":"2026-07-05T07:59:27.512410+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJZZW2N2KX5DPD2Q","created_at":"2026-07-05T07:59:27.512410+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJZZW2N2","created_at":"2026-07-05T07:59:27.512410+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14107","citing_title":"D\\'ej\\`a Vu: Efficient Video-Language Query Engine with Learning-based Inter-Frame Computation Reuse","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5","json":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5.json","graph_json":"https://pith.science/api/pith-number/VJZZW2N2KX5DPD2QI7VJIAEJO5/graph.json","events_json":"https://pith.science/api/pith-number/VJZZW2N2KX5DPD2QI7VJIAEJO5/events.json","paper":"https://pith.science/paper/VJZZW2N2"},"agent_actions":{"view_html":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5","download_json":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5.json","view_paper":"https://pith.science/paper/VJZZW2N2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14902&json=true","fetch_graph":"https://pith.science/api/pith-number/VJZZW2N2KX5DPD2QI7VJIAEJO5/graph.json","fetch_events":"https://pith.science/api/pith-number/VJZZW2N2KX5DPD2QI7VJIAEJO5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5/action/storage_attestation","attest_author":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5/action/author_attestation","sign_citation":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5/action/citation_signature","submit_replication":"https://pith.science/pith/VJZZW2N2KX5DPD2QI7VJIAEJO5/action/replication_record"}},"created_at":"2026-07-05T07:59:27.512410+00:00","updated_at":"2026-07-05T07:59:27.512410+00:00"}