{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7GXJRSGPFE4VFUVKV5F53XZADW","short_pith_number":"pith:7GXJRSGP","canonical_record":{"source":{"id":"1705.05326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-15T16:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"48a2c2d316c3e7a385e092d0b816dcf776c4104dabf4c9911fb609e4b258e98f","abstract_canon_sha256":"099fc36cfd75dc8de56a6df00d4f9a3ce2962e8a9a54478521a58814b2eab244"},"schema_version":"1.0"},"canonical_sha256":"f9ae98c8cf293952d2aaaf4bdddf201d86db2deb789f280b2c802e01445364ee","source":{"kind":"arxiv","id":"1705.05326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05326","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05326v1","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05326","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GXJRSGPFE4V","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7GXJRSGPFE4VFUVK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7GXJRSGP","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7GXJRSGPFE4VFUVKV5F53XZADW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-15T16:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"48a2c2d316c3e7a385e092d0b816dcf776c4104dabf4c9911fb609e4b258e98f","abstract_canon_sha256":"099fc36cfd75dc8de56a6df00d4f9a3ce2962e8a9a54478521a58814b2eab244"},"schema_version":"1.0"},"canonical_sha256":"f9ae98c8cf293952d2aaaf4bdddf201d86db2deb789f280b2c802e01445364ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:30.812765Z","signature_b64":"vhLNd+vC6YD+8wQgs6tJKAYHDh0tdA0l7Tgau2lisNdX9Oh+Ap+mh/X1xlksO4IbMMppLbK2qLYatdGvs9SfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ae98c8cf293952d2aaaf4bdddf201d86db2deb789f280b2c802e01445364ee","last_reissued_at":"2026-05-18T00:44:30.812279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:30.812279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05326","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-18T00:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"myiEM5/66P4VK9R1V6oyDu1sPiYRHrnTsIT4h4InFD088UZVyl7o5tZcsCQ6udyXhz7irx1vpZhy63AAEikPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:02:45.776412Z"},"content_sha256":"0fa53364aa679bef7381a06d93fdd0b12e505a06a8762ec18cbd785d716cb448","schema_version":"1.0","event_id":"sha256:0fa53364aa679bef7381a06d93fdd0b12e505a06a8762ec18cbd785d716cb448"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7GXJRSGPFE4VFUVKV5F53XZADW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Bayesian Networks: Theory, Optimization, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael Huth, Paul Beaumont","submitted_at":"2017-05-15T16:48:12Z","abstract_excerpt":"We develop the theory and practice of an approach to modelling and probabilistic inference in causal networks that is suitable when application-specific or analysis-specific constraints should inform such inference or when little or no data for the learning of causal network structure or probability values at nodes are available. Constrained Bayesian Networks generalize a Bayesian Network such that probabilities can be symbolic, arithmetic expressions and where the meaning of the network is constrained by finitely many formulas from the theory of the reals. A formal semantics for constrained B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05326","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-18T00:44:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWuSDEbpltzf5ybj6dUVDDsJmlUUAemgs+vICsxp7OwpDNiNzNY15V4/zmkwlTngEQ5ZcFnSYlCp9eTZDmEJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:02:45.777039Z"},"content_sha256":"1cedaedf6c66ad19d58028b7aa4317526f180b909926b3db8e323efef25b7155","schema_version":"1.0","event_id":"sha256:1cedaedf6c66ad19d58028b7aa4317526f180b909926b3db8e323efef25b7155"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GXJRSGPFE4VFUVKV5F53XZADW/bundle.json","state_url":"https://pith.science/pith/7GXJRSGPFE4VFUVKV5F53XZADW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GXJRSGPFE4VFUVKV5F53XZADW/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-27T00:02:45Z","links":{"resolver":"https://pith.science/pith/7GXJRSGPFE4VFUVKV5F53XZADW","bundle":"https://pith.science/pith/7GXJRSGPFE4VFUVKV5F53XZADW/bundle.json","state":"https://pith.science/pith/7GXJRSGPFE4VFUVKV5F53XZADW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GXJRSGPFE4VFUVKV5F53XZADW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7GXJRSGPFE4VFUVKV5F53XZADW","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":"099fc36cfd75dc8de56a6df00d4f9a3ce2962e8a9a54478521a58814b2eab244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-15T16:48:12Z","title_canon_sha256":"48a2c2d316c3e7a385e092d0b816dcf776c4104dabf4c9911fb609e4b258e98f"},"schema_version":"1.0","source":{"id":"1705.05326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05326","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05326v1","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05326","created_at":"2026-05-18T00:44:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GXJRSGPFE4V","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7GXJRSGPFE4VFUVK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7GXJRSGP","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:1cedaedf6c66ad19d58028b7aa4317526f180b909926b3db8e323efef25b7155","target":"graph","created_at":"2026-05-18T00:44:30Z","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 develop the theory and practice of an approach to modelling and probabilistic inference in causal networks that is suitable when application-specific or analysis-specific constraints should inform such inference or when little or no data for the learning of causal network structure or probability values at nodes are available. Constrained Bayesian Networks generalize a Bayesian Network such that probabilities can be symbolic, arithmetic expressions and where the meaning of the network is constrained by finitely many formulas from the theory of the reals. A formal semantics for constrained B","authors_text":"Michael Huth, Paul Beaumont","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-15T16:48:12Z","title":"Constrained Bayesian Networks: Theory, Optimization, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05326","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:0fa53364aa679bef7381a06d93fdd0b12e505a06a8762ec18cbd785d716cb448","target":"record","created_at":"2026-05-18T00:44:30Z","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":"099fc36cfd75dc8de56a6df00d4f9a3ce2962e8a9a54478521a58814b2eab244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-15T16:48:12Z","title_canon_sha256":"48a2c2d316c3e7a385e092d0b816dcf776c4104dabf4c9911fb609e4b258e98f"},"schema_version":"1.0","source":{"id":"1705.05326","kind":"arxiv","version":1}},"canonical_sha256":"f9ae98c8cf293952d2aaaf4bdddf201d86db2deb789f280b2c802e01445364ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9ae98c8cf293952d2aaaf4bdddf201d86db2deb789f280b2c802e01445364ee","first_computed_at":"2026-05-18T00:44:30.812279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:30.812279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhLNd+vC6YD+8wQgs6tJKAYHDh0tdA0l7Tgau2lisNdX9Oh+Ap+mh/X1xlksO4IbMMppLbK2qLYatdGvs9SfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:30.812765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa53364aa679bef7381a06d93fdd0b12e505a06a8762ec18cbd785d716cb448","sha256:1cedaedf6c66ad19d58028b7aa4317526f180b909926b3db8e323efef25b7155"],"state_sha256":"b1de8edf10afb2596cfd3e337626885e324d38c4728f4e3659b965cf0f277279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aO927zH3Bvk73g56QYXfZyg4ajvGhs201Qt6xZeFvJZZAGWISv1RYBJ7B+DWLDTTUtk/qY4QdE2S2fR7Xd91Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:02:45.780402Z","bundle_sha256":"95bf24bdc85afc7da9de8894a024dad3fbc07c09f4a8d5087868ae84df493a97"}}