{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KBXKGFNBYTPESZEA3RFOSMCVRZ","short_pith_number":"pith:KBXKGFNB","canonical_record":{"source":{"id":"1304.1101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"ac2df81d6fd2b682913bb01078e9911e2d820154666692de973614655c2cbf12","abstract_canon_sha256":"4abebf582df0742df165f3c6593dc706c73fa851ac373b0b778d3d00b3c167c2"},"schema_version":"1.0"},"canonical_sha256":"506ea315a1c4de496480dc4ae930558e66bd4b233798302184dbf90adf2b802e","source":{"kind":"arxiv","id":"1304.1101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1101","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1101v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1101","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"KBXKGFNBYTPE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KBXKGFNBYTPESZEA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KBXKGFNB","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KBXKGFNBYTPESZEA3RFOSMCVRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:56:23Z","cross_cats_sorted":[],"title_canon_sha256":"ac2df81d6fd2b682913bb01078e9911e2d820154666692de973614655c2cbf12","abstract_canon_sha256":"4abebf582df0742df165f3c6593dc706c73fa851ac373b0b778d3d00b3c167c2"},"schema_version":"1.0"},"canonical_sha256":"506ea315a1c4de496480dc4ae930558e66bd4b233798302184dbf90adf2b802e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.770726Z","signature_b64":"ecaV8hml7bOtrNVMfpkFLTiYlu9qZWsmGqnLxU+iRf6FbmvPhm7Uy5vrNxfsac82530BU5Fs8DM/zK0OrLrRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506ea315a1c4de496480dc4ae930558e66bd4b233798302184dbf90adf2b802e","last_reissued_at":"2026-05-18T03:29:04.769996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.769996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1101","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":"FCCjossEzvTDUiKGRYvFwQgbkFUlzsXnx0a64XYTqg3Bw/tJ63gBaq9HaOv+6dlLsUq0sD5rKJ0Hf9VAmuByDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:02:37.255401Z"},"content_sha256":"1e2a62890bb03371491e4612f885ea2840b02e43a169ee248fc0924bbf0c269a","schema_version":"1.0","event_id":"sha256:1e2a62890bb03371491e4612f885ea2840b02e43a169ee248fc0924bbf0c269a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KBXKGFNBYTPESZEA3RFOSMCVRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximations in Bayesian Belief Universe for Knowledge Based Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Jensen, S. K. Anderson","submitted_at":"2013-03-27T13:56:23Z","abstract_excerpt":"When expert systems based on causal probabilistic networks (CPNs) reach a certain size and complexity, the \"combinatorial explosion monster\" tends to be present. We propose an approximation scheme that identifies rarely occurring cases and excludes these from being processed as ordinary cases in a CPN-based expert system. Depending on the topology and the probability distributions of the CPN, the numbers (representing probabilities of state combinations) in the underlying numerical representation can become very small. Annihilating these numbers and utilizing the resulting sparseness through d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1101","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":"2nhheFVSVtIZZ2XdKbIg0Nw52tEoAT4F+9vV54JZQ1omnaZpROkwIEtUv4gK2GkbKK9TY6H2yx7Oe0Ipcx0wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:02:37.256188Z"},"content_sha256":"0cb56465574624f67bdcd6f0999eaafdd1c564cc854b5506152fb2fc34c1756c","schema_version":"1.0","event_id":"sha256:0cb56465574624f67bdcd6f0999eaafdd1c564cc854b5506152fb2fc34c1756c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/bundle.json","state_url":"https://pith.science/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/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-31T05:02:37Z","links":{"resolver":"https://pith.science/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ","bundle":"https://pith.science/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/bundle.json","state":"https://pith.science/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBXKGFNBYTPESZEA3RFOSMCVRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KBXKGFNBYTPESZEA3RFOSMCVRZ","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":"4abebf582df0742df165f3c6593dc706c73fa851ac373b0b778d3d00b3c167c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:56:23Z","title_canon_sha256":"ac2df81d6fd2b682913bb01078e9911e2d820154666692de973614655c2cbf12"},"schema_version":"1.0","source":{"id":"1304.1101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1101","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1101v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1101","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"KBXKGFNBYTPE","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KBXKGFNBYTPESZEA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KBXKGFNB","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:0cb56465574624f67bdcd6f0999eaafdd1c564cc854b5506152fb2fc34c1756c","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":"When expert systems based on causal probabilistic networks (CPNs) reach a certain size and complexity, the \"combinatorial explosion monster\" tends to be present. We propose an approximation scheme that identifies rarely occurring cases and excludes these from being processed as ordinary cases in a CPN-based expert system. Depending on the topology and the probability distributions of the CPN, the numbers (representing probabilities of state combinations) in the underlying numerical representation can become very small. Annihilating these numbers and utilizing the resulting sparseness through d","authors_text":"Frank Jensen, S. K. Anderson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:56:23Z","title":"Approximations in Bayesian Belief Universe for Knowledge Based Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1101","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:1e2a62890bb03371491e4612f885ea2840b02e43a169ee248fc0924bbf0c269a","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":"4abebf582df0742df165f3c6593dc706c73fa851ac373b0b778d3d00b3c167c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:56:23Z","title_canon_sha256":"ac2df81d6fd2b682913bb01078e9911e2d820154666692de973614655c2cbf12"},"schema_version":"1.0","source":{"id":"1304.1101","kind":"arxiv","version":1}},"canonical_sha256":"506ea315a1c4de496480dc4ae930558e66bd4b233798302184dbf90adf2b802e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506ea315a1c4de496480dc4ae930558e66bd4b233798302184dbf90adf2b802e","first_computed_at":"2026-05-18T03:29:04.769996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:04.769996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ecaV8hml7bOtrNVMfpkFLTiYlu9qZWsmGqnLxU+iRf6FbmvPhm7Uy5vrNxfsac82530BU5Fs8DM/zK0OrLrRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:04.770726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e2a62890bb03371491e4612f885ea2840b02e43a169ee248fc0924bbf0c269a","sha256:0cb56465574624f67bdcd6f0999eaafdd1c564cc854b5506152fb2fc34c1756c"],"state_sha256":"9ec20fa8d30e3d5263fd4d0c6dd2490a4971574b812be3bd72beec1d7e01cb8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9SvFjlQKxcIUboVMtOJcHOFm71HD66QLQYOFkX0lD5h06Z74s199sfbZ8lqtgak3zKZH0u1tIjldMoM82JDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:02:37.260146Z","bundle_sha256":"dcedb1a381fb6aa1d48ad03ca7523379f7c69530ec2b0a362246056b128467d0"}}