{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MY2TMKMGM2TP4NL67ELSDDDYHV","short_pith_number":"pith:MY2TMKMG","canonical_record":{"source":{"id":"1303.1480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:20:51Z","cross_cats_sorted":[],"title_canon_sha256":"58c0f04dbcec34354eb9b4e054baa84a0caf594cb999e3f39886a111e7b3ec30","abstract_canon_sha256":"ba6b3bb3fbf8a9234565db1e5194e76e34ce6b2790134f714e9562df41c0db9c"},"schema_version":"1.0"},"canonical_sha256":"663536298666a6fe357ef917218c783d568ebd57651b8f457cec4e3aff8f530c","source":{"kind":"arxiv","id":"1303.1480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1480","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1480v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1480","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"MY2TMKMGM2TP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MY2TMKMGM2TP4NL6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MY2TMKMG","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MY2TMKMGM2TP4NL67ELSDDDYHV","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:20:51Z","cross_cats_sorted":[],"title_canon_sha256":"58c0f04dbcec34354eb9b4e054baa84a0caf594cb999e3f39886a111e7b3ec30","abstract_canon_sha256":"ba6b3bb3fbf8a9234565db1e5194e76e34ce6b2790134f714e9562df41c0db9c"},"schema_version":"1.0"},"canonical_sha256":"663536298666a6fe357ef917218c783d568ebd57651b8f457cec4e3aff8f530c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.668661Z","signature_b64":"NdpeXv3UxOMb/SMZNHhtuIwoYsAhOBFV9G0IWuysvcnC1Nu963EeM7iASjOZNDAo9ikslRo1fN1E78Zxda9WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"663536298666a6fe357ef917218c783d568ebd57651b8f457cec4e3aff8f530c","last_reissued_at":"2026-05-18T03:31:42.668099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.668099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1480","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:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfIlcUsudF8TJ5ToXvugHo+zpz671hTJze14CUVjJ52cITzXEPj3hgif+rn71Exn5MNhGx1X9Gi7+0AohDqVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:45:10.795338Z"},"content_sha256":"940fc1f2517bbe95698374350297c9a688794205d6973356677c8e9124a93b58","schema_version":"1.0","event_id":"sha256:940fc1f2517bbe95698374350297c9a688794205d6973356677c8e9124a93b58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MY2TMKMGM2TP4NL67ELSDDDYHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using First-Order Probability Logic for the Construction of Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fahiem Bacchus","submitted_at":"2013-03-06T14:20:51Z","abstract_excerpt":"We present a mechanism for constructing graphical models, specifically Bayesian networks, from a knowledge base of general probabilistic information.  The unique feature of our approach is that it uses a powerful first-order probabilistic logic for expressing the general knowledge base.  This logic allows for the representation of a wide range of logical and probabilistic information. The model construction procedure we propose uses notions from direct inference to identify pieces of local statistical information from the knowledge base that are most appropriate to the particular event we want"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1480","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:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC9xOhZK6zUO0+yoL2VjxzTM7NT2gxTF46eWEA8ogTKXeB7AufEgsBNFj29vVzTtkxyTfUOuDM6je4TRLNm3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:45:10.796145Z"},"content_sha256":"bc2bfdd11042958af34e1aca91b8ddddab8953725047a324ba8f826849cf7ae1","schema_version":"1.0","event_id":"sha256:bc2bfdd11042958af34e1aca91b8ddddab8953725047a324ba8f826849cf7ae1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/bundle.json","state_url":"https://pith.science/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/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-31T19:45:10Z","links":{"resolver":"https://pith.science/pith/MY2TMKMGM2TP4NL67ELSDDDYHV","bundle":"https://pith.science/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/bundle.json","state":"https://pith.science/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MY2TMKMGM2TP4NL67ELSDDDYHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MY2TMKMGM2TP4NL67ELSDDDYHV","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":"ba6b3bb3fbf8a9234565db1e5194e76e34ce6b2790134f714e9562df41c0db9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:20:51Z","title_canon_sha256":"58c0f04dbcec34354eb9b4e054baa84a0caf594cb999e3f39886a111e7b3ec30"},"schema_version":"1.0","source":{"id":"1303.1480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1480","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1480v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1480","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"MY2TMKMGM2TP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MY2TMKMGM2TP4NL6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MY2TMKMG","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:bc2bfdd11042958af34e1aca91b8ddddab8953725047a324ba8f826849cf7ae1","target":"graph","created_at":"2026-05-18T03:31:42Z","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 present a mechanism for constructing graphical models, specifically Bayesian networks, from a knowledge base of general probabilistic information.  The unique feature of our approach is that it uses a powerful first-order probabilistic logic for expressing the general knowledge base.  This logic allows for the representation of a wide range of logical and probabilistic information. The model construction procedure we propose uses notions from direct inference to identify pieces of local statistical information from the knowledge base that are most appropriate to the particular event we want","authors_text":"Fahiem Bacchus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:20:51Z","title":"Using First-Order Probability Logic for the Construction of Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1480","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:940fc1f2517bbe95698374350297c9a688794205d6973356677c8e9124a93b58","target":"record","created_at":"2026-05-18T03:31:42Z","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":"ba6b3bb3fbf8a9234565db1e5194e76e34ce6b2790134f714e9562df41c0db9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:20:51Z","title_canon_sha256":"58c0f04dbcec34354eb9b4e054baa84a0caf594cb999e3f39886a111e7b3ec30"},"schema_version":"1.0","source":{"id":"1303.1480","kind":"arxiv","version":1}},"canonical_sha256":"663536298666a6fe357ef917218c783d568ebd57651b8f457cec4e3aff8f530c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"663536298666a6fe357ef917218c783d568ebd57651b8f457cec4e3aff8f530c","first_computed_at":"2026-05-18T03:31:42.668099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:42.668099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdpeXv3UxOMb/SMZNHhtuIwoYsAhOBFV9G0IWuysvcnC1Nu963EeM7iASjOZNDAo9ikslRo1fN1E78Zxda9WCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:42.668661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:940fc1f2517bbe95698374350297c9a688794205d6973356677c8e9124a93b58","sha256:bc2bfdd11042958af34e1aca91b8ddddab8953725047a324ba8f826849cf7ae1"],"state_sha256":"8a7c462c33a38af292ff00112552e8bb1d4a06f7afaf9ca18ef4b2b4ad7814bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbvsoAIISAt/Q8ivVf7z/c4ToDarUHTfyuZzsKaA0NojE6AvRTeL8hL0zE8RB8XmoE3ZF5Q4f+IGeMMFcs9aDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:45:10.801153Z","bundle_sha256":"020b9b54346d6e382103f466e7b762da13e9c518b6a7e235096e87886acf87d0"}}