{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EF7EMRQ2MVRX6E5BRUXN3DLJRZ","short_pith_number":"pith:EF7EMRQ2","canonical_record":{"source":{"id":"1405.0720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-04T17:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"746464be908d151893aac3c11ea9091f3b418273dc98a627a12c1a7515b4e7be","abstract_canon_sha256":"492a6ca94a2cae8d2a83e689d943dd0a6a474b3424c294dde16802e8171ae66b"},"schema_version":"1.0"},"canonical_sha256":"217e46461a65637f13a18d2edd8d698e6d01578728669cb5c78c7816e9ff28a1","source":{"kind":"arxiv","id":"1405.0720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0720","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0720v1","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0720","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"EF7EMRQ2MVRX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EF7EMRQ2MVRX6E5B","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EF7EMRQ2","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EF7EMRQ2MVRX6E5BRUXN3DLJRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-04T17:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"746464be908d151893aac3c11ea9091f3b418273dc98a627a12c1a7515b4e7be","abstract_canon_sha256":"492a6ca94a2cae8d2a83e689d943dd0a6a474b3424c294dde16802e8171ae66b"},"schema_version":"1.0"},"canonical_sha256":"217e46461a65637f13a18d2edd8d698e6d01578728669cb5c78c7816e9ff28a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.830593Z","signature_b64":"SDapmjpcBjYdhL8Rr8XABEnr4M3HAcV1Il1cxO6EjRuj+DuN1dDcFnMOeYTHGIqfnj71ukmmtoFlkfcN75PeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217e46461a65637f13a18d2edd8d698e6d01578728669cb5c78c7816e9ff28a1","last_reissued_at":"2026-05-18T02:52:40.829911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.829911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0720","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-18T02:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeEM5VLAnJYkjAmBwufdAVIynIDVm/Mvf9YLhaOtoCJB6Tg1JdMZCw/h36+eEbTyFNTfEQDSh6JZrNbs+uHEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:40:19.959229Z"},"content_sha256":"f4562dd00dee4008335831ef3a8eb4e8b9e22180a709c33db05d1b0f133d714a","schema_version":"1.0","event_id":"sha256:f4562dd00dee4008335831ef3a8eb4e8b9e22180a709c33db05d1b0f133d714a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EF7EMRQ2MVRX6E5BRUXN3DLJRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Inductive Logic Programming Based on Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alessandra Mileo, Matthias Nickles","submitted_at":"2014-05-04T17:18:49Z","abstract_excerpt":"We propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine a probability distribution over answer sets. In contrast to related approaches, we approach inference by optionally utilizing so-called streamlining XOR constraints, in order to reduce the number of comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0720","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-18T02:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBCbW18qOCAl812mZQ7/74xIwJydoZ0uf0UC2hwa7IUg5k4XGjeBja77kt1+7RBeleVkBts1aIo9bR8tT4eHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:40:19.959592Z"},"content_sha256":"aeff44d55979b3303dc752d4edd6789990e5769e3ebafcc4afdf761c388cadaa","schema_version":"1.0","event_id":"sha256:aeff44d55979b3303dc752d4edd6789990e5769e3ebafcc4afdf761c388cadaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/bundle.json","state_url":"https://pith.science/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/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-19T23:40:19Z","links":{"resolver":"https://pith.science/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ","bundle":"https://pith.science/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/bundle.json","state":"https://pith.science/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EF7EMRQ2MVRX6E5BRUXN3DLJRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EF7EMRQ2MVRX6E5BRUXN3DLJRZ","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":"492a6ca94a2cae8d2a83e689d943dd0a6a474b3424c294dde16802e8171ae66b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-04T17:18:49Z","title_canon_sha256":"746464be908d151893aac3c11ea9091f3b418273dc98a627a12c1a7515b4e7be"},"schema_version":"1.0","source":{"id":"1405.0720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0720","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0720v1","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0720","created_at":"2026-05-18T02:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"EF7EMRQ2MVRX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EF7EMRQ2MVRX6E5B","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EF7EMRQ2","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:aeff44d55979b3303dc752d4edd6789990e5769e3ebafcc4afdf761c388cadaa","target":"graph","created_at":"2026-05-18T02:52:40Z","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 propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine a probability distribution over answer sets. In contrast to related approaches, we approach inference by optionally utilizing so-called streamlining XOR constraints, in order to reduce the number of comp","authors_text":"Alessandra Mileo, Matthias Nickles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-04T17:18:49Z","title":"Probabilistic Inductive Logic Programming Based on Answer Set Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0720","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:f4562dd00dee4008335831ef3a8eb4e8b9e22180a709c33db05d1b0f133d714a","target":"record","created_at":"2026-05-18T02:52:40Z","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":"492a6ca94a2cae8d2a83e689d943dd0a6a474b3424c294dde16802e8171ae66b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-04T17:18:49Z","title_canon_sha256":"746464be908d151893aac3c11ea9091f3b418273dc98a627a12c1a7515b4e7be"},"schema_version":"1.0","source":{"id":"1405.0720","kind":"arxiv","version":1}},"canonical_sha256":"217e46461a65637f13a18d2edd8d698e6d01578728669cb5c78c7816e9ff28a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"217e46461a65637f13a18d2edd8d698e6d01578728669cb5c78c7816e9ff28a1","first_computed_at":"2026-05-18T02:52:40.829911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:40.829911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDapmjpcBjYdhL8Rr8XABEnr4M3HAcV1Il1cxO6EjRuj+DuN1dDcFnMOeYTHGIqfnj71ukmmtoFlkfcN75PeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:40.830593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4562dd00dee4008335831ef3a8eb4e8b9e22180a709c33db05d1b0f133d714a","sha256:aeff44d55979b3303dc752d4edd6789990e5769e3ebafcc4afdf761c388cadaa"],"state_sha256":"3bbaf7e2231bd4cf3140d01b0ec628aa10b65545e00462bb5fdafc6615220d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBW+Xm4AEcKchonFTNs8REWfmJ0s7ENbq1GagqX0gCRBvRikLqHMhbkZpTyyDgLwh3pzBS3b1eikoKl9qOMRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:40:19.961464Z","bundle_sha256":"7004544c9c663d95b5e28115a3aeb1ad512e051f068c135e317345f032d1beaa"}}