{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EE6DTBFP7DD4LCEW3JGM4MUOLO","short_pith_number":"pith:EE6DTBFP","canonical_record":{"source":{"id":"1507.00407","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-02T01:55:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"68cd5cae3c1be999fed5cb40b59c4c3688252f1a43f65ed925325b49858759e5","abstract_canon_sha256":"7e3f8b547af20b2ee16eb0ff2c85c1401973cca2026649388aff4889fcf0d132"},"schema_version":"1.0"},"canonical_sha256":"213c3984aff8c7c58896da4cce328e5bab2249faa651f509f3a2f5d462dc28d0","source":{"kind":"arxiv","id":"1507.00407","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00407","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00407v5","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00407","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"EE6DTBFP7DD4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EE6DTBFP7DD4LCEW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EE6DTBFP","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EE6DTBFP7DD4LCEW3JGM4MUOLO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00407","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-02T01:55:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"68cd5cae3c1be999fed5cb40b59c4c3688252f1a43f65ed925325b49858759e5","abstract_canon_sha256":"7e3f8b547af20b2ee16eb0ff2c85c1401973cca2026649388aff4889fcf0d132"},"schema_version":"1.0"},"canonical_sha256":"213c3984aff8c7c58896da4cce328e5bab2249faa651f509f3a2f5d462dc28d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:32.946387Z","signature_b64":"++LGpVCqnTKavAHn9EuDzEQqpBT08A085niGy6Brd9Mhjo+9JAVCGwtWHIlCJpW61nl4ZSjhB28JNHG9Jl1NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213c3984aff8c7c58896da4cce328e5bab2249faa651f509f3a2f5d462dc28d0","last_reissued_at":"2026-05-18T01:24:32.945915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:32.945915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00407","source_version":5,"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:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFW8Ag3IKyfpSDs4EiBRh6kgHkTBbF+0Cs0ABiCCt205XwWMgFpiORQMIB5D9wIG2l5OesO5dUXDNsKgifM7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:20:51.698305Z"},"content_sha256":"548d2319793024ca4c9c895e0b644e9b39ecd31600a9133091792e0ada0b796e","schema_version":"1.0","event_id":"sha256:548d2319793024ca4c9c895e0b644e9b39ecd31600a9133091792e0ada0b796e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EE6DTBFP7DD4LCEW3JGM4MUOLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Convergence of Regularized Learning in Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Alekh Agarwal, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2015-07-02T01:55:40Z","abstract_excerpt":"We show that natural classes of regularized learning algorithms with a form of recency bias achieve faster convergence rates to approximate efficiency and to coarse correlated equilibria in multiplayer normal form games. When each player in a game uses an algorithm from our class, their individual regret decays at $O(T^{-3/4})$, while the sum of utilities converges to an approximate optimum at $O(T^{-1})$--an improvement upon the worst case $O(T^{-1/2})$ rates. We show a black-box reduction for any algorithm in the class to achieve $\\tilde{O}(T^{-1/2})$ rates against an adversary, while mainta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00407","kind":"arxiv","version":5},"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:24:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iutzvuq457QBN7LTvjbONTx8IUEOpQwStEZcAdiTfU/JKs0D3K6S6yLR4+54xzhIEmeOGn2fRaM8/QjxtOdoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:20:51.698942Z"},"content_sha256":"f17b42c9302eb130f4efbbd69ee6cd23867091065923bd74a6c0320f3f7dc239","schema_version":"1.0","event_id":"sha256:f17b42c9302eb130f4efbbd69ee6cd23867091065923bd74a6c0320f3f7dc239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/bundle.json","state_url":"https://pith.science/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/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-27T20:20:51Z","links":{"resolver":"https://pith.science/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO","bundle":"https://pith.science/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/bundle.json","state":"https://pith.science/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EE6DTBFP7DD4LCEW3JGM4MUOLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EE6DTBFP7DD4LCEW3JGM4MUOLO","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":"7e3f8b547af20b2ee16eb0ff2c85c1401973cca2026649388aff4889fcf0d132","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-02T01:55:40Z","title_canon_sha256":"68cd5cae3c1be999fed5cb40b59c4c3688252f1a43f65ed925325b49858759e5"},"schema_version":"1.0","source":{"id":"1507.00407","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00407","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00407v5","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00407","created_at":"2026-05-18T01:24:32Z"},{"alias_kind":"pith_short_12","alias_value":"EE6DTBFP7DD4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EE6DTBFP7DD4LCEW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EE6DTBFP","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:f17b42c9302eb130f4efbbd69ee6cd23867091065923bd74a6c0320f3f7dc239","target":"graph","created_at":"2026-05-18T01:24:32Z","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 show that natural classes of regularized learning algorithms with a form of recency bias achieve faster convergence rates to approximate efficiency and to coarse correlated equilibria in multiplayer normal form games. When each player in a game uses an algorithm from our class, their individual regret decays at $O(T^{-3/4})$, while the sum of utilities converges to an approximate optimum at $O(T^{-1})$--an improvement upon the worst case $O(T^{-1/2})$ rates. We show a black-box reduction for any algorithm in the class to achieve $\\tilde{O}(T^{-1/2})$ rates against an adversary, while mainta","authors_text":"Alekh Agarwal, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-02T01:55:40Z","title":"Fast Convergence of Regularized Learning in Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00407","kind":"arxiv","version":5},"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:548d2319793024ca4c9c895e0b644e9b39ecd31600a9133091792e0ada0b796e","target":"record","created_at":"2026-05-18T01:24:32Z","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":"7e3f8b547af20b2ee16eb0ff2c85c1401973cca2026649388aff4889fcf0d132","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-02T01:55:40Z","title_canon_sha256":"68cd5cae3c1be999fed5cb40b59c4c3688252f1a43f65ed925325b49858759e5"},"schema_version":"1.0","source":{"id":"1507.00407","kind":"arxiv","version":5}},"canonical_sha256":"213c3984aff8c7c58896da4cce328e5bab2249faa651f509f3a2f5d462dc28d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213c3984aff8c7c58896da4cce328e5bab2249faa651f509f3a2f5d462dc28d0","first_computed_at":"2026-05-18T01:24:32.945915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:32.945915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++LGpVCqnTKavAHn9EuDzEQqpBT08A085niGy6Brd9Mhjo+9JAVCGwtWHIlCJpW61nl4ZSjhB28JNHG9Jl1NDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:32.946387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00407","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:548d2319793024ca4c9c895e0b644e9b39ecd31600a9133091792e0ada0b796e","sha256:f17b42c9302eb130f4efbbd69ee6cd23867091065923bd74a6c0320f3f7dc239"],"state_sha256":"a24e39ede15e22091003310e64f6bd65149620df4b53a1a3fa7f67acbf326996"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"db0Q5qMA3laykCDiKJ2rhXDzdTRY3i+2x75aBpc4+U1w8dDQhi29divC6nTSE5KsoPkOF5EqHwRy6wjBmbCUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:20:51.701704Z","bundle_sha256":"e891729442254b5b96f9d114bce3984d989e325f4fe91be3a635edaa597b7cdc"}}