{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5A5BSHER4O6JBCMRHROPNFIZ4I","short_pith_number":"pith:5A5BSHER","canonical_record":{"source":{"id":"1701.09000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-31T11:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"d6d5631b22db9bc1a46a815354804b964c6aeac7916ce281ac4f642477ac29ca","abstract_canon_sha256":"d871955a7215b224aee5ccaa6daba9cafe310010e6893aed910c4e89b7d32509"},"schema_version":"1.0"},"canonical_sha256":"e83a191c91e3bc9089913c5cf69519e21f746a2a98f0004f4d044d5ea96a88d4","source":{"kind":"arxiv","id":"1701.09000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09000","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09000v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09000","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"5A5BSHER4O6J","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5A5BSHER4O6JBCMR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5A5BSHER","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5A5BSHER4O6JBCMRHROPNFIZ4I","target":"record","payload":{"canonical_record":{"source":{"id":"1701.09000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-31T11:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"d6d5631b22db9bc1a46a815354804b964c6aeac7916ce281ac4f642477ac29ca","abstract_canon_sha256":"d871955a7215b224aee5ccaa6daba9cafe310010e6893aed910c4e89b7d32509"},"schema_version":"1.0"},"canonical_sha256":"e83a191c91e3bc9089913c5cf69519e21f746a2a98f0004f4d044d5ea96a88d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:38.710478Z","signature_b64":"AzH/hKMNkfkoiEBo53m3YCgSdVxVt0bCZ0B5IWQmgdIrNlqahJi2VJnfxvxugsP3o6pQ2XVHUDHF2WSGGR9dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83a191c91e3bc9089913c5cf69519e21f746a2a98f0004f4d044d5ea96a88d4","last_reissued_at":"2026-05-18T00:51:38.709899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:38.709899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.09000","source_version":1,"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:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+4z9zbszQGIaEOaWCy6+Rr6hBfHmZo6E/jrAQEfNovvK7tTZjAP9GKe+At03H5dYHAK/XQiWsrYPN2dJgaIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:20:43.447119Z"},"content_sha256":"6f1fde59da8dbec8f5539bb420c0b52098a255d476f752d609947ae4ca48423c","schema_version":"1.0","event_id":"sha256:6f1fde59da8dbec8f5539bb420c0b52098a255d476f752d609947ae4ca48423c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5A5BSHER4O6JBCMRHROPNFIZ4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Semantics and Complexity of Probabilistic Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Denis Deratani Mau\\'a, Fabio Gagliardi Cozman","submitted_at":"2017-01-31T11:54:15Z","abstract_excerpt":"We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato's distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the \"credal semantics\") produces sets of probability models that dominate infinitely monotone Choquet capacities, we describe several useful consequences of this result. We then examine the complexity of inference with probabilistic logic p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09000","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"},"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:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsDZwewQ/XzzBsQ2zUZMTmm/YfQqQ09oPDi3rjEtv6kNqNTrvvPcUKlNeGB8Bx16VhpsdgkX7Ytw698SfFr8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:20:43.447461Z"},"content_sha256":"5df34f44b2a1e16b13f106a7bf69b93ccbe011b392dfe79082577c5fcc141fde","schema_version":"1.0","event_id":"sha256:5df34f44b2a1e16b13f106a7bf69b93ccbe011b392dfe79082577c5fcc141fde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/bundle.json","state_url":"https://pith.science/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/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-06-22T18:20:43Z","links":{"resolver":"https://pith.science/pith/5A5BSHER4O6JBCMRHROPNFIZ4I","bundle":"https://pith.science/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/bundle.json","state":"https://pith.science/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5A5BSHER4O6JBCMRHROPNFIZ4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5A5BSHER4O6JBCMRHROPNFIZ4I","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":"d871955a7215b224aee5ccaa6daba9cafe310010e6893aed910c4e89b7d32509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-31T11:54:15Z","title_canon_sha256":"d6d5631b22db9bc1a46a815354804b964c6aeac7916ce281ac4f642477ac29ca"},"schema_version":"1.0","source":{"id":"1701.09000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.09000","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.09000v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09000","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"5A5BSHER4O6J","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5A5BSHER4O6JBCMR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5A5BSHER","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5df34f44b2a1e16b13f106a7bf69b93ccbe011b392dfe79082577c5fcc141fde","target":"graph","created_at":"2026-05-18T00:51:38Z","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":"We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato's distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the \"credal semantics\") produces sets of probability models that dominate infinitely monotone Choquet capacities, we describe several useful consequences of this result. We then examine the complexity of inference with probabilistic logic p","authors_text":"Denis Deratani Mau\\'a, Fabio Gagliardi Cozman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-31T11:54:15Z","title":"On the Semantics and Complexity of Probabilistic Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09000","kind":"arxiv","version":1},"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:6f1fde59da8dbec8f5539bb420c0b52098a255d476f752d609947ae4ca48423c","target":"record","created_at":"2026-05-18T00:51:38Z","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":"d871955a7215b224aee5ccaa6daba9cafe310010e6893aed910c4e89b7d32509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-01-31T11:54:15Z","title_canon_sha256":"d6d5631b22db9bc1a46a815354804b964c6aeac7916ce281ac4f642477ac29ca"},"schema_version":"1.0","source":{"id":"1701.09000","kind":"arxiv","version":1}},"canonical_sha256":"e83a191c91e3bc9089913c5cf69519e21f746a2a98f0004f4d044d5ea96a88d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e83a191c91e3bc9089913c5cf69519e21f746a2a98f0004f4d044d5ea96a88d4","first_computed_at":"2026-05-18T00:51:38.709899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:38.709899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AzH/hKMNkfkoiEBo53m3YCgSdVxVt0bCZ0B5IWQmgdIrNlqahJi2VJnfxvxugsP3o6pQ2XVHUDHF2WSGGR9dCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:38.710478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.09000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f1fde59da8dbec8f5539bb420c0b52098a255d476f752d609947ae4ca48423c","sha256:5df34f44b2a1e16b13f106a7bf69b93ccbe011b392dfe79082577c5fcc141fde"],"state_sha256":"84a615efd16e60b1e3f11fa5529a273e7a19e486e358916b1976bca41dacff1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnv4sD4nd85RYEip+0haR20qthO+DVQCiBHT+kFXeZSv6uzBTfORMLd0slpIsa9MrLHgSqBZSBPU5f7KLBMcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:20:43.449287Z","bundle_sha256":"33e1130b8c8ffed161265e6d135bc833ce1d35dcf0bf19402b60a3f85bb4fba1"}}