{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OJBXCGSPT2YTPHRSVXDS2HUW3Z","short_pith_number":"pith:OJBXCGSP","canonical_record":{"source":{"id":"1112.5745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-24T17:53:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7a6c40bdaad0d6c93ab27a00808164be54c4ef5ec59c03e2348017cb94539e3d","abstract_canon_sha256":"b9346d5d14b70ca74e4d943a7f6c9aae1cd5749a3949eafe233742b196723d3c"},"schema_version":"1.0"},"canonical_sha256":"7243711a4f9eb1379e32adc72d1e96de4526273e91323b2c271ed0782c3941ce","source":{"kind":"arxiv","id":"1112.5745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5745","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5745v1","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5745","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"OJBXCGSPT2YT","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OJBXCGSPT2YTPHRS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OJBXCGSP","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OJBXCGSPT2YTPHRSVXDS2HUW3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-24T17:53:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7a6c40bdaad0d6c93ab27a00808164be54c4ef5ec59c03e2348017cb94539e3d","abstract_canon_sha256":"b9346d5d14b70ca74e4d943a7f6c9aae1cd5749a3949eafe233742b196723d3c"},"schema_version":"1.0"},"canonical_sha256":"7243711a4f9eb1379e32adc72d1e96de4526273e91323b2c271ed0782c3941ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:37.677212Z","signature_b64":"rB3eq3z8uTFWfTgFynB4Ib0O3ZE56zzEB8Ma75rXr36NkzI30YQCejPmjBHLMmBdFy94K3C8FfuORT5fC10EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7243711a4f9eb1379e32adc72d1e96de4526273e91323b2c271ed0782c3941ce","last_reissued_at":"2026-05-18T04:05:37.676813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:37.676813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5745","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-18T04:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlAQA8VkSvMqR6IoQb+UwLHjNUB/WHO69P4VYwKvCXJSA1aEs+sMI9giIrhSq5vvmVPYXCG4YP0eNZQdZNEEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:38.307967Z"},"content_sha256":"c946879473d144330a1a67a8f6937dd486e08d7943d2bf97ef010cfe4d396d31","schema_version":"1.0","event_id":"sha256:c946879473d144330a1a67a8f6937dd486e08d7943d2bf97ef010cfe4d396d31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OJBXCGSPT2YTPHRSVXDS2HUW3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Active Learning for Classification and Preference Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ferenc Husz\\'ar, M\\'at\\'e Lengyel, Neil Houlsby, Zoubin Ghahramani","submitted_at":"2011-12-24T17:53:19Z","abstract_excerpt":"Information theoretic active learning has been widely studied for probabilistic models. For simple regression an optimal myopic policy is easily tractable. However, for other tasks and with more complex models, such as classification with nonparametric models, the optimal solution is harder to compute. Current approaches make approximations to achieve tractability. We propose an approach that expresses information gain in terms of predictive entropies, and apply this method to the Gaussian Process Classifier (GPC). Our approach makes minimal approximations to the full information theoretic obj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5745","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-18T04:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVIx8deCITlEKjd9Wx/+41zEOhqZeC60QJyIfD21IDU6+43VIkksx7WGSMODii2w19vte20maocIj01eJdAzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:29:38.308307Z"},"content_sha256":"9f78c202dfc8d12a7c76a97e91e54cf0a785524cae7de9b3b3c4ca9c2f4a25f6","schema_version":"1.0","event_id":"sha256:9f78c202dfc8d12a7c76a97e91e54cf0a785524cae7de9b3b3c4ca9c2f4a25f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/bundle.json","state_url":"https://pith.science/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/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-05T08:29:38Z","links":{"resolver":"https://pith.science/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z","bundle":"https://pith.science/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/bundle.json","state":"https://pith.science/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJBXCGSPT2YTPHRSVXDS2HUW3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OJBXCGSPT2YTPHRSVXDS2HUW3Z","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":"b9346d5d14b70ca74e4d943a7f6c9aae1cd5749a3949eafe233742b196723d3c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-24T17:53:19Z","title_canon_sha256":"7a6c40bdaad0d6c93ab27a00808164be54c4ef5ec59c03e2348017cb94539e3d"},"schema_version":"1.0","source":{"id":"1112.5745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5745","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5745v1","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5745","created_at":"2026-05-18T04:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"OJBXCGSPT2YT","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OJBXCGSPT2YTPHRS","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OJBXCGSP","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:9f78c202dfc8d12a7c76a97e91e54cf0a785524cae7de9b3b3c4ca9c2f4a25f6","target":"graph","created_at":"2026-05-18T04:05: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":"Information theoretic active learning has been widely studied for probabilistic models. For simple regression an optimal myopic policy is easily tractable. However, for other tasks and with more complex models, such as classification with nonparametric models, the optimal solution is harder to compute. Current approaches make approximations to achieve tractability. We propose an approach that expresses information gain in terms of predictive entropies, and apply this method to the Gaussian Process Classifier (GPC). Our approach makes minimal approximations to the full information theoretic obj","authors_text":"Ferenc Husz\\'ar, M\\'at\\'e Lengyel, Neil Houlsby, Zoubin Ghahramani","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-24T17:53:19Z","title":"Bayesian Active Learning for Classification and Preference Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5745","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:c946879473d144330a1a67a8f6937dd486e08d7943d2bf97ef010cfe4d396d31","target":"record","created_at":"2026-05-18T04:05: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":"b9346d5d14b70ca74e4d943a7f6c9aae1cd5749a3949eafe233742b196723d3c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-12-24T17:53:19Z","title_canon_sha256":"7a6c40bdaad0d6c93ab27a00808164be54c4ef5ec59c03e2348017cb94539e3d"},"schema_version":"1.0","source":{"id":"1112.5745","kind":"arxiv","version":1}},"canonical_sha256":"7243711a4f9eb1379e32adc72d1e96de4526273e91323b2c271ed0782c3941ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7243711a4f9eb1379e32adc72d1e96de4526273e91323b2c271ed0782c3941ce","first_computed_at":"2026-05-18T04:05:37.676813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:37.676813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rB3eq3z8uTFWfTgFynB4Ib0O3ZE56zzEB8Ma75rXr36NkzI30YQCejPmjBHLMmBdFy94K3C8FfuORT5fC10EBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:37.677212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c946879473d144330a1a67a8f6937dd486e08d7943d2bf97ef010cfe4d396d31","sha256:9f78c202dfc8d12a7c76a97e91e54cf0a785524cae7de9b3b3c4ca9c2f4a25f6"],"state_sha256":"26c5089b031af9e53c611497801e9cedaee17ab1470cc1ab726f9df249199001"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0uor/66JnbBq8BUYOs0Gs54diKkRSKtj5gpckgLrd+Hut1jO7x57EBmrT1efQkf2UcoLNTaVGe5PKKtJehmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:29:38.310381Z","bundle_sha256":"6530de85c3aab9c80b6a39d2d0ace0a888eefaa0bfa5177f8b1f057555b43793"}}