{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UPDLCFEHQW73RJLJAB4KHXFBE5","short_pith_number":"pith:UPDLCFEH","canonical_record":{"source":{"id":"1807.10455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb7b6c5c8399b67ba75d5ae08fa2acbc1f06fd14d910f875160f73c8cc02a2ed","abstract_canon_sha256":"83d21445e679b85879005b16a92ebe1265626f5250f2cfef740cd928d252bec2"},"schema_version":"1.0"},"canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","source":{"kind":"arxiv","id":"1807.10455","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10455","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10455v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10455","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"UPDLCFEHQW73","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UPDLCFEHQW73RJLJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UPDLCFEH","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UPDLCFEHQW73RJLJAB4KHXFBE5","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eb7b6c5c8399b67ba75d5ae08fa2acbc1f06fd14d910f875160f73c8cc02a2ed","abstract_canon_sha256":"83d21445e679b85879005b16a92ebe1265626f5250f2cfef740cd928d252bec2"},"schema_version":"1.0"},"canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.363982Z","signature_b64":"jn0ifacoQcAD/VHof7YGFRpy4cOumb+d0r2Gb0bIvreYQubTHrNJE6PEkmq3P+Ws6+RdOJ0z9Jdd0m8kWiFgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","last_reissued_at":"2026-05-18T00:00:39.363512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.363512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10455","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-05-18T00:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dPo/EtYt5Qx2mCKaVrisMMynuLrvbzhYnYvZf0yCab6MtPugjwqoL/xcbPLyqjvcsgxtfkrNGOhjjB+c+fDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:04:11.676000Z"},"content_sha256":"fad0efc613d38667b87c3003026d309ed19cb09102f97ae68a396bbcb6438143","schema_version":"1.0","event_id":"sha256:fad0efc613d38667b87c3003026d309ed19cb09102f97ae68a396bbcb6438143"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UPDLCFEHQW73RJLJAB4KHXFBE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acceleration through Optimistic No-Regret Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jacob Abernethy, Jun-Kun Wang","submitted_at":"2018-07-27T06:51:04Z","abstract_excerpt":"We consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game. Zero-sum games can be solved using online learning dynamics, where a classical technique involves simulating two no-regret algorithms that play against each other and, after $T$ rounds, the average iterate is guaranteed to solve the original optimization problem with error decaying as $O(\\log T/T)$. In this paper we show that the technique can be enhanced to a rate of $O(1/T^2)$ by extending recent work \\cite{RS13,SALS15} th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10455","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":""},"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tewCWiKECeNhaKN3JiYNS/pHaA9Msz5FX1DQAHZCOeDZBMxj7yw++OK0jEgepo0yZnW6jAo47qczOifwiJPwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:04:11.676769Z"},"content_sha256":"71557219f79d2a5cb52f95826405c7c8129d4ca04ed0177371a0711c0ff991bf","schema_version":"1.0","event_id":"sha256:71557219f79d2a5cb52f95826405c7c8129d4ca04ed0177371a0711c0ff991bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/bundle.json","state_url":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/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-27T00:04:11Z","links":{"resolver":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5","bundle":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/bundle.json","state":"https://pith.science/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPDLCFEHQW73RJLJAB4KHXFBE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UPDLCFEHQW73RJLJAB4KHXFBE5","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":"83d21445e679b85879005b16a92ebe1265626f5250f2cfef740cd928d252bec2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","title_canon_sha256":"eb7b6c5c8399b67ba75d5ae08fa2acbc1f06fd14d910f875160f73c8cc02a2ed"},"schema_version":"1.0","source":{"id":"1807.10455","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10455","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10455v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10455","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"UPDLCFEHQW73","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UPDLCFEHQW73RJLJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UPDLCFEH","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:71557219f79d2a5cb52f95826405c7c8129d4ca04ed0177371a0711c0ff991bf","target":"graph","created_at":"2026-05-18T00:00:39Z","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 consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game. Zero-sum games can be solved using online learning dynamics, where a classical technique involves simulating two no-regret algorithms that play against each other and, after $T$ rounds, the average iterate is guaranteed to solve the original optimization problem with error decaying as $O(\\log T/T)$. In this paper we show that the technique can be enhanced to a rate of $O(1/T^2)$ by extending recent work \\cite{RS13,SALS15} th","authors_text":"Jacob Abernethy, Jun-Kun Wang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","title":"Acceleration through Optimistic No-Regret Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10455","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:fad0efc613d38667b87c3003026d309ed19cb09102f97ae68a396bbcb6438143","target":"record","created_at":"2026-05-18T00:00:39Z","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":"83d21445e679b85879005b16a92ebe1265626f5250f2cfef740cd928d252bec2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-27T06:51:04Z","title_canon_sha256":"eb7b6c5c8399b67ba75d5ae08fa2acbc1f06fd14d910f875160f73c8cc02a2ed"},"schema_version":"1.0","source":{"id":"1807.10455","kind":"arxiv","version":3}},"canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3c6b1148785bfb8a5690078a3dca1275a5344bd6d81ea8e4325f5bcc73a1aa1","first_computed_at":"2026-05-18T00:00:39.363512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.363512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jn0ifacoQcAD/VHof7YGFRpy4cOumb+d0r2Gb0bIvreYQubTHrNJE6PEkmq3P+Ws6+RdOJ0z9Jdd0m8kWiFgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.363982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10455","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad0efc613d38667b87c3003026d309ed19cb09102f97ae68a396bbcb6438143","sha256:71557219f79d2a5cb52f95826405c7c8129d4ca04ed0177371a0711c0ff991bf"],"state_sha256":"3534322241fe91ecea8f63624dac481b4f2fadfb4020e690479101ebf2f780b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iublyxKUmn1O8Rhm7OPxzwphRP0NFYjF3L7l0we9RSvO//+/5sT3oSbxkEQ8xisd4E/wHPSbojlN+sSJr+UbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:04:11.680636Z","bundle_sha256":"5aa9d0234e9df5b7e822c0400ee15a9931508a827d612d75056b9ada0d9facc8"}}