{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SVHA2DH6Z4RVPNCQRHJVGRTQD6","short_pith_number":"pith:SVHA2DH6","schema_version":"1.0","canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","source":{"kind":"arxiv","id":"1901.01488","version":1},"attestation_state":"computed","paper":{"title":"Exact Selectivity Computation for Modern In-Memory Database Query Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alex Suhan, Florin Rusu, Jun Hyung Shin","submitted_at":"2019-01-06T02:20:57Z","abstract_excerpt":"Selectivity estimation remains a critical task in query optimization even after decades of research and industrial development. Optimizers rely on accurate selectivities when generating execution plans. They maintain a large range of statistical synopses for efficiently estimating selectivities. Nonetheless, small errors -- propagated exponentially -- can lead to severely sub-optimal plans---especially, for complex predicates. Database systems for modern computing architectures rely on extensive in-memory processing supported by massive multithread parallelism and vectorized instructions. Howe"},"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":"1901.01488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-06T02:20:57Z","cross_cats_sorted":[],"title_canon_sha256":"293d656584008e5b95e9dbf721d5815be96265a64aea9010fc802be6ab093cc2","abstract_canon_sha256":"076d9ad619607901e737978c67dfe8766825ee6c8dcd62099142e98ba37297b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.888050Z","signature_b64":"Llq55hFc2PTIqENhbGrtgXzTSpvDQ4TM/pO/Xmpovv/q0kz2eLCIiz4nXcsnVSBZcBInWTfVKAj9jcqW/5N7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","last_reissued_at":"2026-05-17T23:56:51.887524Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.887524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Selectivity Computation for Modern In-Memory Database Query Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alex Suhan, Florin Rusu, Jun Hyung Shin","submitted_at":"2019-01-06T02:20:57Z","abstract_excerpt":"Selectivity estimation remains a critical task in query optimization even after decades of research and industrial development. Optimizers rely on accurate selectivities when generating execution plans. They maintain a large range of statistical synopses for efficiently estimating selectivities. Nonetheless, small errors -- propagated exponentially -- can lead to severely sub-optimal plans---especially, for complex predicates. Database systems for modern computing architectures rely on extensive in-memory processing supported by massive multithread parallelism and vectorized instructions. Howe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01488","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":""},"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":"1901.01488","created_at":"2026-05-17T23:56:51.887602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01488v1","created_at":"2026-05-17T23:56:51.887602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01488","created_at":"2026-05-17T23:56:51.887602+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVHA2DH6Z4RV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVHA2DH6Z4RVPNCQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVHA2DH6","created_at":"2026-05-18T12:33:27.125529+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/SVHA2DH6Z4RVPNCQRHJVGRTQD6","json":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6.json","graph_json":"https://pith.science/api/pith-number/SVHA2DH6Z4RVPNCQRHJVGRTQD6/graph.json","events_json":"https://pith.science/api/pith-number/SVHA2DH6Z4RVPNCQRHJVGRTQD6/events.json","paper":"https://pith.science/paper/SVHA2DH6"},"agent_actions":{"view_html":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6","download_json":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6.json","view_paper":"https://pith.science/paper/SVHA2DH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01488&json=true","fetch_graph":"https://pith.science/api/pith-number/SVHA2DH6Z4RVPNCQRHJVGRTQD6/graph.json","fetch_events":"https://pith.science/api/pith-number/SVHA2DH6Z4RVPNCQRHJVGRTQD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/action/storage_attestation","attest_author":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/action/author_attestation","sign_citation":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/action/citation_signature","submit_replication":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/action/replication_record"}},"created_at":"2026-05-17T23:56:51.887602+00:00","updated_at":"2026-05-17T23:56:51.887602+00:00"}