{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6PHAPX54KKSRNUKBGJFTFBYN2W","short_pith_number":"pith:6PHAPX54","canonical_record":{"source":{"id":"2002.05318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"title_canon_sha256":"49a736162c8c5fa5e0c840781d1df808aec480080f56bc746d243f9c36701445","abstract_canon_sha256":"a3491591a68aaa8e602edda2fdee71104de873a4126be4d3259558b627a791da"},"schema_version":"1.0"},"canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","source":{"kind":"arxiv","id":"2002.05318","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05318","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05318v3","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05318","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"6PHAPX54KKSR","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"6PHAPX54KKSRNUKB","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"6PHAPX54","created_at":"2026-07-05T02:05:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6PHAPX54KKSRNUKBGJFTFBYN2W","target":"record","payload":{"canonical_record":{"source":{"id":"2002.05318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"title_canon_sha256":"49a736162c8c5fa5e0c840781d1df808aec480080f56bc746d243f9c36701445","abstract_canon_sha256":"a3491591a68aaa8e602edda2fdee71104de873a4126be4d3259558b627a791da"},"schema_version":"1.0"},"canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:23.152928Z","signature_b64":"nEZXsCFcq8J8UJyh7deSS1Mz93omaJnVOBbJ0cWNyDFfMLEnn1CbHui+oDdz1adiuRZ8xgGkxrGA6QS3bVxFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","last_reissued_at":"2026-07-05T02:05:23.152370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:23.152370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.05318","source_version":3,"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-05T02:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYllKIUvazZnsqQMo6n14wPK48+IbdagDSvKB9LXoCB/aNf7i1GFVLkZ5Fi7C3it4RQ1nNZRSe+NBupy36qIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:17:49.200221Z"},"content_sha256":"fd2600251f4030ad476e7232c9bed6d1b45875c36450f5ea1deb942e89a44b3d","schema_version":"1.0","event_id":"sha256:fd2600251f4030ad476e7232c9bed6d1b45875c36450f5ea1deb942e89a44b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6PHAPX54KKSRNUKBGJFTFBYN2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Optimization with Memory and Competitive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Guanya Shi, Soon-Jo Chung, Yiheng Lin, Yisong Yue","submitted_at":"2020-02-13T02:58:11Z","abstract_excerpt":"This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous $p$ decisions. This setting generalizes Smoothed Online Convex Optimization. The proposed approach, Optimistic Regularized Online Balanced Descent, achieves a constant, dimension-free competitive ratio. Further, we show a connection between online optimization with memory and online control with adversarial disturbances. This connection, in turn, leads to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05318","kind":"arxiv","version":3},"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/2002.05318/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-05T02:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQvh+aY2/Z6qp7Gs+UDISC3OzdqhcmUX2dvrgEdZVNc5mejg+jHkiBkEcY3rOeUvRGlGi+W2vbgWukMlHyBKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:17:49.200743Z"},"content_sha256":"44b450d477784296da101002f623412bca344dafafa05a1dff4d87b6c6e8e720","schema_version":"1.0","event_id":"sha256:44b450d477784296da101002f623412bca344dafafa05a1dff4d87b6c6e8e720"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/bundle.json","state_url":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/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-09T00:17:49Z","links":{"resolver":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W","bundle":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/bundle.json","state":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6PHAPX54KKSRNUKBGJFTFBYN2W","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":"a3491591a68aaa8e602edda2fdee71104de873a4126be4d3259558b627a791da","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","title_canon_sha256":"49a736162c8c5fa5e0c840781d1df808aec480080f56bc746d243f9c36701445"},"schema_version":"1.0","source":{"id":"2002.05318","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.05318","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"2002.05318v3","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05318","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"6PHAPX54KKSR","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"6PHAPX54KKSRNUKB","created_at":"2026-07-05T02:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"6PHAPX54","created_at":"2026-07-05T02:05:23Z"}],"graph_snapshots":[{"event_id":"sha256:44b450d477784296da101002f623412bca344dafafa05a1dff4d87b6c6e8e720","target":"graph","created_at":"2026-07-05T02:05:23Z","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/2002.05318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous $p$ decisions. This setting generalizes Smoothed Online Convex Optimization. The proposed approach, Optimistic Regularized Online Balanced Descent, achieves a constant, dimension-free competitive ratio. Further, we show a connection between online optimization with memory and online control with adversarial disturbances. This connection, in turn, leads to a ","authors_text":"Adam Wierman, Guanya Shi, Soon-Jo Chung, Yiheng Lin, Yisong Yue","cross_cats":["cs.SY","eess.SY","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","title":"Online Optimization with Memory and Competitive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05318","kind":"arxiv","version":3},"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:fd2600251f4030ad476e7232c9bed6d1b45875c36450f5ea1deb942e89a44b3d","target":"record","created_at":"2026-07-05T02:05:23Z","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":"a3491591a68aaa8e602edda2fdee71104de873a4126be4d3259558b627a791da","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","title_canon_sha256":"49a736162c8c5fa5e0c840781d1df808aec480080f56bc746d243f9c36701445"},"schema_version":"1.0","source":{"id":"2002.05318","kind":"arxiv","version":3}},"canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","first_computed_at":"2026-07-05T02:05:23.152370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:23.152370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nEZXsCFcq8J8UJyh7deSS1Mz93omaJnVOBbJ0cWNyDFfMLEnn1CbHui+oDdz1adiuRZ8xgGkxrGA6QS3bVxFDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:23.152928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.05318","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd2600251f4030ad476e7232c9bed6d1b45875c36450f5ea1deb942e89a44b3d","sha256:44b450d477784296da101002f623412bca344dafafa05a1dff4d87b6c6e8e720"],"state_sha256":"4f80777e0f86d33ee1723f469a2261dd243a9ee79d8b9d0ca35651b4b963cdf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DBzL70R27TcrxzBQa2KfhiuenYEaWHrFbTd0uuS5y6CsuO1NsKiFchPe6Gl7swDhB5aVhT2Gp0HyYrsAWE7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:17:49.206131Z","bundle_sha256":"248de425db90713b7814102d98374c426e03bfc17b54634a666a81c6f56518e8"}}