{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RH5B5PH7GYYICICSA4F6ZWTDH5","short_pith_number":"pith:RH5B5PH7","schema_version":"1.0","canonical_sha256":"89fa1ebcff3630812052070becda633f40ea4fcb07d1600392d76c76593dc5a5","source":{"kind":"arxiv","id":"1905.07550","version":1},"attestation_state":"computed","paper":{"title":"Strong equivalence for $\\rm LP^{MLN}$ programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Man Luo","submitted_at":"2019-05-18T07:48:16Z","abstract_excerpt":"Strong equivalence is a well-studied and important concept in answer set programming (ASP). $\\rm LP^{MLN}$ is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. Because of the semantic differences, strong equivalence for ASP does not simply carry over to $\\rm LP^{MLN}$. I study the concept of strong equivalence in $\\rm LP^{MLN}$ with the goal of extending strong equivalence to $\\rm LP^{MLN}$ programs. My study shows that the verification of strong equivalence in $\\rm LP^{MLN}$ can be reduced to equivalence checking in classical logic plus weight "},"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":"1905.07550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-05-18T07:48:16Z","cross_cats_sorted":[],"title_canon_sha256":"3cc5c5331feba8435736ef28ebfb6265caf0db544ebd4b2ab14307f4d371f9d1","abstract_canon_sha256":"34c0af29e63a1c39c02c247ff8c7503f1adca4f202d760eb691cd8ac42179a48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:49.377097Z","signature_b64":"Ov1q+N1t/IRDKwiutAd/ScNfZ/PSGqXlO7zx0UOFjYRD7ZYM18hHnQYLgsHu4cn8/P+OayIB/dARYEDqfxVuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89fa1ebcff3630812052070becda633f40ea4fcb07d1600392d76c76593dc5a5","last_reissued_at":"2026-05-17T23:45:49.376515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:49.376515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong equivalence for $\\rm LP^{MLN}$ programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Man Luo","submitted_at":"2019-05-18T07:48:16Z","abstract_excerpt":"Strong equivalence is a well-studied and important concept in answer set programming (ASP). $\\rm LP^{MLN}$ is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. Because of the semantic differences, strong equivalence for ASP does not simply carry over to $\\rm LP^{MLN}$. I study the concept of strong equivalence in $\\rm LP^{MLN}$ with the goal of extending strong equivalence to $\\rm LP^{MLN}$ programs. My study shows that the verification of strong equivalence in $\\rm LP^{MLN}$ can be reduced to equivalence checking in classical logic plus weight "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07550","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":"1905.07550","created_at":"2026-05-17T23:45:49.376605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07550v1","created_at":"2026-05-17T23:45:49.376605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07550","created_at":"2026-05-17T23:45:49.376605+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH5B5PH7GYYI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH5B5PH7GYYICICS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH5B5PH7","created_at":"2026-05-18T12:33:27.125529+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/RH5B5PH7GYYICICSA4F6ZWTDH5","json":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5.json","graph_json":"https://pith.science/api/pith-number/RH5B5PH7GYYICICSA4F6ZWTDH5/graph.json","events_json":"https://pith.science/api/pith-number/RH5B5PH7GYYICICSA4F6ZWTDH5/events.json","paper":"https://pith.science/paper/RH5B5PH7"},"agent_actions":{"view_html":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5","download_json":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5.json","view_paper":"https://pith.science/paper/RH5B5PH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07550&json=true","fetch_graph":"https://pith.science/api/pith-number/RH5B5PH7GYYICICSA4F6ZWTDH5/graph.json","fetch_events":"https://pith.science/api/pith-number/RH5B5PH7GYYICICSA4F6ZWTDH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5/action/storage_attestation","attest_author":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5/action/author_attestation","sign_citation":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5/action/citation_signature","submit_replication":"https://pith.science/pith/RH5B5PH7GYYICICSA4F6ZWTDH5/action/replication_record"}},"created_at":"2026-05-17T23:45:49.376605+00:00","updated_at":"2026-05-17T23:45:49.376605+00:00"}