{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZM5C63MYZFQGF3DHNVDQEOBYPA","short_pith_number":"pith:ZM5C63MY","canonical_record":{"source":{"id":"1309.6830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fe0466e949996ecb29813d8a2a7d2325713327374627ed1dbbc9339a69186963","abstract_canon_sha256":"fc3357677f11539c7c97c40c8cd9505ca5146274c2af70faa71af21307656788"},"schema_version":"1.0"},"canonical_sha256":"cb3a2f6d98c96062ec676d47023838781893ac4dc38abf54e0b7619d60836e6d","source":{"kind":"arxiv","id":"1309.6830","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6830","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6830v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6830","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZM5C63MYZFQG","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZM5C63MYZFQGF3DH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZM5C63MY","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZM5C63MYZFQGF3DHNVDQEOBYPA","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fe0466e949996ecb29813d8a2a7d2325713327374627ed1dbbc9339a69186963","abstract_canon_sha256":"fc3357677f11539c7c97c40c8cd9505ca5146274c2af70faa71af21307656788"},"schema_version":"1.0"},"canonical_sha256":"cb3a2f6d98c96062ec676d47023838781893ac4dc38abf54e0b7619d60836e6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.257346Z","signature_b64":"l9ncv9n5cUTJnjqHON5QggH7WUdcN+SKqHEP111ORNqKbOnag5RNitTQaFHdvX5eN5xDqFhhJdqdpNwL20llCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb3a2f6d98c96062ec676d47023838781893ac4dc38abf54e0b7619d60836e6d","last_reissued_at":"2026-05-18T03:12:10.256119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.256119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6830","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcz4aXG4qCISlvPOmkhsQjekHcblwRpC5jeYjUbene5OD0yW2SjC06Nn1O0NB7XHGJ47HgxwiHVTozI1hhYKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:20:53.773415Z"},"content_sha256":"0b1c45ff0bc9ec0498e9a8ab1643fb65f4865a97954a56dc21c9dcd0391b08a8","schema_version":"1.0","event_id":"sha256:0b1c45ff0bc9ec0498e9a8ab1643fb65f4865a97954a56dc21c9dcd0391b08a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZM5C63MYZFQGF3DHNVDQEOBYPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander G. Gray, Ravi Ganti","submitted_at":"2013-09-26T12:39:01Z","abstract_excerpt":"In this paper we propose a multi-armed bandit inspired, pool based active learning algorithm for the problem of binary classification. By carefully constructing an analogy between active learning and multi-armed bandits, we utilize ideas such as lower confidence bounds, and self-concordant regularization from the multi-armed bandit literature to design our proposed algorithm. Our algorithm is a sequential algorithm, which in each round assigns a sampling distribution on the pool, samples one point from this distribution, and queries the oracle for the label of this sampled point. The design of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6830","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kRnZJageDBjsNrEU3gMCJECesmHCZzjTN9RiFift+2zS5K3ql7JPEz3G7NNbNBCqMXO7UVM4g2JSjWj4EQwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:20:53.774138Z"},"content_sha256":"1e18a33c072f6e4fde61c266dc59f2797ea78c1ce484d9085dfb10648cecf595","schema_version":"1.0","event_id":"sha256:1e18a33c072f6e4fde61c266dc59f2797ea78c1ce484d9085dfb10648cecf595"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/bundle.json","state_url":"https://pith.science/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/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-09T06:20:53Z","links":{"resolver":"https://pith.science/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA","bundle":"https://pith.science/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/bundle.json","state":"https://pith.science/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZM5C63MYZFQGF3DHNVDQEOBYPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZM5C63MYZFQGF3DHNVDQEOBYPA","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":"fc3357677f11539c7c97c40c8cd9505ca5146274c2af70faa71af21307656788","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:01Z","title_canon_sha256":"fe0466e949996ecb29813d8a2a7d2325713327374627ed1dbbc9339a69186963"},"schema_version":"1.0","source":{"id":"1309.6830","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6830","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6830v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6830","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZM5C63MYZFQG","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZM5C63MYZFQGF3DH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZM5C63MY","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:1e18a33c072f6e4fde61c266dc59f2797ea78c1ce484d9085dfb10648cecf595","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"In this paper we propose a multi-armed bandit inspired, pool based active learning algorithm for the problem of binary classification. By carefully constructing an analogy between active learning and multi-armed bandits, we utilize ideas such as lower confidence bounds, and self-concordant regularization from the multi-armed bandit literature to design our proposed algorithm. Our algorithm is a sequential algorithm, which in each round assigns a sampling distribution on the pool, samples one point from this distribution, and queries the oracle for the label of this sampled point. The design of","authors_text":"Alexander G. Gray, Ravi Ganti","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:01Z","title":"Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6830","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:0b1c45ff0bc9ec0498e9a8ab1643fb65f4865a97954a56dc21c9dcd0391b08a8","target":"record","created_at":"2026-05-18T03:12:10Z","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":"fc3357677f11539c7c97c40c8cd9505ca5146274c2af70faa71af21307656788","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:39:01Z","title_canon_sha256":"fe0466e949996ecb29813d8a2a7d2325713327374627ed1dbbc9339a69186963"},"schema_version":"1.0","source":{"id":"1309.6830","kind":"arxiv","version":1}},"canonical_sha256":"cb3a2f6d98c96062ec676d47023838781893ac4dc38abf54e0b7619d60836e6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb3a2f6d98c96062ec676d47023838781893ac4dc38abf54e0b7619d60836e6d","first_computed_at":"2026-05-18T03:12:10.256119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.256119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l9ncv9n5cUTJnjqHON5QggH7WUdcN+SKqHEP111ORNqKbOnag5RNitTQaFHdvX5eN5xDqFhhJdqdpNwL20llCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.257346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6830","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b1c45ff0bc9ec0498e9a8ab1643fb65f4865a97954a56dc21c9dcd0391b08a8","sha256:1e18a33c072f6e4fde61c266dc59f2797ea78c1ce484d9085dfb10648cecf595"],"state_sha256":"bf1e11b0a8328a813371e15959b41331a6e759f8ba7f57495e3c0c809f72f6db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6X/juIOrq6ORL2wnXbXMrg/1AGfGMD7aocupvdifFJJvISzR5eXGX2If4udY2zzk7Pif03hoIFXUyEtnpg3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:20:53.777474Z","bundle_sha256":"d576dfad59e533e8ac76313344e25eb606b0649c5d85c8c4a8f0cf82655a15e0"}}