{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HZPB2PIORTF5PFLYRTHPBQPIME","short_pith_number":"pith:HZPB2PIO","schema_version":"1.0","canonical_sha256":"3e5e1d3d0e8ccbd795788ccef0c1e8611bb0b0282521b1fe04bbc34b6490ea2d","source":{"kind":"arxiv","id":"1310.6257","version":4},"attestation_state":"computed","paper":{"title":"Dissociation and Propagation for Approximate Lifted Inference with Standard Relational Database Management Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Wolfgang Gatterbauer","submitted_at":"2013-10-23T15:14:41Z","abstract_excerpt":"Probabilistic inference over large data sets is a challenging data management problem since exact inference is generally #P-hard and is most often solved approximately with sampling-based methods today. This paper proposes an alternative approach for approximate evaluation of conjunctive queries with standard relational databases: In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum. We provide an algorithm that takes into account important schema i"},"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":"1310.6257","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-23T15:14:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"05d41630733ef6e3ee907b66211993e65b91ca2682d162f3f885ecaf926718f7","abstract_canon_sha256":"26da657ac930fcc68b62471606a44f564090fe5e4845a2c9968aec3935871973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:31.029337Z","signature_b64":"/DpyLO1gkIrESqf6SnHrPQlGFKxhSoR27A0DdCMUXCbCzBrnnuDOntHuBOX7/bsEAAKM/PDx2T6enshupeYSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e5e1d3d0e8ccbd795788ccef0c1e8611bb0b0282521b1fe04bbc34b6490ea2d","last_reissued_at":"2026-05-18T01:12:31.028993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:31.028993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dissociation and Propagation for Approximate Lifted Inference with Standard Relational Database Management Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Wolfgang Gatterbauer","submitted_at":"2013-10-23T15:14:41Z","abstract_excerpt":"Probabilistic inference over large data sets is a challenging data management problem since exact inference is generally #P-hard and is most often solved approximately with sampling-based methods today. This paper proposes an alternative approach for approximate evaluation of conjunctive queries with standard relational databases: In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum. We provide an algorithm that takes into account important schema i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6257","kind":"arxiv","version":4},"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":"1310.6257","created_at":"2026-05-18T01:12:31.029041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6257v4","created_at":"2026-05-18T01:12:31.029041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6257","created_at":"2026-05-18T01:12:31.029041+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZPB2PIORTF5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZPB2PIORTF5PFLY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZPB2PIO","created_at":"2026-05-18T12:27:46.883200+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/HZPB2PIORTF5PFLYRTHPBQPIME","json":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME.json","graph_json":"https://pith.science/api/pith-number/HZPB2PIORTF5PFLYRTHPBQPIME/graph.json","events_json":"https://pith.science/api/pith-number/HZPB2PIORTF5PFLYRTHPBQPIME/events.json","paper":"https://pith.science/paper/HZPB2PIO"},"agent_actions":{"view_html":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME","download_json":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME.json","view_paper":"https://pith.science/paper/HZPB2PIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6257&json=true","fetch_graph":"https://pith.science/api/pith-number/HZPB2PIORTF5PFLYRTHPBQPIME/graph.json","fetch_events":"https://pith.science/api/pith-number/HZPB2PIORTF5PFLYRTHPBQPIME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME/action/storage_attestation","attest_author":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME/action/author_attestation","sign_citation":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME/action/citation_signature","submit_replication":"https://pith.science/pith/HZPB2PIORTF5PFLYRTHPBQPIME/action/replication_record"}},"created_at":"2026-05-18T01:12:31.029041+00:00","updated_at":"2026-05-18T01:12:31.029041+00:00"}