{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:M5V3AKSKAAXFWBX47LTPIWXUSX","short_pith_number":"pith:M5V3AKSK","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"},"canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","source":{"kind":"arxiv","id":"1101.2613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2613","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2613v2","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2613","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"M5V3AKSKAAXF","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M5V3AKSKAAXFWBX4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M5V3AKSK","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:M5V3AKSKAAXFWBX47LTPIWXUSX","target":"record","payload":{"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"},"canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","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"},"source_kind":"arxiv","source_id":"1101.2613","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-18T02:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9KfPMbUz60OuesVp5SleIHqQxOun6Ir8UK+QtaaKr/1RwN3Z34yiPaVwsRhK8Bb3evegS7bbEmo5mMalh1iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:49:46.274684Z"},"content_sha256":"7323c8358fb1a61af05a63b4d405923f6450a9a765955f63e15ab222935357ce","schema_version":"1.0","event_id":"sha256:7323c8358fb1a61af05a63b4d405923f6450a9a765955f63e15ab222935357ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:M5V3AKSKAAXFWBX47LTPIWXUSX","target":"graph","payload":{"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"},"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:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3V+BxjUImYVuKyvk5Nf9Ou0OnRAw5yJbOh3bKXHw7MrcmCVrRuxf6QY7UZambK0g/1wqxD75mljI2PCTUn6vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:49:46.275300Z"},"content_sha256":"6977e466aee2306e233bff0c2f5be3151c499dec092d0d712f7978c979d639e6","schema_version":"1.0","event_id":"sha256:6977e466aee2306e233bff0c2f5be3151c499dec092d0d712f7978c979d639e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/bundle.json","state_url":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/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-02T19:49:46Z","links":{"resolver":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX","bundle":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/bundle.json","state":"https://pith.science/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5V3AKSKAAXFWBX47LTPIWXUSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:M5V3AKSKAAXFWBX47LTPIWXUSX","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":"78c0baeb601c72697164c45b6f58b9ca7281a9d4f47799c22e4f607061f676b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-01-13T17:32:01Z","title_canon_sha256":"db97d71c9ffd96224235bd33d5976ce44bcfbbadc487864fc306d7ad79081646"},"schema_version":"1.0","source":{"id":"1101.2613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2613","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2613v2","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2613","created_at":"2026-05-18T02:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"M5V3AKSKAAXF","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"M5V3AKSKAAXFWBX4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"M5V3AKSK","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:6977e466aee2306e233bff0c2f5be3151c499dec092d0d712f7978c979d639e6","target":"graph","created_at":"2026-05-18T02:22:57Z","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":"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","authors_text":"Andreas Zuefle, Hans-Peter Kriegel, Matthias Renz, Nikos Mamoulis, Thomas Bernecker, Tobias Emrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-01-13T17:32:01Z","title":"A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2613","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:7323c8358fb1a61af05a63b4d405923f6450a9a765955f63e15ab222935357ce","target":"record","created_at":"2026-05-18T02:22:57Z","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":"78c0baeb601c72697164c45b6f58b9ca7281a9d4f47799c22e4f607061f676b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-01-13T17:32:01Z","title_canon_sha256":"db97d71c9ffd96224235bd33d5976ce44bcfbbadc487864fc306d7ad79081646"},"schema_version":"1.0","source":{"id":"1101.2613","kind":"arxiv","version":2}},"canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"676bb02a4a002e5b06fcfae6f45af495c31777cd669b3bd9e2b7e3c5b7d26e3c","first_computed_at":"2026-05-18T02:22:57.840373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:57.840373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EssroSGA/ieavI4dET5apGAbPXI/Lx1a0MIbjtn6q3iPnOCswEUdKwKNq9NJAAi59cC85ZVtlTd3Xkc0PCmNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:57.840955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7323c8358fb1a61af05a63b4d405923f6450a9a765955f63e15ab222935357ce","sha256:6977e466aee2306e233bff0c2f5be3151c499dec092d0d712f7978c979d639e6"],"state_sha256":"18f6a0ea8e30d1b8744284ac5c0a2a7bfc99f80058aa09a2721a4b74a690a3e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9dzamNIDgWr1w58qNl8amfZgDQgsvh82nVmpKKrBlRnkENJ1lySVYbAaxxWBxw1FBbncxFOgccLjHWyeEZSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:49:46.277235Z","bundle_sha256":"89dc5031455165ded5f096e1ab765af9661bed9e87d7f1e4d1adbc940ff4931d"}}