{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5Q6SZL763ULQKKT5RG53YXT74X","short_pith_number":"pith:5Q6SZL76","canonical_record":{"source":{"id":"1301.6058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-25T15:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"7dad60c8ce844ab311716a7d544d201fcc01931739a8a461f1ad1e2bca41e509","abstract_canon_sha256":"b89bc322b2b12ec723c3f3a4520871d8d859398bf05103f03e4350769eb04de7"},"schema_version":"1.0"},"canonical_sha256":"ec3d2caffedd17052a7d89bbbc5e7fe5ccdf2720666aba1897a5f3d278b4270b","source":{"kind":"arxiv","id":"1301.6058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6058","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6058v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6058","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"5Q6SZL763ULQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Q6SZL763ULQKKT5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Q6SZL76","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5Q6SZL763ULQKKT5RG53YXT74X","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-25T15:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"7dad60c8ce844ab311716a7d544d201fcc01931739a8a461f1ad1e2bca41e509","abstract_canon_sha256":"b89bc322b2b12ec723c3f3a4520871d8d859398bf05103f03e4350769eb04de7"},"schema_version":"1.0"},"canonical_sha256":"ec3d2caffedd17052a7d89bbbc5e7fe5ccdf2720666aba1897a5f3d278b4270b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:27.237754Z","signature_b64":"xGZyClXhHoMa51knrK87RLF+05f5pCYray+uFH7y3q0Bw9ScG4+OTlDTLq23jhZgWC7e/UlZsw3KwvvVbmZbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec3d2caffedd17052a7d89bbbc5e7fe5ccdf2720666aba1897a5f3d278b4270b","last_reissued_at":"2026-05-18T03:35:27.237087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:27.237087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6058","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-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5w/wpc1Xop+bIU7gbPe0RFCuFfDQ4uk9+YBpcA6a6ES7AmW8ju0mD3nHV5D23693oOyMYVquwIW6vrKmwlBUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:58:52.385927Z"},"content_sha256":"46da5add6cbfc0e0ea74ade436cd7595d5d8625cffdb344a3c9ccb5effcbce25","schema_version":"1.0","event_id":"sha256:46da5add6cbfc0e0ea74ade436cd7595d5d8625cffdb344a3c9ccb5effcbce25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5Q6SZL763ULQKKT5RG53YXT74X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edward Moroshko, Koby Crammer","submitted_at":"2013-01-25T15:09:39Z","abstract_excerpt":"In online learning the performance of an algorithm is typically compared to the performance of a fixed function from some class, with a quantity called regret. Forster proposed a last-step min-max algorithm which was somewhat simpler than the algorithm of Vovk, yet with the same regret. In fact the algorithm he analyzed assumed that the choices of the adversary are bounded, yielding artificially only the two extreme cases. We fix this problem by weighing the examples in such a way that the min-max problem will be well defined, and provide analysis with logarithmic regret that may have better m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6058","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-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxDx6ymkcF0Luuk8k7apUnoua8BMPKD9yvRgnElqna10fsNWt6IribQGFqekkxtHqS3DVQWCj1pQzrOLbRwkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:58:52.386272Z"},"content_sha256":"ddd638dc848da707a11e61f41c936ce11a00ff8aee7c285da0bed1a24de2a26e","schema_version":"1.0","event_id":"sha256:ddd638dc848da707a11e61f41c936ce11a00ff8aee7c285da0bed1a24de2a26e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Q6SZL763ULQKKT5RG53YXT74X/bundle.json","state_url":"https://pith.science/pith/5Q6SZL763ULQKKT5RG53YXT74X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Q6SZL763ULQKKT5RG53YXT74X/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-28T12:58:52Z","links":{"resolver":"https://pith.science/pith/5Q6SZL763ULQKKT5RG53YXT74X","bundle":"https://pith.science/pith/5Q6SZL763ULQKKT5RG53YXT74X/bundle.json","state":"https://pith.science/pith/5Q6SZL763ULQKKT5RG53YXT74X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Q6SZL763ULQKKT5RG53YXT74X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5Q6SZL763ULQKKT5RG53YXT74X","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":"b89bc322b2b12ec723c3f3a4520871d8d859398bf05103f03e4350769eb04de7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-25T15:09:39Z","title_canon_sha256":"7dad60c8ce844ab311716a7d544d201fcc01931739a8a461f1ad1e2bca41e509"},"schema_version":"1.0","source":{"id":"1301.6058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6058","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6058v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6058","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"5Q6SZL763ULQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Q6SZL763ULQKKT5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Q6SZL76","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:ddd638dc848da707a11e61f41c936ce11a00ff8aee7c285da0bed1a24de2a26e","target":"graph","created_at":"2026-05-18T03:35:27Z","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":"In online learning the performance of an algorithm is typically compared to the performance of a fixed function from some class, with a quantity called regret. Forster proposed a last-step min-max algorithm which was somewhat simpler than the algorithm of Vovk, yet with the same regret. In fact the algorithm he analyzed assumed that the choices of the adversary are bounded, yielding artificially only the two extreme cases. We fix this problem by weighing the examples in such a way that the min-max problem will be well defined, and provide analysis with logarithmic regret that may have better m","authors_text":"Edward Moroshko, Koby Crammer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-25T15:09:39Z","title":"Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6058","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:46da5add6cbfc0e0ea74ade436cd7595d5d8625cffdb344a3c9ccb5effcbce25","target":"record","created_at":"2026-05-18T03:35:27Z","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":"b89bc322b2b12ec723c3f3a4520871d8d859398bf05103f03e4350769eb04de7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-25T15:09:39Z","title_canon_sha256":"7dad60c8ce844ab311716a7d544d201fcc01931739a8a461f1ad1e2bca41e509"},"schema_version":"1.0","source":{"id":"1301.6058","kind":"arxiv","version":1}},"canonical_sha256":"ec3d2caffedd17052a7d89bbbc5e7fe5ccdf2720666aba1897a5f3d278b4270b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec3d2caffedd17052a7d89bbbc5e7fe5ccdf2720666aba1897a5f3d278b4270b","first_computed_at":"2026-05-18T03:35:27.237087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:27.237087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xGZyClXhHoMa51knrK87RLF+05f5pCYray+uFH7y3q0Bw9ScG4+OTlDTLq23jhZgWC7e/UlZsw3KwvvVbmZbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:27.237754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46da5add6cbfc0e0ea74ade436cd7595d5d8625cffdb344a3c9ccb5effcbce25","sha256:ddd638dc848da707a11e61f41c936ce11a00ff8aee7c285da0bed1a24de2a26e"],"state_sha256":"3b0e6c3be231c3478e1808289a069657f18f919a0a21e5e940c2180df83c8b28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nx4DTIuxADGev6ENcp+JFw6gKitallRsd6iGdMdNkXQEjLqkskdhODVfy5TPVA7cn1k1Dvk3wllGBoutSS/+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:58:52.388277Z","bundle_sha256":"6d8d27810c8fd5939a7135cbc9f003ac749f7afebdef52612eb6e27c602c5dab"}}