{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7ZPSTGTJI2CGSGOGBT5TIK3PEY","short_pith_number":"pith:7ZPSTGTJ","canonical_record":{"source":{"id":"1606.01261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T20:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"426ba8cf9ec75d3be86c261e3ba04c9d7814403570d86e8f48fa7c3ec2cdb7f6","abstract_canon_sha256":"7a0732971771d1f25343818b0f275d8dc97274e359b80d55acefb421e0df62bb"},"schema_version":"1.0"},"canonical_sha256":"fe5f299a6946846919c60cfb342b6f26030b055bfa3a1f351e4cfb00f180fb6e","source":{"kind":"arxiv","id":"1606.01261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01261","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01261v1","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01261","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"7ZPSTGTJI2CG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZPSTGTJI2CGSGOG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZPSTGTJ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7ZPSTGTJI2CGSGOGBT5TIK3PEY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T20:07:41Z","cross_cats_sorted":[],"title_canon_sha256":"426ba8cf9ec75d3be86c261e3ba04c9d7814403570d86e8f48fa7c3ec2cdb7f6","abstract_canon_sha256":"7a0732971771d1f25343818b0f275d8dc97274e359b80d55acefb421e0df62bb"},"schema_version":"1.0"},"canonical_sha256":"fe5f299a6946846919c60cfb342b6f26030b055bfa3a1f351e4cfb00f180fb6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.486087Z","signature_b64":"94CLokH/cgv1MCsmA2p/SRx8psKnqhJGsIYc0wN2A+XoOLdGVCFckRGWnS7bzsJIsnBaVpJ6VI6ikbVy6C4yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe5f299a6946846919c60cfb342b6f26030b055bfa3a1f351e4cfb00f180fb6e","last_reissued_at":"2026-05-18T01:12:54.485739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.485739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01261","source_version":1,"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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlt3q3atYefJn0IiesXIPyEJ07EDrfFzRC5Jb++HV/klXr2pBb6NRxQqGpofQZ8GycVGu9b0BIM5Ze9yje8NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:44:16.929503Z"},"content_sha256":"28db26ae902dca7016177e995bfc9a0c558d7064ce9fb8278e2f564c421885c1","schema_version":"1.0","event_id":"sha256:28db26ae902dca7016177e995bfc9a0c558d7064ce9fb8278e2f564c421885c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7ZPSTGTJI2CGSGOGBT5TIK3PEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Regret on Reflexive Banach Spaces and Learning Nash Equilibria in Continuous Zero-Sum Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexandre Bayen, Claire Tomlin, Maximilian Balandat, Walid Krichene","submitted_at":"2016-06-03T20:07:41Z","abstract_excerpt":"We study a general version of the adversarial online learning problem. We are given a decision set $\\mathcal{X}$ in a reflexive Banach space $X$ and a sequence of reward vectors in the dual space of $X$. At each iteration, we choose an action from $\\mathcal{X}$, based on the observed sequence of previous rewards. Our goal is to minimize regret, defined as the gap between the realized reward and the reward of the best fixed action in hindsight. Using results from infinite dimensional convex analysis, we generalize the method of Dual Averaging (or Follow the Regularized Leader) to our setting an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01261","kind":"arxiv","version":1},"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-18T01:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuo5bEjFiBOo/Onu2wot70gug2acbeZLdFIjmhq0Q2nxwDKfj2dmnR2Pvoh0Aqy7UaK9HBD66L/WyubcfOZAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:44:16.930007Z"},"content_sha256":"14bc8272e0dffb688f1b91834acf03d8c36f113be62de0c0b61fd8cba43534c6","schema_version":"1.0","event_id":"sha256:14bc8272e0dffb688f1b91834acf03d8c36f113be62de0c0b61fd8cba43534c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/bundle.json","state_url":"https://pith.science/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/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-29T22:44:16Z","links":{"resolver":"https://pith.science/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY","bundle":"https://pith.science/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/bundle.json","state":"https://pith.science/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZPSTGTJI2CGSGOGBT5TIK3PEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7ZPSTGTJI2CGSGOGBT5TIK3PEY","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":"7a0732971771d1f25343818b0f275d8dc97274e359b80d55acefb421e0df62bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T20:07:41Z","title_canon_sha256":"426ba8cf9ec75d3be86c261e3ba04c9d7814403570d86e8f48fa7c3ec2cdb7f6"},"schema_version":"1.0","source":{"id":"1606.01261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01261","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01261v1","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01261","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"7ZPSTGTJI2CG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZPSTGTJI2CGSGOG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZPSTGTJ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:14bc8272e0dffb688f1b91834acf03d8c36f113be62de0c0b61fd8cba43534c6","target":"graph","created_at":"2026-05-18T01:12:54Z","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 a general version of the adversarial online learning problem. We are given a decision set $\\mathcal{X}$ in a reflexive Banach space $X$ and a sequence of reward vectors in the dual space of $X$. At each iteration, we choose an action from $\\mathcal{X}$, based on the observed sequence of previous rewards. Our goal is to minimize regret, defined as the gap between the realized reward and the reward of the best fixed action in hindsight. Using results from infinite dimensional convex analysis, we generalize the method of Dual Averaging (or Follow the Regularized Leader) to our setting an","authors_text":"Alexandre Bayen, Claire Tomlin, Maximilian Balandat, Walid Krichene","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T20:07:41Z","title":"Minimizing Regret on Reflexive Banach Spaces and Learning Nash Equilibria in Continuous Zero-Sum Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01261","kind":"arxiv","version":1},"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:28db26ae902dca7016177e995bfc9a0c558d7064ce9fb8278e2f564c421885c1","target":"record","created_at":"2026-05-18T01:12:54Z","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":"7a0732971771d1f25343818b0f275d8dc97274e359b80d55acefb421e0df62bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-03T20:07:41Z","title_canon_sha256":"426ba8cf9ec75d3be86c261e3ba04c9d7814403570d86e8f48fa7c3ec2cdb7f6"},"schema_version":"1.0","source":{"id":"1606.01261","kind":"arxiv","version":1}},"canonical_sha256":"fe5f299a6946846919c60cfb342b6f26030b055bfa3a1f351e4cfb00f180fb6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe5f299a6946846919c60cfb342b6f26030b055bfa3a1f351e4cfb00f180fb6e","first_computed_at":"2026-05-18T01:12:54.485739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.485739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"94CLokH/cgv1MCsmA2p/SRx8psKnqhJGsIYc0wN2A+XoOLdGVCFckRGWnS7bzsJIsnBaVpJ6VI6ikbVy6C4yAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.486087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28db26ae902dca7016177e995bfc9a0c558d7064ce9fb8278e2f564c421885c1","sha256:14bc8272e0dffb688f1b91834acf03d8c36f113be62de0c0b61fd8cba43534c6"],"state_sha256":"5855e826b81d1ddf73b2f7a7686522c389cf83f20be09c058b708851e5d46eb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HI3cU67MpWy+W7GF7dkhLeBOh1h4BQrgzrnFLGWa/NPqPVI8Oix7OdMu1uSmVak7koWhAUSyaiSayAoIkBYBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:44:16.932897Z","bundle_sha256":"d7e06670537ead83f7f41412a7715b755349812fcc5a253235ed968d359f1a1d"}}