{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SXTT5HNP3N4P652MBRVCIN2UAJ","short_pith_number":"pith:SXTT5HNP","canonical_record":{"source":{"id":"1803.10366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e7cc6a42a091f89cb9ee16987022a4d495e9890e2bce25a46964d6a032b0d72e","abstract_canon_sha256":"9a77ef3cd5f0239c967b0fec61b13e08786b0915ee419c4df16731583dbc14cf"},"schema_version":"1.0"},"canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","source":{"kind":"arxiv","id":"1803.10366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10366","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10366v2","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10366","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SXTT5HNP3N4P","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SXTT5HNP3N4P652M","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SXTT5HNP","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SXTT5HNP3N4P652MBRVCIN2UAJ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"e7cc6a42a091f89cb9ee16987022a4d495e9890e2bce25a46964d6a032b0d72e","abstract_canon_sha256":"9a77ef3cd5f0239c967b0fec61b13e08786b0915ee419c4df16731583dbc14cf"},"schema_version":"1.0"},"canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:17.613179Z","signature_b64":"akvqUYcaw9qsM4B0A0PJ+lpc0M2mEQlohOab01U5/ESSu1PLrdPEfua4uX0QiL67Hiy7P6Aczbq8W7ZFFyElDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","last_reissued_at":"2026-05-18T00:11:17.612556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:17.612556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10366","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:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni653OKCnU6mGOmFPrFEp37ISG0TpWRCzKBLQXUX272P2XW7CM2WvcxHXMVa+fJ9T3zMFsdSN2myPIG12K3zBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:42.137839Z"},"content_sha256":"6471a803dcb6b522167e0621fa3c2fc3690322d32ebf0d70a85af1544e99087f","schema_version":"1.0","event_id":"sha256:6471a803dcb6b522167e0621fa3c2fc3690322d32ebf0d70a85af1544e99087f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SXTT5HNP3N4P652MBRVCIN2UAJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Gautam Goel, Niangjun Chen","submitted_at":"2018-03-28T00:39:33Z","abstract_excerpt":"We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditions this bound can be beaten. We introduce a novel algorithmic framework for this problem, Online Balanced Descent (OBD), which works by iteratively projecting the previous point onto a carefully chosen level set of the current cost function so as to balance the switching cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10366","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:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRzRSkVWCU4imAl37m+QmnYB4qf8rDun0OgqsfzXibORqWv5bm+kkgQXAsZlfvf9SZhpxZzgzapX6kq/oPzHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:42.138484Z"},"content_sha256":"6c97d9f6896b5d0f43065336fe0305249f6d4e3ad5dcf0c542b80550c4a5346a","schema_version":"1.0","event_id":"sha256:6c97d9f6896b5d0f43065336fe0305249f6d4e3ad5dcf0c542b80550c4a5346a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/bundle.json","state_url":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/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-08T09:59:42Z","links":{"resolver":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ","bundle":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/bundle.json","state":"https://pith.science/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXTT5HNP3N4P652MBRVCIN2UAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SXTT5HNP3N4P652MBRVCIN2UAJ","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":"9a77ef3cd5f0239c967b0fec61b13e08786b0915ee419c4df16731583dbc14cf","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","title_canon_sha256":"e7cc6a42a091f89cb9ee16987022a4d495e9890e2bce25a46964d6a032b0d72e"},"schema_version":"1.0","source":{"id":"1803.10366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10366","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10366v2","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10366","created_at":"2026-05-18T00:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SXTT5HNP3N4P","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SXTT5HNP3N4P652M","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SXTT5HNP","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6c97d9f6896b5d0f43065336fe0305249f6d4e3ad5dcf0c542b80550c4a5346a","target":"graph","created_at":"2026-05-18T00:11:17Z","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 study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditions this bound can be beaten. We introduce a novel algorithmic framework for this problem, Online Balanced Descent (OBD), which works by iteratively projecting the previous point onto a carefully chosen level set of the current cost function so as to balance the switching cos","authors_text":"Adam Wierman, Gautam Goel, Niangjun Chen","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","title":"Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10366","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:6471a803dcb6b522167e0621fa3c2fc3690322d32ebf0d70a85af1544e99087f","target":"record","created_at":"2026-05-18T00:11:17Z","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":"9a77ef3cd5f0239c967b0fec61b13e08786b0915ee419c4df16731583dbc14cf","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T00:39:33Z","title_canon_sha256":"e7cc6a42a091f89cb9ee16987022a4d495e9890e2bce25a46964d6a032b0d72e"},"schema_version":"1.0","source":{"id":"1803.10366","kind":"arxiv","version":2}},"canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95e73e9dafdb78ff774c0c6a243754027d013499466d4e62424eed044ed2971d","first_computed_at":"2026-05-18T00:11:17.612556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:17.612556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"akvqUYcaw9qsM4B0A0PJ+lpc0M2mEQlohOab01U5/ESSu1PLrdPEfua4uX0QiL67Hiy7P6Aczbq8W7ZFFyElDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:17.613179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6471a803dcb6b522167e0621fa3c2fc3690322d32ebf0d70a85af1544e99087f","sha256:6c97d9f6896b5d0f43065336fe0305249f6d4e3ad5dcf0c542b80550c4a5346a"],"state_sha256":"16752201c9921f0f534d1dcd4afd1281325cfba12141a8b9a9b0a4f5e4eb5eaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDMSIhjAWlhaCIMuoDGMxKrjp34NCciRp+YxvgTiuBQxEakg0oUhgGkRBSI4KzgSXbKnllhD37EXfGd4TEhmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:59:42.141446Z","bundle_sha256":"1c1a6934c155fa410bb6cd510c6b06ab8e086a69e17d10064c3a33e44af2228c"}}