{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:M5V3AKSKAAXFWBX47LTPIWXUSX","short_pith_number":"pith:M5V3AKSK","schema_version":"1.0","canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","source":{"kind":"arxiv","id":"1101.2613","version":2},"attestation_state":"computed","paper":{"title":"A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Zuefle, Hans-Peter Kriegel, Matthias Renz, Nikos Mamoulis, Thomas Bernecker, Tobias Emrich","submitted_at":"2011-01-13T17:32:01Z","abstract_excerpt":"In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach supports a general uncertainty model using continuous probabilistic density functions to describe the (possibly correlated) uncertain attributes of objects. In a nutshell, the problem to be solved is to compute the PDF of the random variable denoted by the probabilistic domination count: Given an uncertain database object B, an uncertain reference object R and a set D of uncertain database objects in a multi-dimensional space, the proba"},"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":"1101.2613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-01-13T17:32:01Z","cross_cats_sorted":[],"title_canon_sha256":"db97d71c9ffd96224235bd33d5976ce44bcfbbadc487864fc306d7ad79081646","abstract_canon_sha256":"78c0baeb601c72697164c45b6f58b9ca7281a9d4f47799c22e4f607061f676b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:57.840955Z","signature_b64":"EssroSGA/ieavI4dET5apGAbPXI/Lx1a0MIbjtn6q3iPnOCswEUdKwKNq9NJAAi59cC85ZVtlTd3Xkc0PCmNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","last_reissued_at":"2026-05-18T02:22:57.840373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:57.840373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Zuefle, Hans-Peter Kriegel, Matthias Renz, Nikos Mamoulis, Thomas Bernecker, Tobias Emrich","submitted_at":"2011-01-13T17:32:01Z","abstract_excerpt":"In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach supports a general uncertainty model using continuous probabilistic density functions to describe the (possibly correlated) uncertain attributes of objects. In a nutshell, the problem to be solved is to compute the PDF of the random variable denoted by the probabilistic domination count: Given an uncertain database object B, an uncertain reference object R and a set D of uncertain database objects in a multi-dimensional space, the proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2613","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2613","created_at":"2026-05-18T02:22:57.840447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2613v2","created_at":"2026-05-18T02:22:57.840447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2613","created_at":"2026-05-18T02:22:57.840447+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5V3AKSKAAXF","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5V3AKSKAAXFWBX4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5V3AKSK","created_at":"2026-05-18T12:26:34.985390+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/M5V3AKSKAAXFWBX47LTPIWXUSX","json":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX.json","graph_json":"https://pith.science/api/pith-number/M5V3AKSKAAXFWBX47LTPIWXUSX/graph.json","events_json":"https://pith.science/api/pith-number/M5V3AKSKAAXFWBX47LTPIWXUSX/events.json","paper":"https://pith.science/paper/M5V3AKSK"},"agent_actions":{"view_html":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX","download_json":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX.json","view_paper":"https://pith.science/paper/M5V3AKSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2613&json=true","fetch_graph":"https://pith.science/api/pith-number/M5V3AKSKAAXFWBX47LTPIWXUSX/graph.json","fetch_events":"https://pith.science/api/pith-number/M5V3AKSKAAXFWBX47LTPIWXUSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/action/storage_attestation","attest_author":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/action/author_attestation","sign_citation":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/action/citation_signature","submit_replication":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/action/replication_record"}},"created_at":"2026-05-18T02:22:57.840447+00:00","updated_at":"2026-05-18T02:22:57.840447+00:00"}