{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ZNKUA2UJXUTRFNE5LHIZGJOWD","short_pith_number":"pith:6ZNKUA2U","canonical_record":{"source":{"id":"1702.07958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-25T23:15:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8a8a74524830626b952d93ec3bcf2d41e501a0cb6d480cb1e3074e1e18f9a3ff","abstract_canon_sha256":"daca26ded49fec3dd6e450f59a49dc39de70d7c7dc1b0accb98529b143897a7e"},"schema_version":"1.0"},"canonical_sha256":"f65aaa03544de93895a4eace8c992eb0e6282b25ead430928edf94d7046c915f","source":{"kind":"arxiv","id":"1702.07958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07958","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07958v3","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07958","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"6ZNKUA2UJXUT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZNKUA2UJXUTRFNE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZNKUA2U","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ZNKUA2UJXUTRFNE5LHIZGJOWD","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-25T23:15:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8a8a74524830626b952d93ec3bcf2d41e501a0cb6d480cb1e3074e1e18f9a3ff","abstract_canon_sha256":"daca26ded49fec3dd6e450f59a49dc39de70d7c7dc1b0accb98529b143897a7e"},"schema_version":"1.0"},"canonical_sha256":"f65aaa03544de93895a4eace8c992eb0e6282b25ead430928edf94d7046c915f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:39.615860Z","signature_b64":"sxmXzTrL6xT0UCdk55hHe8FQY97wgC/EneTpnA9amUPVULNl//kmxYQHgEKF7x2YX2VgF9jjtkNM7PRyO6tCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f65aaa03544de93895a4eace8c992eb0e6282b25ead430928edf94d7046c915f","last_reissued_at":"2026-05-18T00:25:39.615228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:39.615228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07958","source_version":3,"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-18T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9CzUHJalklxeSeligMZaM0/IBNU6jFNMgqU8Cxt/+gCwXNZsXpYO3rf4ugT35GKRIXv8NYrOKi6j8Jqdy7VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:37:49.470194Z"},"content_sha256":"480ae05be175f5dfb61ec8ffaa53fd904f9e413d34ffa73992e5a3a312b058b2","schema_version":"1.0","event_id":"sha256:480ae05be175f5dfb61ec8ffaa53fd904f9e413d34ffa73992e5a3a312b058b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ZNKUA2UJXUTRFNE5LHIZGJOWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Online Bandit Multiclass Learning with $\\tilde{O}(\\sqrt{T})$ Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Chicheng Zhang, Francesco Orabona","submitted_at":"2017-02-25T23:15:55Z","abstract_excerpt":"We present an efficient second-order algorithm with $\\tilde{O}(\\frac{1}{\\eta}\\sqrt{T})$ regret for the bandit online multiclass problem. The regret bound holds simultaneously with respect to a family of loss functions parameterized by $\\eta$, for a range of $\\eta$ restricted by the norm of the competitor. The family of loss functions ranges from hinge loss ($\\eta=0$) to squared hinge loss ($\\eta=1$). This provides a solution to the open problem of (J. Abernethy and A. Rakhlin. An efficient bandit algorithm for $\\sqrt{T}$-regret in online multiclass prediction? In COLT, 2009). We test our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07958","kind":"arxiv","version":3},"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-18T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9L4Pz/e4uPLKrLMpYCzlLQO6+ntBOhh3aoKPS94ve50aSGAub9bvH7c8BkR3k0PQhV+JJjD4joq5aOQoASvYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:37:49.470882Z"},"content_sha256":"0464a14f6b227f12b18f4089f2abdc1587d3073c0d947decc889482749146207","schema_version":"1.0","event_id":"sha256:0464a14f6b227f12b18f4089f2abdc1587d3073c0d947decc889482749146207"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/bundle.json","state_url":"https://pith.science/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/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-26T10:37:49Z","links":{"resolver":"https://pith.science/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD","bundle":"https://pith.science/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/bundle.json","state":"https://pith.science/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZNKUA2UJXUTRFNE5LHIZGJOWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ZNKUA2UJXUTRFNE5LHIZGJOWD","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":"daca26ded49fec3dd6e450f59a49dc39de70d7c7dc1b0accb98529b143897a7e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-25T23:15:55Z","title_canon_sha256":"8a8a74524830626b952d93ec3bcf2d41e501a0cb6d480cb1e3074e1e18f9a3ff"},"schema_version":"1.0","source":{"id":"1702.07958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07958","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07958v3","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07958","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"6ZNKUA2UJXUT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZNKUA2UJXUTRFNE","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZNKUA2U","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:0464a14f6b227f12b18f4089f2abdc1587d3073c0d947decc889482749146207","target":"graph","created_at":"2026-05-18T00:25:39Z","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 present an efficient second-order algorithm with $\\tilde{O}(\\frac{1}{\\eta}\\sqrt{T})$ regret for the bandit online multiclass problem. The regret bound holds simultaneously with respect to a family of loss functions parameterized by $\\eta$, for a range of $\\eta$ restricted by the norm of the competitor. The family of loss functions ranges from hinge loss ($\\eta=0$) to squared hinge loss ($\\eta=1$). This provides a solution to the open problem of (J. Abernethy and A. Rakhlin. An efficient bandit algorithm for $\\sqrt{T}$-regret in online multiclass prediction? In COLT, 2009). We test our algor","authors_text":"Alina Beygelzimer, Chicheng Zhang, Francesco Orabona","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-25T23:15:55Z","title":"Efficient Online Bandit Multiclass Learning with $\\tilde{O}(\\sqrt{T})$ Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07958","kind":"arxiv","version":3},"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:480ae05be175f5dfb61ec8ffaa53fd904f9e413d34ffa73992e5a3a312b058b2","target":"record","created_at":"2026-05-18T00:25:39Z","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":"daca26ded49fec3dd6e450f59a49dc39de70d7c7dc1b0accb98529b143897a7e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-25T23:15:55Z","title_canon_sha256":"8a8a74524830626b952d93ec3bcf2d41e501a0cb6d480cb1e3074e1e18f9a3ff"},"schema_version":"1.0","source":{"id":"1702.07958","kind":"arxiv","version":3}},"canonical_sha256":"f65aaa03544de93895a4eace8c992eb0e6282b25ead430928edf94d7046c915f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f65aaa03544de93895a4eace8c992eb0e6282b25ead430928edf94d7046c915f","first_computed_at":"2026-05-18T00:25:39.615228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:39.615228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sxmXzTrL6xT0UCdk55hHe8FQY97wgC/EneTpnA9amUPVULNl//kmxYQHgEKF7x2YX2VgF9jjtkNM7PRyO6tCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:39.615860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480ae05be175f5dfb61ec8ffaa53fd904f9e413d34ffa73992e5a3a312b058b2","sha256:0464a14f6b227f12b18f4089f2abdc1587d3073c0d947decc889482749146207"],"state_sha256":"45c0dd095a0a42146eb8c9d8664898bc9a869d312934ebb73d019821cd837f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/ZfYSfalKKkcpC5Ywk69NOvFGxBy0+pUyPuHmy578ml3VZq73an411zflFygXAHgOXPFTyzy/ZVoYd7OzsxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:37:49.474049Z","bundle_sha256":"201148d741543158358812f0c28dc4cb814bdba1d5d24f5594a2f22bcdaa9671"}}