{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GCVXQ5Q57I5XX75ZS7NN2WGST6","short_pith_number":"pith:GCVXQ5Q5","canonical_record":{"source":{"id":"1301.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"e05251d548485eed54b3f88fa4bf482eb0d07b11d7619b595a0c99be38d9baed","abstract_canon_sha256":"e89bd4ccafdb1326a3ade9c8e154fccb836b2a5131fc5856ed3e7f24cc798a3b"},"schema_version":"1.0"},"canonical_sha256":"30ab78761dfa3b7bffb997dadd58d29fbe40eb2eb72ed720af838cf1e2340f56","source":{"kind":"arxiv","id":"1301.2260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2260","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2260v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2260","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"GCVXQ5Q57I5X","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCVXQ5Q57I5XX75Z","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCVXQ5Q5","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GCVXQ5Q57I5XX75ZS7NN2WGST6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:53Z","cross_cats_sorted":[],"title_canon_sha256":"e05251d548485eed54b3f88fa4bf482eb0d07b11d7619b595a0c99be38d9baed","abstract_canon_sha256":"e89bd4ccafdb1326a3ade9c8e154fccb836b2a5131fc5856ed3e7f24cc798a3b"},"schema_version":"1.0"},"canonical_sha256":"30ab78761dfa3b7bffb997dadd58d29fbe40eb2eb72ed720af838cf1e2340f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.810883Z","signature_b64":"j4X7/2rViuOVxj5Lm2G0+tyWzu/xg7hZsWd8uuQz7ug0e/GT3tOJ6YRHNv2rZRQ52CTnkYH2o6ysFZ6T/VE8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ab78761dfa3b7bffb997dadd58d29fbe40eb2eb72ed720af838cf1e2340f56","last_reissued_at":"2026-05-18T03:36:45.810050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.810050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2260","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:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjTk6pIlsC4HyJoX/a5tEvkKgX+D04vGiX4J/+TtFmRCzcOkj08bUzUnpnOt8fqHiOFP9buP8v+ginti2sjEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:24:53.177966Z"},"content_sha256":"d946721ec3ddaa544a6e779c4b2757a3cd5c1e4166752f5750182b860a9f5008","schema_version":"1.0","event_id":"sha256:d946721ec3ddaa544a6e779c4b2757a3cd5c1e4166752f5750182b860a9f5008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GCVXQ5Q57I5XX75ZS7NN2WGST6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confidence Inference in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jian Cheng, Marek J. Druzdzel","submitted_at":"2013-01-10T16:22:53Z","abstract_excerpt":"We present two sampling algorithms for probabilistic confidence inference in Bayesian networks. These two algorithms (we call them AIS-BN-mu and AIS-BN-sigma algorithms) guarantee that estimates of posterior probabilities are with a given probability within a desired precision bound. Our algorithms are based on recent advances in sampling algorithms for (1) estimating the mean of bounded random variables and (2) adaptive importance sampling in Bayesian networks. In addition to a simple stopping rule for sampling that they provide, the AIS-BN-mu and AIS-BN-sigma algorithms are capable of guidin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2260","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:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w65WgUP2equQgM8+t2h2wvhAPjSARVSI8n9tyN6X8IKHsVx2qzLpfVNjnLKHfEos4Hqsuyl/2/xO7TSiadzIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:24:53.178308Z"},"content_sha256":"a2aec3bb071bbe82ae6261604dba332792eee1c0668259ca683b9ca27f901078","schema_version":"1.0","event_id":"sha256:a2aec3bb071bbe82ae6261604dba332792eee1c0668259ca683b9ca27f901078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/bundle.json","state_url":"https://pith.science/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/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-23T18:24:53Z","links":{"resolver":"https://pith.science/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6","bundle":"https://pith.science/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/bundle.json","state":"https://pith.science/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCVXQ5Q57I5XX75ZS7NN2WGST6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GCVXQ5Q57I5XX75ZS7NN2WGST6","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":"e89bd4ccafdb1326a3ade9c8e154fccb836b2a5131fc5856ed3e7f24cc798a3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:53Z","title_canon_sha256":"e05251d548485eed54b3f88fa4bf482eb0d07b11d7619b595a0c99be38d9baed"},"schema_version":"1.0","source":{"id":"1301.2260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2260","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2260v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2260","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"GCVXQ5Q57I5X","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GCVXQ5Q57I5XX75Z","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GCVXQ5Q5","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:a2aec3bb071bbe82ae6261604dba332792eee1c0668259ca683b9ca27f901078","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"We present two sampling algorithms for probabilistic confidence inference in Bayesian networks. These two algorithms (we call them AIS-BN-mu and AIS-BN-sigma algorithms) guarantee that estimates of posterior probabilities are with a given probability within a desired precision bound. Our algorithms are based on recent advances in sampling algorithms for (1) estimating the mean of bounded random variables and (2) adaptive importance sampling in Bayesian networks. In addition to a simple stopping rule for sampling that they provide, the AIS-BN-mu and AIS-BN-sigma algorithms are capable of guidin","authors_text":"Jian Cheng, Marek J. Druzdzel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:53Z","title":"Confidence Inference in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2260","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:d946721ec3ddaa544a6e779c4b2757a3cd5c1e4166752f5750182b860a9f5008","target":"record","created_at":"2026-05-18T03:36:45Z","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":"e89bd4ccafdb1326a3ade9c8e154fccb836b2a5131fc5856ed3e7f24cc798a3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:22:53Z","title_canon_sha256":"e05251d548485eed54b3f88fa4bf482eb0d07b11d7619b595a0c99be38d9baed"},"schema_version":"1.0","source":{"id":"1301.2260","kind":"arxiv","version":1}},"canonical_sha256":"30ab78761dfa3b7bffb997dadd58d29fbe40eb2eb72ed720af838cf1e2340f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30ab78761dfa3b7bffb997dadd58d29fbe40eb2eb72ed720af838cf1e2340f56","first_computed_at":"2026-05-18T03:36:45.810050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.810050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j4X7/2rViuOVxj5Lm2G0+tyWzu/xg7hZsWd8uuQz7ug0e/GT3tOJ6YRHNv2rZRQ52CTnkYH2o6ysFZ6T/VE8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.810883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d946721ec3ddaa544a6e779c4b2757a3cd5c1e4166752f5750182b860a9f5008","sha256:a2aec3bb071bbe82ae6261604dba332792eee1c0668259ca683b9ca27f901078"],"state_sha256":"9ed179c08cd81f5edb8939cebdabfd7ae9dbf731af05b2d15ffc29ff1e3c66c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLMm/gLwOwx6HjonKvAa6iTNl3N4BJ5SgHp9sLLvTVwDBpmJR83WATn6Jx3H9BWGeyd5z6ZQzEP386448qutDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:24:53.180220Z","bundle_sha256":"a81079dfcca82794e2b339543fb91f2a9d815bd738c53f6af7c9ad161e6bad23"}}