{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MUNB3F6MH4UNIFWPP23QQIL53P","short_pith_number":"pith:MUNB3F6M","canonical_record":{"source":{"id":"1107.5152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-26T09:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"b66ad6895d529a5da45f4599ad9458acde4fe22166314bee678d6065cb8ddea2","abstract_canon_sha256":"150865201ef81fff8b33fbe78a3cae6a438cb6676ec52b09b18f550abb8c2530"},"schema_version":"1.0"},"canonical_sha256":"651a1d97cc3f28d416cf7eb708217ddbc6069c04f7c76385e40b392d1abad837","source":{"kind":"arxiv","id":"1107.5152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5152","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5152v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5152","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"MUNB3F6MH4UN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MUNB3F6MH4UNIFWP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MUNB3F6M","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MUNB3F6MH4UNIFWPP23QQIL53P","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-26T09:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"b66ad6895d529a5da45f4599ad9458acde4fe22166314bee678d6065cb8ddea2","abstract_canon_sha256":"150865201ef81fff8b33fbe78a3cae6a438cb6676ec52b09b18f550abb8c2530"},"schema_version":"1.0"},"canonical_sha256":"651a1d97cc3f28d416cf7eb708217ddbc6069c04f7c76385e40b392d1abad837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.889293Z","signature_b64":"hraip9u6zEBBUltS86GoGAxqrE2opJEuMrmmG78YWa6Az1U/8k15VSZWZstkZbkBSvPRxVLv86y6lvHk4W+vCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651a1d97cc3f28d416cf7eb708217ddbc6069c04f7c76385e40b392d1abad837","last_reissued_at":"2026-05-18T04:16:52.888443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.888443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5152","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDUfPmuYsoip2oxT/TTFr5FVB6cmWIKfU0UHl+Pz+fHf5VhQJVf5JCqRrLi/LlEski1p/ViuksO+y2QrSC+aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:28.198247Z"},"content_sha256":"806d6756a631a5bb82be09c2519e52120cf0d9003e7dde08d884cddc9a484d51","schema_version":"1.0","event_id":"sha256:806d6756a631a5bb82be09c2519e52120cf0d9003e7dde08d884cddc9a484d51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MUNB3F6MH4UNIFWPP23QQIL53P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Magic of Logical Inference in Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelika Kimmig, Bernd Gutmann, Ingo Thon, Luc De Raedt, Maurice Bruynooghe","submitted_at":"2011-07-26T09:58:08Z","abstract_excerpt":"Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions, nor evidence. To overcome these limitations, we introduce distributional clauses, a variation and extension of Sato's distribution semantics. We also contribute a novel approximate inference method that integrates forward reasoning with im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5152","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TA1MyUQ6IMAFTjR/n4EdXU3C8nNU7ihywqlRepm6or47FqZHNE3U52tCxy7Aic96URoSFRLirb90HkSIywsqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:28.198616Z"},"content_sha256":"c17d74d2974f51f9d12a8de43d68e2ca23d00744091ebeaf583fe42b4b573c59","schema_version":"1.0","event_id":"sha256:c17d74d2974f51f9d12a8de43d68e2ca23d00744091ebeaf583fe42b4b573c59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUNB3F6MH4UNIFWPP23QQIL53P/bundle.json","state_url":"https://pith.science/pith/MUNB3F6MH4UNIFWPP23QQIL53P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUNB3F6MH4UNIFWPP23QQIL53P/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-30T15:00:28Z","links":{"resolver":"https://pith.science/pith/MUNB3F6MH4UNIFWPP23QQIL53P","bundle":"https://pith.science/pith/MUNB3F6MH4UNIFWPP23QQIL53P/bundle.json","state":"https://pith.science/pith/MUNB3F6MH4UNIFWPP23QQIL53P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUNB3F6MH4UNIFWPP23QQIL53P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MUNB3F6MH4UNIFWPP23QQIL53P","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":"150865201ef81fff8b33fbe78a3cae6a438cb6676ec52b09b18f550abb8c2530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-26T09:58:08Z","title_canon_sha256":"b66ad6895d529a5da45f4599ad9458acde4fe22166314bee678d6065cb8ddea2"},"schema_version":"1.0","source":{"id":"1107.5152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5152","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5152v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5152","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"MUNB3F6MH4UN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MUNB3F6MH4UNIFWP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MUNB3F6M","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:c17d74d2974f51f9d12a8de43d68e2ca23d00744091ebeaf583fe42b4b573c59","target":"graph","created_at":"2026-05-18T04:16: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":"Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions, nor evidence. To overcome these limitations, we introduce distributional clauses, a variation and extension of Sato's distribution semantics. We also contribute a novel approximate inference method that integrates forward reasoning with im","authors_text":"Angelika Kimmig, Bernd Gutmann, Ingo Thon, Luc De Raedt, Maurice Bruynooghe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-26T09:58:08Z","title":"The Magic of Logical Inference in Probabilistic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5152","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:806d6756a631a5bb82be09c2519e52120cf0d9003e7dde08d884cddc9a484d51","target":"record","created_at":"2026-05-18T04:16: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":"150865201ef81fff8b33fbe78a3cae6a438cb6676ec52b09b18f550abb8c2530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-26T09:58:08Z","title_canon_sha256":"b66ad6895d529a5da45f4599ad9458acde4fe22166314bee678d6065cb8ddea2"},"schema_version":"1.0","source":{"id":"1107.5152","kind":"arxiv","version":1}},"canonical_sha256":"651a1d97cc3f28d416cf7eb708217ddbc6069c04f7c76385e40b392d1abad837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"651a1d97cc3f28d416cf7eb708217ddbc6069c04f7c76385e40b392d1abad837","first_computed_at":"2026-05-18T04:16:52.888443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:52.888443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hraip9u6zEBBUltS86GoGAxqrE2opJEuMrmmG78YWa6Az1U/8k15VSZWZstkZbkBSvPRxVLv86y6lvHk4W+vCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:52.889293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:806d6756a631a5bb82be09c2519e52120cf0d9003e7dde08d884cddc9a484d51","sha256:c17d74d2974f51f9d12a8de43d68e2ca23d00744091ebeaf583fe42b4b573c59"],"state_sha256":"3191cddf7726db790251dc1b52f86ce705747be0d24eab9cb94595885d67ec83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhWDHJCtptQvitTWvs4egM2bh7jN3vfhu6WILvhfongNvrtb6jxqGZQHmywnHuBszeP8naAPridMVI8EQistAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:00:28.200738Z","bundle_sha256":"b470bb407f01fc86272b901d27f049fc2e2d7f9989d6eb15322622e6ea71d8d6"}}