{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RFICFLXKRVBIX7SDCL7E6HW3TK","short_pith_number":"pith:RFICFLXK","canonical_record":{"source":{"id":"1304.1512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"8a27960008707bccb4350b6fa25cb777bd078d84a39408fa588177ae003a2068","abstract_canon_sha256":"d9fd84444fc453943eb0d288137dcf73391908c5b8f0971cc9400375da86ddfa"},"schema_version":"1.0"},"canonical_sha256":"895022aeea8d428bfe4312fe4f1edb9a81aaaa46c11d919bbfc33c261c08eb2e","source":{"kind":"arxiv","id":"1304.1512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1512","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1512v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1512","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"RFICFLXKRVBI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RFICFLXKRVBIX7SD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RFICFLXK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RFICFLXKRVBIX7SDCL7E6HW3TK","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"8a27960008707bccb4350b6fa25cb777bd078d84a39408fa588177ae003a2068","abstract_canon_sha256":"d9fd84444fc453943eb0d288137dcf73391908c5b8f0971cc9400375da86ddfa"},"schema_version":"1.0"},"canonical_sha256":"895022aeea8d428bfe4312fe4f1edb9a81aaaa46c11d919bbfc33c261c08eb2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.596910Z","signature_b64":"ohBm9/+oYNq8NPUcqgIMv3TUbz8+7Yz0RiFzu+gxvbZKlZTYT75MBkkpgoI6guntW6yirwfQItEEZP7k9FsABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"895022aeea8d428bfe4312fe4f1edb9a81aaaa46c11d919bbfc33c261c08eb2e","last_reissued_at":"2026-05-18T03:28:55.596463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.596463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1512","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"el4dMMtwfYsUofzj3UDPknC4uLDJKCRs1972t9jJOyu6gaOfjnmh8NK8JLXY84abVE+rS7341HBiw3bzd052DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:05:13.163817Z"},"content_sha256":"8785fb035edf1ebeae0783055b56f3df6acbe7967264e54e11eb644f4440c5aa","schema_version":"1.0","event_id":"sha256:8785fb035edf1ebeae0783055b56f3df6acbe7967264e54e11eb644f4440c5aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RFICFLXKRVBIX7SDCL7E6HW3TK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Eric J. Horvitz, Gregory F. Cooper, Jaap Suermondt","submitted_at":"2013-03-27T19:38:53Z","abstract_excerpt":"We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final probabilities of interest with the allocation of a complete resource fraction. The approach allows a reasoner to exchange arbitrary quantities of computational resource for incremental gains in inference quality. As such, bounded conditioning holds promise as a useful inference technique for reasoning under the general conditions of uncertain and varying reasoning re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1512","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtjIxyrvL6diTt4geKh4Z3eo3KBwQrGd84+0X95Yc0IcvTXQcvz/TlWtS86spjvt3TyoNostv1cV80sqMF3TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:05:13.164527Z"},"content_sha256":"38742a333880fc65846193d0e77923a91bbdaf5fe975a5bc7e66dcf22b5f1899","schema_version":"1.0","event_id":"sha256:38742a333880fc65846193d0e77923a91bbdaf5fe975a5bc7e66dcf22b5f1899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/bundle.json","state_url":"https://pith.science/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/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-06T13:05:13Z","links":{"resolver":"https://pith.science/pith/RFICFLXKRVBIX7SDCL7E6HW3TK","bundle":"https://pith.science/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/bundle.json","state":"https://pith.science/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFICFLXKRVBIX7SDCL7E6HW3TK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RFICFLXKRVBIX7SDCL7E6HW3TK","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":"d9fd84444fc453943eb0d288137dcf73391908c5b8f0971cc9400375da86ddfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:38:53Z","title_canon_sha256":"8a27960008707bccb4350b6fa25cb777bd078d84a39408fa588177ae003a2068"},"schema_version":"1.0","source":{"id":"1304.1512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1512","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1512v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1512","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"RFICFLXKRVBI","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RFICFLXKRVBIX7SD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RFICFLXK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:38742a333880fc65846193d0e77923a91bbdaf5fe975a5bc7e66dcf22b5f1899","target":"graph","created_at":"2026-05-18T03:28:55Z","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 introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final probabilities of interest with the allocation of a complete resource fraction. The approach allows a reasoner to exchange arbitrary quantities of computational resource for incremental gains in inference quality. As such, bounded conditioning holds promise as a useful inference technique for reasoning under the general conditions of uncertain and varying reasoning re","authors_text":"Eric J. Horvitz, Gregory F. Cooper, Jaap Suermondt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:38:53Z","title":"Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1512","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:8785fb035edf1ebeae0783055b56f3df6acbe7967264e54e11eb644f4440c5aa","target":"record","created_at":"2026-05-18T03:28:55Z","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":"d9fd84444fc453943eb0d288137dcf73391908c5b8f0971cc9400375da86ddfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:38:53Z","title_canon_sha256":"8a27960008707bccb4350b6fa25cb777bd078d84a39408fa588177ae003a2068"},"schema_version":"1.0","source":{"id":"1304.1512","kind":"arxiv","version":1}},"canonical_sha256":"895022aeea8d428bfe4312fe4f1edb9a81aaaa46c11d919bbfc33c261c08eb2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"895022aeea8d428bfe4312fe4f1edb9a81aaaa46c11d919bbfc33c261c08eb2e","first_computed_at":"2026-05-18T03:28:55.596463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:55.596463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohBm9/+oYNq8NPUcqgIMv3TUbz8+7Yz0RiFzu+gxvbZKlZTYT75MBkkpgoI6guntW6yirwfQItEEZP7k9FsABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:55.596910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8785fb035edf1ebeae0783055b56f3df6acbe7967264e54e11eb644f4440c5aa","sha256:38742a333880fc65846193d0e77923a91bbdaf5fe975a5bc7e66dcf22b5f1899"],"state_sha256":"15f20102c0594dc4e3d79e11291e4904c94126e4467bbf75e4009a3f6e38d3d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9ZSUiEoZnxsek/0RahVEn+kEGZ7TLvLpkJ5gWWKxF4dzAHlEV2BhVt6tmovDm3tu+KtSc3jzhgI9wt5FRQjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:05:13.168232Z","bundle_sha256":"704efff6a6cd900acdf04f1f92f8f6fb9360349cf438ed494a8ce9b0838fe6d8"}}