{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3YBXWYL4JIFYZMF5HZTTZQ4CBF","short_pith_number":"pith:3YBXWYL4","schema_version":"1.0","canonical_sha256":"de037b617c4a0b8cb0bd3e673cc382095ffc57b1410e17e1723136091309119e","source":{"kind":"arxiv","id":"1411.5410","version":1},"attestation_state":"computed","paper":{"title":"Stable Model Counting and Its Application in Probabilistic Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Muise, Geoffrey Chu, Peter Stuckey, Rehan Abdul Aziz","submitted_at":"2014-11-20T00:54:45Z","abstract_excerpt":"Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the probability of given queries being true provided a set of mutually independent random variables, a model (a logic program) and some evidence. The core of solving this inference task involves translating the logic program to a propositional theory and using a model counter. In this paper, we show that for some problems that involve inductive definitions like reachabi"},"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":"1411.5410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-20T00:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"4d6203101e8e55fd900157f16716a0039b8767a80c6d05d65d8cdf2503dcb4ac","abstract_canon_sha256":"42f1d8d7938aacb014bce26c4dd9762bb258d7293608b5e6474af58d07943f1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:24.726085Z","signature_b64":"0NJBHM8RwbTxWXx7FgvwZh5Y32K8lSmMm77yCS3phPt30AzitB9/IhEhglo/Xqm1V7GNVFokBBNUPnjBc6A1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de037b617c4a0b8cb0bd3e673cc382095ffc57b1410e17e1723136091309119e","last_reissued_at":"2026-05-18T02:33:24.723930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:24.723930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable Model Counting and Its Application in Probabilistic Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christian Muise, Geoffrey Chu, Peter Stuckey, Rehan Abdul Aziz","submitted_at":"2014-11-20T00:54:45Z","abstract_excerpt":"Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the probability of given queries being true provided a set of mutually independent random variables, a model (a logic program) and some evidence. The core of solving this inference task involves translating the logic program to a propositional theory and using a model counter. In this paper, we show that for some problems that involve inductive definitions like reachabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5410","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":"1411.5410","created_at":"2026-05-18T02:33:24.724007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5410v1","created_at":"2026-05-18T02:33:24.724007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5410","created_at":"2026-05-18T02:33:24.724007+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YBXWYL4JIFY","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YBXWYL4JIFYZMF5","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YBXWYL4","created_at":"2026-05-18T12:28:11.866339+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/3YBXWYL4JIFYZMF5HZTTZQ4CBF","json":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF.json","graph_json":"https://pith.science/api/pith-number/3YBXWYL4JIFYZMF5HZTTZQ4CBF/graph.json","events_json":"https://pith.science/api/pith-number/3YBXWYL4JIFYZMF5HZTTZQ4CBF/events.json","paper":"https://pith.science/paper/3YBXWYL4"},"agent_actions":{"view_html":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF","download_json":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF.json","view_paper":"https://pith.science/paper/3YBXWYL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5410&json=true","fetch_graph":"https://pith.science/api/pith-number/3YBXWYL4JIFYZMF5HZTTZQ4CBF/graph.json","fetch_events":"https://pith.science/api/pith-number/3YBXWYL4JIFYZMF5HZTTZQ4CBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF/action/storage_attestation","attest_author":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF/action/author_attestation","sign_citation":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF/action/citation_signature","submit_replication":"https://pith.science/pith/3YBXWYL4JIFYZMF5HZTTZQ4CBF/action/replication_record"}},"created_at":"2026-05-18T02:33:24.724007+00:00","updated_at":"2026-05-18T02:33:24.724007+00:00"}