{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YZQXS2OYPWMHEH5EPIVC7GQRF6","short_pith_number":"pith:YZQXS2OY","canonical_record":{"source":{"id":"1312.7658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T09:15:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"cf005353ab907dca6b30318d05113948c7c9290a9401588bd20960815281284f","abstract_canon_sha256":"53816fbf197248bab61acefa102222c3780d2fe061e216079e53bf183fa6a451"},"schema_version":"1.0"},"canonical_sha256":"c6617969d87d98721fa47a2a2f9a112f90138bb1072fc01014828e8351fd621b","source":{"kind":"arxiv","id":"1312.7658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7658","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7658v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7658","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"YZQXS2OYPWMH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZQXS2OYPWMHEH5E","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZQXS2OY","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YZQXS2OYPWMHEH5EPIVC7GQRF6","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T09:15:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"cf005353ab907dca6b30318d05113948c7c9290a9401588bd20960815281284f","abstract_canon_sha256":"53816fbf197248bab61acefa102222c3780d2fe061e216079e53bf183fa6a451"},"schema_version":"1.0"},"canonical_sha256":"c6617969d87d98721fa47a2a2f9a112f90138bb1072fc01014828e8351fd621b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:34.066164Z","signature_b64":"OTB//9z8Qrg81eZIwlCEj9LdCAtE5ElELRwXnYgk4x2zAHz4SHqaWnonA021pN9ZuOo5SsD21RC81y1ZTuOoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6617969d87d98721fa47a2a2f9a112f90138bb1072fc01014828e8351fd621b","last_reissued_at":"2026-05-18T03:03:34.065560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:34.065560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7658","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNX0jxDVLQiYSam7qWHZMKY2oTTtcW7Iftg52eVCvkA5TOKZJO19ruXMT6/UbcXRkFqRAI4cvRAUSMIW/qeQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:50:55.442859Z"},"content_sha256":"b44cd11cc07511d1c516bb88e59a45d4f1d638c6eab0e29d3bd224dccea507bf","schema_version":"1.0","event_id":"sha256:b44cd11cc07511d1c516bb88e59a45d4f1d638c6eab0e29d3bd224dccea507bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YZQXS2OYPWMHEH5EPIVC7GQRF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Response-Based Approachability and its Application to Generalized No-Regret Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Andrey Bernstein, Nahum Shimkin","submitted_at":"2013-12-30T09:15:03Z","abstract_excerpt":"Approachability theory, introduced by Blackwell (1956), provides fundamental results on repeated games with vector-valued payoffs, and has been usefully applied since in the theory of learning in games and to learning algorithms in the online adversarial setup. Given a repeated game with vector payoffs, a target set $S$ is approachable by a certain player (the agent) if he can ensure that the average payoff vector converges to that set no matter what his adversary opponent does. Blackwell provided two equivalent sets of conditions for a convex set to be approachable. The first (primary) condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7658","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF9SPtAyR6LmlziOME143pbLi6/EvaGX/lrjSrFFg7sVxfNMuX++txXvkhPvjm8EO5MTziP81wYOsS2r8GCtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:50:55.443196Z"},"content_sha256":"cb7f8c3a5cb1f12cc1944880c1c7641ed47d9716af18b4a75cf7d81717fcf217","schema_version":"1.0","event_id":"sha256:cb7f8c3a5cb1f12cc1944880c1c7641ed47d9716af18b4a75cf7d81717fcf217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/bundle.json","state_url":"https://pith.science/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/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-06-28T21:50:55Z","links":{"resolver":"https://pith.science/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6","bundle":"https://pith.science/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/bundle.json","state":"https://pith.science/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZQXS2OYPWMHEH5EPIVC7GQRF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YZQXS2OYPWMHEH5EPIVC7GQRF6","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":"53816fbf197248bab61acefa102222c3780d2fe061e216079e53bf183fa6a451","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T09:15:03Z","title_canon_sha256":"cf005353ab907dca6b30318d05113948c7c9290a9401588bd20960815281284f"},"schema_version":"1.0","source":{"id":"1312.7658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7658","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7658v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7658","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"YZQXS2OYPWMH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZQXS2OYPWMHEH5E","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZQXS2OY","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:cb7f8c3a5cb1f12cc1944880c1c7641ed47d9716af18b4a75cf7d81717fcf217","target":"graph","created_at":"2026-05-18T03:03:34Z","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":"Approachability theory, introduced by Blackwell (1956), provides fundamental results on repeated games with vector-valued payoffs, and has been usefully applied since in the theory of learning in games and to learning algorithms in the online adversarial setup. Given a repeated game with vector payoffs, a target set $S$ is approachable by a certain player (the agent) if he can ensure that the average payoff vector converges to that set no matter what his adversary opponent does. Blackwell provided two equivalent sets of conditions for a convex set to be approachable. The first (primary) condit","authors_text":"Andrey Bernstein, Nahum Shimkin","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T09:15:03Z","title":"Response-Based Approachability and its Application to Generalized No-Regret Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7658","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:b44cd11cc07511d1c516bb88e59a45d4f1d638c6eab0e29d3bd224dccea507bf","target":"record","created_at":"2026-05-18T03:03:34Z","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":"53816fbf197248bab61acefa102222c3780d2fe061e216079e53bf183fa6a451","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-30T09:15:03Z","title_canon_sha256":"cf005353ab907dca6b30318d05113948c7c9290a9401588bd20960815281284f"},"schema_version":"1.0","source":{"id":"1312.7658","kind":"arxiv","version":1}},"canonical_sha256":"c6617969d87d98721fa47a2a2f9a112f90138bb1072fc01014828e8351fd621b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6617969d87d98721fa47a2a2f9a112f90138bb1072fc01014828e8351fd621b","first_computed_at":"2026-05-18T03:03:34.065560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:34.065560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OTB//9z8Qrg81eZIwlCEj9LdCAtE5ElELRwXnYgk4x2zAHz4SHqaWnonA021pN9ZuOo5SsD21RC81y1ZTuOoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:34.066164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b44cd11cc07511d1c516bb88e59a45d4f1d638c6eab0e29d3bd224dccea507bf","sha256:cb7f8c3a5cb1f12cc1944880c1c7641ed47d9716af18b4a75cf7d81717fcf217"],"state_sha256":"31757e357a6ccabb6fc4ddc467ecd5f31d774eef2c3dac593621b057970c92c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScATYE3nVkecYPj/Tj6zTaTAWNRs3of6MX3hliDvk04A0yGQtrft1DtXMBd32lME8yVLHovrxYPPGzjl9MNGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:50:55.445193Z","bundle_sha256":"62b941b4ab3ce5d87d9fb58aa8973bb300830f972f0905c0fa00ea205937cbb8"}}