{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZIFOZ3E4GWPCS3TXQUAX56BKM3","short_pith_number":"pith:ZIFOZ3E4","canonical_record":{"source":{"id":"1507.04955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-07-17T13:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"7cb3cbffa7f411934da9c251aeff5337862fde290d41030093829b41ec5747a3","abstract_canon_sha256":"6295532d5fd297ca94626914e1e1fc6f36c9988b06a5e23a1cbe2dc3e2913285"},"schema_version":"1.0"},"canonical_sha256":"ca0aecec9c359e296e7785017ef82a66dd68dcc6520a9922875e403f90cc9c6a","source":{"kind":"arxiv","id":"1507.04955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04955","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04955v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04955","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZIFOZ3E4GWPC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZIFOZ3E4GWPCS3TX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZIFOZ3E4","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZIFOZ3E4GWPCS3TXQUAX56BKM3","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-07-17T13:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"7cb3cbffa7f411934da9c251aeff5337862fde290d41030093829b41ec5747a3","abstract_canon_sha256":"6295532d5fd297ca94626914e1e1fc6f36c9988b06a5e23a1cbe2dc3e2913285"},"schema_version":"1.0"},"canonical_sha256":"ca0aecec9c359e296e7785017ef82a66dd68dcc6520a9922875e403f90cc9c6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.007786Z","signature_b64":"CC8G3x8s7EzU4KOjnWicoX22YUaZHedczFGJSZPtZEv1tmgm6BN8VL9qFvewAuP9VBCe2C0SaJMUVtEV4VAADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca0aecec9c359e296e7785017ef82a66dd68dcc6520a9922875e403f90cc9c6a","last_reissued_at":"2026-05-18T01:11:00.007247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.007247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04955","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOsMbaDjEPSFZWbRe8hbTKSUFkYEONoKzkXpNVJT8i10j8BLwDamOlRHJbguMfHy2iiKxrItCeDprMGsQKUbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:03:41.316885Z"},"content_sha256":"b28befe91405af6c1f3d4fd1922321e82ffaf61ad7788be0b49e9da7129f6161","schema_version":"1.0","event_id":"sha256:b28befe91405af6c1f3d4fd1922321e82ffaf61ad7788be0b49e9da7129f6161"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZIFOZ3E4GWPCS3TXQUAX56BKM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structurally Tractable Uncertain Data","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Antoine Amarilli","submitted_at":"2015-07-17T13:04:32Z","abstract_excerpt":"Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query possibility, certainty, or probability: these problems are hard on arbitrary uncertain input instances. We thus ask whether we could restrict the structure of uncertain data so as to guarantee the tractability of exact query evaluation. We present our tractability results for tree and tree-like uncertain data, and a vision for probabilistic rule reasoning. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04955","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-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1+yydHqPoDG3nuOeX6yMDOi2c/hRZy25SBI+yxH9HDyJzBcjbJJK/TiV21XOy87e/BcwZpOrLfyMrEq0Sm4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:03:41.317563Z"},"content_sha256":"9b082c62df0a065007c2f30e5401d2cd8d68e9d353869b8438504b6ec241d61d","schema_version":"1.0","event_id":"sha256:9b082c62df0a065007c2f30e5401d2cd8d68e9d353869b8438504b6ec241d61d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/bundle.json","state_url":"https://pith.science/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/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-25T18:03:41Z","links":{"resolver":"https://pith.science/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3","bundle":"https://pith.science/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/bundle.json","state":"https://pith.science/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIFOZ3E4GWPCS3TXQUAX56BKM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZIFOZ3E4GWPCS3TXQUAX56BKM3","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":"6295532d5fd297ca94626914e1e1fc6f36c9988b06a5e23a1cbe2dc3e2913285","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-07-17T13:04:32Z","title_canon_sha256":"7cb3cbffa7f411934da9c251aeff5337862fde290d41030093829b41ec5747a3"},"schema_version":"1.0","source":{"id":"1507.04955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04955","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04955v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04955","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZIFOZ3E4GWPC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZIFOZ3E4GWPCS3TX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZIFOZ3E4","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:9b082c62df0a065007c2f30e5401d2cd8d68e9d353869b8438504b6ec241d61d","target":"graph","created_at":"2026-05-18T01:11:00Z","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":"Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query possibility, certainty, or probability: these problems are hard on arbitrary uncertain input instances. We thus ask whether we could restrict the structure of uncertain data so as to guarantee the tractability of exact query evaluation. We present our tractability results for tree and tree-like uncertain data, and a vision for probabilistic rule reasoning. We als","authors_text":"Antoine Amarilli","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-07-17T13:04:32Z","title":"Structurally Tractable Uncertain Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04955","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:b28befe91405af6c1f3d4fd1922321e82ffaf61ad7788be0b49e9da7129f6161","target":"record","created_at":"2026-05-18T01:11:00Z","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":"6295532d5fd297ca94626914e1e1fc6f36c9988b06a5e23a1cbe2dc3e2913285","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-07-17T13:04:32Z","title_canon_sha256":"7cb3cbffa7f411934da9c251aeff5337862fde290d41030093829b41ec5747a3"},"schema_version":"1.0","source":{"id":"1507.04955","kind":"arxiv","version":1}},"canonical_sha256":"ca0aecec9c359e296e7785017ef82a66dd68dcc6520a9922875e403f90cc9c6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca0aecec9c359e296e7785017ef82a66dd68dcc6520a9922875e403f90cc9c6a","first_computed_at":"2026-05-18T01:11:00.007247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.007247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CC8G3x8s7EzU4KOjnWicoX22YUaZHedczFGJSZPtZEv1tmgm6BN8VL9qFvewAuP9VBCe2C0SaJMUVtEV4VAADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.007786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b28befe91405af6c1f3d4fd1922321e82ffaf61ad7788be0b49e9da7129f6161","sha256:9b082c62df0a065007c2f30e5401d2cd8d68e9d353869b8438504b6ec241d61d"],"state_sha256":"487b5ed37e90652404b974c71422c22dd2cc7c9c34cc0356a18ac274c962278a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXx7dP95rV5yXPekOkzaDcK/T6UWVXCZeQEifTE9dn4YB3XSVDhj182LqYOcOOL5OzWMQuKx2BjGsIEu3e//Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:03:41.321304Z","bundle_sha256":"31bfcc14522675787d1abf7de650cdb22b896fb16c585d809cc92eac60f19df1"}}