{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E5IUHOUP5546XROC5BB5XVII2D","short_pith_number":"pith:E5IUHOUP","canonical_record":{"source":{"id":"1304.1112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"fb0e6c89e60180938f9fdbd3222c9591d67aa8a37a38461e9644b3027c4c3bc8","abstract_canon_sha256":"8f64309a3ed1ea74e91cd575e43a7a24fc5c675c2f872b741c0ac0a5e1f35c7c"},"schema_version":"1.0"},"canonical_sha256":"275143ba8fef79ebc5c2e843dbd508d0e697bea153b78b7b1945ee14ac84dd3d","source":{"kind":"arxiv","id":"1304.1112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1112","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1112v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1112","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"E5IUHOUP5546","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E5IUHOUP5546XROC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E5IUHOUP","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E5IUHOUP5546XROC5BB5XVII2D","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"fb0e6c89e60180938f9fdbd3222c9591d67aa8a37a38461e9644b3027c4c3bc8","abstract_canon_sha256":"8f64309a3ed1ea74e91cd575e43a7a24fc5c675c2f872b741c0ac0a5e1f35c7c"},"schema_version":"1.0"},"canonical_sha256":"275143ba8fef79ebc5c2e843dbd508d0e697bea153b78b7b1945ee14ac84dd3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.633537Z","signature_b64":"qTAgJsJCSZViPZ2xZmHuinzD9Y8s16hOFLqzqOV547yBsadqoSfgrI4145ftB820n3XAFSA6pqcebm9b4DfyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"275143ba8fef79ebc5c2e843dbd508d0e697bea153b78b7b1945ee14ac84dd3d","last_reissued_at":"2026-05-18T03:29:04.632713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.632713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1112","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:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWNKIdwj2jC0roMInZ5X09fFSZ+Ih5wQYrdipEgwAfYBOuqR9+DLSb51BAXzhiqdpiJf3vqWao49WHD2XiQwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:15.663504Z"},"content_sha256":"d865569e920e4b5f73cc9f867a0ccc697dc300b2fef435109a084ca774f3ea98","schema_version":"1.0","event_id":"sha256:d865569e920e4b5f73cc9f867a0ccc697dc300b2fef435109a084ca774f3ea98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E5IUHOUP5546XROC5BB5XVII2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning Bayesian Networks for Efficient Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michelle Baker, Terrance E. Boult","submitted_at":"2013-03-27T13:57:25Z","abstract_excerpt":"This paper analyzes the circumstances under which Bayesian networks can be pruned in order to reduce computational complexity without altering the computation for variables of interest.  Given a problem instance which consists of a query and evidence for a set of nodes in the network, it is possible to delete portions of the network which do not participate in the computation for the query.  Savings in computational complexity can be large when the original network is not singly connected.  Results analogous to those described in this paper have been derived before [Geiger, Verma, and Pearl 89"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1112","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:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VWvSYcQIeJj18+vqidna7f57BCcGKLzVU/yN87aV2DFOvPdtips+Qs/QdZn5ZT26dP0r22nt31ev0s7psW8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:44:15.664250Z"},"content_sha256":"d2889adba7795450f6e565ce52236150186d9f7d1a21bd996437a0e2b2a51a37","schema_version":"1.0","event_id":"sha256:d2889adba7795450f6e565ce52236150186d9f7d1a21bd996437a0e2b2a51a37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5IUHOUP5546XROC5BB5XVII2D/bundle.json","state_url":"https://pith.science/pith/E5IUHOUP5546XROC5BB5XVII2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5IUHOUP5546XROC5BB5XVII2D/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-25T17:44:15Z","links":{"resolver":"https://pith.science/pith/E5IUHOUP5546XROC5BB5XVII2D","bundle":"https://pith.science/pith/E5IUHOUP5546XROC5BB5XVII2D/bundle.json","state":"https://pith.science/pith/E5IUHOUP5546XROC5BB5XVII2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5IUHOUP5546XROC5BB5XVII2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E5IUHOUP5546XROC5BB5XVII2D","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":"8f64309a3ed1ea74e91cd575e43a7a24fc5c675c2f872b741c0ac0a5e1f35c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:57:25Z","title_canon_sha256":"fb0e6c89e60180938f9fdbd3222c9591d67aa8a37a38461e9644b3027c4c3bc8"},"schema_version":"1.0","source":{"id":"1304.1112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1112","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1112v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1112","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"E5IUHOUP5546","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E5IUHOUP5546XROC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E5IUHOUP","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d2889adba7795450f6e565ce52236150186d9f7d1a21bd996437a0e2b2a51a37","target":"graph","created_at":"2026-05-18T03:29:04Z","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":"This paper analyzes the circumstances under which Bayesian networks can be pruned in order to reduce computational complexity without altering the computation for variables of interest.  Given a problem instance which consists of a query and evidence for a set of nodes in the network, it is possible to delete portions of the network which do not participate in the computation for the query.  Savings in computational complexity can be large when the original network is not singly connected.  Results analogous to those described in this paper have been derived before [Geiger, Verma, and Pearl 89","authors_text":"Michelle Baker, Terrance E. Boult","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:57:25Z","title":"Pruning Bayesian Networks for Efficient Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1112","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:d865569e920e4b5f73cc9f867a0ccc697dc300b2fef435109a084ca774f3ea98","target":"record","created_at":"2026-05-18T03:29:04Z","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":"8f64309a3ed1ea74e91cd575e43a7a24fc5c675c2f872b741c0ac0a5e1f35c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:57:25Z","title_canon_sha256":"fb0e6c89e60180938f9fdbd3222c9591d67aa8a37a38461e9644b3027c4c3bc8"},"schema_version":"1.0","source":{"id":"1304.1112","kind":"arxiv","version":1}},"canonical_sha256":"275143ba8fef79ebc5c2e843dbd508d0e697bea153b78b7b1945ee14ac84dd3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"275143ba8fef79ebc5c2e843dbd508d0e697bea153b78b7b1945ee14ac84dd3d","first_computed_at":"2026-05-18T03:29:04.632713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:04.632713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qTAgJsJCSZViPZ2xZmHuinzD9Y8s16hOFLqzqOV547yBsadqoSfgrI4145ftB820n3XAFSA6pqcebm9b4DfyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:04.633537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d865569e920e4b5f73cc9f867a0ccc697dc300b2fef435109a084ca774f3ea98","sha256:d2889adba7795450f6e565ce52236150186d9f7d1a21bd996437a0e2b2a51a37"],"state_sha256":"94fbcddff566f0ad9746fca40ddc41bd78bdf81609e857ded7045772224d6b46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lj5oqh8GMdWT/Bb5UShG1i8Sy/aAegLM3Ze8f3rVYzcJpIHp8pcJNCl8Uk5orUKKWFsUoWQXbOz3guCan1FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:44:15.668096Z","bundle_sha256":"c59f1b2aeda7b83f015d2a2e7144e65b21ffd375aa906fc1c89d321cee6b7ffa"}}