{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SXDZOOZTNO6VRB2USNPMK7SY7S","short_pith_number":"pith:SXDZOOZT","schema_version":"1.0","canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","source":{"kind":"arxiv","id":"1804.10237","version":1},"attestation_state":"computed","paper":{"title":"Constraint-Based Inference in Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arun Nampally, C. R. Ramakrishnan, Timothy Zhang","submitted_at":"2018-04-26T18:34:24Z","abstract_excerpt":"Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query in a suitable data structure, and using it to compute the answer probability. Systems such as ProbLog, PITA, etc., use propositional data structures like explanation graphs, BDDs, SDDs, etc., to represent the possible worlds. While this approach saves inference time due to substructure sharing, there are a number of problems where a more compact data struct"},"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":"1804.10237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-26T18:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"09858ee1eb604be59f40ec35b32b0179b21154c97ce84e0cbc14584151c15565","abstract_canon_sha256":"527cd9f5151bbd390c37b941538862d9ff39b602d38b83d3c7973643759fa79b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:21.389105Z","signature_b64":"yRSxTADoNznbFvAbr3lh9ZPN6FX+6G88z+K+sEllpd1U2FLgjOK7i1HvGfYNI34+tdT4cpvx7ZAc63LUTy/nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c7973b336bbd588754935ec57e58fc820e9d7bc7bbcc6346ffff70624e9020","last_reissued_at":"2026-05-18T00:17:21.388313Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:21.388313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint-Based Inference in Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arun Nampally, C. R. Ramakrishnan, Timothy Zhang","submitted_at":"2018-04-26T18:34:24Z","abstract_excerpt":"Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query in a suitable data structure, and using it to compute the answer probability. Systems such as ProbLog, PITA, etc., use propositional data structures like explanation graphs, BDDs, SDDs, etc., to represent the possible worlds. While this approach saves inference time due to substructure sharing, there are a number of problems where a more compact data struct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10237","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":"1804.10237","created_at":"2026-05-18T00:17:21.388447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10237v1","created_at":"2026-05-18T00:17:21.388447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10237","created_at":"2026-05-18T00:17:21.388447+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXDZOOZTNO6V","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXDZOOZTNO6VRB2U","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXDZOOZT","created_at":"2026-05-18T12:32:53.628368+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/SXDZOOZTNO6VRB2USNPMK7SY7S","json":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S.json","graph_json":"https://pith.science/api/pith-number/SXDZOOZTNO6VRB2USNPMK7SY7S/graph.json","events_json":"https://pith.science/api/pith-number/SXDZOOZTNO6VRB2USNPMK7SY7S/events.json","paper":"https://pith.science/paper/SXDZOOZT"},"agent_actions":{"view_html":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S","download_json":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S.json","view_paper":"https://pith.science/paper/SXDZOOZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10237&json=true","fetch_graph":"https://pith.science/api/pith-number/SXDZOOZTNO6VRB2USNPMK7SY7S/graph.json","fetch_events":"https://pith.science/api/pith-number/SXDZOOZTNO6VRB2USNPMK7SY7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/action/storage_attestation","attest_author":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/action/author_attestation","sign_citation":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/action/citation_signature","submit_replication":"https://pith.science/pith/SXDZOOZTNO6VRB2USNPMK7SY7S/action/replication_record"}},"created_at":"2026-05-18T00:17:21.388447+00:00","updated_at":"2026-05-18T00:17:21.388447+00:00"}