{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BYNRWKWTKCDIM2HDPNY424UP6B","short_pith_number":"pith:BYNRWKWT","canonical_record":{"source":{"id":"1302.3602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"69a5a6b47d3aca41076b95ebd97f22505d6991fcd4ca2b09065f139870dc09fe","abstract_canon_sha256":"442b8fda268aea3c4ab0f2ab20ee5eb809ce635e54b5e43d069491b839406dcc"},"schema_version":"1.0"},"canonical_sha256":"0e1b1b2ad350868668e37b71cd728ff0477696bce07673440b6efce2148b7d4a","source":{"kind":"arxiv","id":"1302.3602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3602","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3602v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3602","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"BYNRWKWTKCDI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYNRWKWTKCDIM2HD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYNRWKWT","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BYNRWKWTKCDIM2HDPNY424UP6B","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"69a5a6b47d3aca41076b95ebd97f22505d6991fcd4ca2b09065f139870dc09fe","abstract_canon_sha256":"442b8fda268aea3c4ab0f2ab20ee5eb809ce635e54b5e43d069491b839406dcc"},"schema_version":"1.0"},"canonical_sha256":"0e1b1b2ad350868668e37b71cd728ff0477696bce07673440b6efce2148b7d4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.511303Z","signature_b64":"r0rOw2mbx+eLdm6xZehWX7SPqnC6/Nh8wmGEpT4WJ2Nm9SC71QiXUpTG6mNEi4nzu7Nw2gJVH3Sez+TUsZwUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e1b1b2ad350868668e37b71cd728ff0477696bce07673440b6efce2148b7d4a","last_reissued_at":"2026-05-18T03:33:36.510535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.510535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3602","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wau+jIysrqu24sanuZyB8KxtKVW+GLd7KQg4YyMvLNv065tqUujMXrzCc5a1jHaMB4CdNl1TsxZvT08VRkg4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:19:58.946030Z"},"content_sha256":"02dcab9f5ad38454e81e522658d433afee0cc0a74df99020d725d81a7b1e29bb","schema_version":"1.0","event_id":"sha256:02dcab9f5ad38454e81e522658d433afee0cc0a74df99020d725d81a7b1e29bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BYNRWKWTKCDIM2HDPNY424UP6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample-and-Accumulate Algorithms for Belief Updating in Bayes Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Edward Williams, Eugene Santos Jr., Solomon Eyal Shimony","submitted_at":"2013-02-13T14:16:30Z","abstract_excerpt":"Belief updating in Bayes nets, a well known computationally hard problem, has recently been approximated by several deterministic algorithms, and by various randomized approximation algorithms.  Deterministic algorithms usually provide probability bounds, but have an exponential runtime.  Some randomized schemes have a polynomial runtime, but provide only probability estimates.  We present randomized algorithms that enumerate high-probability partial instantiations, resulting in probability bounds.  Some of these algorithms are also sampling algorithms.  Specifically, we introduce and evaluate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3602","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+DqhVxZbVwRNEVQduw1LDOEVsP2Z9RtvUA48v4q8VpZvzAn7Dw2t4eGwJgSAZc87p2Kix9I/VLU/LchRaYwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:19:58.946377Z"},"content_sha256":"0da2586b6e6dbdaa7907c6ded82c610bab4df4a2420fa3ee09abe424c7b9d6b3","schema_version":"1.0","event_id":"sha256:0da2586b6e6dbdaa7907c6ded82c610bab4df4a2420fa3ee09abe424c7b9d6b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYNRWKWTKCDIM2HDPNY424UP6B/bundle.json","state_url":"https://pith.science/pith/BYNRWKWTKCDIM2HDPNY424UP6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYNRWKWTKCDIM2HDPNY424UP6B/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-01T21:19:58Z","links":{"resolver":"https://pith.science/pith/BYNRWKWTKCDIM2HDPNY424UP6B","bundle":"https://pith.science/pith/BYNRWKWTKCDIM2HDPNY424UP6B/bundle.json","state":"https://pith.science/pith/BYNRWKWTKCDIM2HDPNY424UP6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYNRWKWTKCDIM2HDPNY424UP6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BYNRWKWTKCDIM2HDPNY424UP6B","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":"442b8fda268aea3c4ab0f2ab20ee5eb809ce635e54b5e43d069491b839406dcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:30Z","title_canon_sha256":"69a5a6b47d3aca41076b95ebd97f22505d6991fcd4ca2b09065f139870dc09fe"},"schema_version":"1.0","source":{"id":"1302.3602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3602","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3602v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3602","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"BYNRWKWTKCDI","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYNRWKWTKCDIM2HD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYNRWKWT","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:0da2586b6e6dbdaa7907c6ded82c610bab4df4a2420fa3ee09abe424c7b9d6b3","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"Belief updating in Bayes nets, a well known computationally hard problem, has recently been approximated by several deterministic algorithms, and by various randomized approximation algorithms.  Deterministic algorithms usually provide probability bounds, but have an exponential runtime.  Some randomized schemes have a polynomial runtime, but provide only probability estimates.  We present randomized algorithms that enumerate high-probability partial instantiations, resulting in probability bounds.  Some of these algorithms are also sampling algorithms.  Specifically, we introduce and evaluate","authors_text":"Edward Williams, Eugene Santos Jr., Solomon Eyal Shimony","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:30Z","title":"Sample-and-Accumulate Algorithms for Belief Updating in Bayes Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3602","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:02dcab9f5ad38454e81e522658d433afee0cc0a74df99020d725d81a7b1e29bb","target":"record","created_at":"2026-05-18T03:33:36Z","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":"442b8fda268aea3c4ab0f2ab20ee5eb809ce635e54b5e43d069491b839406dcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:30Z","title_canon_sha256":"69a5a6b47d3aca41076b95ebd97f22505d6991fcd4ca2b09065f139870dc09fe"},"schema_version":"1.0","source":{"id":"1302.3602","kind":"arxiv","version":1}},"canonical_sha256":"0e1b1b2ad350868668e37b71cd728ff0477696bce07673440b6efce2148b7d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e1b1b2ad350868668e37b71cd728ff0477696bce07673440b6efce2148b7d4a","first_computed_at":"2026-05-18T03:33:36.510535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.510535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r0rOw2mbx+eLdm6xZehWX7SPqnC6/Nh8wmGEpT4WJ2Nm9SC71QiXUpTG6mNEi4nzu7Nw2gJVH3Sez+TUsZwUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.511303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02dcab9f5ad38454e81e522658d433afee0cc0a74df99020d725d81a7b1e29bb","sha256:0da2586b6e6dbdaa7907c6ded82c610bab4df4a2420fa3ee09abe424c7b9d6b3"],"state_sha256":"437225997951055a377ef527cdea577001b16fa9129c713c582f0ff98b9a4d84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3U4dbJtuqtJ0aAi6VbKnGOGrgzz3pWOsRwyP/01zsgBN6trpa4ztCHUONFamGOKioFu2hU4wkbggNQZBFxmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:19:58.948363Z","bundle_sha256":"5e93e6c4e0ff98dca38656c76dccf08a6e701b3dce4530c1a5ca22c07bcfe00e"}}