{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VXPSVNZ3IDADQ5S754GAUL75UJ","short_pith_number":"pith:VXPSVNZ3","canonical_record":{"source":{"id":"1301.3846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"6091b8629787e755bad3a1ee9ddbb97412ed96cd4f9e03a8f87e5165f0b605a1","abstract_canon_sha256":"a3686b4cb81a20ad1f12c56c9b811474f7095b68642c12b3ab1a5a5d3dae9454"},"schema_version":"1.0"},"canonical_sha256":"addf2ab73b40c038765fef0c0a2ffda24939b82e4b629105a7ad39c1d89ccac7","source":{"kind":"arxiv","id":"1301.3846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3846","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3846v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3846","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"VXPSVNZ3IDAD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXPSVNZ3IDADQ5S7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXPSVNZ3","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VXPSVNZ3IDADQ5S754GAUL75UJ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"6091b8629787e755bad3a1ee9ddbb97412ed96cd4f9e03a8f87e5165f0b605a1","abstract_canon_sha256":"a3686b4cb81a20ad1f12c56c9b811474f7095b68642c12b3ab1a5a5d3dae9454"},"schema_version":"1.0"},"canonical_sha256":"addf2ab73b40c038765fef0c0a2ffda24939b82e4b629105a7ad39c1d89ccac7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.392088Z","signature_b64":"Ap0ROqlh0aXjb/+pYE5QARTztdIyAjnkVfqcQbYMZWK6TZO7jl1SPUu3kooEeP/wiz8HZF0llGPEViQ1QY2XBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"addf2ab73b40c038765fef0c0a2ffda24939b82e4b629105a7ad39c1d89ccac7","last_reissued_at":"2026-05-18T03:36:15.391534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.391534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3846","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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiTpsiSkYirPz8JblrJlGMXh19biq1W5y1gWQdddl5n3XYMmmUrw6oAio45yc5jjqSbLLLf4bwDBg1CpC/cdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:58.782837Z"},"content_sha256":"99880223ef26815f8ea59689df97965aa97980e6a95cb3befbf95aabf45eed82","schema_version":"1.0","event_id":"sha256:99880223ef26815f8ea59689df97965aa97980e6a95cb3befbf95aabf45eed82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VXPSVNZ3IDADQ5S754GAUL75UJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Logic Programs: Sampling, Inference and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"James Cussens","submitted_at":"2013-01-16T15:49:34Z","abstract_excerpt":"Algorithms for exact and approximate inference in stochastic logic   programs (SLPs) are presented, based respectively, on variable   elimination and importance sampling. We then show how SLPs can be   used to represent prior distributions for machine learning, using   (i) logic programs and (ii) Bayes net structures as examples.   Drawing on existing work in statistics, we apply the   Metropolis-Hasting algorithm to construct a Markov chain which   samples from the posterior distribution. A Prolog implementation for   this is described. We also discuss the possibility of constructing   explic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3846","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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey127wHfWSLIoxEB5stihM97wQehNqnEhXRlwgSXYaC8slTaENFgSDh2z1K7JePELPy1i0A/ANgLT77hWkpmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:58.783174Z"},"content_sha256":"e760ba021027052f3b338c5b811c4052d82d1662da305403b9537f24460b32cb","schema_version":"1.0","event_id":"sha256:e760ba021027052f3b338c5b811c4052d82d1662da305403b9537f24460b32cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/bundle.json","state_url":"https://pith.science/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/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-01T22:22:58Z","links":{"resolver":"https://pith.science/pith/VXPSVNZ3IDADQ5S754GAUL75UJ","bundle":"https://pith.science/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/bundle.json","state":"https://pith.science/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXPSVNZ3IDADQ5S754GAUL75UJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VXPSVNZ3IDADQ5S754GAUL75UJ","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":"a3686b4cb81a20ad1f12c56c9b811474f7095b68642c12b3ab1a5a5d3dae9454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:49:34Z","title_canon_sha256":"6091b8629787e755bad3a1ee9ddbb97412ed96cd4f9e03a8f87e5165f0b605a1"},"schema_version":"1.0","source":{"id":"1301.3846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3846","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3846v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3846","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"VXPSVNZ3IDAD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VXPSVNZ3IDADQ5S7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VXPSVNZ3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:e760ba021027052f3b338c5b811c4052d82d1662da305403b9537f24460b32cb","target":"graph","created_at":"2026-05-18T03:36:15Z","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":"Algorithms for exact and approximate inference in stochastic logic   programs (SLPs) are presented, based respectively, on variable   elimination and importance sampling. We then show how SLPs can be   used to represent prior distributions for machine learning, using   (i) logic programs and (ii) Bayes net structures as examples.   Drawing on existing work in statistics, we apply the   Metropolis-Hasting algorithm to construct a Markov chain which   samples from the posterior distribution. A Prolog implementation for   this is described. We also discuss the possibility of constructing   explic","authors_text":"James Cussens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:49:34Z","title":"Stochastic Logic Programs: Sampling, Inference and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3846","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:99880223ef26815f8ea59689df97965aa97980e6a95cb3befbf95aabf45eed82","target":"record","created_at":"2026-05-18T03:36:15Z","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":"a3686b4cb81a20ad1f12c56c9b811474f7095b68642c12b3ab1a5a5d3dae9454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:49:34Z","title_canon_sha256":"6091b8629787e755bad3a1ee9ddbb97412ed96cd4f9e03a8f87e5165f0b605a1"},"schema_version":"1.0","source":{"id":"1301.3846","kind":"arxiv","version":1}},"canonical_sha256":"addf2ab73b40c038765fef0c0a2ffda24939b82e4b629105a7ad39c1d89ccac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"addf2ab73b40c038765fef0c0a2ffda24939b82e4b629105a7ad39c1d89ccac7","first_computed_at":"2026-05-18T03:36:15.391534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.391534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ap0ROqlh0aXjb/+pYE5QARTztdIyAjnkVfqcQbYMZWK6TZO7jl1SPUu3kooEeP/wiz8HZF0llGPEViQ1QY2XBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.392088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99880223ef26815f8ea59689df97965aa97980e6a95cb3befbf95aabf45eed82","sha256:e760ba021027052f3b338c5b811c4052d82d1662da305403b9537f24460b32cb"],"state_sha256":"f6d6de9fd77f1c5625b2ef62d0e87e453521a6c51fbac7dc98b4bbedc79d22b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55JtrYezCkp9IwZhCz5/f+UkcOr7ucjWKjc5lOAdDhuyVA1P23CcIplU+vMZStWasWma8vmRB3KvQKKFBOUdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:58.785089Z","bundle_sha256":"fe64fb1fb27bfe9f433f9d2a9323ab1b2f2a170617bf0fbe61b252bdc294194a"}}