{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5CA2Z5GCACTNTJNVNDVCFRBOAO","short_pith_number":"pith:5CA2Z5GC","schema_version":"1.0","canonical_sha256":"e881acf4c200a6d9a5b568ea22c42e039248836934c75458e208cb8e70d37888","source":{"kind":"arxiv","id":"1403.6036","version":1},"attestation_state":"computed","paper":{"title":"Adaptive MCMC-Based Inference in Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arun Nampally, C. R. Ramakrishnan","submitted_at":"2014-03-24T16:51:06Z","abstract_excerpt":"Probabilistic Logic Programming (PLP) languages enable programmers to specify systems that combine logical models with statistical knowledge. The inference problem, to determine the probability of query answers in PLP, is intractable in general, thereby motivating the need for approximate techniques. In this paper, we present a technique for approximate inference of conditional probabilities for PLP queries. It is an Adaptive Markov Chain Monte Carlo (MCMC) technique, where the distribution from which samples are drawn is modified as the Markov Chain is explored. In particular, the distributio"},"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":"1403.6036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-03-24T16:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"a33698e85ebaa400e90b71898b902f9a0dff45e89f8b3838f8a67595537dcd2c","abstract_canon_sha256":"ff81020b220333a4ae5ae40388a9717dd45fde8085a8bf06516fe5743225b0ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:47.094883Z","signature_b64":"lXB8l/eGmfGTHxqqFR2jU/iilMDHAThRf4y8q1YUXomIjXxZUCSE4Xong49YUgBlw1urJG23oUJ5aVwkDvliBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e881acf4c200a6d9a5b568ea22c42e039248836934c75458e208cb8e70d37888","last_reissued_at":"2026-05-18T02:55:47.094027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:47.094027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive MCMC-Based Inference in Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arun Nampally, C. R. Ramakrishnan","submitted_at":"2014-03-24T16:51:06Z","abstract_excerpt":"Probabilistic Logic Programming (PLP) languages enable programmers to specify systems that combine logical models with statistical knowledge. The inference problem, to determine the probability of query answers in PLP, is intractable in general, thereby motivating the need for approximate techniques. In this paper, we present a technique for approximate inference of conditional probabilities for PLP queries. It is an Adaptive Markov Chain Monte Carlo (MCMC) technique, where the distribution from which samples are drawn is modified as the Markov Chain is explored. In particular, the distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6036","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":"1403.6036","created_at":"2026-05-18T02:55:47.094131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6036v1","created_at":"2026-05-18T02:55:47.094131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6036","created_at":"2026-05-18T02:55:47.094131+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CA2Z5GCACTN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CA2Z5GCACTNTJNV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CA2Z5GC","created_at":"2026-05-18T12:28:14.216126+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/5CA2Z5GCACTNTJNVNDVCFRBOAO","json":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO.json","graph_json":"https://pith.science/api/pith-number/5CA2Z5GCACTNTJNVNDVCFRBOAO/graph.json","events_json":"https://pith.science/api/pith-number/5CA2Z5GCACTNTJNVNDVCFRBOAO/events.json","paper":"https://pith.science/paper/5CA2Z5GC"},"agent_actions":{"view_html":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO","download_json":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO.json","view_paper":"https://pith.science/paper/5CA2Z5GC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6036&json=true","fetch_graph":"https://pith.science/api/pith-number/5CA2Z5GCACTNTJNVNDVCFRBOAO/graph.json","fetch_events":"https://pith.science/api/pith-number/5CA2Z5GCACTNTJNVNDVCFRBOAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO/action/storage_attestation","attest_author":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO/action/author_attestation","sign_citation":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO/action/citation_signature","submit_replication":"https://pith.science/pith/5CA2Z5GCACTNTJNVNDVCFRBOAO/action/replication_record"}},"created_at":"2026-05-18T02:55:47.094131+00:00","updated_at":"2026-05-18T02:55:47.094131+00:00"}