{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:K56STSD3TEJ54YQJQ6BF2FFLJE","short_pith_number":"pith:K56STSD3","schema_version":"1.0","canonical_sha256":"577d29c87b9913de620987825d14ab4903bbe6ab7c2a30412fec921a66db701f","source":{"kind":"arxiv","id":"1405.3250","version":2},"attestation_state":"computed","paper":{"title":"Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Dan Suciu, Eric Gribkoff, Guy Van den Broeck","submitted_at":"2014-05-13T18:39:11Z","abstract_excerpt":"In this paper we study lifted inference for the Weighted First-Order Model Counting problem (WFOMC), which counts the assignments that satisfy a given sentence in first-order logic (FOL); it has applications in Statistical Relational Learning (SRL) and Probabilistic Databases (PDB). We present several results. First, we describe a lifted inference algorithm that generalizes prior approaches in SRL and PDB. Second, we provide a novel dichotomy result for a non-trivial fragment of FO CNF sentences, showing that for each sentence the WFOMC problem is either in PTIME or #P-hard in the size of the "},"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":"1405.3250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-13T18:39:11Z","cross_cats_sorted":["cs.DB","cs.LO"],"title_canon_sha256":"205b8cb63345c77c60e8c5781029752be5143bc04b47af893e2d480a77219d9b","abstract_canon_sha256":"aea39e2bb106c380393831835649cc805a5a5dffb96601e94043a21a3d2a34a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:25.844145Z","signature_b64":"ZfWpVUCXfsEdRxL8zLl8Z5Ti0JIAardavEtGtj9sZieR6IcLIF8BywazUv0brd/Hp2RdQC1RycwtLftDYTtDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"577d29c87b9913de620987825d14ab4903bbe6ab7c2a30412fec921a66db701f","last_reissued_at":"2026-07-05T00:18:25.843808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:25.843808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LO"],"primary_cat":"cs.AI","authors_text":"Dan Suciu, Eric Gribkoff, Guy Van den Broeck","submitted_at":"2014-05-13T18:39:11Z","abstract_excerpt":"In this paper we study lifted inference for the Weighted First-Order Model Counting problem (WFOMC), which counts the assignments that satisfy a given sentence in first-order logic (FOL); it has applications in Statistical Relational Learning (SRL) and Probabilistic Databases (PDB). We present several results. First, we describe a lifted inference algorithm that generalizes prior approaches in SRL and PDB. Second, we provide a novel dichotomy result for a non-trivial fragment of FO CNF sentences, showing that for each sentence the WFOMC problem is either in PTIME or #P-hard in the size of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3250","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1405.3250/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1405.3250","created_at":"2026-07-05T00:18:25.843862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3250v2","created_at":"2026-07-05T00:18:25.843862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3250","created_at":"2026-07-05T00:18:25.843862+00:00"},{"alias_kind":"pith_short_12","alias_value":"K56STSD3TEJ5","created_at":"2026-07-05T00:18:25.843862+00:00"},{"alias_kind":"pith_short_16","alias_value":"K56STSD3TEJ54YQJ","created_at":"2026-07-05T00:18:25.843862+00:00"},{"alias_kind":"pith_short_8","alias_value":"K56STSD3","created_at":"2026-07-05T00:18:25.843862+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/K56STSD3TEJ54YQJQ6BF2FFLJE","json":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE.json","graph_json":"https://pith.science/api/pith-number/K56STSD3TEJ54YQJQ6BF2FFLJE/graph.json","events_json":"https://pith.science/api/pith-number/K56STSD3TEJ54YQJQ6BF2FFLJE/events.json","paper":"https://pith.science/paper/K56STSD3"},"agent_actions":{"view_html":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE","download_json":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE.json","view_paper":"https://pith.science/paper/K56STSD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3250&json=true","fetch_graph":"https://pith.science/api/pith-number/K56STSD3TEJ54YQJQ6BF2FFLJE/graph.json","fetch_events":"https://pith.science/api/pith-number/K56STSD3TEJ54YQJQ6BF2FFLJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE/action/storage_attestation","attest_author":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE/action/author_attestation","sign_citation":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE/action/citation_signature","submit_replication":"https://pith.science/pith/K56STSD3TEJ54YQJQ6BF2FFLJE/action/replication_record"}},"created_at":"2026-07-05T00:18:25.843862+00:00","updated_at":"2026-07-05T00:18:25.843862+00:00"}