{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E2ZFABLGCSWNTAQHRNQCOSJZYK","short_pith_number":"pith:E2ZFABLG","schema_version":"1.0","canonical_sha256":"26b250056614acd982078b60274939c29bef17dbb0d7635383be1b1c4b793836","source":{"kind":"arxiv","id":"2506.12784","version":1},"attestation_state":"computed","paper":{"title":"LPMLN, Weak Constraints, and P-log","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joohyung Lee, Zhun Yang","submitted_at":"2025-06-15T09:28:20Z","abstract_excerpt":"LPMLN is a recently introduced formalism that extends answer set programs by adopting the log-linear weight scheme of Markov Logic. This paper investigates the relationships between LPMLN and two other extensions of answer set programs: weak constraints to express a quantitative preference among answer sets, and P-log to incorporate probabilistic uncertainty. We present a translation of LPMLN into programs with weak constraints and a translation of P-log into LPMLN, which complement the existing translations in the opposite directions. The first translation allows us to compute the most probab"},"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":"2506.12784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-15T09:28:20Z","cross_cats_sorted":[],"title_canon_sha256":"8b56e4c7ba3266743a33f50099f15045098ff03f590cb2921a2e02e9bde87827","abstract_canon_sha256":"201a2781dcaee8052d1462251dce1fa78e0208aa1c80789fc3db7d3b224b2d56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:59.934997Z","signature_b64":"2o0bnv+wL2EbCS27KhLapo3XwUYCyDBd2tBJSWc5joum6ZrOgjp8MIjeW/tKGyb6wRHYmCf7h5foiXzlqzdACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b250056614acd982078b60274939c29bef17dbb0d7635383be1b1c4b793836","last_reissued_at":"2026-07-05T11:21:59.934530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:59.934530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LPMLN, Weak Constraints, and P-log","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joohyung Lee, Zhun Yang","submitted_at":"2025-06-15T09:28:20Z","abstract_excerpt":"LPMLN is a recently introduced formalism that extends answer set programs by adopting the log-linear weight scheme of Markov Logic. This paper investigates the relationships between LPMLN and two other extensions of answer set programs: weak constraints to express a quantitative preference among answer sets, and P-log to incorporate probabilistic uncertainty. We present a translation of LPMLN into programs with weak constraints and a translation of P-log into LPMLN, which complement the existing translations in the opposite directions. The first translation allows us to compute the most probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12784","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.12784/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.12784","created_at":"2026-07-05T11:21:59.934586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12784v1","created_at":"2026-07-05T11:21:59.934586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12784","created_at":"2026-07-05T11:21:59.934586+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2ZFABLGCSWN","created_at":"2026-07-05T11:21:59.934586+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2ZFABLGCSWNTAQH","created_at":"2026-07-05T11:21:59.934586+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2ZFABLG","created_at":"2026-07-05T11:21:59.934586+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/E2ZFABLGCSWNTAQHRNQCOSJZYK","json":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK.json","graph_json":"https://pith.science/api/pith-number/E2ZFABLGCSWNTAQHRNQCOSJZYK/graph.json","events_json":"https://pith.science/api/pith-number/E2ZFABLGCSWNTAQHRNQCOSJZYK/events.json","paper":"https://pith.science/paper/E2ZFABLG"},"agent_actions":{"view_html":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK","download_json":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK.json","view_paper":"https://pith.science/paper/E2ZFABLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12784&json=true","fetch_graph":"https://pith.science/api/pith-number/E2ZFABLGCSWNTAQHRNQCOSJZYK/graph.json","fetch_events":"https://pith.science/api/pith-number/E2ZFABLGCSWNTAQHRNQCOSJZYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK/action/storage_attestation","attest_author":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK/action/author_attestation","sign_citation":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK/action/citation_signature","submit_replication":"https://pith.science/pith/E2ZFABLGCSWNTAQHRNQCOSJZYK/action/replication_record"}},"created_at":"2026-07-05T11:21:59.934586+00:00","updated_at":"2026-07-05T11:21:59.934586+00:00"}