{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:72R456CGVAVR55CLCQJPVHQDTY","short_pith_number":"pith:72R456CG","schema_version":"1.0","canonical_sha256":"fea3cef846a82b1ef44b1412fa9e039e06960a1212ce90fc7a60378c691406d6","source":{"kind":"arxiv","id":"1608.05763","version":1},"attestation_state":"computed","paper":{"title":"Inference in Probabilistic Logic Programs using Lifted Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Arun Nampally, C. R. Ramakrishnan","submitted_at":"2016-08-20T00:37:20Z","abstract_excerpt":"In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query and computing probabilities over this graph. When evaluating queries over probabilistic logic programs with a large number of instances of random variables, traditional methods treat each instance separately. For many programs and queries, we observe that explanations can be summarized into substantially more compact structures, which we call lifted explanation g"},"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":"1608.05763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-20T00:37:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c41a6fa5fc8238aec7034d7ee04843386adc0139b30f5c1923147bc364a3e390","abstract_canon_sha256":"38283464822399efaa83c7b6918adf6a63222d5d4971342ee3e27f989109a27b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:23.285008Z","signature_b64":"M6C9MnU6BYxudkcALzTfNozw0Iu7M/M1ETPTPKnYsVPwEmXYuExGZkEfQctuXUqoDvpVKsBytdGgPXnxtUaiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea3cef846a82b1ef44b1412fa9e039e06960a1212ce90fc7a60378c691406d6","last_reissued_at":"2026-05-18T01:08:23.284353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:23.284353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference in Probabilistic Logic Programs using Lifted Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Arun Nampally, C. R. Ramakrishnan","submitted_at":"2016-08-20T00:37:20Z","abstract_excerpt":"In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query and computing probabilities over this graph. When evaluating queries over probabilistic logic programs with a large number of instances of random variables, traditional methods treat each instance separately. For many programs and queries, we observe that explanations can be summarized into substantially more compact structures, which we call lifted explanation g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05763","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":"1608.05763","created_at":"2026-05-18T01:08:23.284479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05763v1","created_at":"2026-05-18T01:08:23.284479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05763","created_at":"2026-05-18T01:08:23.284479+00:00"},{"alias_kind":"pith_short_12","alias_value":"72R456CGVAVR","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"72R456CGVAVR55CL","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"72R456CG","created_at":"2026-05-18T12:30:04.600751+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/72R456CGVAVR55CLCQJPVHQDTY","json":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY.json","graph_json":"https://pith.science/api/pith-number/72R456CGVAVR55CLCQJPVHQDTY/graph.json","events_json":"https://pith.science/api/pith-number/72R456CGVAVR55CLCQJPVHQDTY/events.json","paper":"https://pith.science/paper/72R456CG"},"agent_actions":{"view_html":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY","download_json":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY.json","view_paper":"https://pith.science/paper/72R456CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05763&json=true","fetch_graph":"https://pith.science/api/pith-number/72R456CGVAVR55CLCQJPVHQDTY/graph.json","fetch_events":"https://pith.science/api/pith-number/72R456CGVAVR55CLCQJPVHQDTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY/action/storage_attestation","attest_author":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY/action/author_attestation","sign_citation":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY/action/citation_signature","submit_replication":"https://pith.science/pith/72R456CGVAVR55CLCQJPVHQDTY/action/replication_record"}},"created_at":"2026-05-18T01:08:23.284479+00:00","updated_at":"2026-05-18T01:08:23.284479+00:00"}