{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SBWMLCGXW2KUTIR3HEN7VZ2MY6","short_pith_number":"pith:SBWMLCGX","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"},"canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","source":{"kind":"arxiv","id":"1707.06325","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06325","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06325v3","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06325","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"SBWMLCGXW2KU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBWMLCGXW2KUTIR3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBWMLCGX","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SBWMLCGXW2KUTIR3HEN7VZ2MY6","target":"record","payload":{"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"},"canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","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"},"source_kind":"arxiv","source_id":"1707.06325","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAsO73g4WmIfhuh+V6oJKv/XEzeQCdhcxL4khwDVceCyDsjxaHiPKXiDi/av8F01xklCZPezZLEP3FDM8QAECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:34.363389Z"},"content_sha256":"75d079113f02d4cef4e375ab9139814df2c435e17152d973f6b850fa238d5c56","schema_version":"1.0","event_id":"sha256:75d079113f02d4cef4e375ab9139814df2c435e17152d973f6b850fa238d5c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SBWMLCGXW2KUTIR3HEN7VZ2MY6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A42pZqLiDSODdKxmfbHgkpMPfCsPh8xsRfxsZ60KMYdxB/kzj/1v2cpzlRtvlRcKW7YFa4Lq+pEG0heo6Q7VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:34.364094Z"},"content_sha256":"e3d0c448807a2f3488f8e5fbcdcdc61e53839beab0b145bd65b6ce6d8d1e474c","schema_version":"1.0","event_id":"sha256:e3d0c448807a2f3488f8e5fbcdcdc61e53839beab0b145bd65b6ce6d8d1e474c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/bundle.json","state_url":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T19:43:34Z","links":{"resolver":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6","bundle":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/bundle.json","state":"https://pith.science/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBWMLCGXW2KUTIR3HEN7VZ2MY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SBWMLCGXW2KUTIR3HEN7VZ2MY6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"608e29312f477bb24622808a4b78ece7a1c9c3a9d5979b8aa5f4e4214c225ad8","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T23:38:47Z","title_canon_sha256":"5d11749654fdc64e4d65bd539ce18e90e434b7c7efe3134332a36594520fa711"},"schema_version":"1.0","source":{"id":"1707.06325","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06325","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06325v3","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06325","created_at":"2026-05-18T00:29:10Z"},{"alias_kind":"pith_short_12","alias_value":"SBWMLCGXW2KU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBWMLCGXW2KUTIR3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBWMLCGX","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:e3d0c448807a2f3488f8e5fbcdcdc61e53839beab0b145bd65b6ce6d8d1e474c","target":"graph","created_at":"2026-05-18T00:29:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Joohyung Lee, Samidh Talsania, Yi Wang","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T23:38:47Z","title":"Computing LPMLN Using ASP and MLN Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06325","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:75d079113f02d4cef4e375ab9139814df2c435e17152d973f6b850fa238d5c56","target":"record","created_at":"2026-05-18T00:29:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"608e29312f477bb24622808a4b78ece7a1c9c3a9d5979b8aa5f4e4214c225ad8","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T23:38:47Z","title_canon_sha256":"5d11749654fdc64e4d65bd539ce18e90e434b7c7efe3134332a36594520fa711"},"schema_version":"1.0","source":{"id":"1707.06325","kind":"arxiv","version":3}},"canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"906cc588d7b69549a23b391bfae74cc7bf2c0ede8cd5668cd2cefab38b82ccc0","first_computed_at":"2026-05-18T00:29:10.476332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:10.476332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zs0YvlyUvJKxFAlQOyqx4+iWnKxX3CzNAPrCsOKbg9O2O+u1HLdzBYTZJTf6wUUQD1bjTd6aJfV4QFIL4QFZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:10.477172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06325","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d079113f02d4cef4e375ab9139814df2c435e17152d973f6b850fa238d5c56","sha256:e3d0c448807a2f3488f8e5fbcdcdc61e53839beab0b145bd65b6ce6d8d1e474c"],"state_sha256":"c020764a7b3c9d71c5b904fccbc4f28743000471fa4636ef3e9a3b3881924870"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmrCbYUdc3zrRbj6NGJP5mFvp3pPypNxEf3j6UZyf8FhQjHTYtoT1BGpETggwO+TqvTChO5xrkD2ShunjQ72AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:43:34.367621Z","bundle_sha256":"8d3a4aba5522624d92b59bebd41aefb80b8df230e2ffaf92350b420443029d87"}}