{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:52P7G75RKUL4AYJZ34MPWWD7KJ","short_pith_number":"pith:52P7G75R","canonical_record":{"source":{"id":"1401.6956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d8a7d92bb9ab4fa23b1e56ac0a6f42c3b6b3c7e4373b1f7c2181cffac27a29ff","abstract_canon_sha256":"d0955cf2f046450d1db9e58870945de4ce889037d0e9391428ef78e09385f341"},"schema_version":"1.0"},"canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","source":{"kind":"arxiv","id":"1401.6956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6956","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6956v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6956","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"52P7G75RKUL4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"52P7G75RKUL4AYJZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"52P7G75R","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:52P7G75RKUL4AYJZ34MPWWD7KJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d8a7d92bb9ab4fa23b1e56ac0a6f42c3b6b3c7e4373b1f7c2181cffac27a29ff","abstract_canon_sha256":"d0955cf2f046450d1db9e58870945de4ce889037d0e9391428ef78e09385f341"},"schema_version":"1.0"},"canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:43.187522Z","signature_b64":"ms6Lj2fHoKgQ62be5x0UVhBnKMWLD+eoy4Usaws0chJgM++O873EVA5S9s0YDdj9+EbyESApukvtL4mWBkiYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","last_reissued_at":"2026-05-18T02:57:43.186951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:43.186951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6956","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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lVyOXcwFGpisrqwMlgYY+Ccj/oGKtiTvL2Xdbn2fVSD4J35T+o0luxNCkzyStPFCtQnhz1jD82nIjrv2resCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:02:38.519871Z"},"content_sha256":"4739c74687b4e6e62b09ca231ae7fc491cac0ba6b2b99b04c8a4a6b137b0ad30","schema_version":"1.0","event_id":"sha256:4739c74687b4e6e62b09ca231ae7fc491cac0ba6b2b99b04c8a4a6b137b0ad30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:52P7G75RKUL4AYJZ34MPWWD7KJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A continuous-time approach to online optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Joon Kwon, Panayotis Mertikopoulos","submitted_at":"2014-01-27T18:45:54Z","abstract_excerpt":"We consider a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms including as special cases the exponential weight algorithm, online mirror descent, smooth fictitious play and vanishingly smooth fictitious play. In so doing, we obtain a unified view of many classical regret bounds, and we show that they can be decomposed into a term stemming fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6956","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-18T02:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgMc+CoesLJYXTtF9uOa5l6mZ3SCF+Chxi6d6h2JXRiC4s83IZAar+uJR5pIAbSDwhrCLb2cldZh/uMfrWO2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:02:38.520227Z"},"content_sha256":"e53c7a8bded8db08784df80c383828a5251d014db835e6c3095dcf6783542da9","schema_version":"1.0","event_id":"sha256:e53c7a8bded8db08784df80c383828a5251d014db835e6c3095dcf6783542da9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/bundle.json","state_url":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/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-19T13:02:38Z","links":{"resolver":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ","bundle":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/bundle.json","state":"https://pith.science/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52P7G75RKUL4AYJZ34MPWWD7KJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:52P7G75RKUL4AYJZ34MPWWD7KJ","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":"d0955cf2f046450d1db9e58870945de4ce889037d0e9391428ef78e09385f341","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","title_canon_sha256":"d8a7d92bb9ab4fa23b1e56ac0a6f42c3b6b3c7e4373b1f7c2181cffac27a29ff"},"schema_version":"1.0","source":{"id":"1401.6956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6956","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6956v2","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6956","created_at":"2026-05-18T02:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"52P7G75RKUL4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"52P7G75RKUL4AYJZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"52P7G75R","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:e53c7a8bded8db08784df80c383828a5251d014db835e6c3095dcf6783542da9","target":"graph","created_at":"2026-05-18T02:57:43Z","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 a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms including as special cases the exponential weight algorithm, online mirror descent, smooth fictitious play and vanishingly smooth fictitious play. In so doing, we obtain a unified view of many classical regret bounds, and we show that they can be decomposed into a term stemming fr","authors_text":"Joon Kwon, Panayotis Mertikopoulos","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","title":"A continuous-time approach to online optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6956","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:4739c74687b4e6e62b09ca231ae7fc491cac0ba6b2b99b04c8a4a6b137b0ad30","target":"record","created_at":"2026-05-18T02:57:43Z","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":"d0955cf2f046450d1db9e58870945de4ce889037d0e9391428ef78e09385f341","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-27T18:45:54Z","title_canon_sha256":"d8a7d92bb9ab4fa23b1e56ac0a6f42c3b6b3c7e4373b1f7c2181cffac27a29ff"},"schema_version":"1.0","source":{"id":"1401.6956","kind":"arxiv","version":2}},"canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee9ff37fb15517c06139df18fb587f5254aa49b2b1127ba02242ec74cce3fde8","first_computed_at":"2026-05-18T02:57:43.186951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:43.186951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ms6Lj2fHoKgQ62be5x0UVhBnKMWLD+eoy4Usaws0chJgM++O873EVA5S9s0YDdj9+EbyESApukvtL4mWBkiYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:43.187522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4739c74687b4e6e62b09ca231ae7fc491cac0ba6b2b99b04c8a4a6b137b0ad30","sha256:e53c7a8bded8db08784df80c383828a5251d014db835e6c3095dcf6783542da9"],"state_sha256":"5c405a7c1d8998460c99b8cfd62c67d1e00c3af49033781420c8b90140843a49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WlFcv2S3Mc0J0sGrz4ioZZJpn2acnc4gWJwjAuxGZ0og2maJBektaJ9r9lgKJKf0oxDtrx4FeSXpaUde+32Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:02:38.521972Z","bundle_sha256":"89131ed4afc0483c57c8f3823ade7af7f3d6eea8fbf1a5e17485d79bd88102c1"}}