{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SVHA2DH6Z4RVPNCQRHJVGRTQD6","short_pith_number":"pith:SVHA2DH6","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"},"canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","source":{"kind":"arxiv","id":"1901.01488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01488","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01488v1","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01488","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"SVHA2DH6Z4RV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SVHA2DH6Z4RVPNCQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SVHA2DH6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SVHA2DH6Z4RVPNCQRHJVGRTQD6","target":"record","payload":{"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"},"canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","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"},"source_kind":"arxiv","source_id":"1901.01488","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-17T23:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6E1rsp+FMJ7YhSRYvXifof9ck+wKQSmv3TaLsgY6CpAy6fI5D/JkjGuTDLaj+oBfLbftOJLmWZNStnE8CohBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:03:25.876697Z"},"content_sha256":"298e2a06138461005e177dd6b739403dc74ff8caa06d9ea468309979c75ad65d","schema_version":"1.0","event_id":"sha256:298e2a06138461005e177dd6b739403dc74ff8caa06d9ea468309979c75ad65d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SVHA2DH6Z4RVPNCQRHJVGRTQD6","target":"graph","payload":{"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"},"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:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nGz80rDY/FoEBcH8qCLQZtgsSOGVaY/sXCYRwGQ29hyZXeC8y4fcqC3t6oECHCQrTPP2iJWtQHqoDvoLom9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:03:25.877103Z"},"content_sha256":"f61aaf551a52059817cf8eb6fa70f0fde73ebf80fd6d112795edf23bb9a47b4b","schema_version":"1.0","event_id":"sha256:f61aaf551a52059817cf8eb6fa70f0fde73ebf80fd6d112795edf23bb9a47b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/bundle.json","state_url":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/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-05-26T12:03:25Z","links":{"resolver":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6","bundle":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/bundle.json","state":"https://pith.science/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVHA2DH6Z4RVPNCQRHJVGRTQD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SVHA2DH6Z4RVPNCQRHJVGRTQD6","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":"076d9ad619607901e737978c67dfe8766825ee6c8dcd62099142e98ba37297b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-06T02:20:57Z","title_canon_sha256":"293d656584008e5b95e9dbf721d5815be96265a64aea9010fc802be6ab093cc2"},"schema_version":"1.0","source":{"id":"1901.01488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01488","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01488v1","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01488","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"SVHA2DH6Z4RV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SVHA2DH6Z4RVPNCQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SVHA2DH6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:f61aaf551a52059817cf8eb6fa70f0fde73ebf80fd6d112795edf23bb9a47b4b","target":"graph","created_at":"2026-05-17T23:56:51Z","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 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","authors_text":"Alex Suhan, Florin Rusu, Jun Hyung Shin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-06T02:20:57Z","title":"Exact Selectivity Computation for Modern In-Memory Database Query Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01488","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:298e2a06138461005e177dd6b739403dc74ff8caa06d9ea468309979c75ad65d","target":"record","created_at":"2026-05-17T23:56:51Z","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":"076d9ad619607901e737978c67dfe8766825ee6c8dcd62099142e98ba37297b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-06T02:20:57Z","title_canon_sha256":"293d656584008e5b95e9dbf721d5815be96265a64aea9010fc802be6ab093cc2"},"schema_version":"1.0","source":{"id":"1901.01488","kind":"arxiv","version":1}},"canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"954e0d0cfecf2357b45089d35346701f9e062a4feeebd23a264ee3d8417e4252","first_computed_at":"2026-05-17T23:56:51.887524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:51.887524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Llq55hFc2PTIqENhbGrtgXzTSpvDQ4TM/pO/Xmpovv/q0kz2eLCIiz4nXcsnVSBZcBInWTfVKAj9jcqW/5N7CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:51.888050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:298e2a06138461005e177dd6b739403dc74ff8caa06d9ea468309979c75ad65d","sha256:f61aaf551a52059817cf8eb6fa70f0fde73ebf80fd6d112795edf23bb9a47b4b"],"state_sha256":"d12c3d1a80df4f825fe72ab75b9ad42124824dfa84740fdc53a77889888ab1eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cuD0+2wHnsO4XXq5fxega6OcOUgYXT2UrVlNyJX8JE9EsQd+Xi/y9bYcNhcAH0Tfd7GoYl069vJmc/933SeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:03:25.879329Z","bundle_sha256":"463bd0690f4ff3b26684dacca36cc7860cf86851cb4f13530e2b33deb522b5f2"}}