{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SHTISS7R2UFOWC7IC2UG5OMYU4","short_pith_number":"pith:SHTISS7R","canonical_record":{"source":{"id":"1903.09999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-24T15:21:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f927d3a65001060c9ea2eaab836be6cbd83724a7a930e5eba9fecb696ec69516","abstract_canon_sha256":"b150ceaa135b10d01f7c553e28b5e0ef4dbdb8afb214292c842eb8d93bb5f913"},"schema_version":"1.0"},"canonical_sha256":"91e6894bf1d50aeb0be816a86eb998a7390fc3c4cba3693141d1bf935358ff95","source":{"kind":"arxiv","id":"1903.09999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09999","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09999v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09999","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"SHTISS7R2UFO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SHTISS7R2UFOWC7I","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SHTISS7R","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SHTISS7R2UFOWC7IC2UG5OMYU4","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-24T15:21:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f927d3a65001060c9ea2eaab836be6cbd83724a7a930e5eba9fecb696ec69516","abstract_canon_sha256":"b150ceaa135b10d01f7c553e28b5e0ef4dbdb8afb214292c842eb8d93bb5f913"},"schema_version":"1.0"},"canonical_sha256":"91e6894bf1d50aeb0be816a86eb998a7390fc3c4cba3693141d1bf935358ff95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.959723Z","signature_b64":"4e/9EROyyN4CX97BSLa7Dg/nS0i+8qWSoQ/IYRMPvgLf9SGbrEipsYf3wj6HuUKVZ5tdzEkPQ3sMhOqo9k2WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e6894bf1d50aeb0be816a86eb998a7390fc3c4cba3693141d1bf935358ff95","last_reissued_at":"2026-05-17T23:43:08.959221Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.959221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09999","source_version":2,"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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZX9wZm56fynb0jXW+Pz4DYGzFMRSULgRze+VGdLdcUPO54TUxWZUIEvwUF05e5qUjIwJUAPEdyGuBUTdqsNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:34.446970Z"},"content_sha256":"7d586d7b7c85c294efeb148f413b0de7898a17d2d75b30520adbf1dd67c6aff9","schema_version":"1.0","event_id":"sha256:7d586d7b7c85c294efeb148f413b0de7898a17d2d75b30520adbf1dd67c6aff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SHTISS7R2UFOWC7IC2UG5OMYU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Attribute Selectivity Estimation Using Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Gautam Das, Jees Augustine, Nick Koudas, Saravanan Thirumuruganathan, Shohedul Hasan","submitted_at":"2019-03-24T15:21:04Z","abstract_excerpt":"Selectivity estimation - the problem of estimating the result size of queries - is a fundamental problem in databases. Accurate estimation of query selectivity involving multiple correlated attributes is especially challenging. Poor cardinality estimates could result in the selection of bad plans by the query optimizer. We investigate the feasibility of using deep learning based approaches for both point and range queries and propose two complementary approaches. Our first approach considers selectivity as an unsupervised deep density estimation problem. We successfully introduce techniques fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09999","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":""},"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-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93AgmrU1xeJz5uEF2KMRAYe1EYdiZX5kW/NhKp+jtI43eaAIyZMET40iD+mgrSM9niaHMTGb6FfRPxW70xBODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:02:34.447646Z"},"content_sha256":"840ed6ae2b192df6b70c3d0a6b26a22a92c6c59c23b996b74ac0c47d5fed7dcd","schema_version":"1.0","event_id":"sha256:840ed6ae2b192df6b70c3d0a6b26a22a92c6c59c23b996b74ac0c47d5fed7dcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/bundle.json","state_url":"https://pith.science/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/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-06-08T17:02:34Z","links":{"resolver":"https://pith.science/pith/SHTISS7R2UFOWC7IC2UG5OMYU4","bundle":"https://pith.science/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/bundle.json","state":"https://pith.science/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHTISS7R2UFOWC7IC2UG5OMYU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SHTISS7R2UFOWC7IC2UG5OMYU4","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":"b150ceaa135b10d01f7c553e28b5e0ef4dbdb8afb214292c842eb8d93bb5f913","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-24T15:21:04Z","title_canon_sha256":"f927d3a65001060c9ea2eaab836be6cbd83724a7a930e5eba9fecb696ec69516"},"schema_version":"1.0","source":{"id":"1903.09999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09999","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09999v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09999","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"SHTISS7R2UFO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SHTISS7R2UFOWC7I","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SHTISS7R","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:840ed6ae2b192df6b70c3d0a6b26a22a92c6c59c23b996b74ac0c47d5fed7dcd","target":"graph","created_at":"2026-05-17T23:43:08Z","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 - the problem of estimating the result size of queries - is a fundamental problem in databases. Accurate estimation of query selectivity involving multiple correlated attributes is especially challenging. Poor cardinality estimates could result in the selection of bad plans by the query optimizer. We investigate the feasibility of using deep learning based approaches for both point and range queries and propose two complementary approaches. Our first approach considers selectivity as an unsupervised deep density estimation problem. We successfully introduce techniques fr","authors_text":"Gautam Das, Jees Augustine, Nick Koudas, Saravanan Thirumuruganathan, Shohedul Hasan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-24T15:21:04Z","title":"Multi-Attribute Selectivity Estimation Using Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09999","kind":"arxiv","version":2},"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:7d586d7b7c85c294efeb148f413b0de7898a17d2d75b30520adbf1dd67c6aff9","target":"record","created_at":"2026-05-17T23:43:08Z","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":"b150ceaa135b10d01f7c553e28b5e0ef4dbdb8afb214292c842eb8d93bb5f913","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-24T15:21:04Z","title_canon_sha256":"f927d3a65001060c9ea2eaab836be6cbd83724a7a930e5eba9fecb696ec69516"},"schema_version":"1.0","source":{"id":"1903.09999","kind":"arxiv","version":2}},"canonical_sha256":"91e6894bf1d50aeb0be816a86eb998a7390fc3c4cba3693141d1bf935358ff95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91e6894bf1d50aeb0be816a86eb998a7390fc3c4cba3693141d1bf935358ff95","first_computed_at":"2026-05-17T23:43:08.959221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.959221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4e/9EROyyN4CX97BSLa7Dg/nS0i+8qWSoQ/IYRMPvgLf9SGbrEipsYf3wj6HuUKVZ5tdzEkPQ3sMhOqo9k2WAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.959723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d586d7b7c85c294efeb148f413b0de7898a17d2d75b30520adbf1dd67c6aff9","sha256:840ed6ae2b192df6b70c3d0a6b26a22a92c6c59c23b996b74ac0c47d5fed7dcd"],"state_sha256":"8825d9f06aefc8e359d677ceed14f2b2af766227014e76c85f643e7e532fc7c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"He3WfxHNdWi1KpoBlTsn4OpBZLvfeVhG9Uaz2fGS3BgCvKJbvJiMmI/Xj+jSS/e2bYBUQteHDy9547CcAkvmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:02:34.452059Z","bundle_sha256":"a85c31178e77fa1a02366b79e3ca3d170fcfb59761f9bcc52644c0f46ae2c185"}}