{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SBWMLCGXW2KUTIR3HEN7VZ2MY6","short_pith_number":"pith:SBWMLCGX","schema_version":"1.0","canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","source":{"kind":"arxiv","id":"1707.06325","version":3},"attestation_state":"computed","paper":{"title":"Computing LPMLN Using ASP and MLN Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Joohyung Lee, Samidh Talsania, Yi Wang","submitted_at":"2017-07-19T23:38:47Z","abstract_excerpt":"LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LPMLN, $\\text{LPMLN2ASP}$ and $\\text{LPMLN2MLN}$. System $\\text{LPMLN2ASP}$ translates LPMLN programs into the input language of answer set solver $\\text{CLINGO}$, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System $\\text{LP"},"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":"1707.06325","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T23:38:47Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5d11749654fdc64e4d65bd539ce18e90e434b7c7efe3134332a36594520fa711","abstract_canon_sha256":"608e29312f477bb24622808a4b78ece7a1c9c3a9d5979b8aa5f4e4214c225ad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:10.477172Z","signature_b64":"Zs0YvlyUvJKxFAlQOyqx4+iWnKxX3CzNAPrCsOKbg9O2O+u1HLdzBYTZJTf6wUUQD1bjTd6aJfV4QFIL4QFZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","last_reissued_at":"2026-05-18T00:29:10.476332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:10.476332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing LPMLN Using ASP and MLN Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Joohyung Lee, Samidh Talsania, Yi Wang","submitted_at":"2017-07-19T23:38:47Z","abstract_excerpt":"LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LPMLN, $\\text{LPMLN2ASP}$ and $\\text{LPMLN2MLN}$. System $\\text{LPMLN2ASP}$ translates LPMLN programs into the input language of answer set solver $\\text{CLINGO}$, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System $\\text{LP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06325","kind":"arxiv","version":3},"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":"1707.06325","created_at":"2026-05-18T00:29:10.476463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06325v3","created_at":"2026-05-18T00:29:10.476463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06325","created_at":"2026-05-18T00:29:10.476463+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBWMLCGXW2KU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBWMLCGXW2KUTIR3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBWMLCGX","created_at":"2026-05-18T12:31:43.269735+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/SBWMLCGXW2KUTIR3HEN7VZ2MY6","json":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6.json","graph_json":"https://pith.science/api/pith-number/SBWMLCGXW2KUTIR3HEN7VZ2MY6/graph.json","events_json":"https://pith.science/api/pith-number/SBWMLCGXW2KUTIR3HEN7VZ2MY6/events.json","paper":"https://pith.science/paper/SBWMLCGX"},"agent_actions":{"view_html":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6","download_json":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6.json","view_paper":"https://pith.science/paper/SBWMLCGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06325&json=true","fetch_graph":"https://pith.science/api/pith-number/SBWMLCGXW2KUTIR3HEN7VZ2MY6/graph.json","fetch_events":"https://pith.science/api/pith-number/SBWMLCGXW2KUTIR3HEN7VZ2MY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/action/storage_attestation","attest_author":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/action/author_attestation","sign_citation":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/action/citation_signature","submit_replication":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/action/replication_record"}},"created_at":"2026-05-18T00:29:10.476463+00:00","updated_at":"2026-05-18T00:29:10.476463+00:00"}