{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DDJCAKAS3AE43KNCLIP4DPXPWM","short_pith_number":"pith:DDJCAKAS","canonical_record":{"source":{"id":"1207.1394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"6cf8564d856e4fd229a7b69943b16ad73bc2b85e999b444abcade003f9d7edf3","abstract_canon_sha256":"30b53d1fd19a4b9b710199e45f5de56a19898b3b9c6e80b33b24ceead42d15b0"},"schema_version":"1.0"},"canonical_sha256":"18d2202812d809cda9a25a1fc1beefb3347fb65a9b7cc3350d2e311adda0003d","source":{"kind":"arxiv","id":"1207.1394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1394","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1394v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1394","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"DDJCAKAS3AE4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DDJCAKAS3AE43KNC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DDJCAKAS","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DDJCAKAS3AE43KNCLIP4DPXPWM","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"6cf8564d856e4fd229a7b69943b16ad73bc2b85e999b444abcade003f9d7edf3","abstract_canon_sha256":"30b53d1fd19a4b9b710199e45f5de56a19898b3b9c6e80b33b24ceead42d15b0"},"schema_version":"1.0"},"canonical_sha256":"18d2202812d809cda9a25a1fc1beefb3347fb65a9b7cc3350d2e311adda0003d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.374362Z","signature_b64":"2zCH2qeJ+dzuTILw0umU6yuwE7jbUR3aKNggpTY/M1CZ4sC7YA03SwFQ9JpHZjlGzwY3zzqlQGbAKBpqeAMFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18d2202812d809cda9a25a1fc1beefb3347fb65a9b7cc3350d2e311adda0003d","last_reissued_at":"2026-05-18T03:51:37.373617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.373617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1394","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZS+RShxZd0qWqMI5un1vhTMfNl3iwpAFcGzqlpnMwvS7P2WZi6ORXt3Gj40pK9Gaj4UeWQlQ1WNXxOJFGV2wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:09.460325Z"},"content_sha256":"21bcea8245bdcdd1281a221cf8b60795133a59a130d975709553aade9ef66d8e","schema_version":"1.0","event_id":"sha256:21bcea8245bdcdd1281a221cf8b60795133a59a130d975709553aade9ef66d8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DDJCAKAS3AE43KNCLIP4DPXPWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-optimal Nonmyopic 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 E. Guestrin","submitted_at":"2012-07-04T16:16:25Z","abstract_excerpt":"A fundamental issue in real-world systems, such as sensor networks, is the selection of observations which most effectively reduce uncertainty. More specifically, we address the long standing problem of nonmyopically selecting the most informative subset of variables in a graphical model. We present the first efficient randomized algorithm providing a constant factor (1-1/e-epsilon) approximation guarantee for any epsilon > 0 with high confidence. The algorithm leverages the theory of submodular functions, in combination with a polynomial bound on sample complexity. We furthermore prove that n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1394","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTLkr83eTXE1x6q8RjADSs7BcXgyN0AA9T5vDjXF+j6DJ6zCnYzOHCdDCYx/8sG0Utlt1JXxCvS5e8bqjnNtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:09.460698Z"},"content_sha256":"8f804c8aca04f6e5aabd25d6a60e25b1d37a17c160872e065a2f51a0ff8e7f03","schema_version":"1.0","event_id":"sha256:8f804c8aca04f6e5aabd25d6a60e25b1d37a17c160872e065a2f51a0ff8e7f03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/bundle.json","state_url":"https://pith.science/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/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-02T20:45:09Z","links":{"resolver":"https://pith.science/pith/DDJCAKAS3AE43KNCLIP4DPXPWM","bundle":"https://pith.science/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/bundle.json","state":"https://pith.science/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDJCAKAS3AE43KNCLIP4DPXPWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DDJCAKAS3AE43KNCLIP4DPXPWM","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":"30b53d1fd19a4b9b710199e45f5de56a19898b3b9c6e80b33b24ceead42d15b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:16:25Z","title_canon_sha256":"6cf8564d856e4fd229a7b69943b16ad73bc2b85e999b444abcade003f9d7edf3"},"schema_version":"1.0","source":{"id":"1207.1394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1394","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1394v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1394","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"DDJCAKAS3AE4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DDJCAKAS3AE43KNC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DDJCAKAS","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8f804c8aca04f6e5aabd25d6a60e25b1d37a17c160872e065a2f51a0ff8e7f03","target":"graph","created_at":"2026-05-18T03:51:37Z","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":"A fundamental issue in real-world systems, such as sensor networks, is the selection of observations which most effectively reduce uncertainty. More specifically, we address the long standing problem of nonmyopically selecting the most informative subset of variables in a graphical model. We present the first efficient randomized algorithm providing a constant factor (1-1/e-epsilon) approximation guarantee for any epsilon > 0 with high confidence. The algorithm leverages the theory of submodular functions, in combination with a polynomial bound on sample complexity. We furthermore prove that n","authors_text":"Andreas Krause, Carlos E. Guestrin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:16:25Z","title":"Near-optimal Nonmyopic Value of Information in Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1394","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:21bcea8245bdcdd1281a221cf8b60795133a59a130d975709553aade9ef66d8e","target":"record","created_at":"2026-05-18T03:51:37Z","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":"30b53d1fd19a4b9b710199e45f5de56a19898b3b9c6e80b33b24ceead42d15b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:16:25Z","title_canon_sha256":"6cf8564d856e4fd229a7b69943b16ad73bc2b85e999b444abcade003f9d7edf3"},"schema_version":"1.0","source":{"id":"1207.1394","kind":"arxiv","version":1}},"canonical_sha256":"18d2202812d809cda9a25a1fc1beefb3347fb65a9b7cc3350d2e311adda0003d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18d2202812d809cda9a25a1fc1beefb3347fb65a9b7cc3350d2e311adda0003d","first_computed_at":"2026-05-18T03:51:37.373617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.373617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2zCH2qeJ+dzuTILw0umU6yuwE7jbUR3aKNggpTY/M1CZ4sC7YA03SwFQ9JpHZjlGzwY3zzqlQGbAKBpqeAMFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.374362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21bcea8245bdcdd1281a221cf8b60795133a59a130d975709553aade9ef66d8e","sha256:8f804c8aca04f6e5aabd25d6a60e25b1d37a17c160872e065a2f51a0ff8e7f03"],"state_sha256":"db26c8592cdabcd47aeb6b02f2d453e599eb35a27f2e01fbc8d70084e3012442"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mPqnndog5mAJIHHzHBPu0SWwJdt1KZHEq7r4OrV2H380JoezjjQqAocHsfO1pASwKAQRNU43gSqwDk6+xxIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:45:09.462792Z","bundle_sha256":"d70cb5247deb77c6fa52501638f191174684c6e5c5be8c1c088cd2243550e7da"}}