{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HOTV6JVS3TU3Z4PIBH4Q2VK7N2","short_pith_number":"pith:HOTV6JVS","canonical_record":{"source":{"id":"1411.3374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-12T22:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"3b5e7b90ca5a9420b4f68c2920457daa09ef8993fee329f2465361411850b54a","abstract_canon_sha256":"d63b38abcd33725a4c7f11bb10b42367f1e815fff32a6f61a00211f1d047dc2d"},"schema_version":"1.0"},"canonical_sha256":"3ba75f26b2dce9bcf1e809f90d555f6ea967bdaf3748a36d76e4852b0109554b","source":{"kind":"arxiv","id":"1411.3374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3374","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3374v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3374","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"HOTV6JVS3TU3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOTV6JVS3TU3Z4PI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOTV6JVS","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HOTV6JVS3TU3Z4PIBH4Q2VK7N2","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-12T22:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"3b5e7b90ca5a9420b4f68c2920457daa09ef8993fee329f2465361411850b54a","abstract_canon_sha256":"d63b38abcd33725a4c7f11bb10b42367f1e815fff32a6f61a00211f1d047dc2d"},"schema_version":"1.0"},"canonical_sha256":"3ba75f26b2dce9bcf1e809f90d555f6ea967bdaf3748a36d76e4852b0109554b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.948819Z","signature_b64":"7hf+3j6z1cZgodNfo3O+r4c2ZPUb51kQtIDxfzFldq1Y2pvS6oO+cjtSX4yNi3/lECR0FzjsfVpfehYF4kVzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba75f26b2dce9bcf1e809f90d555f6ea967bdaf3748a36d76e4852b0109554b","last_reissued_at":"2026-05-18T02:37:43.948223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.948223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3374","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dsw6cqIbcTqttAPp4FAGkQ/S+NiJ5Ta6yIixUDjE6oNADuuTfYLBjGb4NIACxD10yBpWy4aD2HMlxGbF+PECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:15:42.675975Z"},"content_sha256":"c4176202297c7591f845dfaec314d743f4257bc84a6fab6631b3383ed766e5e1","schema_version":"1.0","event_id":"sha256:c4176202297c7591f845dfaec314d743f4257bc84a6fab6631b3383ed766e5e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HOTV6JVS3TU3Z4PIBH4Q2VK7N2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Correlations for Expensive Predicate Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aditya Parameswaran, Christopher Re, Hector Garcia-Molina, Manas Joglekar","submitted_at":"2014-11-12T22:00:08Z","abstract_excerpt":"User Defined Function(UDFs) are used increasingly to augment query languages with extra, application dependent functionality. Selection queries involving UDF predicates tend to be expensive, either in terms of monetary cost or latency. In this paper, we study ways to efficiently evaluate selection queries with UDF predicates. We provide a family of techniques for processing queries at low cost while satisfying user-specified precision and recall constraints. Our techniques are applicable to a variety of scenarios including when selection probabilities of tuples are available beforehand, when t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3374","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7ipqGziVDgqoYLWmlabkyswd+Qr8j/XlnA6hGznOeur2t2J8DyYwtU6EL0mUCvor3CPOvX1OZWBGkVW6YkZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:15:42.676574Z"},"content_sha256":"8bd679ea3caaeecaafbbc24e7e5bfb45b88bd75b2a627870aa5b0c5dd8e32608","schema_version":"1.0","event_id":"sha256:8bd679ea3caaeecaafbbc24e7e5bfb45b88bd75b2a627870aa5b0c5dd8e32608"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/bundle.json","state_url":"https://pith.science/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/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-06T04:15:42Z","links":{"resolver":"https://pith.science/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2","bundle":"https://pith.science/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/bundle.json","state":"https://pith.science/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOTV6JVS3TU3Z4PIBH4Q2VK7N2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HOTV6JVS3TU3Z4PIBH4Q2VK7N2","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":"d63b38abcd33725a4c7f11bb10b42367f1e815fff32a6f61a00211f1d047dc2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-12T22:00:08Z","title_canon_sha256":"3b5e7b90ca5a9420b4f68c2920457daa09ef8993fee329f2465361411850b54a"},"schema_version":"1.0","source":{"id":"1411.3374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3374","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3374v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3374","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"HOTV6JVS3TU3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HOTV6JVS3TU3Z4PI","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HOTV6JVS","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:8bd679ea3caaeecaafbbc24e7e5bfb45b88bd75b2a627870aa5b0c5dd8e32608","target":"graph","created_at":"2026-05-18T02:37:43Z","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":"User Defined Function(UDFs) are used increasingly to augment query languages with extra, application dependent functionality. Selection queries involving UDF predicates tend to be expensive, either in terms of monetary cost or latency. In this paper, we study ways to efficiently evaluate selection queries with UDF predicates. We provide a family of techniques for processing queries at low cost while satisfying user-specified precision and recall constraints. Our techniques are applicable to a variety of scenarios including when selection probabilities of tuples are available beforehand, when t","authors_text":"Aditya Parameswaran, Christopher Re, Hector Garcia-Molina, Manas Joglekar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-12T22:00:08Z","title":"Exploiting Correlations for Expensive Predicate Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3374","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:c4176202297c7591f845dfaec314d743f4257bc84a6fab6631b3383ed766e5e1","target":"record","created_at":"2026-05-18T02:37:43Z","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":"d63b38abcd33725a4c7f11bb10b42367f1e815fff32a6f61a00211f1d047dc2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-12T22:00:08Z","title_canon_sha256":"3b5e7b90ca5a9420b4f68c2920457daa09ef8993fee329f2465361411850b54a"},"schema_version":"1.0","source":{"id":"1411.3374","kind":"arxiv","version":1}},"canonical_sha256":"3ba75f26b2dce9bcf1e809f90d555f6ea967bdaf3748a36d76e4852b0109554b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba75f26b2dce9bcf1e809f90d555f6ea967bdaf3748a36d76e4852b0109554b","first_computed_at":"2026-05-18T02:37:43.948223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.948223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hf+3j6z1cZgodNfo3O+r4c2ZPUb51kQtIDxfzFldq1Y2pvS6oO+cjtSX4yNi3/lECR0FzjsfVpfehYF4kVzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.948819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4176202297c7591f845dfaec314d743f4257bc84a6fab6631b3383ed766e5e1","sha256:8bd679ea3caaeecaafbbc24e7e5bfb45b88bd75b2a627870aa5b0c5dd8e32608"],"state_sha256":"2e87c07eb15d54ab0bd33ef58cc34186f8a0aab7b731295c831aba62659ec0aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIMh0e/DtdFTICAhrKiPEmtM8nK8J48v2tHLYBrdzTMhmOc/r3su6P2NWbbB7Nu10Cw9cwlLSecWseHoY1uPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T04:15:42.679906Z","bundle_sha256":"aec005af0a7d150d8bc3e49372c3559c48d9340b86b33e329d9ab13ce0235f48"}}