{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MH2KVVAMOTB3YJMDV2JMM7FCT2","short_pith_number":"pith:MH2KVVAM","canonical_record":{"source":{"id":"1802.04623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f5c86caaecd5e4c4a0430528f3d97250e0a79d8260bf59ef9fd85c5ad10c439","abstract_canon_sha256":"9d98c995ad8cf06c02a6257cd9f8cfebf72c26bfbe8a12e8714f04e23923ce7f"},"schema_version":"1.0"},"canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","source":{"kind":"arxiv","id":"1802.04623","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04623","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04623v2","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04623","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"MH2KVVAMOTB3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MH2KVVAMOTB3YJMD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MH2KVVAM","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MH2KVVAMOTB3YJMDV2JMM7FCT2","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f5c86caaecd5e4c4a0430528f3d97250e0a79d8260bf59ef9fd85c5ad10c439","abstract_canon_sha256":"9d98c995ad8cf06c02a6257cd9f8cfebf72c26bfbe8a12e8714f04e23923ce7f"},"schema_version":"1.0"},"canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.692518Z","signature_b64":"lj8UOydlWzy7YpMbCGXFBUGzvn+c34sUbak0PzY0qHEaY8pO4NMoEALP4Qzww+o2Kp0lWmQUZ6TwGPtWK23WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","last_reissued_at":"2026-05-17T23:53:51.691851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.691851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04623","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-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUPS0EuzZjUUB+7ghZ62CKkC4rO2naWOn+iwPLmW8SHr/wqT/0m0e+OMvLEHVW2HBMMZFfSc5sFTJrpxA9RcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:59:45.838967Z"},"content_sha256":"8795db70f2f0204be9a51b789d55b1cccd6d68cf651eb998becb56a02e8b89eb","schema_version":"1.0","event_id":"sha256:8795db70f2f0204be9a51b789d55b1cccd6d68cf651eb998becb56a02e8b89eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MH2KVVAMOTB3YJMDV2JMM7FCT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2018-02-13T13:54:33Z","abstract_excerpt":"Hoffman's classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints. Recently, several results showed that Hoffman's bound can be used to derive strongly-convex-like rates for first-order methods for \\textit{offline} convex optimization of curved, though not strongly convex, functions, over polyhedral sets. In this work, we use this classical result for the first time to obtain faster rates for \\textit{online convex optimization} over polyhedral sets with curved convex, though not strongly convex, loss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04623","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-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cu2XC+KfpoqpcTM81CGrFqoylYtnhTQVzM16yBHY6PkL9Q+aeHAznYvaydkT96nvAi2gib3cI0bFlaXuz8A3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:59:45.839333Z"},"content_sha256":"82b1a7a73826512ac349d7b305e39c498ce3b0f64ac5b8f6726add53db6a9784","schema_version":"1.0","event_id":"sha256:82b1a7a73826512ac349d7b305e39c498ce3b0f64ac5b8f6726add53db6a9784"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/bundle.json","state_url":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/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-06-24T20:59:45Z","links":{"resolver":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2","bundle":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/bundle.json","state":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MH2KVVAMOTB3YJMDV2JMM7FCT2","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":"9d98c995ad8cf06c02a6257cd9f8cfebf72c26bfbe8a12e8714f04e23923ce7f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","title_canon_sha256":"5f5c86caaecd5e4c4a0430528f3d97250e0a79d8260bf59ef9fd85c5ad10c439"},"schema_version":"1.0","source":{"id":"1802.04623","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04623","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04623v2","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04623","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"MH2KVVAMOTB3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MH2KVVAMOTB3YJMD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MH2KVVAM","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:82b1a7a73826512ac349d7b305e39c498ce3b0f64ac5b8f6726add53db6a9784","target":"graph","created_at":"2026-05-17T23:53:51Z","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":"Hoffman's classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints. Recently, several results showed that Hoffman's bound can be used to derive strongly-convex-like rates for first-order methods for \\textit{offline} convex optimization of curved, though not strongly convex, functions, over polyhedral sets. In this work, we use this classical result for the first time to obtain faster rates for \\textit{online convex optimization} over polyhedral sets with curved convex, though not strongly convex, loss","authors_text":"Dan Garber","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","title":"Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04623","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:8795db70f2f0204be9a51b789d55b1cccd6d68cf651eb998becb56a02e8b89eb","target":"record","created_at":"2026-05-17T23:53:51Z","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":"9d98c995ad8cf06c02a6257cd9f8cfebf72c26bfbe8a12e8714f04e23923ce7f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","title_canon_sha256":"5f5c86caaecd5e4c4a0430528f3d97250e0a79d8260bf59ef9fd85c5ad10c439"},"schema_version":"1.0","source":{"id":"1802.04623","kind":"arxiv","version":2}},"canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","first_computed_at":"2026-05-17T23:53:51.691851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:51.691851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lj8UOydlWzy7YpMbCGXFBUGzvn+c34sUbak0PzY0qHEaY8pO4NMoEALP4Qzww+o2Kp0lWmQUZ6TwGPtWK23WCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:51.692518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04623","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8795db70f2f0204be9a51b789d55b1cccd6d68cf651eb998becb56a02e8b89eb","sha256:82b1a7a73826512ac349d7b305e39c498ce3b0f64ac5b8f6726add53db6a9784"],"state_sha256":"9a6979f245cda0269647f0a677ae371cc92669d5bf9716454c7aac73a0cf0931"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tB+XgdB1h5aGo0KYqFev1DDoSm6Ul0Sq5HfY9CYO3CHbg5qN0stSCobXNRiwK6zoePLluu3FVBVGqPNAsGZDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:59:45.841259Z","bundle_sha256":"4818defb19398c20f1d042570b616ce36687de962ac459783bf17158d2d718d9"}}