{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UG2ZORO5FXKGCOOUOK7FNAJOI6","short_pith_number":"pith:UG2ZORO5","canonical_record":{"source":{"id":"1902.02244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-06T15:47:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b196c7b44612eec5dfd0be30da9436338ee5127a8283a97176b9d614c232effb","abstract_canon_sha256":"e90d51504e7bd9becfa1905f148b39df61d340b0ae86fea032d88c685e4d4885"},"schema_version":"1.0"},"canonical_sha256":"a1b59745dd2dd46139d472be56812e47b5e49934259d15450e7cb1410777a568","source":{"kind":"arxiv","id":"1902.02244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02244","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02244v2","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02244","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"UG2ZORO5FXKG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UG2ZORO5FXKGCOOU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UG2ZORO5","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UG2ZORO5FXKGCOOUOK7FNAJOI6","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-06T15:47:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b196c7b44612eec5dfd0be30da9436338ee5127a8283a97176b9d614c232effb","abstract_canon_sha256":"e90d51504e7bd9becfa1905f148b39df61d340b0ae86fea032d88c685e4d4885"},"schema_version":"1.0"},"canonical_sha256":"a1b59745dd2dd46139d472be56812e47b5e49934259d15450e7cb1410777a568","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:09.057512Z","signature_b64":"LTxrPMUlb9p97gtNqcw+YGHPFSKW7OPO+cUFDMiivuvL0JI/b00jDrLl/seq0mdskynvAh5JuUX6b6W5n2QWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b59745dd2dd46139d472be56812e47b5e49934259d15450e7cb1410777a568","last_reissued_at":"2026-05-17T23:43:09.056774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:09.056774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02244","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-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXPFZILUPR1Xt+g8lIt+H2MuhJy9PfDDs8+K1MrevjIGzVb+fNB8/NWsYpWaPhAX0UAshvDH2SrwA9qA+QtPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:42:37.097776Z"},"content_sha256":"68803de74eb8cd826ee9b23b0866a765c67596ce77d628641e602eee34e8e500","schema_version":"1.0","event_id":"sha256:68803de74eb8cd826ee9b23b0866a765c67596ce77d628641e602eee34e8e500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UG2ZORO5FXKGCOOUOK7FNAJOI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Bal\\'azs Sz\\\"or\\'enyi, Chen-Yu Wei, Chicheng Zhang, D\\'avid P\\'al, Devanathan Thiruvenkatachari","submitted_at":"2019-02-06T15:47:38Z","abstract_excerpt":"We study the problem of efficient online multiclass linear classification with bandit feedback, where all examples belong to one of $K$ classes and lie in the $d$-dimensional Euclidean space. Previous works have left open the challenge of designing efficient algorithms with finite mistake bounds when the data is linearly separable by a margin $\\gamma$. In this work, we take a first step towards this problem. We consider two notions of linear separability: strong and weak.\n  1. Under the strong linear separability condition, we design an efficient algorithm that achieves a near-optimal mistake "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02244","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-17T23:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQ/U8ukHbCgDnPHLc4BSbdZWPSFnDCIZ8yooCG3n9qYm0ndnjnMHaqFdTDZagn5qnRqCPMWT25qFiu/PSa5RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:42:37.098123Z"},"content_sha256":"73bcd9ace706464fedeff8872103d4ff4b270ff3877dc552daf0e5399ad593e5","schema_version":"1.0","event_id":"sha256:73bcd9ace706464fedeff8872103d4ff4b270ff3877dc552daf0e5399ad593e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/bundle.json","state_url":"https://pith.science/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/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-21T09:42:37Z","links":{"resolver":"https://pith.science/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6","bundle":"https://pith.science/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/bundle.json","state":"https://pith.science/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UG2ZORO5FXKGCOOUOK7FNAJOI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UG2ZORO5FXKGCOOUOK7FNAJOI6","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":"e90d51504e7bd9becfa1905f148b39df61d340b0ae86fea032d88c685e4d4885","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-06T15:47:38Z","title_canon_sha256":"b196c7b44612eec5dfd0be30da9436338ee5127a8283a97176b9d614c232effb"},"schema_version":"1.0","source":{"id":"1902.02244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02244","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02244v2","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02244","created_at":"2026-05-17T23:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"UG2ZORO5FXKG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UG2ZORO5FXKGCOOU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UG2ZORO5","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:73bcd9ace706464fedeff8872103d4ff4b270ff3877dc552daf0e5399ad593e5","target":"graph","created_at":"2026-05-17T23:43:09Z","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 problem of efficient online multiclass linear classification with bandit feedback, where all examples belong to one of $K$ classes and lie in the $d$-dimensional Euclidean space. Previous works have left open the challenge of designing efficient algorithms with finite mistake bounds when the data is linearly separable by a margin $\\gamma$. In this work, we take a first step towards this problem. We consider two notions of linear separability: strong and weak.\n  1. Under the strong linear separability condition, we design an efficient algorithm that achieves a near-optimal mistake ","authors_text":"Alina Beygelzimer, Bal\\'azs Sz\\\"or\\'enyi, Chen-Yu Wei, Chicheng Zhang, D\\'avid P\\'al, Devanathan Thiruvenkatachari","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-06T15:47:38Z","title":"Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02244","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:68803de74eb8cd826ee9b23b0866a765c67596ce77d628641e602eee34e8e500","target":"record","created_at":"2026-05-17T23:43:09Z","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":"e90d51504e7bd9becfa1905f148b39df61d340b0ae86fea032d88c685e4d4885","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-06T15:47:38Z","title_canon_sha256":"b196c7b44612eec5dfd0be30da9436338ee5127a8283a97176b9d614c232effb"},"schema_version":"1.0","source":{"id":"1902.02244","kind":"arxiv","version":2}},"canonical_sha256":"a1b59745dd2dd46139d472be56812e47b5e49934259d15450e7cb1410777a568","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1b59745dd2dd46139d472be56812e47b5e49934259d15450e7cb1410777a568","first_computed_at":"2026-05-17T23:43:09.056774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:09.056774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTxrPMUlb9p97gtNqcw+YGHPFSKW7OPO+cUFDMiivuvL0JI/b00jDrLl/seq0mdskynvAh5JuUX6b6W5n2QWDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:09.057512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68803de74eb8cd826ee9b23b0866a765c67596ce77d628641e602eee34e8e500","sha256:73bcd9ace706464fedeff8872103d4ff4b270ff3877dc552daf0e5399ad593e5"],"state_sha256":"6f6d47a66824b35d0d46db37533e44fd81bc8d798c0937ab7130905f3ee0d153"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcYXE8Ot0XtSp8tEE1SGaxKLjEO/Gcd6MLBR1w0B8vXYSSP78CvATHCoM0D8bG8lGBOUzYkm6alGqF5le51fCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T09:42:37.100419Z","bundle_sha256":"2d517026f14a08842b9ab4b38b3cb4983b9fe64d527248fb41ff7b58a1274c85"}}