{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZP57TAXTYXO2CUECOE6DKVJPWU","short_pith_number":"pith:ZP57TAXT","canonical_record":{"source":{"id":"1806.08384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-21T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"b0441c2876473ccd616ef2be700b57353446d28c4b79dc0164a52f11539b05a0","abstract_canon_sha256":"9615d1648daadea114ddff4009fa98de067ee3658a510ad76cc6415343fd405a"},"schema_version":"1.0"},"canonical_sha256":"cbfbf982f3c5dda15082713c35552fb53b433cf12233fe195991e28498f44324","source":{"kind":"arxiv","id":"1806.08384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08384","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08384v1","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08384","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZP57TAXTYXO2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZP57TAXTYXO2CUEC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZP57TAXT","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZP57TAXTYXO2CUECOE6DKVJPWU","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-21T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"b0441c2876473ccd616ef2be700b57353446d28c4b79dc0164a52f11539b05a0","abstract_canon_sha256":"9615d1648daadea114ddff4009fa98de067ee3658a510ad76cc6415343fd405a"},"schema_version":"1.0"},"canonical_sha256":"cbfbf982f3c5dda15082713c35552fb53b433cf12233fe195991e28498f44324","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:37.536791Z","signature_b64":"kzh5Ai3HN9sFCNdusrpZoh4BqUlPJxlRPD8x4oCoWoYPRGzIkhamlXZ/t3a4670OvRZikQB+MHLQ5Nla8zHiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbfbf982f3c5dda15082713c35552fb53b433cf12233fe195991e28498f44324","last_reissued_at":"2026-05-18T00:12:37.536040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:37.536040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08384","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBd0IjdBf1tm880+zQxnkbzyBLfKVDmf3iZ5mMK6MkTyTJe9VH35GODcMBWuX+gO2KjtiGSkR4aYsIFRxliXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:20:57.279058Z"},"content_sha256":"12f56e7374a896f8b3cc854f9866fde6b628105903236a1367c7dad6ca430ee1","schema_version":"1.0","event_id":"sha256:12f56e7374a896f8b3cc854f9866fde6b628105903236a1367c7dad6ca430ee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZP57TAXTYXO2CUECOE6DKVJPWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Selectivity Estimation Strategy for Modern DBMS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jun Hyung Shin","submitted_at":"2018-06-21T18:34:03Z","abstract_excerpt":"Selectivity estimation is important in query optimization, however accurate estimation is difficult when predicates are complex. Instead of existing database synopses and statistics not helpful for such cases, we introduce a new approach to compute the exact selectivity by running an aggregate query during the optimization phase. Exact selectivity can be achieved without significant overhead for in-memory and GPU-accelerated databases by adding extra query execution calls. We implement a selection push-down extension based on the novel selectivity estimation strategy in the MapD database syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08384","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sm6x13MwUMg5dyHP/8Iv7aJF0icvdGWu3NmM1f48OMs7jM0jGIxJ+u4/AgA2eSay5VKk8t/kzdBu76Gm8rgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:20:57.279439Z"},"content_sha256":"e1768e7ee3b4689b6eab24fb6f5c12a57906682bfd8e2e93d13450547a4ec605","schema_version":"1.0","event_id":"sha256:e1768e7ee3b4689b6eab24fb6f5c12a57906682bfd8e2e93d13450547a4ec605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/bundle.json","state_url":"https://pith.science/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T23:20:57Z","links":{"resolver":"https://pith.science/pith/ZP57TAXTYXO2CUECOE6DKVJPWU","bundle":"https://pith.science/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/bundle.json","state":"https://pith.science/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZP57TAXTYXO2CUECOE6DKVJPWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZP57TAXTYXO2CUECOE6DKVJPWU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9615d1648daadea114ddff4009fa98de067ee3658a510ad76cc6415343fd405a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-21T18:34:03Z","title_canon_sha256":"b0441c2876473ccd616ef2be700b57353446d28c4b79dc0164a52f11539b05a0"},"schema_version":"1.0","source":{"id":"1806.08384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08384","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08384v1","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08384","created_at":"2026-05-18T00:12:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZP57TAXTYXO2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZP57TAXTYXO2CUEC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZP57TAXT","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e1768e7ee3b4689b6eab24fb6f5c12a57906682bfd8e2e93d13450547a4ec605","target":"graph","created_at":"2026-05-18T00:12:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Selectivity estimation is important in query optimization, however accurate estimation is difficult when predicates are complex. Instead of existing database synopses and statistics not helpful for such cases, we introduce a new approach to compute the exact selectivity by running an aggregate query during the optimization phase. Exact selectivity can be achieved without significant overhead for in-memory and GPU-accelerated databases by adding extra query execution calls. We implement a selection push-down extension based on the novel selectivity estimation strategy in the MapD database syste","authors_text":"Jun Hyung Shin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-21T18:34:03Z","title":"Novel Selectivity Estimation Strategy for Modern DBMS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08384","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:12f56e7374a896f8b3cc854f9866fde6b628105903236a1367c7dad6ca430ee1","target":"record","created_at":"2026-05-18T00:12:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9615d1648daadea114ddff4009fa98de067ee3658a510ad76cc6415343fd405a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-06-21T18:34:03Z","title_canon_sha256":"b0441c2876473ccd616ef2be700b57353446d28c4b79dc0164a52f11539b05a0"},"schema_version":"1.0","source":{"id":"1806.08384","kind":"arxiv","version":1}},"canonical_sha256":"cbfbf982f3c5dda15082713c35552fb53b433cf12233fe195991e28498f44324","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbfbf982f3c5dda15082713c35552fb53b433cf12233fe195991e28498f44324","first_computed_at":"2026-05-18T00:12:37.536040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:37.536040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kzh5Ai3HN9sFCNdusrpZoh4BqUlPJxlRPD8x4oCoWoYPRGzIkhamlXZ/t3a4670OvRZikQB+MHLQ5Nla8zHiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:37.536791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12f56e7374a896f8b3cc854f9866fde6b628105903236a1367c7dad6ca430ee1","sha256:e1768e7ee3b4689b6eab24fb6f5c12a57906682bfd8e2e93d13450547a4ec605"],"state_sha256":"aa71dc296204d6a60c4fe6a4b4481c1039d190240b85717c70aeb85aece037b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1KfmxagqMNZRmw1E5UfXXpr+lnxNcLvQd+lvohAlAPmTwwVVE+3KM4ZmH+M58cvBbb0929aNvBLDpIYrtsIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:20:57.282832Z","bundle_sha256":"4fba23e9a438255dd7b59dcf02a9c39a3f36e2bc78926969f95a6274b5489954"}}