{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XR6VKX4OBKOYOFTU4QCEZGFL6C","short_pith_number":"pith:XR6VKX4O","canonical_record":{"source":{"id":"1501.07340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T04:02:39Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"80a533bf13677aed74f288b9f9862ffa5ec98ba172e48c5820b463f5208b9b39","abstract_canon_sha256":"7223a98027f3582efabdd269df1fbfca7848823f986dcf8de86fbb3353c626a3"},"schema_version":"1.0"},"canonical_sha256":"bc7d555f8e0a9d871674e4044c98abf0b71979130c6a01273c3eee6906bae500","source":{"kind":"arxiv","id":"1501.07340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07340","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07340v1","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07340","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"XR6VKX4OBKOY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XR6VKX4OBKOYOFTU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XR6VKX4O","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XR6VKX4OBKOYOFTU4QCEZGFL6C","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T04:02:39Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"80a533bf13677aed74f288b9f9862ffa5ec98ba172e48c5820b463f5208b9b39","abstract_canon_sha256":"7223a98027f3582efabdd269df1fbfca7848823f986dcf8de86fbb3353c626a3"},"schema_version":"1.0"},"canonical_sha256":"bc7d555f8e0a9d871674e4044c98abf0b71979130c6a01273c3eee6906bae500","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:22.225697Z","signature_b64":"5i5aUM+4w5VhlDYU8nob6oF/S2p2eLUpW+OIq1m9mNAjgd+vbuEJk6pto64fzrPvUs24i3vUvNcVED6BQY8VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7d555f8e0a9d871674e4044c98abf0b71979130c6a01273c3eee6906bae500","last_reissued_at":"2026-05-18T02:28:22.225202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:22.225202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07340","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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSDjIFz/nxPj0wLPAOAG9l30L+MNTxy+TG4Ao2os5UEIVzD8Cxn8EjVmBQlna4PrTs9GmevtIuT/U43ZVgtkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:55:01.731987Z"},"content_sha256":"894e652aabe76c099dfd15b2a00c9089117db1498a5c2dae41c54d83f77fc505","schema_version":"1.0","event_id":"sha256:894e652aabe76c099dfd15b2a00c9089117db1498a5c2dae41c54d83f77fc505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XR6VKX4OBKOYOFTU4QCEZGFL6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Alexander Rakhlin, Karthik Sridharan","submitted_at":"2015-01-29T04:02:39Z","abstract_excerpt":"We analyze the problem of sequential probability assignment for binary outcomes with side information and logarithmic loss, where regret---or, redundancy---is measured with respect to a (possibly infinite) class of experts. We provide upper and lower bounds for minimax regret in terms of sequential complexities of the class. These complexities were recently shown to give matching (up to logarithmic factors) upper and lower bounds for sequential prediction with general convex Lipschitz loss functions (Rakhlin and Sridharan, 2015). To deal with unbounded gradients of the logarithmic loss, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07340","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-18T02:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZFYhiqrx3niyj9Zq4GP+CeUG4aKfK7shDLLKrAamhmzarK2ic9YCPgUt+t6OvFOH+Wt/BB/ZdJt2zadHGRbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:55:01.732354Z"},"content_sha256":"c6a7326788c3de0ade60f5ce7c700331a61ed96942979d4f78b8607932983d26","schema_version":"1.0","event_id":"sha256:c6a7326788c3de0ade60f5ce7c700331a61ed96942979d4f78b8607932983d26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/bundle.json","state_url":"https://pith.science/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/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-07-05T11:55:01Z","links":{"resolver":"https://pith.science/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C","bundle":"https://pith.science/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/bundle.json","state":"https://pith.science/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XR6VKX4OBKOYOFTU4QCEZGFL6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XR6VKX4OBKOYOFTU4QCEZGFL6C","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":"7223a98027f3582efabdd269df1fbfca7848823f986dcf8de86fbb3353c626a3","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T04:02:39Z","title_canon_sha256":"80a533bf13677aed74f288b9f9862ffa5ec98ba172e48c5820b463f5208b9b39"},"schema_version":"1.0","source":{"id":"1501.07340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07340","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07340v1","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07340","created_at":"2026-05-18T02:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"XR6VKX4OBKOY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XR6VKX4OBKOYOFTU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XR6VKX4O","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:c6a7326788c3de0ade60f5ce7c700331a61ed96942979d4f78b8607932983d26","target":"graph","created_at":"2026-05-18T02:28: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 analyze the problem of sequential probability assignment for binary outcomes with side information and logarithmic loss, where regret---or, redundancy---is measured with respect to a (possibly infinite) class of experts. We provide upper and lower bounds for minimax regret in terms of sequential complexities of the class. These complexities were recently shown to give matching (up to logarithmic factors) upper and lower bounds for sequential prediction with general convex Lipschitz loss functions (Rakhlin and Sridharan, 2015). To deal with unbounded gradients of the logarithmic loss, we pre","authors_text":"Alexander Rakhlin, Karthik Sridharan","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T04:02:39Z","title":"Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07340","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:894e652aabe76c099dfd15b2a00c9089117db1498a5c2dae41c54d83f77fc505","target":"record","created_at":"2026-05-18T02:28: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":"7223a98027f3582efabdd269df1fbfca7848823f986dcf8de86fbb3353c626a3","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T04:02:39Z","title_canon_sha256":"80a533bf13677aed74f288b9f9862ffa5ec98ba172e48c5820b463f5208b9b39"},"schema_version":"1.0","source":{"id":"1501.07340","kind":"arxiv","version":1}},"canonical_sha256":"bc7d555f8e0a9d871674e4044c98abf0b71979130c6a01273c3eee6906bae500","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc7d555f8e0a9d871674e4044c98abf0b71979130c6a01273c3eee6906bae500","first_computed_at":"2026-05-18T02:28:22.225202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:22.225202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5i5aUM+4w5VhlDYU8nob6oF/S2p2eLUpW+OIq1m9mNAjgd+vbuEJk6pto64fzrPvUs24i3vUvNcVED6BQY8VCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:22.225697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:894e652aabe76c099dfd15b2a00c9089117db1498a5c2dae41c54d83f77fc505","sha256:c6a7326788c3de0ade60f5ce7c700331a61ed96942979d4f78b8607932983d26"],"state_sha256":"dc3323401662987fdcc284376a951b40cdc4124fb39e78861ea3e6be444e1fee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ef2IKDCWkb706A0BFD0vOrrr0FSS1gL61UY75e7JlO+27k9mYTHqBQ049DuVwjF0x4y1DUkeq7aX2NHlcgUhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:55:01.734570Z","bundle_sha256":"6b6a6d1b4995e398a122263d171567d8ae870ef847fb146f2b37fe1b81415bae"}}