{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZSGPWC6KRN23YJQXVVXHNIJ3C3","short_pith_number":"pith:ZSGPWC6K","canonical_record":{"source":{"id":"1302.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:08Z","cross_cats_sorted":[],"title_canon_sha256":"e2c5a8524a4f19ef8c71ce84945501c2095be61941868caae7d9ee66a9af14f6","abstract_canon_sha256":"ca2a17838a79b74cffad0349e5c4ec462bcb440495791f0dd5d153df29281d96"},"schema_version":"1.0"},"canonical_sha256":"cc8cfb0bca8b75bc2617ad6e76a13b16c33785a0c8a2ac16fe03f0f57b2dbebf","source":{"kind":"arxiv","id":"1302.3588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3588","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3588v1","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3588","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZSGPWC6KRN23","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZSGPWC6KRN23YJQX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZSGPWC6K","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZSGPWC6KRN23YJQXVVXHNIJ3C3","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:08Z","cross_cats_sorted":[],"title_canon_sha256":"e2c5a8524a4f19ef8c71ce84945501c2095be61941868caae7d9ee66a9af14f6","abstract_canon_sha256":"ca2a17838a79b74cffad0349e5c4ec462bcb440495791f0dd5d153df29281d96"},"schema_version":"1.0"},"canonical_sha256":"cc8cfb0bca8b75bc2617ad6e76a13b16c33785a0c8a2ac16fe03f0f57b2dbebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:20.693203Z","signature_b64":"209WrFS3V1qO7CkBtaaS4/ApCOgVBmQchtLmy4ZLFMlw/SITL5tV7PUwvY/wCC2wzDAhcncl7y9Cmp8czdO4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc8cfb0bca8b75bc2617ad6e76a13b16c33785a0c8a2ac16fe03f0f57b2dbebf","last_reissued_at":"2026-05-18T01:00:20.692391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:20.692391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3588","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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF78o5yGKG8Rn9Ya2VWwHGr8D4aqS7sVTPGRWK2jKNkTMBBJRrctkU8wlzXjKzON+8py06yk+cp/X6ujd/LSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:27.992861Z"},"content_sha256":"1b8273bc4a858d3b8fcc0760eb031c17ca0f3d1f95e342d39ce4a4f134fd4100","schema_version":"1.0","event_id":"sha256:1b8273bc4a858d3b8fcc0760eb031c17ca0f3d1f95e342d39ce4a4f134fd4100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZSGPWC6KRN23YJQXVVXHNIJ3C3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity Reduction for BN2O Networks Using Similarity of States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander V. Kozlov, Jaswinder Pal Singh","submitted_at":"2013-02-13T14:15:08Z","abstract_excerpt":"Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approximations in the knowledge representation.  In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation and inference which is based on this property.  We define two or more states of a node to be similar when the ratio of their probabilities, the likelihood ratio, does not depend on the instantiations of the other nodes in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3588","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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKK47ajGaIwzhT+CVKQ8Wqx7Vmuhl8YygB9HGxAGUOcZniTR8iEvuYQENcwib1AQtwohiDO0a4duAkq5MSzRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:21:27.993759Z"},"content_sha256":"bc1b463548ea2a0583454b806861399e7f2d8547933f8af1c849e093c4b43f02","schema_version":"1.0","event_id":"sha256:bc1b463548ea2a0583454b806861399e7f2d8547933f8af1c849e093c4b43f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/bundle.json","state_url":"https://pith.science/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/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-10T16:21:27Z","links":{"resolver":"https://pith.science/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3","bundle":"https://pith.science/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/bundle.json","state":"https://pith.science/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSGPWC6KRN23YJQXVVXHNIJ3C3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZSGPWC6KRN23YJQXVVXHNIJ3C3","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":"ca2a17838a79b74cffad0349e5c4ec462bcb440495791f0dd5d153df29281d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:08Z","title_canon_sha256":"e2c5a8524a4f19ef8c71ce84945501c2095be61941868caae7d9ee66a9af14f6"},"schema_version":"1.0","source":{"id":"1302.3588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3588","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3588v1","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3588","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZSGPWC6KRN23","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZSGPWC6KRN23YJQX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZSGPWC6K","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:bc1b463548ea2a0583454b806861399e7f2d8547933f8af1c849e093c4b43f02","target":"graph","created_at":"2026-05-18T01:00:20Z","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":"Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approximations in the knowledge representation.  In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation and inference which is based on this property.  We define two or more states of a node to be similar when the ratio of their probabilities, the likelihood ratio, does not depend on the instantiations of the other nodes in","authors_text":"Alexander V. Kozlov, Jaswinder Pal Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:08Z","title":"Computational Complexity Reduction for BN2O Networks Using Similarity of States"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3588","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:1b8273bc4a858d3b8fcc0760eb031c17ca0f3d1f95e342d39ce4a4f134fd4100","target":"record","created_at":"2026-05-18T01:00:20Z","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":"ca2a17838a79b74cffad0349e5c4ec462bcb440495791f0dd5d153df29281d96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:15:08Z","title_canon_sha256":"e2c5a8524a4f19ef8c71ce84945501c2095be61941868caae7d9ee66a9af14f6"},"schema_version":"1.0","source":{"id":"1302.3588","kind":"arxiv","version":1}},"canonical_sha256":"cc8cfb0bca8b75bc2617ad6e76a13b16c33785a0c8a2ac16fe03f0f57b2dbebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8cfb0bca8b75bc2617ad6e76a13b16c33785a0c8a2ac16fe03f0f57b2dbebf","first_computed_at":"2026-05-18T01:00:20.692391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:20.692391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"209WrFS3V1qO7CkBtaaS4/ApCOgVBmQchtLmy4ZLFMlw/SITL5tV7PUwvY/wCC2wzDAhcncl7y9Cmp8czdO4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:20.693203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b8273bc4a858d3b8fcc0760eb031c17ca0f3d1f95e342d39ce4a4f134fd4100","sha256:bc1b463548ea2a0583454b806861399e7f2d8547933f8af1c849e093c4b43f02"],"state_sha256":"9947105e6874420ffe620ad13878f53c6927225fa0691960006eb398f8cbe4d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpvPTZ0HXG1VKGkGX0JLSmribInhpKt6jRHTHfVSJOCwlZ/TUnU6eUcXk3B/Vcu2L2oYVeUUhZ+D4xWGBtJ9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:21:27.996803Z","bundle_sha256":"15f568ac790331fee61e784c6084f4224f25127ac8e3ce4c29ddf59eb74fbc38"}}