{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C5XGQ33Q7COGKQ6CMKEMT6DFV5","short_pith_number":"pith:C5XGQ33Q","canonical_record":{"source":{"id":"1802.06965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T04:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"b7624eb7dc0e8934004a3a63ae8f956cf497599e7032eae4b3707c4e11bbeba1","abstract_canon_sha256":"a0d7cf29c77e13ab2a2ba6aee1eae5b1936cf25094fb2573a796d2b25e37bce9"},"schema_version":"1.0"},"canonical_sha256":"176e686f70f89c6543c26288c9f865af7c63f26a1d68d34edeaee1ec9334d4c8","source":{"kind":"arxiv","id":"1802.06965","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06965","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06965v3","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06965","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"C5XGQ33Q7COG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5XGQ33Q7COGKQ6C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5XGQ33Q","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C5XGQ33Q7COGKQ6CMKEMT6DFV5","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T04:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"b7624eb7dc0e8934004a3a63ae8f956cf497599e7032eae4b3707c4e11bbeba1","abstract_canon_sha256":"a0d7cf29c77e13ab2a2ba6aee1eae5b1936cf25094fb2573a796d2b25e37bce9"},"schema_version":"1.0"},"canonical_sha256":"176e686f70f89c6543c26288c9f865af7c63f26a1d68d34edeaee1ec9334d4c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.424027Z","signature_b64":"zfWth15M+EGgmy6hTQvmKRjcLVaXvqpFs88l4+KFsYoEOEK0nKG+1BcEPQt2uiRrMQtsJtA2GXtgkuSnbmz1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"176e686f70f89c6543c26288c9f865af7c63f26a1d68d34edeaee1ec9334d4c8","last_reissued_at":"2026-05-18T00:01:53.423578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.423578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06965","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:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8PRFU5lLg1AkHhS+AvNe1JJ79qAm2maUNYN5/0fyVNRzS2puCZrREVCKRM516S8KBYoav1EOKDBZSqaXszNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:23:19.831482Z"},"content_sha256":"db9d57f7a569d52a1b72701ac91dc93dae84de4f9394c74d75a35d7e6a2dbadf","schema_version":"1.0","event_id":"sha256:db9d57f7a569d52a1b72701ac91dc93dae84de4f9394c74d75a35d7e6a2dbadf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C5XGQ33Q7COGKQ6CMKEMT6DFV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant Regret, Generalized Mixability, and Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Robert C. Williamson, Zakaria Mhammedi","submitted_at":"2018-02-20T04:40:51Z","abstract_excerpt":"We consider the setting of prediction with expert advice; a learner makes predictions by aggregating those of a group of experts. Under this setting, and for the right choice of loss function and \"mixing\" algorithm, it is possible for the learner to achieve a constant regret regardless of the number of prediction rounds. For example, a constant regret can be achieved for \\emph{mixable} losses using the \\emph{aggregating algorithm}. The \\emph{Generalized Aggregating Algorithm} (GAA) is a name for a family of algorithms parameterized by convex functions on simplices (entropies), which reduce to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06965","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:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLouqlLNEQn3tOWW17e4MdGVzj7BO8mtG8nz2xJ9yGrhCXEHVRbGtgiacxovNWfiZzmv8pAyIoWFC5n600PEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:23:19.832176Z"},"content_sha256":"db4db01df2cc985255f2a96ef132ec54af7682a666043da048e4968bffc18d6b","schema_version":"1.0","event_id":"sha256:db4db01df2cc985255f2a96ef132ec54af7682a666043da048e4968bffc18d6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/bundle.json","state_url":"https://pith.science/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/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-26T14:23:19Z","links":{"resolver":"https://pith.science/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5","bundle":"https://pith.science/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/bundle.json","state":"https://pith.science/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5XGQ33Q7COGKQ6CMKEMT6DFV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C5XGQ33Q7COGKQ6CMKEMT6DFV5","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":"a0d7cf29c77e13ab2a2ba6aee1eae5b1936cf25094fb2573a796d2b25e37bce9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T04:40:51Z","title_canon_sha256":"b7624eb7dc0e8934004a3a63ae8f956cf497599e7032eae4b3707c4e11bbeba1"},"schema_version":"1.0","source":{"id":"1802.06965","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06965","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06965v3","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06965","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"C5XGQ33Q7COG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5XGQ33Q7COGKQ6C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5XGQ33Q","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:db4db01df2cc985255f2a96ef132ec54af7682a666043da048e4968bffc18d6b","target":"graph","created_at":"2026-05-18T00:01:53Z","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 setting of prediction with expert advice; a learner makes predictions by aggregating those of a group of experts. Under this setting, and for the right choice of loss function and \"mixing\" algorithm, it is possible for the learner to achieve a constant regret regardless of the number of prediction rounds. For example, a constant regret can be achieved for \\emph{mixable} losses using the \\emph{aggregating algorithm}. The \\emph{Generalized Aggregating Algorithm} (GAA) is a name for a family of algorithms parameterized by convex functions on simplices (entropies), which reduce to ","authors_text":"Robert C. Williamson, Zakaria Mhammedi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T04:40:51Z","title":"Constant Regret, Generalized Mixability, and Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06965","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:db9d57f7a569d52a1b72701ac91dc93dae84de4f9394c74d75a35d7e6a2dbadf","target":"record","created_at":"2026-05-18T00:01:53Z","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":"a0d7cf29c77e13ab2a2ba6aee1eae5b1936cf25094fb2573a796d2b25e37bce9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-20T04:40:51Z","title_canon_sha256":"b7624eb7dc0e8934004a3a63ae8f956cf497599e7032eae4b3707c4e11bbeba1"},"schema_version":"1.0","source":{"id":"1802.06965","kind":"arxiv","version":3}},"canonical_sha256":"176e686f70f89c6543c26288c9f865af7c63f26a1d68d34edeaee1ec9334d4c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"176e686f70f89c6543c26288c9f865af7c63f26a1d68d34edeaee1ec9334d4c8","first_computed_at":"2026-05-18T00:01:53.423578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:53.423578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfWth15M+EGgmy6hTQvmKRjcLVaXvqpFs88l4+KFsYoEOEK0nKG+1BcEPQt2uiRrMQtsJtA2GXtgkuSnbmz1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:53.424027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06965","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db9d57f7a569d52a1b72701ac91dc93dae84de4f9394c74d75a35d7e6a2dbadf","sha256:db4db01df2cc985255f2a96ef132ec54af7682a666043da048e4968bffc18d6b"],"state_sha256":"0ba0dd15923e9aeeba155a8eeecab05d6548023a251d4fbb3e2e99f5e1787eb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gym9Cd2Kn705N+t8ZnMuEPu6wbgVcF4Q58QumHR3FmComp8oueDgGUeajX++rsxkxs9YGa4tJzz5tmj30cu1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:23:19.835698Z","bundle_sha256":"34362a00fd247f153d51247dcfd3cb6b7237c40e47d8f29cad41bfa734cb35e3"}}