{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XNYBDVUT3DKVYAGFEXRCBIMGB4","short_pith_number":"pith:XNYBDVUT","canonical_record":{"source":{"id":"1401.3474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"206f1e7e4e9fa61e6622ac7898204a2b93d759027c55e370c660d4fdd6fe8a32","abstract_canon_sha256":"5908341e3f8b1d078cc3e1c1f6fbdd68c0b78c61e95c662c2ea582ba1f6e119b"},"schema_version":"1.0"},"canonical_sha256":"bb7011d693d8d55c00c525e220a1860f0de7fb1d7e1dbb72ab43444610c4bb1d","source":{"kind":"arxiv","id":"1401.3474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3474","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3474v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3474","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"XNYBDVUT3DKV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XNYBDVUT3DKVYAGF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XNYBDVUT","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XNYBDVUT3DKVYAGFEXRCBIMGB4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"206f1e7e4e9fa61e6622ac7898204a2b93d759027c55e370c660d4fdd6fe8a32","abstract_canon_sha256":"5908341e3f8b1d078cc3e1c1f6fbdd68c0b78c61e95c662c2ea582ba1f6e119b"},"schema_version":"1.0"},"canonical_sha256":"bb7011d693d8d55c00c525e220a1860f0de7fb1d7e1dbb72ab43444610c4bb1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.824227Z","signature_b64":"k/HBhK3R/cDXnP4yMpodBUaX4nHbCy4rgQABPg8khIjAlB82d9/3SzBa9Fv74+aie61BmNhgwtstYkOSNW0OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb7011d693d8d55c00c525e220a1860f0de7fb1d7e1dbb72ab43444610c4bb1d","last_reissued_at":"2026-05-18T03:02:08.823762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.823762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3474","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLncg3Rqu39D204j2HEjvuVuWJ+zSOTmwOAa8jHu+jJ4IVyQekOyN75MYRg5j0u0hB3ULlx6HpvxnC7HSvhuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:09:41.842251Z"},"content_sha256":"d0064cbed78d1ae692f21dbe75c01d0c8e3150615ece4dc89362a5d9609a2410","schema_version":"1.0","event_id":"sha256:d0064cbed78d1ae692f21dbe75c01d0c8e3150615ece4dc89362a5d9609a2410"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XNYBDVUT3DKVYAGFEXRCBIMGB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Value of Information in Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andreas Krause, Carlos Guestrin","submitted_at":"2014-01-15T05:30:52Z","abstract_excerpt":"Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example, it is important to select the subset of sensors that is expected to provide the strongest reduction in uncertainty. In medical decision making tasks, one needs to select which tests to administer before deciding on the most effective treatment. It has been general practice to use heuristic-guided procedures for selecting observations. In this paper, we present the first efficient optimal algorithms for selecting observations for a class of probabilistic graphical m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3474","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxLYIDy8kbEXqH0eRqBigjVMDsXMBxoCuwWTZ0BWnIySFawvbIbf37HB+VGb1AnAuGGhYSJx6e6a0Y4Vpio0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:09:41.842941Z"},"content_sha256":"58fcb17c2697408251e2b8160cd52eaee2950dda12143d6f8c4bce0343e8ef43","schema_version":"1.0","event_id":"sha256:58fcb17c2697408251e2b8160cd52eaee2950dda12143d6f8c4bce0343e8ef43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/bundle.json","state_url":"https://pith.science/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/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-06T06:09:41Z","links":{"resolver":"https://pith.science/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4","bundle":"https://pith.science/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/bundle.json","state":"https://pith.science/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNYBDVUT3DKVYAGFEXRCBIMGB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XNYBDVUT3DKVYAGFEXRCBIMGB4","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":"5908341e3f8b1d078cc3e1c1f6fbdd68c0b78c61e95c662c2ea582ba1f6e119b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:30:52Z","title_canon_sha256":"206f1e7e4e9fa61e6622ac7898204a2b93d759027c55e370c660d4fdd6fe8a32"},"schema_version":"1.0","source":{"id":"1401.3474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3474","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3474v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3474","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"XNYBDVUT3DKV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XNYBDVUT3DKVYAGF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XNYBDVUT","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:58fcb17c2697408251e2b8160cd52eaee2950dda12143d6f8c4bce0343e8ef43","target":"graph","created_at":"2026-05-18T03:02:08Z","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":"Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example, it is important to select the subset of sensors that is expected to provide the strongest reduction in uncertainty. In medical decision making tasks, one needs to select which tests to administer before deciding on the most effective treatment. It has been general practice to use heuristic-guided procedures for selecting observations. In this paper, we present the first efficient optimal algorithms for selecting observations for a class of probabilistic graphical m","authors_text":"Andreas Krause, Carlos Guestrin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:30:52Z","title":"Optimal Value of Information in Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3474","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:d0064cbed78d1ae692f21dbe75c01d0c8e3150615ece4dc89362a5d9609a2410","target":"record","created_at":"2026-05-18T03:02:08Z","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":"5908341e3f8b1d078cc3e1c1f6fbdd68c0b78c61e95c662c2ea582ba1f6e119b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:30:52Z","title_canon_sha256":"206f1e7e4e9fa61e6622ac7898204a2b93d759027c55e370c660d4fdd6fe8a32"},"schema_version":"1.0","source":{"id":"1401.3474","kind":"arxiv","version":1}},"canonical_sha256":"bb7011d693d8d55c00c525e220a1860f0de7fb1d7e1dbb72ab43444610c4bb1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb7011d693d8d55c00c525e220a1860f0de7fb1d7e1dbb72ab43444610c4bb1d","first_computed_at":"2026-05-18T03:02:08.823762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.823762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k/HBhK3R/cDXnP4yMpodBUaX4nHbCy4rgQABPg8khIjAlB82d9/3SzBa9Fv74+aie61BmNhgwtstYkOSNW0OAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.824227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0064cbed78d1ae692f21dbe75c01d0c8e3150615ece4dc89362a5d9609a2410","sha256:58fcb17c2697408251e2b8160cd52eaee2950dda12143d6f8c4bce0343e8ef43"],"state_sha256":"a4b18e0fbda4e942512b6f3a780a5b0019335648cdaee58258175834b1b2fbef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6SGRgGj0yAQdIZYZIQQahM/PCkcGqSGOPGyLRQ8DbUj/rsZm8Xur9B3/wuyscnl9i1HZIndziDGmA3Lfuh5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:09:41.846631Z","bundle_sha256":"25719fd6b907ae396294157989e7d734ebf972a16a43a2f05ee9853869282932"}}