{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WRUKFCEG5COBGB2M5XW22TRGEP","short_pith_number":"pith:WRUKFCEG","canonical_record":{"source":{"id":"1304.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"954e7656d437d3d992de9c5e9a183049d7f62eb8a3250bc1a5e94e477cc71e36","abstract_canon_sha256":"6244930f2e293cee51e1f67975e46f2442c1361663475c0d0d17a7b630f77511"},"schema_version":"1.0"},"canonical_sha256":"b468a28886e89c13074cededad4e2623d8ba3c264606a4c512fa2e54adcbc33b","source":{"kind":"arxiv","id":"1304.1097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1097","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1097v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1097","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"WRUKFCEG5COB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WRUKFCEG5COBGB2M","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WRUKFCEG","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WRUKFCEG5COBGB2M5XW22TRGEP","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"954e7656d437d3d992de9c5e9a183049d7f62eb8a3250bc1a5e94e477cc71e36","abstract_canon_sha256":"6244930f2e293cee51e1f67975e46f2442c1361663475c0d0d17a7b630f77511"},"schema_version":"1.0"},"canonical_sha256":"b468a28886e89c13074cededad4e2623d8ba3c264606a4c512fa2e54adcbc33b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.810378Z","signature_b64":"udnxxiOcTqCguSuGcibY1GZazzXC1xRQfqMstFQry0SlSm0UaeCBw0fVyNWzexER8ChvYtcKbfkg+L4sBEMjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b468a28886e89c13074cededad4e2623d8ba3c264606a4c512fa2e54adcbc33b","last_reissued_at":"2026-05-18T03:29:04.809688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.809688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1097","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":"xU3umJHhRHalwMfGAnONFU5F7PP8kLMHv6s3nwXXb2kc70PYpKe2VRRRUA0KpQ8V0N5uAFlUV4mVXvF29+M6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:32:10.008203Z"},"content_sha256":"c0e55831c4be7fb4c07b0a789cf6076169b972af190db993eaf4ce824a3dad41","schema_version":"1.0","event_id":"sha256:c0e55831c4be7fb4c07b0a789cf6076169b972af190db993eaf4ce824a3dad41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WRUKFCEG5COBGB2M5XW22TRGEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Randomized Approximation Algorithm of Logic Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gregory F. Cooper, R. Martin Chavez","submitted_at":"2013-03-27T13:55:59Z","abstract_excerpt":"In recent years, researchers in decision analysis and artificial intelligence (AI) have used Bayesian belief networks to build models of expert opinion. Using standard methods drawn from the theory of computational complexity, workers in the field have shown that the problem of exact probabilistic inference on belief networks almost certainly requires exponential computation in the worst ease [3]. We have previously described a randomized approximation scheme, called BN-RAS, for computation on belief networks [ 1, 2, 4]. We gave precise analytic bounds on the convergence of BN-RAS and showed h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1097","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":"yYvcbC298eb2s9MGv4fDD8UJJhLDoHh0Vl5kmJlm7MwQ3CP93BkkNFI2qlz0A/pmGYj7jV5pLus9xWFhZzb0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:32:10.008607Z"},"content_sha256":"fc7fa12b44237c7b3264f9b3b8179cbaafc39e4e9f592586dc8a8d5e589f6798","schema_version":"1.0","event_id":"sha256:fc7fa12b44237c7b3264f9b3b8179cbaafc39e4e9f592586dc8a8d5e589f6798"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRUKFCEG5COBGB2M5XW22TRGEP/bundle.json","state_url":"https://pith.science/pith/WRUKFCEG5COBGB2M5XW22TRGEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRUKFCEG5COBGB2M5XW22TRGEP/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-06T14:32:10Z","links":{"resolver":"https://pith.science/pith/WRUKFCEG5COBGB2M5XW22TRGEP","bundle":"https://pith.science/pith/WRUKFCEG5COBGB2M5XW22TRGEP/bundle.json","state":"https://pith.science/pith/WRUKFCEG5COBGB2M5XW22TRGEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRUKFCEG5COBGB2M5XW22TRGEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WRUKFCEG5COBGB2M5XW22TRGEP","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":"6244930f2e293cee51e1f67975e46f2442c1361663475c0d0d17a7b630f77511","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:55:59Z","title_canon_sha256":"954e7656d437d3d992de9c5e9a183049d7f62eb8a3250bc1a5e94e477cc71e36"},"schema_version":"1.0","source":{"id":"1304.1097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1097","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1097v1","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1097","created_at":"2026-05-18T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"WRUKFCEG5COB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WRUKFCEG5COBGB2M","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WRUKFCEG","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:fc7fa12b44237c7b3264f9b3b8179cbaafc39e4e9f592586dc8a8d5e589f6798","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":"In recent years, researchers in decision analysis and artificial intelligence (AI) have used Bayesian belief networks to build models of expert opinion. Using standard methods drawn from the theory of computational complexity, workers in the field have shown that the problem of exact probabilistic inference on belief networks almost certainly requires exponential computation in the worst ease [3]. We have previously described a randomized approximation scheme, called BN-RAS, for computation on belief networks [ 1, 2, 4]. We gave precise analytic bounds on the convergence of BN-RAS and showed h","authors_text":"Gregory F. Cooper, R. Martin Chavez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:55:59Z","title":"A Randomized Approximation Algorithm of Logic Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1097","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:c0e55831c4be7fb4c07b0a789cf6076169b972af190db993eaf4ce824a3dad41","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":"6244930f2e293cee51e1f67975e46f2442c1361663475c0d0d17a7b630f77511","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T13:55:59Z","title_canon_sha256":"954e7656d437d3d992de9c5e9a183049d7f62eb8a3250bc1a5e94e477cc71e36"},"schema_version":"1.0","source":{"id":"1304.1097","kind":"arxiv","version":1}},"canonical_sha256":"b468a28886e89c13074cededad4e2623d8ba3c264606a4c512fa2e54adcbc33b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b468a28886e89c13074cededad4e2623d8ba3c264606a4c512fa2e54adcbc33b","first_computed_at":"2026-05-18T03:29:04.809688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:04.809688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udnxxiOcTqCguSuGcibY1GZazzXC1xRQfqMstFQry0SlSm0UaeCBw0fVyNWzexER8ChvYtcKbfkg+L4sBEMjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:04.810378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0e55831c4be7fb4c07b0a789cf6076169b972af190db993eaf4ce824a3dad41","sha256:fc7fa12b44237c7b3264f9b3b8179cbaafc39e4e9f592586dc8a8d5e589f6798"],"state_sha256":"fe4dd69cd54cf973dd0621abdf8e2d5a537495ce64b9a1d792c8b3e7014e05d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsX1QoebfaiWlMst0+ZWrAksQCn/cGUCXVqWFIc937fKplUVPPa0XvdMXkn/x699fJxE1evuTvWG1bJXRE7rBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:32:10.012279Z","bundle_sha256":"351e1de11ac67351016477e859f52395bdd1df741bf893f539938ff4019079eb"}}