{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:65DXKOJUQ7IEDZUO2WMOFJ22FF","short_pith_number":"pith:65DXKOJU","canonical_record":{"source":{"id":"1603.00522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-01T23:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"19247d39d38068a5fa389005ec1c2cf5c9c025193d61e379207c02b111eec2da","abstract_canon_sha256":"3214f63ea5689f15917a26afd157c9ff3201ba84cd0dc97a25e65add7dd4d307"},"schema_version":"1.0"},"canonical_sha256":"f74775393487d041e68ed598e2a75a295222ee614371498b7eb96d36fdf30646","source":{"kind":"arxiv","id":"1603.00522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00522","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00522v1","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00522","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"65DXKOJUQ7IE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"65DXKOJUQ7IEDZUO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"65DXKOJU","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:65DXKOJUQ7IEDZUO2WMOFJ22FF","target":"record","payload":{"canonical_record":{"source":{"id":"1603.00522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-01T23:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"19247d39d38068a5fa389005ec1c2cf5c9c025193d61e379207c02b111eec2da","abstract_canon_sha256":"3214f63ea5689f15917a26afd157c9ff3201ba84cd0dc97a25e65add7dd4d307"},"schema_version":"1.0"},"canonical_sha256":"f74775393487d041e68ed598e2a75a295222ee614371498b7eb96d36fdf30646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:43.538609Z","signature_b64":"/H1BN/HyVh25oiSwz25MW2T6lX3wmaz2eYLAiITidEdy+HpbgmkichhBIiJXnoh3+DY/PElTZjWYszBfrFzfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74775393487d041e68ed598e2a75a295222ee614371498b7eb96d36fdf30646","last_reissued_at":"2026-05-18T01:19:43.538133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:43.538133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.00522","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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUmQytXem47FY44n2lToMjcMrqltIWg/ICGeThJZOBijy5A2WIyJVxeYe/m7RprcO7sGDQDZCDycRp/roIi5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:59:11.921805Z"},"content_sha256":"7580a8f855155bcd9182138caad4eaa9d2b7888c3b615fa32f71cd4cf9cb6085","schema_version":"1.0","event_id":"sha256:7580a8f855155bcd9182138caad4eaa9d2b7888c3b615fa32f71cd4cf9cb6085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:65DXKOJUQ7IEDZUO2WMOFJ22FF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Michel Goemans, Patrick Jaillet, Swati Gupta","submitted_at":"2016-03-01T23:02:38Z","abstract_excerpt":"In order to find Nash-equilibria for two-player zero-sum games where each player plays combinatorial objects like spanning trees, matchings etc, we consider two online learning algorithms: the online mirror descent (OMD) algorithm and the multiplicative weights update (MWU) algorithm. The OMD algorithm requires the computation of a certain Bregman projection, that has closed form solutions for simple convex sets like the Euclidean ball or the simplex. However, for general polyhedra one often needs to exploit the general machinery of convex optimization. We give a novel primal-style algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00522","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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jm9kHfgEzt9vAdrFCC4k66YaMh+clmnJxyv8QsOxxAmaJO+90c3vZmVHSn4qySMmpdZ5XLQc7lZWYcmNXMViAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:59:11.923026Z"},"content_sha256":"e9f091ebb625cc369b1dbbf03559ff37e6a15fd3639669db019b2c6abec61034","schema_version":"1.0","event_id":"sha256:e9f091ebb625cc369b1dbbf03559ff37e6a15fd3639669db019b2c6abec61034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/bundle.json","state_url":"https://pith.science/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/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-28T22:59:11Z","links":{"resolver":"https://pith.science/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF","bundle":"https://pith.science/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/bundle.json","state":"https://pith.science/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65DXKOJUQ7IEDZUO2WMOFJ22FF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:65DXKOJUQ7IEDZUO2WMOFJ22FF","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":"3214f63ea5689f15917a26afd157c9ff3201ba84cd0dc97a25e65add7dd4d307","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-01T23:02:38Z","title_canon_sha256":"19247d39d38068a5fa389005ec1c2cf5c9c025193d61e379207c02b111eec2da"},"schema_version":"1.0","source":{"id":"1603.00522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00522","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00522v1","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00522","created_at":"2026-05-18T01:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"65DXKOJUQ7IE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"65DXKOJUQ7IEDZUO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"65DXKOJU","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:e9f091ebb625cc369b1dbbf03559ff37e6a15fd3639669db019b2c6abec61034","target":"graph","created_at":"2026-05-18T01:19: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":"In order to find Nash-equilibria for two-player zero-sum games where each player plays combinatorial objects like spanning trees, matchings etc, we consider two online learning algorithms: the online mirror descent (OMD) algorithm and the multiplicative weights update (MWU) algorithm. The OMD algorithm requires the computation of a certain Bregman projection, that has closed form solutions for simple convex sets like the Euclidean ball or the simplex. However, for general polyhedra one often needs to exploit the general machinery of convex optimization. We give a novel primal-style algorithm f","authors_text":"Michel Goemans, Patrick Jaillet, Swati Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-01T23:02:38Z","title":"Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00522","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:7580a8f855155bcd9182138caad4eaa9d2b7888c3b615fa32f71cd4cf9cb6085","target":"record","created_at":"2026-05-18T01:19: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":"3214f63ea5689f15917a26afd157c9ff3201ba84cd0dc97a25e65add7dd4d307","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-01T23:02:38Z","title_canon_sha256":"19247d39d38068a5fa389005ec1c2cf5c9c025193d61e379207c02b111eec2da"},"schema_version":"1.0","source":{"id":"1603.00522","kind":"arxiv","version":1}},"canonical_sha256":"f74775393487d041e68ed598e2a75a295222ee614371498b7eb96d36fdf30646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74775393487d041e68ed598e2a75a295222ee614371498b7eb96d36fdf30646","first_computed_at":"2026-05-18T01:19:43.538133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:43.538133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/H1BN/HyVh25oiSwz25MW2T6lX3wmaz2eYLAiITidEdy+HpbgmkichhBIiJXnoh3+DY/PElTZjWYszBfrFzfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:43.538609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7580a8f855155bcd9182138caad4eaa9d2b7888c3b615fa32f71cd4cf9cb6085","sha256:e9f091ebb625cc369b1dbbf03559ff37e6a15fd3639669db019b2c6abec61034"],"state_sha256":"d55a9724cb00d02077db96d76ad7e6bcb109acf10fd3a2e279130553a40333e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ssagcRsKezCu0blqsAtMgt/oynV+2ligH9dMxtZuPCsn2V9XvSKs7ynmP+FqTzzDmSYIVrAVouIlmng3sZrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:59:11.926748Z","bundle_sha256":"0781212b7a306a169860efc43bf9e4e4582e9ab07d45031f1f5240489938ba69"}}