{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6N7HWF75MEQIATN26JBHTIHEY6","short_pith_number":"pith:6N7HWF75","canonical_record":{"source":{"id":"1905.12776","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:21:09Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cec3c4b675949efb6edff802e13507fff38e6e194564e91d57225f5fcc97e124","abstract_canon_sha256":"7087e9b617a16557ab8e5d54be47d5ab954ef6ad37f420a5d1d6ce1fc980cb95"},"schema_version":"1.0"},"canonical_sha256":"f37e7b17fd6120804dbaf24279a0e4c7867c0d344a3557588b568ee15025ecbf","source":{"kind":"arxiv","id":"1905.12776","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12776","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12776v4","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12776","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"6N7HWF75MEQI","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_16","alias_value":"6N7HWF75MEQIATN2","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_8","alias_value":"6N7HWF75","created_at":"2026-07-05T00:13:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6N7HWF75MEQIATN26JBHTIHEY6","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12776","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:21:09Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cec3c4b675949efb6edff802e13507fff38e6e194564e91d57225f5fcc97e124","abstract_canon_sha256":"7087e9b617a16557ab8e5d54be47d5ab954ef6ad37f420a5d1d6ce1fc980cb95"},"schema_version":"1.0"},"canonical_sha256":"f37e7b17fd6120804dbaf24279a0e4c7867c0d344a3557588b568ee15025ecbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:47.414668Z","signature_b64":"HvMYG9Iayos4rWvcN1O65EtVyNZIdAHovALItaNY6N1hDoONaadrpkhGtoXD836QTu+ITN2OkOAttGDnqBH9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f37e7b17fd6120804dbaf24279a0e4c7867c0d344a3557588b568ee15025ecbf","last_reissued_at":"2026-07-05T00:13:47.414163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:47.414163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12776","source_version":4,"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-07-05T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmWqthcsXVt6dpEi7FNCs5WwoGiy5n+CI0/C4rcH8bdnqFPaBS8axEI0qnJDh2pkKJmwCE/rFsYRbbPG18eyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:15:40.130663Z"},"content_sha256":"20e0d3a94a854ea8cb444d1f8085ac324102c846546fb5597e17a7114f4ffdce","schema_version":"1.0","event_id":"sha256:20e0d3a94a854ea8cb444d1f8085ac324102c846546fb5597e17a7114f4ffdce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6N7HWF75MEQIATN26JBHTIHEY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Gautam Goel, Haoyuan Sun, Yiheng Lin","submitted_at":"2019-05-29T23:21:09Z","abstract_excerpt":"We study online convex optimization in a setting where the learner seeks to minimize the sum of a per-round hitting cost and a movement cost which is incurred when changing decisions between rounds. We prove a new lower bound on the competitive ratio of any online algorithm in the setting where the costs are $m$-strongly convex and the movement costs are the squared $\\ell_2$ norm. This lower bound shows that no algorithm can achieve a competitive ratio that is $o(m^{-1/2})$ as $m$ tends to zero. No existing algorithms have competitive ratios matching this bound, and we show that the state-of-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12776","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12776/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpVDopohdaPbyQ5tlz1Hgbj0kpFJcdBMp7IxsiPasNbEfsXsEcmcRD+5rPodoWUGoua886ABaughi6RvGVJlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:15:40.131614Z"},"content_sha256":"65c155defcc616f205441c5d9967919e7df748db7cdbc1b8402a11c699c68b5f","schema_version":"1.0","event_id":"sha256:65c155defcc616f205441c5d9967919e7df748db7cdbc1b8402a11c699c68b5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6N7HWF75MEQIATN26JBHTIHEY6/bundle.json","state_url":"https://pith.science/pith/6N7HWF75MEQIATN26JBHTIHEY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6N7HWF75MEQIATN26JBHTIHEY6/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-08-17T19:15:40Z","links":{"resolver":"https://pith.science/pith/6N7HWF75MEQIATN26JBHTIHEY6","bundle":"https://pith.science/pith/6N7HWF75MEQIATN26JBHTIHEY6/bundle.json","state":"https://pith.science/pith/6N7HWF75MEQIATN26JBHTIHEY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6N7HWF75MEQIATN26JBHTIHEY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6N7HWF75MEQIATN26JBHTIHEY6","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":"7087e9b617a16557ab8e5d54be47d5ab954ef6ad37f420a5d1d6ce1fc980cb95","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:21:09Z","title_canon_sha256":"cec3c4b675949efb6edff802e13507fff38e6e194564e91d57225f5fcc97e124"},"schema_version":"1.0","source":{"id":"1905.12776","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12776","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12776v4","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12776","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"6N7HWF75MEQI","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_16","alias_value":"6N7HWF75MEQIATN2","created_at":"2026-07-05T00:13:47Z"},{"alias_kind":"pith_short_8","alias_value":"6N7HWF75","created_at":"2026-07-05T00:13:47Z"}],"graph_snapshots":[{"event_id":"sha256:65c155defcc616f205441c5d9967919e7df748db7cdbc1b8402a11c699c68b5f","target":"graph","created_at":"2026-07-05T00:13:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.12776/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study online convex optimization in a setting where the learner seeks to minimize the sum of a per-round hitting cost and a movement cost which is incurred when changing decisions between rounds. We prove a new lower bound on the competitive ratio of any online algorithm in the setting where the costs are $m$-strongly convex and the movement costs are the squared $\\ell_2$ norm. This lower bound shows that no algorithm can achieve a competitive ratio that is $o(m^{-1/2})$ as $m$ tends to zero. No existing algorithms have competitive ratios matching this bound, and we show that the state-of-t","authors_text":"Adam Wierman, Gautam Goel, Haoyuan Sun, Yiheng Lin","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:21:09Z","title":"Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12776","kind":"arxiv","version":4},"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:20e0d3a94a854ea8cb444d1f8085ac324102c846546fb5597e17a7114f4ffdce","target":"record","created_at":"2026-07-05T00:13:47Z","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":"7087e9b617a16557ab8e5d54be47d5ab954ef6ad37f420a5d1d6ce1fc980cb95","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T23:21:09Z","title_canon_sha256":"cec3c4b675949efb6edff802e13507fff38e6e194564e91d57225f5fcc97e124"},"schema_version":"1.0","source":{"id":"1905.12776","kind":"arxiv","version":4}},"canonical_sha256":"f37e7b17fd6120804dbaf24279a0e4c7867c0d344a3557588b568ee15025ecbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f37e7b17fd6120804dbaf24279a0e4c7867c0d344a3557588b568ee15025ecbf","first_computed_at":"2026-07-05T00:13:47.414163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:13:47.414163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HvMYG9Iayos4rWvcN1O65EtVyNZIdAHovALItaNY6N1hDoONaadrpkhGtoXD836QTu+ITN2OkOAttGDnqBH9Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:13:47.414668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12776","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20e0d3a94a854ea8cb444d1f8085ac324102c846546fb5597e17a7114f4ffdce","sha256:65c155defcc616f205441c5d9967919e7df748db7cdbc1b8402a11c699c68b5f"],"state_sha256":"9ebbc3891887133eaf9b73436c0558a3d62394f91b8b3a2db5cb5b5f683c684c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cA6NySl2PK8G4Xf6Zb3/RrgjLs1KoPXMZjh73yty4jDHOM9xT4hAWMglrsBbWjkpzrzjCr6r8Rjce497APZBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T19:15:40.138989Z","bundle_sha256":"47775da58f9916ffedeb41773e966ffd6b1b4faa299dbf033e0c24ac0128d076"}}