{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QZOIKTJ4VULAZS2YX5WT7CPFAU","short_pith_number":"pith:QZOIKTJ4","canonical_record":{"source":{"id":"1503.02193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T17:36:08Z","cross_cats_sorted":[],"title_canon_sha256":"f1aec61963c8d7c6151b6d9c20be0a46919920110e135a0d0f9553720fdb326a","abstract_canon_sha256":"b45938b9731a2de814742191d7f084920892309e43a61aff86770cf68093508b"},"schema_version":"1.0"},"canonical_sha256":"865c854d3cad160ccb58bf6d3f89e5053cf30684c363e83e66774cd8bd53cddb","source":{"kind":"arxiv","id":"1503.02193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02193","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02193v2","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02193","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"QZOIKTJ4VULA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZOIKTJ4VULAZS2Y","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZOIKTJ4","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QZOIKTJ4VULAZS2YX5WT7CPFAU","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T17:36:08Z","cross_cats_sorted":[],"title_canon_sha256":"f1aec61963c8d7c6151b6d9c20be0a46919920110e135a0d0f9553720fdb326a","abstract_canon_sha256":"b45938b9731a2de814742191d7f084920892309e43a61aff86770cf68093508b"},"schema_version":"1.0"},"canonical_sha256":"865c854d3cad160ccb58bf6d3f89e5053cf30684c363e83e66774cd8bd53cddb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:54.908687Z","signature_b64":"I6Qo53RghDnFEQuMykA1pPYRzEwgcl4+h88gQ5fH2F/4blWYPW9cFzkcz6dYKkZGZeG6DDtSlkMd/n2EfVyHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865c854d3cad160ccb58bf6d3f89e5053cf30684c363e83e66774cd8bd53cddb","last_reissued_at":"2026-05-18T01:34:54.908044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:54.908044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02193","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-18T01:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUZ9cAhfrarg6W3TAp3w5HMc5AynL4klBodaBm3phtQlBTyoSejgCegJDWzc4RfgX8+84hZ8PesX3f7nsuAPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:29:14.940408Z"},"content_sha256":"73e396bc390fe41537fff8787bc0561ede51d6ab721da109d0a5429258218efe","schema_version":"1.0","event_id":"sha256:73e396bc390fe41537fff8787bc0561ede51d6ab721da109d0a5429258218efe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QZOIKTJ4VULAZS2YX5WT7CPFAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Label optimal regret bounds for online local learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Kevin A. Lai, Moses Charikar, Pranjal Awasthi","submitted_at":"2015-03-07T17:36:08Z","abstract_excerpt":"We resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label set. In this framework the algorithm is shown a pair of items at each step, chosen from a set of $n$ items. The learner then predicts a label for each item, from a label set of size $L$ and receives a real valued payoff. This is a natural framework which captures many interesting scenarios such as collaborative filtering, online gambling, and online max cut among others. (Christiano, 2014a) designed an efficient onlin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02193","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-18T01:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZWw/+C8QPjteKt0C61GAsjafpnOBSyjN2+lUpQJh8sEOJGITslWaF3KQvVsn1nTQNmJPwLv4dOcnaqEoH4aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:29:14.940750Z"},"content_sha256":"3da3d569caea5896c90d18318e709267ab7ea0e163d20daf962e9231e5c891a1","schema_version":"1.0","event_id":"sha256:3da3d569caea5896c90d18318e709267ab7ea0e163d20daf962e9231e5c891a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/bundle.json","state_url":"https://pith.science/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/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-27T18:29:14Z","links":{"resolver":"https://pith.science/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU","bundle":"https://pith.science/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/bundle.json","state":"https://pith.science/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZOIKTJ4VULAZS2YX5WT7CPFAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QZOIKTJ4VULAZS2YX5WT7CPFAU","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":"b45938b9731a2de814742191d7f084920892309e43a61aff86770cf68093508b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T17:36:08Z","title_canon_sha256":"f1aec61963c8d7c6151b6d9c20be0a46919920110e135a0d0f9553720fdb326a"},"schema_version":"1.0","source":{"id":"1503.02193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02193","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02193v2","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02193","created_at":"2026-05-18T01:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"QZOIKTJ4VULA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZOIKTJ4VULAZS2Y","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZOIKTJ4","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:3da3d569caea5896c90d18318e709267ab7ea0e163d20daf962e9231e5c891a1","target":"graph","created_at":"2026-05-18T01:34:54Z","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 resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label set. In this framework the algorithm is shown a pair of items at each step, chosen from a set of $n$ items. The learner then predicts a label for each item, from a label set of size $L$ and receives a real valued payoff. This is a natural framework which captures many interesting scenarios such as collaborative filtering, online gambling, and online max cut among others. (Christiano, 2014a) designed an efficient onlin","authors_text":"Andrej Risteski, Kevin A. Lai, Moses Charikar, Pranjal Awasthi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T17:36:08Z","title":"Label optimal regret bounds for online local learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02193","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:73e396bc390fe41537fff8787bc0561ede51d6ab721da109d0a5429258218efe","target":"record","created_at":"2026-05-18T01:34:54Z","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":"b45938b9731a2de814742191d7f084920892309e43a61aff86770cf68093508b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-07T17:36:08Z","title_canon_sha256":"f1aec61963c8d7c6151b6d9c20be0a46919920110e135a0d0f9553720fdb326a"},"schema_version":"1.0","source":{"id":"1503.02193","kind":"arxiv","version":2}},"canonical_sha256":"865c854d3cad160ccb58bf6d3f89e5053cf30684c363e83e66774cd8bd53cddb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865c854d3cad160ccb58bf6d3f89e5053cf30684c363e83e66774cd8bd53cddb","first_computed_at":"2026-05-18T01:34:54.908044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:54.908044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I6Qo53RghDnFEQuMykA1pPYRzEwgcl4+h88gQ5fH2F/4blWYPW9cFzkcz6dYKkZGZeG6DDtSlkMd/n2EfVyHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:54.908687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73e396bc390fe41537fff8787bc0561ede51d6ab721da109d0a5429258218efe","sha256:3da3d569caea5896c90d18318e709267ab7ea0e163d20daf962e9231e5c891a1"],"state_sha256":"40fe7a65658235a665fa173acac6ef8c042370d4f63af2d50223a9ed6ada23b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8jLl+uDUAmjYrsmeUngeYYSxclJnyLr+S1YX5TScBLhUgEYRDhGCJnRKpApBCfoR5KyjF/KeTDcDVLuhdZyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:29:14.942538Z","bundle_sha256":"f1440da1c28373e62eb1b5144044009c225d5fbd87d1c8e6f74dcfbcc5868e43"}}