{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2FIOXCUBSR36V35NKL3XIY3GIC","short_pith_number":"pith:2FIOXCUB","canonical_record":{"source":{"id":"1802.06293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T20:59:02Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8f981a43316ea7bbbeb171c5492be418c977861f8db2dbd84a0297f276114d15","abstract_canon_sha256":"6201457f901ba4fd337c7e230f106fec52f1b4048407588fdb4668f6df239c8a"},"schema_version":"1.0"},"canonical_sha256":"d150eb8a819477eaefad52f774636640927df587b103f578e47b7b7f7d626a25","source":{"kind":"arxiv","id":"1802.06293","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06293","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06293v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06293","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"2FIOXCUBSR36","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2FIOXCUBSR36V35N","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2FIOXCUB","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2FIOXCUBSR36V35NKL3XIY3GIC","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T20:59:02Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"8f981a43316ea7bbbeb171c5492be418c977861f8db2dbd84a0297f276114d15","abstract_canon_sha256":"6201457f901ba4fd337c7e230f106fec52f1b4048407588fdb4668f6df239c8a"},"schema_version":"1.0"},"canonical_sha256":"d150eb8a819477eaefad52f774636640927df587b103f578e47b7b7f7d626a25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:24.534046Z","signature_b64":"VVzXShk7V+RVmKWOxomIPI3JjvzOKCypiD5a2iN7UzLUaErSiUB+ywd32OA2Rbnd0nd0dByWrAkfOZRrmZtlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d150eb8a819477eaefad52f774636640927df587b103f578e47b7b7f7d626a25","last_reissued_at":"2026-05-18T00:12:24.533465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:24.533465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06293","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-18T00:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKI7NLQWDwZHK6lygr6Al0Ee/xcrAlJ17hyu5wu2O+hxFvIpwRhKc+O7LDlws2XxxgN86wTIACC5L6JZzbWyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:01.736336Z"},"content_sha256":"338d8772d44d9e53222cb1fc027b5fabeb7f53c3acff032fbbdf4315c8e27771","schema_version":"1.0","event_id":"sha256:338d8772d44d9e53222cb1fc027b5fabeb7f53c3acff032fbbdf4315c8e27771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2FIOXCUBSR36V35NKL3XIY3GIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Black-Box Reductions for Parameter-free Online Learning in Banach Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashok Cutkosky, Francesco Orabona","submitted_at":"2018-02-17T20:59:02Z","abstract_excerpt":"We introduce several new black-box reductions that significantly improve the design of adaptive and parameter-free online learning algorithms by simplifying analysis, improving regret guarantees, and sometimes even improving runtime. We reduce parameter-free online learning to online exp-concave optimization, we reduce optimization in a Banach space to one-dimensional optimization, and we reduce optimization over a constrained domain to unconstrained optimization. All of our reductions run as fast as online gradient descent. We use our new techniques to improve upon the previously best regret "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06293","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-18T00:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JI4D/ivGBzkvfEOXjiOqRjuHPzNL4aAvAyScPBgU6/cumBVBDegUx2G2HEy0BK5QyfqalIo8J29QRL9snK4zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:01.736971Z"},"content_sha256":"2cce9fefc5ccf9f4dd8418b3e4079e7e027f2a634089ee6048f07bc8fa34daf1","schema_version":"1.0","event_id":"sha256:2cce9fefc5ccf9f4dd8418b3e4079e7e027f2a634089ee6048f07bc8fa34daf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FIOXCUBSR36V35NKL3XIY3GIC/bundle.json","state_url":"https://pith.science/pith/2FIOXCUBSR36V35NKL3XIY3GIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FIOXCUBSR36V35NKL3XIY3GIC/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-26T21:54:01Z","links":{"resolver":"https://pith.science/pith/2FIOXCUBSR36V35NKL3XIY3GIC","bundle":"https://pith.science/pith/2FIOXCUBSR36V35NKL3XIY3GIC/bundle.json","state":"https://pith.science/pith/2FIOXCUBSR36V35NKL3XIY3GIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FIOXCUBSR36V35NKL3XIY3GIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2FIOXCUBSR36V35NKL3XIY3GIC","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":"6201457f901ba4fd337c7e230f106fec52f1b4048407588fdb4668f6df239c8a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T20:59:02Z","title_canon_sha256":"8f981a43316ea7bbbeb171c5492be418c977861f8db2dbd84a0297f276114d15"},"schema_version":"1.0","source":{"id":"1802.06293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06293","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06293v2","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06293","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"2FIOXCUBSR36","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2FIOXCUBSR36V35N","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2FIOXCUB","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:2cce9fefc5ccf9f4dd8418b3e4079e7e027f2a634089ee6048f07bc8fa34daf1","target":"graph","created_at":"2026-05-18T00:12:24Z","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 introduce several new black-box reductions that significantly improve the design of adaptive and parameter-free online learning algorithms by simplifying analysis, improving regret guarantees, and sometimes even improving runtime. We reduce parameter-free online learning to online exp-concave optimization, we reduce optimization in a Banach space to one-dimensional optimization, and we reduce optimization over a constrained domain to unconstrained optimization. All of our reductions run as fast as online gradient descent. We use our new techniques to improve upon the previously best regret ","authors_text":"Ashok Cutkosky, Francesco Orabona","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T20:59:02Z","title":"Black-Box Reductions for Parameter-free Online Learning in Banach Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06293","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:338d8772d44d9e53222cb1fc027b5fabeb7f53c3acff032fbbdf4315c8e27771","target":"record","created_at":"2026-05-18T00:12:24Z","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":"6201457f901ba4fd337c7e230f106fec52f1b4048407588fdb4668f6df239c8a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-17T20:59:02Z","title_canon_sha256":"8f981a43316ea7bbbeb171c5492be418c977861f8db2dbd84a0297f276114d15"},"schema_version":"1.0","source":{"id":"1802.06293","kind":"arxiv","version":2}},"canonical_sha256":"d150eb8a819477eaefad52f774636640927df587b103f578e47b7b7f7d626a25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d150eb8a819477eaefad52f774636640927df587b103f578e47b7b7f7d626a25","first_computed_at":"2026-05-18T00:12:24.533465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:24.533465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVzXShk7V+RVmKWOxomIPI3JjvzOKCypiD5a2iN7UzLUaErSiUB+ywd32OA2Rbnd0nd0dByWrAkfOZRrmZtlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:24.534046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:338d8772d44d9e53222cb1fc027b5fabeb7f53c3acff032fbbdf4315c8e27771","sha256:2cce9fefc5ccf9f4dd8418b3e4079e7e027f2a634089ee6048f07bc8fa34daf1"],"state_sha256":"c4595c65a2cbe7129f32e95bf3ffaeee07b8bb07c361e93e17cc045d6ac9813e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiHU1OOqkc7iFutIT+UtOgPUCmPltBZcFq2T20wDElQOsh8QJSNHjASrQ73jhS/XFmnLk9wQ1BtJIQNb5O4bAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:54:01.740829Z","bundle_sha256":"c7edc407f768a74a58a010148ab27a8a7eacf80618d07563b7da96a1647b9214"}}