{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IXV2IM4S4MWOHCJY4GGWBIYIMA","short_pith_number":"pith:IXV2IM4S","canonical_record":{"source":{"id":"1506.01432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T23:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"2663486e502c735b3cf1a42a6f9fec2b27700ed25315675e2c9ce8c60ae2b452","abstract_canon_sha256":"e6bcb674f9549cd739cc6a217b0557a09a13bd33b2eec391b90f906bcbe7b0ba"},"schema_version":"1.0"},"canonical_sha256":"45eba43392e32ce38938e18d60a3086031077b392ab1439a57a52243f8019413","source":{"kind":"arxiv","id":"1506.01432","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01432","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01432v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01432","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"IXV2IM4S4MWO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IXV2IM4S4MWOHCJY","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IXV2IM4S","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IXV2IM4S4MWOHCJY4GGWBIYIMA","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T23:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"2663486e502c735b3cf1a42a6f9fec2b27700ed25315675e2c9ce8c60ae2b452","abstract_canon_sha256":"e6bcb674f9549cd739cc6a217b0557a09a13bd33b2eec391b90f906bcbe7b0ba"},"schema_version":"1.0"},"canonical_sha256":"45eba43392e32ce38938e18d60a3086031077b392ab1439a57a52243f8019413","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.251551Z","signature_b64":"R13DDzTIwjE2IEX3EFZMVJ/lZtACIry6ZE1RIz64sVkNlHJ587GwEB/hZOKeDQiECOq0EY502D3bJDTFdsuJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45eba43392e32ce38938e18d60a3086031077b392ab1439a57a52243f8019413","last_reissued_at":"2026-05-18T01:55:52.251161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.251161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01432","source_version":2,"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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyAM2vWP9imo8UsbKF2KIsIDOFCMl+x2efkeGdWv8Ux7pnyL9RfM16OiDOr7r/7LrizMj9iXsbPM/eecNV6DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:43:05.345063Z"},"content_sha256":"1e199e12449b4cf3909049ee96259b5a8699eb01c173e059404b485fa6229c89","schema_version":"1.0","event_id":"sha256:1e199e12449b4cf3909049ee96259b5a8699eb01c173e059404b485fa6229c89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IXV2IM4S4MWOHCJY4GGWBIYIMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encoding Markov Logic Networks in Possibilistic Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jesse Davis, Ondrej Kuzelka, Steven Schockaert","submitted_at":"2015-06-03T23:20:28Z","abstract_excerpt":"Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a given MLN using maximum a posteriori (MAP) inference. Unfortunately, the size of this theory is exponential in general. We therefore also propose two methods which can derive compact theories that still "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01432","kind":"arxiv","version":2},"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-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkDUDe4k4OLLkDkfcdWFGnUxuzqhmmkRF5TKfYjfustiXIoTDoWrWg6eNxfNJcxFj5L5at+Q8inH1WWtsK0wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:43:05.345772Z"},"content_sha256":"5ea464f7d26846c8a16d882de293c71eae752d0f16058bd5f6bf94ab8ebfdfca","schema_version":"1.0","event_id":"sha256:5ea464f7d26846c8a16d882de293c71eae752d0f16058bd5f6bf94ab8ebfdfca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/bundle.json","state_url":"https://pith.science/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/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-25T19:43:05Z","links":{"resolver":"https://pith.science/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA","bundle":"https://pith.science/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/bundle.json","state":"https://pith.science/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXV2IM4S4MWOHCJY4GGWBIYIMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IXV2IM4S4MWOHCJY4GGWBIYIMA","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":"e6bcb674f9549cd739cc6a217b0557a09a13bd33b2eec391b90f906bcbe7b0ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T23:20:28Z","title_canon_sha256":"2663486e502c735b3cf1a42a6f9fec2b27700ed25315675e2c9ce8c60ae2b452"},"schema_version":"1.0","source":{"id":"1506.01432","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01432","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01432v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01432","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"IXV2IM4S4MWO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IXV2IM4S4MWOHCJY","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IXV2IM4S","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:5ea464f7d26846c8a16d882de293c71eae752d0f16058bd5f6bf94ab8ebfdfca","target":"graph","created_at":"2026-05-18T01:55:52Z","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":"Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive meaning of their weights. To address this issue, we propose a method to construct a possibilistic logic theory that exactly captures what can be derived from a given MLN using maximum a posteriori (MAP) inference. Unfortunately, the size of this theory is exponential in general. We therefore also propose two methods which can derive compact theories that still ","authors_text":"Jesse Davis, Ondrej Kuzelka, Steven Schockaert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T23:20:28Z","title":"Encoding Markov Logic Networks in Possibilistic Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01432","kind":"arxiv","version":2},"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:1e199e12449b4cf3909049ee96259b5a8699eb01c173e059404b485fa6229c89","target":"record","created_at":"2026-05-18T01:55:52Z","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":"e6bcb674f9549cd739cc6a217b0557a09a13bd33b2eec391b90f906bcbe7b0ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-03T23:20:28Z","title_canon_sha256":"2663486e502c735b3cf1a42a6f9fec2b27700ed25315675e2c9ce8c60ae2b452"},"schema_version":"1.0","source":{"id":"1506.01432","kind":"arxiv","version":2}},"canonical_sha256":"45eba43392e32ce38938e18d60a3086031077b392ab1439a57a52243f8019413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45eba43392e32ce38938e18d60a3086031077b392ab1439a57a52243f8019413","first_computed_at":"2026-05-18T01:55:52.251161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.251161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R13DDzTIwjE2IEX3EFZMVJ/lZtACIry6ZE1RIz64sVkNlHJ587GwEB/hZOKeDQiECOq0EY502D3bJDTFdsuJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.251551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01432","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e199e12449b4cf3909049ee96259b5a8699eb01c173e059404b485fa6229c89","sha256:5ea464f7d26846c8a16d882de293c71eae752d0f16058bd5f6bf94ab8ebfdfca"],"state_sha256":"d8da6dff7abfe9c05c835ef62edcb21c53603da05406d16b98c7a02f60619345"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nwYPudzW16OVpfbcJLJAZvb+e/fLc9Ch0drq5Veu552nphXXUGdGvPDbKViVstEerB+UlIw34XJ6jjGVzrACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:43:05.349828Z","bundle_sha256":"81a0dedc6f91e01bbea7ea672ba12e23ba7d8bfdc4e1164f7f00318c5e772a25"}}