{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DO3F7Y624FAD64EG7ETJGKMPUU","short_pith_number":"pith:DO3F7Y62","canonical_record":{"source":{"id":"1708.00075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"00b9b1e48a461f98008d4d24aa5f4d7dec20f8b692ed39db287acfe1ff0d37f3","abstract_canon_sha256":"ae276b1ea35e2275c68ed880798005608246b8971c7f4034eda3a0a08e592a39"},"schema_version":"1.0"},"canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","source":{"kind":"arxiv","id":"1708.00075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00075","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00075v1","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00075","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"pith_short_12","alias_value":"DO3F7Y624FAD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DO3F7Y624FAD64EG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DO3F7Y62","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DO3F7Y624FAD64EG7ETJGKMPUU","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","cross_cats_sorted":["cs.GT","stat.ML"],"title_canon_sha256":"00b9b1e48a461f98008d4d24aa5f4d7dec20f8b692ed39db287acfe1ff0d37f3","abstract_canon_sha256":"ae276b1ea35e2275c68ed880798005608246b8971c7f4034eda3a0a08e592a39"},"schema_version":"1.0"},"canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:28.764642Z","signature_b64":"WFa9TEQVo9BtUPy2FK7xfJKQ0ibOAzgdyYK67SfVK76FZlK+79EOseW6TvOpORTVVySGy0gNhkjdtBBLxTKcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","last_reissued_at":"2026-05-18T00:31:28.763827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:28.763827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00075","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-18T00:31:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mO15pQd9NC+BuDsyZZVub3bu8u2it31DHVFUbGaZAGeNJyBVcyj7nCF4xazIjE+ihYhZfov6cqYgjGEwFJg+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:20:38.735010Z"},"content_sha256":"932e6587ecfddeca7aea38c94cbcc2c162a711a0ff0fc3bd65e135e5455e1a51","schema_version":"1.0","event_id":"sha256:932e6587ecfddeca7aea38c94cbcc2c162a711a0ff0fc3bd65e135e5455e1a51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DO3F7Y624FAD64EG7ETJGKMPUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Regret Minimization in Non-Convex Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","submitted_at":"2017-07-31T21:23:29Z","abstract_excerpt":"We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guarantee convergence to equilibrium in this framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00075","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-18T00:31:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYSTRRKsKMXq/DFtBM6k7B/23nLLIperfnZ+6lWxRS+djbekKN+X9LL5MJ9P/yPOsvuKA0iXr3PlTNnm/o5zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:20:38.735648Z"},"content_sha256":"3fe5d24eed416e958e58c5ad0b95d0b22af254ff0361ca472a3f3fa56410c462","schema_version":"1.0","event_id":"sha256:3fe5d24eed416e958e58c5ad0b95d0b22af254ff0361ca472a3f3fa56410c462"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/bundle.json","state_url":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO3F7Y624FAD64EG7ETJGKMPUU/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-06T23:20:38Z","links":{"resolver":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU","bundle":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/bundle.json","state":"https://pith.science/pith/DO3F7Y624FAD64EG7ETJGKMPUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO3F7Y624FAD64EG7ETJGKMPUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DO3F7Y624FAD64EG7ETJGKMPUU","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":"ae276b1ea35e2275c68ed880798005608246b8971c7f4034eda3a0a08e592a39","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","title_canon_sha256":"00b9b1e48a461f98008d4d24aa5f4d7dec20f8b692ed39db287acfe1ff0d37f3"},"schema_version":"1.0","source":{"id":"1708.00075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00075","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00075v1","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00075","created_at":"2026-05-18T00:31:28Z"},{"alias_kind":"pith_short_12","alias_value":"DO3F7Y624FAD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DO3F7Y624FAD64EG","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DO3F7Y62","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:3fe5d24eed416e958e58c5ad0b95d0b22af254ff0361ca472a3f3fa56410c462","target":"graph","created_at":"2026-05-18T00:31:28Z","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 regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guarantee convergence to equilibrium in this framework.","authors_text":"Cyril Zhang, Elad Hazan, Karan Singh","cross_cats":["cs.GT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","title":"Efficient Regret Minimization in Non-Convex Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00075","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:932e6587ecfddeca7aea38c94cbcc2c162a711a0ff0fc3bd65e135e5455e1a51","target":"record","created_at":"2026-05-18T00:31:28Z","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":"ae276b1ea35e2275c68ed880798005608246b8971c7f4034eda3a0a08e592a39","cross_cats_sorted":["cs.GT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-31T21:23:29Z","title_canon_sha256":"00b9b1e48a461f98008d4d24aa5f4d7dec20f8b692ed39db287acfe1ff0d37f3"},"schema_version":"1.0","source":{"id":"1708.00075","kind":"arxiv","version":1}},"canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bb65fe3dae1403f7086f92693298fa53490588caeb2ea70cb2be0b29f6895be","first_computed_at":"2026-05-18T00:31:28.763827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:28.763827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WFa9TEQVo9BtUPy2FK7xfJKQ0ibOAzgdyYK67SfVK76FZlK+79EOseW6TvOpORTVVySGy0gNhkjdtBBLxTKcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:28.764642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:932e6587ecfddeca7aea38c94cbcc2c162a711a0ff0fc3bd65e135e5455e1a51","sha256:3fe5d24eed416e958e58c5ad0b95d0b22af254ff0361ca472a3f3fa56410c462"],"state_sha256":"9efd86f84217ed5a190261f4fd9cd15e2f101091b7256a00353b1161f4f2b852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOAsEMR3hE7DfELcEekSQml9tTPc9J6RYyi6e4OlfSkf3lCCgY3jPZOGM37vslcvTd6NERidMt87Q9wcZxOyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:20:38.739041Z","bundle_sha256":"408cabdf5c3079c54510151b12cc6dd40aa208464040dcbb6ee24aba561e53e0"}}