{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IK3YUOOST6XCEVB4NN3XOL4WYT","short_pith_number":"pith:IK3YUOOS","canonical_record":{"source":{"id":"1105.2813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-13T19:41:45Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"7a97dab393bdfcd3fd88c409215c64ca7501b7d5e9dff614a95e5725e7945ada","abstract_canon_sha256":"00d63c9b86b0c545aeb5254da001074703a6eb61f3ca448df86deaccfbaf0b39"},"schema_version":"1.0"},"canonical_sha256":"42b78a39d29fae22543c6b77772f96c4f56b9272a6136d0224e09b4aa8a7cdac","source":{"kind":"arxiv","id":"1105.2813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2813","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2813v1","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2813","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"IK3YUOOST6XC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IK3YUOOST6XCEVB4","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IK3YUOOS","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IK3YUOOST6XCEVB4NN3XOL4WYT","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-13T19:41:45Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"7a97dab393bdfcd3fd88c409215c64ca7501b7d5e9dff614a95e5725e7945ada","abstract_canon_sha256":"00d63c9b86b0c545aeb5254da001074703a6eb61f3ca448df86deaccfbaf0b39"},"schema_version":"1.0"},"canonical_sha256":"42b78a39d29fae22543c6b77772f96c4f56b9272a6136d0224e09b4aa8a7cdac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.255521Z","signature_b64":"O6mvY52SHGGdORsZ0AA2Aw6P6O7i9MraLSYgp4IdDLuzrfDLahHb9+017iI1vgc/citsCA3oMASIzHdlPIlxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b78a39d29fae22543c6b77772f96c4f56b9272a6136d0224e09b4aa8a7cdac","last_reissued_at":"2026-05-18T02:22:00.254673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.254673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2813","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:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpyKxAlMKy94jRSeuYsKA18Qa3vP3D4evHrFOBJgs4PXuQwLnhpGIIDLfJi6Oxttzb5Xl6vujXu9Dq2HkmxxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:55:17.666980Z"},"content_sha256":"a217a787b3ca3e26393d66451494ac5319d7639935641b1e66d5126ae9e311a5","schema_version":"1.0","event_id":"sha256:a217a787b3ca3e26393d66451494ac5319d7639935641b1e66d5126ae9e311a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IK3YUOOST6XCEVB4NN3XOL4WYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Dan Suciu, Wolfgang Gatterbauer","submitted_at":"2011-05-13T19:41:45Z","abstract_excerpt":"This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabilistic databases. We prove that the probabilities we assign to new variables are the best possible in some sense."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2813","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:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2/k6yYxlNfdHSGCM5V6wzp7YfjPz88/9dtZ236mnr4NzTtUg+1Kcx/QRSVNY7QLHmdlgNDgvbIoaEH3xj1IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:55:17.667822Z"},"content_sha256":"f9a3f84d9527553e5430ee62bc5317596bfb5996cb865b6305cd17ab5a8bf8b4","schema_version":"1.0","event_id":"sha256:f9a3f84d9527553e5430ee62bc5317596bfb5996cb865b6305cd17ab5a8bf8b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/bundle.json","state_url":"https://pith.science/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/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-19T01:55:17Z","links":{"resolver":"https://pith.science/pith/IK3YUOOST6XCEVB4NN3XOL4WYT","bundle":"https://pith.science/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/bundle.json","state":"https://pith.science/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IK3YUOOST6XCEVB4NN3XOL4WYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IK3YUOOST6XCEVB4NN3XOL4WYT","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":"00d63c9b86b0c545aeb5254da001074703a6eb61f3ca448df86deaccfbaf0b39","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-13T19:41:45Z","title_canon_sha256":"7a97dab393bdfcd3fd88c409215c64ca7501b7d5e9dff614a95e5725e7945ada"},"schema_version":"1.0","source":{"id":"1105.2813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2813","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2813v1","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2813","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"IK3YUOOST6XC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IK3YUOOST6XCEVB4","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IK3YUOOS","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:f9a3f84d9527553e5430ee62bc5317596bfb5996cb865b6305cd17ab5a8bf8b4","target":"graph","created_at":"2026-05-18T02:22: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":"This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabilistic databases. We prove that the probabilities we assign to new variables are the best possible in some sense.","authors_text":"Dan Suciu, Wolfgang Gatterbauer","cross_cats":["cs.DB","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-13T19:41:45Z","title":"Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2813","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:a217a787b3ca3e26393d66451494ac5319d7639935641b1e66d5126ae9e311a5","target":"record","created_at":"2026-05-18T02:22: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":"00d63c9b86b0c545aeb5254da001074703a6eb61f3ca448df86deaccfbaf0b39","cross_cats_sorted":["cs.DB","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-13T19:41:45Z","title_canon_sha256":"7a97dab393bdfcd3fd88c409215c64ca7501b7d5e9dff614a95e5725e7945ada"},"schema_version":"1.0","source":{"id":"1105.2813","kind":"arxiv","version":1}},"canonical_sha256":"42b78a39d29fae22543c6b77772f96c4f56b9272a6136d0224e09b4aa8a7cdac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b78a39d29fae22543c6b77772f96c4f56b9272a6136d0224e09b4aa8a7cdac","first_computed_at":"2026-05-18T02:22:00.254673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:00.254673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O6mvY52SHGGdORsZ0AA2Aw6P6O7i9MraLSYgp4IdDLuzrfDLahHb9+017iI1vgc/citsCA3oMASIzHdlPIlxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:00.255521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a217a787b3ca3e26393d66451494ac5319d7639935641b1e66d5126ae9e311a5","sha256:f9a3f84d9527553e5430ee62bc5317596bfb5996cb865b6305cd17ab5a8bf8b4"],"state_sha256":"af144d71301e9fb70056fd2ccee4e027c032c57f2301d1ed4b9e826d776c1665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NEvDShOwCX96CyFa5ysHrkp1ssA5TDMrG4D8awayh3rHUHVWjnqVLwHkDKJj8940XIFe5EXSoIBlfOXXa5gBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:55:17.670032Z","bundle_sha256":"4650720db277060754dec52f41e21ae1bb1f2171a55d83c5d14a140d53086e29"}}