{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:52XZJYNDAUXUSYJ5SNSQFAFLDQ","short_pith_number":"pith:52XZJYND","canonical_record":{"source":{"id":"1006.1138","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-06-06T21:05:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43d0547a28a48e813d6face33840f5c3f23cb3046f3157e042539a8827f82624","abstract_canon_sha256":"d1eab7c3ea65bf48726c59d74611c58ad85a7624b71f074347e601504462ba8c"},"schema_version":"1.0"},"canonical_sha256":"eeaf94e1a3052f49613d93650280ab1c3337b59cfdaa6b5177fc136900e7de30","source":{"kind":"arxiv","id":"1006.1138","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1138","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1138v3","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1138","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"52XZJYNDAUXU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"52XZJYNDAUXUSYJ5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"52XZJYND","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:52XZJYNDAUXUSYJ5SNSQFAFLDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1138","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-06-06T21:05:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"43d0547a28a48e813d6face33840f5c3f23cb3046f3157e042539a8827f82624","abstract_canon_sha256":"d1eab7c3ea65bf48726c59d74611c58ad85a7624b71f074347e601504462ba8c"},"schema_version":"1.0"},"canonical_sha256":"eeaf94e1a3052f49613d93650280ab1c3337b59cfdaa6b5177fc136900e7de30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.388576Z","signature_b64":"sarBhHoWVe4nougGLovbqJ8MPSZfoGksNIerANe7f2ZrwlTIBpRTsd9CD+DyKwF3N1KCLe4JYUljHt9QdGJBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeaf94e1a3052f49613d93650280ab1c3337b59cfdaa6b5177fc136900e7de30","last_reissued_at":"2026-05-18T02:45:22.388179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.388179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1138","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-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF+WAcOplC0qCdEA5YSgM+oveC4FCdsD5sBFHirg6bbgYzKLYrmM29prlnvgyHU2Wh8ijHQH3rhRl7dF2i8pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:57.957561Z"},"content_sha256":"9a722248308ad282c837387b91b81ba8f1745ef54117f114e0116a4b91efc077","schema_version":"1.0","event_id":"sha256:9a722248308ad282c837387b91b81ba8f1745ef54117f114e0116a4b91efc077"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:52XZJYNDAUXUSYJ5SNSQFAFLDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Learning via Sequential Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Ambuj Tewari, Karthik Sridharan","submitted_at":"2010-06-06T21:05:27Z","abstract_excerpt":"We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our proposed sequential complexities can be seen as extensions of these measures to the sequential setting. The developed theory is shown to yield precise learning guarantees for the problem of sequential prediction. In particular, we show necessary and sufficient conditions for online learnability in the setting of supervised learning. Several examples show the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1138","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-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlQS4sG+ARv/BPKtey+z/1nNHEvKiKs41F2Ep/7V/WlSTCjuludEWQ3tTLUOpz7SoTzMbEadsM4XQaX5uAAVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:57.958249Z"},"content_sha256":"546656ab5a40713d484456330d1dcc4da6770df39abe44540811a94fb37538b5","schema_version":"1.0","event_id":"sha256:546656ab5a40713d484456330d1dcc4da6770df39abe44540811a94fb37538b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/bundle.json","state_url":"https://pith.science/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/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-31T11:22:57Z","links":{"resolver":"https://pith.science/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ","bundle":"https://pith.science/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/bundle.json","state":"https://pith.science/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52XZJYNDAUXUSYJ5SNSQFAFLDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:52XZJYNDAUXUSYJ5SNSQFAFLDQ","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":"d1eab7c3ea65bf48726c59d74611c58ad85a7624b71f074347e601504462ba8c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-06-06T21:05:27Z","title_canon_sha256":"43d0547a28a48e813d6face33840f5c3f23cb3046f3157e042539a8827f82624"},"schema_version":"1.0","source":{"id":"1006.1138","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1138","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1138v3","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1138","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"52XZJYNDAUXU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"52XZJYNDAUXUSYJ5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"52XZJYND","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:546656ab5a40713d484456330d1dcc4da6770df39abe44540811a94fb37538b5","target":"graph","created_at":"2026-05-18T02:45:22Z","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 consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our proposed sequential complexities can be seen as extensions of these measures to the sequential setting. The developed theory is shown to yield precise learning guarantees for the problem of sequential prediction. In particular, we show necessary and sufficient conditions for online learnability in the setting of supervised learning. Several examples show the","authors_text":"Alexander Rakhlin, Ambuj Tewari, Karthik Sridharan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-06-06T21:05:27Z","title":"Online Learning via Sequential Complexities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1138","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:9a722248308ad282c837387b91b81ba8f1745ef54117f114e0116a4b91efc077","target":"record","created_at":"2026-05-18T02:45:22Z","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":"d1eab7c3ea65bf48726c59d74611c58ad85a7624b71f074347e601504462ba8c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-06-06T21:05:27Z","title_canon_sha256":"43d0547a28a48e813d6face33840f5c3f23cb3046f3157e042539a8827f82624"},"schema_version":"1.0","source":{"id":"1006.1138","kind":"arxiv","version":3}},"canonical_sha256":"eeaf94e1a3052f49613d93650280ab1c3337b59cfdaa6b5177fc136900e7de30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeaf94e1a3052f49613d93650280ab1c3337b59cfdaa6b5177fc136900e7de30","first_computed_at":"2026-05-18T02:45:22.388179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:22.388179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sarBhHoWVe4nougGLovbqJ8MPSZfoGksNIerANe7f2ZrwlTIBpRTsd9CD+DyKwF3N1KCLe4JYUljHt9QdGJBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:22.388576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1138","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a722248308ad282c837387b91b81ba8f1745ef54117f114e0116a4b91efc077","sha256:546656ab5a40713d484456330d1dcc4da6770df39abe44540811a94fb37538b5"],"state_sha256":"f1c52980850b5339ab4b240ad08c5afd4b265fb3f591f76dfcd2e5bf4c4f395a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m416/ihpF1Wu7+NAEFKHxRkUyL6U/bdltRWYNZIwzBi8hG+dm10TXqIjF89HB/W78KS9F8L2WM5OCo7zunRTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:22:57.962102Z","bundle_sha256":"44463e2814c644aac9197635006270df6a7c46d8d915ad6b06f4cd596a13fb3b"}}