{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BMFEQIKJOZQEGZ7TJ3FUGRRWMU","short_pith_number":"pith:BMFEQIKJ","canonical_record":{"source":{"id":"1409.6052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-21T23:32:34Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"5887cb7ce5bf988be3b75cdebd008a812618d033aabccbefea60c7d9843bb3ec","abstract_canon_sha256":"857a70514c48a19c49866167b855aaee7f3dc65fb10a15d6ee1d619e19d67e43"},"schema_version":"1.0"},"canonical_sha256":"0b0a48214976604367f34ecb43463665184b1140c74f0ede5663817c23bc3e26","source":{"kind":"arxiv","id":"1409.6052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6052","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6052v1","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6052","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMFEQIKJOZQE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BMFEQIKJOZQEGZ7T","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BMFEQIKJ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BMFEQIKJOZQEGZ7TJ3FUGRRWMU","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-21T23:32:34Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"5887cb7ce5bf988be3b75cdebd008a812618d033aabccbefea60c7d9843bb3ec","abstract_canon_sha256":"857a70514c48a19c49866167b855aaee7f3dc65fb10a15d6ee1d619e19d67e43"},"schema_version":"1.0"},"canonical_sha256":"0b0a48214976604367f34ecb43463665184b1140c74f0ede5663817c23bc3e26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:44.715398Z","signature_b64":"dMmmJM451VdgENZ9cCV+/TUnliZFeVApt+O6V6fepK16bJ6hFOS7MutWpuIxAdk/2N0y8tLlJPB2pbY3kfMCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0a48214976604367f34ecb43463665184b1140c74f0ede5663817c23bc3e26","last_reissued_at":"2026-05-18T01:37:44.714738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:44.714738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6052","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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BK/kOwgP9SCGmvB0IfcwmM9D7M99dmBmnB7P3rj1sKtbYBpaIXly+8ZGfYO8gpnUDGKUv0SenpeMoNarTVDJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:49:04.176831Z"},"content_sha256":"b8823ae3902008d689b099ed1a3c57e0412df76ac1a590b347417e96b2c2d4c1","schema_version":"1.0","event_id":"sha256:b8823ae3902008d689b099ed1a3c57e0412df76ac1a590b347417e96b2c2d4c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BMFEQIKJOZQEGZ7TJ3FUGRRWMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oblivious Bounds on the Probability of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Dan Suciu, Wolfgang Gatterbauer","submitted_at":"2014-09-21T23:32:34Z","abstract_excerpt":"This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. when the new probabilities are chosen independent of the probabilities of all other variables. Our motivation comes from the weighted model counting problem (or, equivalently, the problem of computing the probability of a Boolean function), which is #P-hard in general. By performing several dissociati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6052","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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lYesOua5NigapEcILGrN4LUtUIDw2Jbhe52R5ce42fOu7DuLNr0V7r+tA4Kt/IopJW0I/V40hl7NrmsYasYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:49:04.177196Z"},"content_sha256":"cec0cb1b4e9dff7791b824fe51c4643af786b09c4f9461c7030d499fce402456","schema_version":"1.0","event_id":"sha256:cec0cb1b4e9dff7791b824fe51c4643af786b09c4f9461c7030d499fce402456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/bundle.json","state_url":"https://pith.science/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/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-05T17:49:04Z","links":{"resolver":"https://pith.science/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU","bundle":"https://pith.science/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/bundle.json","state":"https://pith.science/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMFEQIKJOZQEGZ7TJ3FUGRRWMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BMFEQIKJOZQEGZ7TJ3FUGRRWMU","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":"857a70514c48a19c49866167b855aaee7f3dc65fb10a15d6ee1d619e19d67e43","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-21T23:32:34Z","title_canon_sha256":"5887cb7ce5bf988be3b75cdebd008a812618d033aabccbefea60c7d9843bb3ec"},"schema_version":"1.0","source":{"id":"1409.6052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6052","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6052v1","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6052","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMFEQIKJOZQE","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BMFEQIKJOZQEGZ7T","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BMFEQIKJ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:cec0cb1b4e9dff7791b824fe51c4643af786b09c4f9461c7030d499fce402456","target":"graph","created_at":"2026-05-18T01:37:44Z","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 functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. when the new probabilities are chosen independent of the probabilities of all other variables. Our motivation comes from the weighted model counting problem (or, equivalently, the problem of computing the probability of a Boolean function), which is #P-hard in general. By performing several dissociati","authors_text":"Dan Suciu, Wolfgang Gatterbauer","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-21T23:32:34Z","title":"Oblivious Bounds on the Probability of Boolean Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6052","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:b8823ae3902008d689b099ed1a3c57e0412df76ac1a590b347417e96b2c2d4c1","target":"record","created_at":"2026-05-18T01:37:44Z","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":"857a70514c48a19c49866167b855aaee7f3dc65fb10a15d6ee1d619e19d67e43","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-09-21T23:32:34Z","title_canon_sha256":"5887cb7ce5bf988be3b75cdebd008a812618d033aabccbefea60c7d9843bb3ec"},"schema_version":"1.0","source":{"id":"1409.6052","kind":"arxiv","version":1}},"canonical_sha256":"0b0a48214976604367f34ecb43463665184b1140c74f0ede5663817c23bc3e26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b0a48214976604367f34ecb43463665184b1140c74f0ede5663817c23bc3e26","first_computed_at":"2026-05-18T01:37:44.714738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:44.714738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dMmmJM451VdgENZ9cCV+/TUnliZFeVApt+O6V6fepK16bJ6hFOS7MutWpuIxAdk/2N0y8tLlJPB2pbY3kfMCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:44.715398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8823ae3902008d689b099ed1a3c57e0412df76ac1a590b347417e96b2c2d4c1","sha256:cec0cb1b4e9dff7791b824fe51c4643af786b09c4f9461c7030d499fce402456"],"state_sha256":"6e929973420d1f326c381f97d45022ddfcc12f75f3fff4ce14eaf5ed59579c32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdVs3DNMbZvvywEYmUiKKnnq23Tobuc+3/bz3Vs9Wx14u1TVqI6KZV9Pn6Nw2e7dDSGJFD/ZPBKGd6LDG3LOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:49:04.179988Z","bundle_sha256":"8dc3a1faf729e251e25dfe174bf3020593fab8af1ace8aea87b96c20dcc288f9"}}