{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:P4XFATTAF7WXOIF5QPWGBULHUB","short_pith_number":"pith:P4XFATTA","canonical_record":{"source":{"id":"1010.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"1d1c2b7872abc030303adbae89c64910f1db2243d5fce6783becaf157499a14c","abstract_canon_sha256":"4d515c1cb48452dfab42080630e08e41d354deb334e6c2935ec8d184c123e99a"},"schema_version":"1.0"},"canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","source":{"kind":"arxiv","id":"1010.3091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3091","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3091v2","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3091","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4XFATTAF7WX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P4XFATTAF7WXOIF5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P4XFATTA","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:P4XFATTAF7WXOIF5QPWGBULHUB","target":"record","payload":{"canonical_record":{"source":{"id":"1010.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"1d1c2b7872abc030303adbae89c64910f1db2243d5fce6783becaf157499a14c","abstract_canon_sha256":"4d515c1cb48452dfab42080630e08e41d354deb334e6c2935ec8d184c123e99a"},"schema_version":"1.0"},"canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:38.886340Z","signature_b64":"YOW0MeoQ26LgeppJ+tvyM3A+vwEFf5Qe3uKeYW7OUwZoUfhZ/WAsYYbDF5cbjvJFrVhi1sURPQJcr214/oA6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","last_reissued_at":"2026-05-18T03:04:38.885471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:38.885471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.3091","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-18T03:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vDLvzClU5efLdD33NwWrIrSxdp0WclhYbkDRKay2hXU47/5e3xtzdbaQ2xWgy2STMnZmmaVYa4q9R0LePh8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:29:01.181415Z"},"content_sha256":"bd775e83bfe8eca26cafde1e3f939d0d0a6fd7d826502a9e47ba7a55d96e3177","schema_version":"1.0","event_id":"sha256:bd775e83bfe8eca26cafde1e3f939d0d0a6fd7d826502a9e47ba7a55d96e3177"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:P4XFATTAF7WXOIF5QPWGBULHUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Bayesian Active Learning with Noisy Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Daniel Golovin, Debajyoti Ray","submitted_at":"2010-10-15T08:20:46Z","abstract_excerpt":"We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypothesis sampled from a known prior distribution. In the case of noise-free observations, a greedy algorithm called generalized binary search (GBS) is known to perform near-optimally. We show that if the observations are noisy, perhaps surprisingly, GBS can perform very poorly. We develop EC2, a novel, greedy active learning algorithm and prove that it is competitive with the optimal policy, thus obtaining the first comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3091","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-18T03:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toF9+MmjPxO50XZudPqOTxogAaATDLbubthNwC8sqziYovGPzrZTW1KvkG0cIR/JdMD+eVJqnOe3J6N+EqOgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:29:01.181769Z"},"content_sha256":"c1f5bccbd79ce8cb3cd6d2136068d33f6f9704e14be851bc5e622b9060b62ee4","schema_version":"1.0","event_id":"sha256:c1f5bccbd79ce8cb3cd6d2136068d33f6f9704e14be851bc5e622b9060b62ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/bundle.json","state_url":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4XFATTAF7WXOIF5QPWGBULHUB/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-03T03:29:01Z","links":{"resolver":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB","bundle":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/bundle.json","state":"https://pith.science/pith/P4XFATTAF7WXOIF5QPWGBULHUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4XFATTAF7WXOIF5QPWGBULHUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:P4XFATTAF7WXOIF5QPWGBULHUB","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":"4d515c1cb48452dfab42080630e08e41d354deb334e6c2935ec8d184c123e99a","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","title_canon_sha256":"1d1c2b7872abc030303adbae89c64910f1db2243d5fce6783becaf157499a14c"},"schema_version":"1.0","source":{"id":"1010.3091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3091","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3091v2","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3091","created_at":"2026-05-18T03:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4XFATTAF7WX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P4XFATTAF7WXOIF5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P4XFATTA","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:c1f5bccbd79ce8cb3cd6d2136068d33f6f9704e14be851bc5e622b9060b62ee4","target":"graph","created_at":"2026-05-18T03:04:38Z","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 tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypothesis sampled from a known prior distribution. In the case of noise-free observations, a greedy algorithm called generalized binary search (GBS) is known to perform near-optimally. We show that if the observations are noisy, perhaps surprisingly, GBS can perform very poorly. We develop EC2, a novel, greedy active learning algorithm and prove that it is competitive with the optimal policy, thus obtaining the first comp","authors_text":"Andreas Krause, Daniel Golovin, Debajyoti Ray","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","title":"Near-Optimal Bayesian Active Learning with Noisy Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3091","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:bd775e83bfe8eca26cafde1e3f939d0d0a6fd7d826502a9e47ba7a55d96e3177","target":"record","created_at":"2026-05-18T03:04:38Z","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":"4d515c1cb48452dfab42080630e08e41d354deb334e6c2935ec8d184c123e99a","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-15T08:20:46Z","title_canon_sha256":"1d1c2b7872abc030303adbae89c64910f1db2243d5fce6783becaf157499a14c"},"schema_version":"1.0","source":{"id":"1010.3091","kind":"arxiv","version":2}},"canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f2e504e602fed7720bd83ec60d167a04d49dd59c1470e0930eaa59c88e6bdde","first_computed_at":"2026-05-18T03:04:38.885471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:38.885471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOW0MeoQ26LgeppJ+tvyM3A+vwEFf5Qe3uKeYW7OUwZoUfhZ/WAsYYbDF5cbjvJFrVhi1sURPQJcr214/oA6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:38.886340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd775e83bfe8eca26cafde1e3f939d0d0a6fd7d826502a9e47ba7a55d96e3177","sha256:c1f5bccbd79ce8cb3cd6d2136068d33f6f9704e14be851bc5e622b9060b62ee4"],"state_sha256":"813dd27d5d902f0019514d973fe0df4bab739517ddd757df463f0b3533224c03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qNY39YV5dkR9pZJW7rONPF8id0LEdxByMZAjcUMaLknuoqcH4d6fIfSVZLaweZ3PAsgimMA0E+qIYgfRxLcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:29:01.183718Z","bundle_sha256":"9c54bfc310a6b19db94dbcf56070b06a18c4c28f16e215de755d56adcb7f961e"}}