{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QHLTGS3KFXUPQCWSA6F65NYKQD","short_pith_number":"pith:QHLTGS3K","canonical_record":{"source":{"id":"1603.09050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:21:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56cbcd5773ecd1135f48e4f3f5fe04949871ee48960713c3746bd608f4e52ed7","abstract_canon_sha256":"080817ee47cf18421ca843e0aa9e3da8ff5755f01f107d45073d6d19182a69b6"},"schema_version":"1.0"},"canonical_sha256":"81d7334b6a2de8f80ad2078beeb70a80cdc63533ecb2dbb20c362acdb01e07a2","source":{"kind":"arxiv","id":"1603.09050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09050","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09050v1","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09050","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"QHLTGS3KFXUP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHLTGS3KFXUPQCWS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHLTGS3K","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QHLTGS3KFXUPQCWSA6F65NYKQD","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:21:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56cbcd5773ecd1135f48e4f3f5fe04949871ee48960713c3746bd608f4e52ed7","abstract_canon_sha256":"080817ee47cf18421ca843e0aa9e3da8ff5755f01f107d45073d6d19182a69b6"},"schema_version":"1.0"},"canonical_sha256":"81d7334b6a2de8f80ad2078beeb70a80cdc63533ecb2dbb20c362acdb01e07a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:03.876189Z","signature_b64":"Nu7USpr7PYbWI3hZ4Xv7XjoCLCHnOF+vnppzbO+CPXy3k0NeKMwTKVdCKSWd4eh32tio1LgekARb6ek0S+L2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81d7334b6a2de8f80ad2078beeb70a80cdc63533ecb2dbb20c362acdb01e07a2","last_reissued_at":"2026-05-18T01:18:03.875521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:03.875521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09050","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-18T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpTG9xAp/cNf4Gk539kIvj8zyvTrwbPyP6qm72f37LswUgEGqpVSs2j57aSCclPEkG5ClcVp0J1WhrYrNAnrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:47:22.597565Z"},"content_sha256":"0ed8fa5f9f3b6478e5a5c4bc40bc65668329044cd1c9baf371b3686da7320337","schema_version":"1.0","event_id":"sha256:0ed8fa5f9f3b6478e5a5c4bc40bc65668329044cd1c9baf371b3686da7320337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QHLTGS3KFXUPQCWSA6F65NYKQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness of Bayesian Pool-based Active Learning Against Prior Misspecification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nan Ye, Nguyen Viet Cuong, Wee Sun Lee","submitted_at":"2016-03-30T06:21:42Z","abstract_excerpt":"We study the robustness of active learning (AL) algorithms against prior misspecification: whether an algorithm achieves similar performance using a perturbed prior as compared to using the true prior. In both the average and worst cases of the maximum coverage setting, we prove that all $\\alpha$-approximate algorithms are robust (i.e., near $\\alpha$-approximate) if the utility is Lipschitz continuous in the prior. We further show that robustness may not be achieved if the utility is non-Lipschitz. This suggests we should use a Lipschitz utility for AL if robustness is required. For the minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09050","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-18T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYkWSwwH+osaXcSXzistJqwHnc4aC0MoM9s6aAmpVfeF/tQeTPrlYPCer8KrXoO12AS5sLkOXB0vWa42+LSaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:47:22.597917Z"},"content_sha256":"d660761bbf034e45ec0eeeaca03e516f6026306d0b9c9d3bd6bad62442382737","schema_version":"1.0","event_id":"sha256:d660761bbf034e45ec0eeeaca03e516f6026306d0b9c9d3bd6bad62442382737"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/bundle.json","state_url":"https://pith.science/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/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-28T06:47:22Z","links":{"resolver":"https://pith.science/pith/QHLTGS3KFXUPQCWSA6F65NYKQD","bundle":"https://pith.science/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/bundle.json","state":"https://pith.science/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHLTGS3KFXUPQCWSA6F65NYKQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QHLTGS3KFXUPQCWSA6F65NYKQD","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":"080817ee47cf18421ca843e0aa9e3da8ff5755f01f107d45073d6d19182a69b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:21:42Z","title_canon_sha256":"56cbcd5773ecd1135f48e4f3f5fe04949871ee48960713c3746bd608f4e52ed7"},"schema_version":"1.0","source":{"id":"1603.09050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09050","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09050v1","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09050","created_at":"2026-05-18T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"QHLTGS3KFXUP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHLTGS3KFXUPQCWS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHLTGS3K","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:d660761bbf034e45ec0eeeaca03e516f6026306d0b9c9d3bd6bad62442382737","target":"graph","created_at":"2026-05-18T01:18:03Z","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 study the robustness of active learning (AL) algorithms against prior misspecification: whether an algorithm achieves similar performance using a perturbed prior as compared to using the true prior. In both the average and worst cases of the maximum coverage setting, we prove that all $\\alpha$-approximate algorithms are robust (i.e., near $\\alpha$-approximate) if the utility is Lipschitz continuous in the prior. We further show that robustness may not be achieved if the utility is non-Lipschitz. This suggests we should use a Lipschitz utility for AL if robustness is required. For the minimu","authors_text":"Nan Ye, Nguyen Viet Cuong, Wee Sun Lee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:21:42Z","title":"Robustness of Bayesian Pool-based Active Learning Against Prior Misspecification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09050","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:0ed8fa5f9f3b6478e5a5c4bc40bc65668329044cd1c9baf371b3686da7320337","target":"record","created_at":"2026-05-18T01:18:03Z","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":"080817ee47cf18421ca843e0aa9e3da8ff5755f01f107d45073d6d19182a69b6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-30T06:21:42Z","title_canon_sha256":"56cbcd5773ecd1135f48e4f3f5fe04949871ee48960713c3746bd608f4e52ed7"},"schema_version":"1.0","source":{"id":"1603.09050","kind":"arxiv","version":1}},"canonical_sha256":"81d7334b6a2de8f80ad2078beeb70a80cdc63533ecb2dbb20c362acdb01e07a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81d7334b6a2de8f80ad2078beeb70a80cdc63533ecb2dbb20c362acdb01e07a2","first_computed_at":"2026-05-18T01:18:03.875521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:03.875521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nu7USpr7PYbWI3hZ4Xv7XjoCLCHnOF+vnppzbO+CPXy3k0NeKMwTKVdCKSWd4eh32tio1LgekARb6ek0S+L2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:03.876189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ed8fa5f9f3b6478e5a5c4bc40bc65668329044cd1c9baf371b3686da7320337","sha256:d660761bbf034e45ec0eeeaca03e516f6026306d0b9c9d3bd6bad62442382737"],"state_sha256":"2e11812d6d3e391f02709eefe6681d8aff9f1afb67af39c1cf5c1416b358c764"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7RpvYykT5J7NdRwQ4QX3PrZv9zk+NA2tyLCrHV8Qui+a6AsT820Wo7OoAXiT/vUiAMI1pnoF5SmS4U0SYVlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:47:22.599923Z","bundle_sha256":"e61ab2ed11f188749aeaea2570e6df60490d6c187496073854bb472f34c7e505"}}