{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M7G2BTWZ4DDW2ZUUGW4A5LP6FN","short_pith_number":"pith:M7G2BTWZ","canonical_record":{"source":{"id":"1703.05452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-16T01:37:25Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3067b5f5bf35cae18a8731dff166ad5e28c8784f407c43b6db334ceebf3dcea1","abstract_canon_sha256":"76ed6e637728e2eaf34ebcb6fbc162e5086fff6c703a1487538ab7a49ef97151"},"schema_version":"1.0"},"canonical_sha256":"67cda0ced9e0c76d669435b80eadfe2b7e005fd79b2890751fe8b76c5391ac4f","source":{"kind":"arxiv","id":"1703.05452","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05452","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05452v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05452","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"M7G2BTWZ4DDW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M7G2BTWZ4DDW2ZUU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M7G2BTWZ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M7G2BTWZ4DDW2ZUUGW4A5LP6FN","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-16T01:37:25Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3067b5f5bf35cae18a8731dff166ad5e28c8784f407c43b6db334ceebf3dcea1","abstract_canon_sha256":"76ed6e637728e2eaf34ebcb6fbc162e5086fff6c703a1487538ab7a49ef97151"},"schema_version":"1.0"},"canonical_sha256":"67cda0ced9e0c76d669435b80eadfe2b7e005fd79b2890751fe8b76c5391ac4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.227178Z","signature_b64":"5Wvxiwx8c0hN92X/pRVszjz+1NdqPAmXvt4ZrpWEtgKx4XNwZJ3X/rmmWr3VR2l7HWMIyXfZEa30LiKNj2hIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67cda0ced9e0c76d669435b80eadfe2b7e005fd79b2890751fe8b76c5391ac4f","last_reissued_at":"2026-05-18T00:40:13.226569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.226569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05452","source_version":2,"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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RYuwyAzt55iWfBp7lhb/i5jUPNs9+1qwTqlBtD/6ODXmBQ4+3wlDBdTustGaScThl7fq8kDD7CCZzpocuiNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:32:02.399306Z"},"content_sha256":"3435d99ab9de2dec240d7c853421071f10e4819e026d8916d697c8c234e6f912","schema_version":"1.0","event_id":"sha256:3435d99ab9de2dec240d7c853421071f10e4819e026d8916d697c8c234e6f912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M7G2BTWZ4DDW2ZUUGW4A5LP6FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Andreas Krause, Jean-Michel Renders, Morteza Haghir Chehreghani, Yuxin Chen","submitted_at":"2017-03-16T01:37:25Z","abstract_excerpt":"We consider the optimal value of information (VoI) problem, where the goal is to sequentially select a set of tests with a minimal cost, so that one can efficiently make the best decision based on the observed outcomes. Existing algorithms are either heuristics with no guarantees, or scale poorly (with exponential run time in terms of the number of available tests). Moreover, these methods assume a known distribution over the test outcomes, which is often not the case in practice. We propose an efficient sampling-based online learning framework to address the above issues. First, assuming the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05452","kind":"arxiv","version":2},"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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNoL1n6mbZcw6vgdBAdoHzuIT1xikQepZ/143SW7rdo5JRUAxjO+BijryL9dT1vqAZSns8uBp6qTibXYahg9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:32:02.399990Z"},"content_sha256":"274ba25b3ee83f2b151ddd8b1cdf232d57c7f74ada363516b9ed43cf646b126a","schema_version":"1.0","event_id":"sha256:274ba25b3ee83f2b151ddd8b1cdf232d57c7f74ada363516b9ed43cf646b126a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/bundle.json","state_url":"https://pith.science/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/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-05-26T16:32:02Z","links":{"resolver":"https://pith.science/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN","bundle":"https://pith.science/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/bundle.json","state":"https://pith.science/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7G2BTWZ4DDW2ZUUGW4A5LP6FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M7G2BTWZ4DDW2ZUUGW4A5LP6FN","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":"76ed6e637728e2eaf34ebcb6fbc162e5086fff6c703a1487538ab7a49ef97151","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-16T01:37:25Z","title_canon_sha256":"3067b5f5bf35cae18a8731dff166ad5e28c8784f407c43b6db334ceebf3dcea1"},"schema_version":"1.0","source":{"id":"1703.05452","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05452","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05452v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05452","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"M7G2BTWZ4DDW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M7G2BTWZ4DDW2ZUU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M7G2BTWZ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:274ba25b3ee83f2b151ddd8b1cdf232d57c7f74ada363516b9ed43cf646b126a","target":"graph","created_at":"2026-05-18T00:40:13Z","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 consider the optimal value of information (VoI) problem, where the goal is to sequentially select a set of tests with a minimal cost, so that one can efficiently make the best decision based on the observed outcomes. Existing algorithms are either heuristics with no guarantees, or scale poorly (with exponential run time in terms of the number of available tests). Moreover, these methods assume a known distribution over the test outcomes, which is often not the case in practice. We propose an efficient sampling-based online learning framework to address the above issues. First, assuming the ","authors_text":"Andreas Krause, Jean-Michel Renders, Morteza Haghir Chehreghani, Yuxin Chen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-16T01:37:25Z","title":"Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05452","kind":"arxiv","version":2},"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:3435d99ab9de2dec240d7c853421071f10e4819e026d8916d697c8c234e6f912","target":"record","created_at":"2026-05-18T00:40:13Z","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":"76ed6e637728e2eaf34ebcb6fbc162e5086fff6c703a1487538ab7a49ef97151","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-16T01:37:25Z","title_canon_sha256":"3067b5f5bf35cae18a8731dff166ad5e28c8784f407c43b6db334ceebf3dcea1"},"schema_version":"1.0","source":{"id":"1703.05452","kind":"arxiv","version":2}},"canonical_sha256":"67cda0ced9e0c76d669435b80eadfe2b7e005fd79b2890751fe8b76c5391ac4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67cda0ced9e0c76d669435b80eadfe2b7e005fd79b2890751fe8b76c5391ac4f","first_computed_at":"2026-05-18T00:40:13.226569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:13.226569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Wvxiwx8c0hN92X/pRVszjz+1NdqPAmXvt4ZrpWEtgKx4XNwZJ3X/rmmWr3VR2l7HWMIyXfZEa30LiKNj2hIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:13.227178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05452","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3435d99ab9de2dec240d7c853421071f10e4819e026d8916d697c8c234e6f912","sha256:274ba25b3ee83f2b151ddd8b1cdf232d57c7f74ada363516b9ed43cf646b126a"],"state_sha256":"8d723361cbbf6f063b04bcd099c1f8d08c72ccf22446e0253f813f2530e94989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoaDS6hHQ/KCPnFTPnX+dNibITMQWaixh14YszY5bH6qW2yAK2/keVTr/b7+iG6sUnhEWIydFThURN1CVms2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:32:02.402672Z","bundle_sha256":"90f14e5a15163d6b63e4180c92ab8a7dbadb03b634185e4386b857fedee3839d"}}