{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FGYDRAPOIUN4WOHJF7J27N6GSP","short_pith_number":"pith:FGYDRAPO","schema_version":"1.0","canonical_sha256":"29b03881ee451bcb38e92fd3afb7c693eaec30fbdc517949ff0449d0764fd38c","source":{"kind":"arxiv","id":"1812.10568","version":2},"attestation_state":"computed","paper":{"title":"QuickSel: Quick Selectivity Learning with Mixture Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Barzan Mozafari, Shucheng Zhong, Yongjoo Park","submitted_at":"2018-12-26T23:05:32Z","abstract_excerpt":"Estimating the selectivity of a query is a key step in almost any cost-based query optimizer. Most of today's databases rely on histograms or samples that are periodically refreshed by re-scanning the data as the underlying data changes. Since frequent scans are costly, these statistics are often stale and lead to poor selectivity estimates. As an alternative to scans, query-driven histograms have been proposed, which refine the histograms based on the actual selectivities of the observed queries. Unfortunately, these approaches are either too costly to use in practice---i.e., require an expon"},"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":"1812.10568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-12-26T23:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"67a58afcbd1334787d9f521bf7c0538633f14b07c23116c99d7155178c9a430d","abstract_canon_sha256":"7da044f26cd1e60a0f63bcebb8ad9436f9e3dbe01ed7b7a37282517162c0143a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:27.919162Z","signature_b64":"ycf3OXAEyGSWC7di3JDpOVIFufeXP+h5lXsJQc7bIgjRIkyLpfyo+hFAdleyohaI1VGQIpZpDr2Xx+MXaH6MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b03881ee451bcb38e92fd3afb7c693eaec30fbdc517949ff0449d0764fd38c","last_reissued_at":"2026-07-05T00:54:27.918815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:27.918815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QuickSel: Quick Selectivity Learning with Mixture Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Barzan Mozafari, Shucheng Zhong, Yongjoo Park","submitted_at":"2018-12-26T23:05:32Z","abstract_excerpt":"Estimating the selectivity of a query is a key step in almost any cost-based query optimizer. Most of today's databases rely on histograms or samples that are periodically refreshed by re-scanning the data as the underlying data changes. Since frequent scans are costly, these statistics are often stale and lead to poor selectivity estimates. As an alternative to scans, query-driven histograms have been proposed, which refine the histograms based on the actual selectivities of the observed queries. Unfortunately, these approaches are either too costly to use in practice---i.e., require an expon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10568","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/1812.10568/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":"1812.10568","created_at":"2026-07-05T00:54:27.918867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10568v2","created_at":"2026-07-05T00:54:27.918867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10568","created_at":"2026-07-05T00:54:27.918867+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGYDRAPOIUN4","created_at":"2026-07-05T00:54:27.918867+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGYDRAPOIUN4WOHJ","created_at":"2026-07-05T00:54:27.918867+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGYDRAPO","created_at":"2026-07-05T00:54:27.918867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05256","citing_title":"Learned Offline Query Planning via Bayesian Optimization","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP","json":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP.json","graph_json":"https://pith.science/api/pith-number/FGYDRAPOIUN4WOHJF7J27N6GSP/graph.json","events_json":"https://pith.science/api/pith-number/FGYDRAPOIUN4WOHJF7J27N6GSP/events.json","paper":"https://pith.science/paper/FGYDRAPO"},"agent_actions":{"view_html":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP","download_json":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP.json","view_paper":"https://pith.science/paper/FGYDRAPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10568&json=true","fetch_graph":"https://pith.science/api/pith-number/FGYDRAPOIUN4WOHJF7J27N6GSP/graph.json","fetch_events":"https://pith.science/api/pith-number/FGYDRAPOIUN4WOHJF7J27N6GSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP/action/storage_attestation","attest_author":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP/action/author_attestation","sign_citation":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP/action/citation_signature","submit_replication":"https://pith.science/pith/FGYDRAPOIUN4WOHJF7J27N6GSP/action/replication_record"}},"created_at":"2026-07-05T00:54:27.918867+00:00","updated_at":"2026-07-05T00:54:27.918867+00:00"}