{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:I4UVZOOSA5U3NUOLTZBVRVCXHM","short_pith_number":"pith:I4UVZOOS","canonical_record":{"source":{"id":"1903.02868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T12:23:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e579df1ce4defaecbbeefb87333455fb6ed3efaeabc23348264c0170fe3a3e3","abstract_canon_sha256":"67dce81be5a1484aae4d8381fbd0697b2039a2adb64fa905d6c4e7581c052f3e"},"schema_version":"1.0"},"canonical_sha256":"47295cb9d20769b6d1cb9e4358d4573b09154ec97a5dd207473c7fce44466942","source":{"kind":"arxiv","id":"1903.02868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02868","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02868v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02868","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"I4UVZOOSA5U3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"I4UVZOOSA5U3NUOL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"I4UVZOOS","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:I4UVZOOSA5U3NUOLTZBVRVCXHM","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T12:23:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e579df1ce4defaecbbeefb87333455fb6ed3efaeabc23348264c0170fe3a3e3","abstract_canon_sha256":"67dce81be5a1484aae4d8381fbd0697b2039a2adb64fa905d6c4e7581c052f3e"},"schema_version":"1.0"},"canonical_sha256":"47295cb9d20769b6d1cb9e4358d4573b09154ec97a5dd207473c7fce44466942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:50.911064Z","signature_b64":"3iH+o0Bd1+nz5RtcSg5OCfgIZwtmSthbNbmlrW4yJ6y2jPN6lUxUjhL6X2meE3crO6OhIv//ZUw9UX0Zt8XgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47295cb9d20769b6d1cb9e4358d4573b09154ec97a5dd207473c7fce44466942","last_reissued_at":"2026-05-17T23:51:50.910471Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:50.910471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02868","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-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlZnoy4ZkPwGkO+t1F7GOS8KWrNGv8sgjUBuJfImNNmTwJ+/9uXnuRmOEYVLv9PRIX3Nx6uBwc6LEreyhkSIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:55.431714Z"},"content_sha256":"4f0640b479f0dd620bb2ef65ed54ae89fdea3f3f1d38ea8afe906c256e657774","schema_version":"1.0","event_id":"sha256:4f0640b479f0dd620bb2ef65ed54ae89fdea3f3f1d38ea8afe906c256e657774"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:I4UVZOOSA5U3NUOLTZBVRVCXHM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of Multi-Agent Learning with a Finite Step Size in General-Sum Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.MA","authors_text":"Chongjie Zhang, Tonghan Wang, Xinliang Song","submitted_at":"2019-03-07T12:23:15Z","abstract_excerpt":"Learning in a multi-agent system is challenging because agents are simultaneously learning and the environment is not stationary, undermining convergence guarantees. To address this challenge, this paper presents a new gradient-based learning algorithm, called Gradient Ascent with Shrinking Policy Prediction (GA-SPP), which augments the basic gradient ascent approach with the concept of shrinking policy prediction. The key idea behind this algorithm is that an agent adjusts its strategy in response to the forecasted strategy of the other agent, instead of its current one. GA-SPP is shown forma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02868","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-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eak9TP6g9V+Z6QxYu4efOXdIMWckeQzyG1onTzdxtNlnk2hBTgKoDxgb9wAPfljqL7TARdYvfjK+CA28AyaNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:27:55.432053Z"},"content_sha256":"77f6576341b7d69d143950f8804da9b8bcf0819e447e473f5e8b6b41e1b035a4","schema_version":"1.0","event_id":"sha256:77f6576341b7d69d143950f8804da9b8bcf0819e447e473f5e8b6b41e1b035a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/bundle.json","state_url":"https://pith.science/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/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-02T20:27:55Z","links":{"resolver":"https://pith.science/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM","bundle":"https://pith.science/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/bundle.json","state":"https://pith.science/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4UVZOOSA5U3NUOLTZBVRVCXHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:I4UVZOOSA5U3NUOLTZBVRVCXHM","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":"67dce81be5a1484aae4d8381fbd0697b2039a2adb64fa905d6c4e7581c052f3e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T12:23:15Z","title_canon_sha256":"5e579df1ce4defaecbbeefb87333455fb6ed3efaeabc23348264c0170fe3a3e3"},"schema_version":"1.0","source":{"id":"1903.02868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02868","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02868v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02868","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"I4UVZOOSA5U3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"I4UVZOOSA5U3NUOL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"I4UVZOOS","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:77f6576341b7d69d143950f8804da9b8bcf0819e447e473f5e8b6b41e1b035a4","target":"graph","created_at":"2026-05-17T23:51:50Z","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":"Learning in a multi-agent system is challenging because agents are simultaneously learning and the environment is not stationary, undermining convergence guarantees. To address this challenge, this paper presents a new gradient-based learning algorithm, called Gradient Ascent with Shrinking Policy Prediction (GA-SPP), which augments the basic gradient ascent approach with the concept of shrinking policy prediction. The key idea behind this algorithm is that an agent adjusts its strategy in response to the forecasted strategy of the other agent, instead of its current one. GA-SPP is shown forma","authors_text":"Chongjie Zhang, Tonghan Wang, Xinliang Song","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T12:23:15Z","title":"Convergence of Multi-Agent Learning with a Finite Step Size in General-Sum Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02868","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:4f0640b479f0dd620bb2ef65ed54ae89fdea3f3f1d38ea8afe906c256e657774","target":"record","created_at":"2026-05-17T23:51:50Z","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":"67dce81be5a1484aae4d8381fbd0697b2039a2adb64fa905d6c4e7581c052f3e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T12:23:15Z","title_canon_sha256":"5e579df1ce4defaecbbeefb87333455fb6ed3efaeabc23348264c0170fe3a3e3"},"schema_version":"1.0","source":{"id":"1903.02868","kind":"arxiv","version":1}},"canonical_sha256":"47295cb9d20769b6d1cb9e4358d4573b09154ec97a5dd207473c7fce44466942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47295cb9d20769b6d1cb9e4358d4573b09154ec97a5dd207473c7fce44466942","first_computed_at":"2026-05-17T23:51:50.910471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:50.910471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3iH+o0Bd1+nz5RtcSg5OCfgIZwtmSthbNbmlrW4yJ6y2jPN6lUxUjhL6X2meE3crO6OhIv//ZUw9UX0Zt8XgDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:50.911064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f0640b479f0dd620bb2ef65ed54ae89fdea3f3f1d38ea8afe906c256e657774","sha256:77f6576341b7d69d143950f8804da9b8bcf0819e447e473f5e8b6b41e1b035a4"],"state_sha256":"2dbc588c61a1445a806b91e6a5f1caf4fc83d652189a1994530f80a5537e480b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKd4YyC71AgvWqbDuyG2eo3SnHnqoQ7LuuLiuzOck0MO78LMxuBZYvGT8GkuGN8fwc/Z1Zk1yiNM64eTAgW7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:27:55.434006Z","bundle_sha256":"40804b1454839b1af0268f6edf1739e4c950431a7ce9c8bc5e075f4053075b59"}}