{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OTMA6WQSVY2LWVFISW6UWZVSIH","short_pith_number":"pith:OTMA6WQS","schema_version":"1.0","canonical_sha256":"74d80f5a12ae34bb54a895bd4b66b241c912da262eaabd88288a6b5349894bd2","source":{"kind":"arxiv","id":"2607.02895","version":1},"attestation_state":"computed","paper":{"title":"Selectivity Estimation for Linear Queries via Online Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Debmalya Panigrahi, Fangzhu Shen, Sudeepa Roy","submitted_at":"2026-07-03T02:44:32Z","abstract_excerpt":"Learning-based approaches for selectivity estimation in databases have gained significant traction in recent years. However, theoretical studies of these learning-based approaches are essentially limited to fixed query distributions on static databases. In practice, both the underlying database and the query workload can dynamically change over time. In this work, we propose an algorithmic framework for learning selectivity of queries in this more general dynamic setup. Inspired by online learning, we measure the performance of the learning algorithm in this setting by its regret, which compar"},"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":"2607.02895","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-07-03T02:44:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e7b4a64b11625b199d001715c2edfea2b7e629a24d793690b4e9ff2cb7552af3","abstract_canon_sha256":"3aed61fe0596e1df624b784e607fc137e05ff07f616a2b39a82e8e1b402974f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:35.710039Z","signature_b64":"88zvMpyvQLucrQTXVyyu7wYtSQQo1yHU+E933lWrLLkpvyGaBdrF+eJTPvmb+2L8A/AwS8vTL2XKnn8pWCeDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74d80f5a12ae34bb54a895bd4b66b241c912da262eaabd88288a6b5349894bd2","last_reissued_at":"2026-07-07T01:16:35.709528Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:35.709528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selectivity Estimation for Linear Queries via Online Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Debmalya Panigrahi, Fangzhu Shen, Sudeepa Roy","submitted_at":"2026-07-03T02:44:32Z","abstract_excerpt":"Learning-based approaches for selectivity estimation in databases have gained significant traction in recent years. However, theoretical studies of these learning-based approaches are essentially limited to fixed query distributions on static databases. In practice, both the underlying database and the query workload can dynamically change over time. In this work, we propose an algorithmic framework for learning selectivity of queries in this more general dynamic setup. Inspired by online learning, we measure the performance of the learning algorithm in this setting by its regret, which compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02895","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/2607.02895/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":"2607.02895","created_at":"2026-07-07T01:16:35.709586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02895v1","created_at":"2026-07-07T01:16:35.709586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02895","created_at":"2026-07-07T01:16:35.709586+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTMA6WQSVY2L","created_at":"2026-07-07T01:16:35.709586+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTMA6WQSVY2LWVFI","created_at":"2026-07-07T01:16:35.709586+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTMA6WQS","created_at":"2026-07-07T01:16:35.709586+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/OTMA6WQSVY2LWVFISW6UWZVSIH","json":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH.json","graph_json":"https://pith.science/api/pith-number/OTMA6WQSVY2LWVFISW6UWZVSIH/graph.json","events_json":"https://pith.science/api/pith-number/OTMA6WQSVY2LWVFISW6UWZVSIH/events.json","paper":"https://pith.science/paper/OTMA6WQS"},"agent_actions":{"view_html":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH","download_json":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH.json","view_paper":"https://pith.science/paper/OTMA6WQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02895&json=true","fetch_graph":"https://pith.science/api/pith-number/OTMA6WQSVY2LWVFISW6UWZVSIH/graph.json","fetch_events":"https://pith.science/api/pith-number/OTMA6WQSVY2LWVFISW6UWZVSIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH/action/storage_attestation","attest_author":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH/action/author_attestation","sign_citation":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH/action/citation_signature","submit_replication":"https://pith.science/pith/OTMA6WQSVY2LWVFISW6UWZVSIH/action/replication_record"}},"created_at":"2026-07-07T01:16:35.709586+00:00","updated_at":"2026-07-07T01:16:35.709586+00:00"}