{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4KGXKMHU2LA563JUT3ROO6W3XA","short_pith_number":"pith:4KGXKMHU","canonical_record":{"source":{"id":"1906.00303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T22:23:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"303e7530d617b46714d14f724e8d57ac9185a6f669b863ec20d0bb73990ec380","abstract_canon_sha256":"b9ec85dda183e68139d04bce03ad03540fad5e74af199e8f71df2283a524603b"},"schema_version":"1.0"},"canonical_sha256":"e28d7530f4d2c1df6d349ee2e77adbb81361b40391f4bf7798ef82dc6353d49d","source":{"kind":"arxiv","id":"1906.00303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00303","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00303v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00303","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"4KGXKMHU2LA5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4KGXKMHU2LA563JU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4KGXKMHU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4KGXKMHU2LA563JUT3ROO6W3XA","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T22:23:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"303e7530d617b46714d14f724e8d57ac9185a6f669b863ec20d0bb73990ec380","abstract_canon_sha256":"b9ec85dda183e68139d04bce03ad03540fad5e74af199e8f71df2283a524603b"},"schema_version":"1.0"},"canonical_sha256":"e28d7530f4d2c1df6d349ee2e77adbb81361b40391f4bf7798ef82dc6353d49d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:27.512445Z","signature_b64":"OLegfXO//6DbDPRB2+ESE7F3M12+iyXPdNT/Ptt51nPfNwyNyg4odWOSaCFtMfUs0rdmmRcVo3AAKU+qoZf/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28d7530f4d2c1df6d349ee2e77adbb81361b40391f4bf7798ef82dc6353d49d","last_reissued_at":"2026-05-17T23:44:27.511793Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:27.511793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00303","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-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AEKtMpZctCf3NKyI+bmqL0zQ3eXcnd8td1cbA/VW9ld89rZCVsmQc7zc4BZtB0N6qZyBxUiidCBNvn3fgAQODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:09:08.741791Z"},"content_sha256":"55886dc422c5850c3f5bd7cf4c010a6c6567312920eb09e9981cb6844032b82c","schema_version":"1.0","event_id":"sha256:55886dc422c5850c3f5bd7cf4c010a6c6567312920eb09e9981cb6844032b82c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4KGXKMHU2LA563JUT3ROO6W3XA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Learning for Binary Classification with Abstention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mohammad Ghavamzadeh, Shubhanshu Shekhar, Tara Javidi","submitted_at":"2019-06-01T22:23:45Z","abstract_excerpt":"We construct and analyze active learning algorithms for the problem of binary classification with abstention. We consider three abstention settings: \\emph{fixed-cost} and two variants of \\emph{bounded-rate} abstention, and for each of them propose an active learning algorithm. All the proposed algorithms can work in the most commonly used active learning models, i.e., \\emph{membership-query}, \\emph{pool-based}, and \\emph{stream-based} sampling. We obtain upper-bounds on the excess risk of our algorithms in a general non-parametric framework and establish their minimax near-optimality by derivi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00303","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-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76FP7ccgyPyVVvNFHWvdlE/V8KWAx8yH2sgRnY5dOHb+dfXjQ8aRy4B7h08YJZU+PsZlHy+6bQzSvFNR1UMRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:09:08.742143Z"},"content_sha256":"679a8e4e7454139394652bd7766e5571dda000163b4819b0f6f67170e65fbe13","schema_version":"1.0","event_id":"sha256:679a8e4e7454139394652bd7766e5571dda000163b4819b0f6f67170e65fbe13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KGXKMHU2LA563JUT3ROO6W3XA/bundle.json","state_url":"https://pith.science/pith/4KGXKMHU2LA563JUT3ROO6W3XA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KGXKMHU2LA563JUT3ROO6W3XA/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-02T05:09:08Z","links":{"resolver":"https://pith.science/pith/4KGXKMHU2LA563JUT3ROO6W3XA","bundle":"https://pith.science/pith/4KGXKMHU2LA563JUT3ROO6W3XA/bundle.json","state":"https://pith.science/pith/4KGXKMHU2LA563JUT3ROO6W3XA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KGXKMHU2LA563JUT3ROO6W3XA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4KGXKMHU2LA563JUT3ROO6W3XA","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":"b9ec85dda183e68139d04bce03ad03540fad5e74af199e8f71df2283a524603b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T22:23:45Z","title_canon_sha256":"303e7530d617b46714d14f724e8d57ac9185a6f669b863ec20d0bb73990ec380"},"schema_version":"1.0","source":{"id":"1906.00303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00303","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00303v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00303","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"4KGXKMHU2LA5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4KGXKMHU2LA563JU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4KGXKMHU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:679a8e4e7454139394652bd7766e5571dda000163b4819b0f6f67170e65fbe13","target":"graph","created_at":"2026-05-17T23:44:27Z","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 construct and analyze active learning algorithms for the problem of binary classification with abstention. We consider three abstention settings: \\emph{fixed-cost} and two variants of \\emph{bounded-rate} abstention, and for each of them propose an active learning algorithm. All the proposed algorithms can work in the most commonly used active learning models, i.e., \\emph{membership-query}, \\emph{pool-based}, and \\emph{stream-based} sampling. We obtain upper-bounds on the excess risk of our algorithms in a general non-parametric framework and establish their minimax near-optimality by derivi","authors_text":"Mohammad Ghavamzadeh, Shubhanshu Shekhar, Tara Javidi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T22:23:45Z","title":"Active Learning for Binary Classification with Abstention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00303","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:55886dc422c5850c3f5bd7cf4c010a6c6567312920eb09e9981cb6844032b82c","target":"record","created_at":"2026-05-17T23:44:27Z","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":"b9ec85dda183e68139d04bce03ad03540fad5e74af199e8f71df2283a524603b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-01T22:23:45Z","title_canon_sha256":"303e7530d617b46714d14f724e8d57ac9185a6f669b863ec20d0bb73990ec380"},"schema_version":"1.0","source":{"id":"1906.00303","kind":"arxiv","version":1}},"canonical_sha256":"e28d7530f4d2c1df6d349ee2e77adbb81361b40391f4bf7798ef82dc6353d49d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e28d7530f4d2c1df6d349ee2e77adbb81361b40391f4bf7798ef82dc6353d49d","first_computed_at":"2026-05-17T23:44:27.511793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:27.511793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OLegfXO//6DbDPRB2+ESE7F3M12+iyXPdNT/Ptt51nPfNwyNyg4odWOSaCFtMfUs0rdmmRcVo3AAKU+qoZf/CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:27.512445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55886dc422c5850c3f5bd7cf4c010a6c6567312920eb09e9981cb6844032b82c","sha256:679a8e4e7454139394652bd7766e5571dda000163b4819b0f6f67170e65fbe13"],"state_sha256":"324367ee89177f4cdc65d8378f82045f9603f6109bbe876fc3aa81cb48d16d97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6DWOla+ZsdlfmUKo26YGQPEnDBErzgQLxA1TfJNGYiByjKEsiS45Ser6A18c2nCjeHI5IsqrUtg8C4+HhpZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:09:08.744030Z","bundle_sha256":"7cc1980c3ebfb11fcc127b8e5eef106e77e556db4eb68c162e67b1191f2d59a5"}}