{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TB3F47DB3PR2YJLWOL2OWXFDVD","short_pith_number":"pith:TB3F47DB","schema_version":"1.0","canonical_sha256":"98765e7c61dbe3ac257672f4eb5ca3a8dda4c067f403fcb12514a14c0c6089ba","source":{"kind":"arxiv","id":"1412.1069","version":1},"attestation_state":"computed","paper":{"title":"Approximate Lifted Inference with Probabilistic Databases","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":"2014-12-02T20:58:20Z","abstract_excerpt":"This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic 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 information to enumerate only the minimal necessary plans among all possible plans. Importantly, this algorithm is a strict generalization of all known results of PTIME self-join-free conjunctive queries: A query is safe if"},"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":"1412.1069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-02T20:58:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c74eca05cd878b2479986d30a014e232122bd1c28790d8ad15c07b301aef45ff","abstract_canon_sha256":"905122dcd73d66ca0237cff7d4c4c5ec2bd30cb1367f07ad207f3635e681918b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:14.974146Z","signature_b64":"h91hp/RduWq13flxUCUDB+Iu0DZDSsMIfXpRwKpfLWOoQT3HWes2PvI5ivp6siBjEp0Q6XVHHlx51oP3myyKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98765e7c61dbe3ac257672f4eb5ca3a8dda4c067f403fcb12514a14c0c6089ba","last_reissued_at":"2026-05-18T02:32:14.973603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:14.973603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Lifted Inference with Probabilistic Databases","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":"2014-12-02T20:58:20Z","abstract_excerpt":"This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic 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 information to enumerate only the minimal necessary plans among all possible plans. Importantly, this algorithm is a strict generalization of all known results of PTIME self-join-free conjunctive queries: A query is safe if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1069","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1069","created_at":"2026-05-18T02:32:14.973694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1069v1","created_at":"2026-05-18T02:32:14.973694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1069","created_at":"2026-05-18T02:32:14.973694+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB3F47DB3PR2","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB3F47DB3PR2YJLW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB3F47DB","created_at":"2026-05-18T12:28:49.207871+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/TB3F47DB3PR2YJLWOL2OWXFDVD","json":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD.json","graph_json":"https://pith.science/api/pith-number/TB3F47DB3PR2YJLWOL2OWXFDVD/graph.json","events_json":"https://pith.science/api/pith-number/TB3F47DB3PR2YJLWOL2OWXFDVD/events.json","paper":"https://pith.science/paper/TB3F47DB"},"agent_actions":{"view_html":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD","download_json":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD.json","view_paper":"https://pith.science/paper/TB3F47DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1069&json=true","fetch_graph":"https://pith.science/api/pith-number/TB3F47DB3PR2YJLWOL2OWXFDVD/graph.json","fetch_events":"https://pith.science/api/pith-number/TB3F47DB3PR2YJLWOL2OWXFDVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD/action/storage_attestation","attest_author":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD/action/author_attestation","sign_citation":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD/action/citation_signature","submit_replication":"https://pith.science/pith/TB3F47DB3PR2YJLWOL2OWXFDVD/action/replication_record"}},"created_at":"2026-05-18T02:32:14.973694+00:00","updated_at":"2026-05-18T02:32:14.973694+00:00"}