{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FNQWPOHYJBQKOQG2VOFF3QPG65","short_pith_number":"pith:FNQWPOHY","canonical_record":{"source":{"id":"2408.08395","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-15T19:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"9714044e27b65e2864a11f1911e1a5064d2f66fe062d1f69194a36ae51dab57e","abstract_canon_sha256":"66851f913014b4fc3f784e2aeac00b818b8693d1bfbcb2d49fe6d48542aa01ba"},"schema_version":"1.0"},"canonical_sha256":"2b6167b8f84860a740daab8a5dc1e6f7794b51fefcaed1f5065ad057fed72b3e","source":{"kind":"arxiv","id":"2408.08395","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08395","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08395v1","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08395","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"FNQWPOHYJBQK","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_16","alias_value":"FNQWPOHYJBQKOQG2","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_8","alias_value":"FNQWPOHY","created_at":"2026-07-05T08:55:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FNQWPOHYJBQKOQG2VOFF3QPG65","target":"record","payload":{"canonical_record":{"source":{"id":"2408.08395","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-15T19:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"9714044e27b65e2864a11f1911e1a5064d2f66fe062d1f69194a36ae51dab57e","abstract_canon_sha256":"66851f913014b4fc3f784e2aeac00b818b8693d1bfbcb2d49fe6d48542aa01ba"},"schema_version":"1.0"},"canonical_sha256":"2b6167b8f84860a740daab8a5dc1e6f7794b51fefcaed1f5065ad057fed72b3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:53.847039Z","signature_b64":"gl9SVsgGpagS15IxP4a3/vmGiCsBzFK7W+P7g8/ZEn0yhhrKPoTdy3+KuTC1ULJmHO9S6gi/NP6V8CRRQ0bnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b6167b8f84860a740daab8a5dc1e6f7794b51fefcaed1f5065ad057fed72b3e","last_reissued_at":"2026-07-05T08:55:53.846663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:53.846663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.08395","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-07-05T08:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOMMLZCv6wvP6gYjuPMyYrpF9jqzZ5dKkRqZ5Di1uKbe3PSwrE90F7dmdOOLcuvK1Q1ZVVl0dueRApCtB/fcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:57:02.863004Z"},"content_sha256":"6db049e1b667f51181995a2d34de7200c01730a61b2ede7943026995ae9018a6","schema_version":"1.0","event_id":"sha256:6db049e1b667f51181995a2d34de7200c01730a61b2ede7943026995ae9018a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FNQWPOHYJBQKOQG2VOFF3QPG65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Baoxiang Wang, Jing Dong, Yaoliang Yu","submitted_at":"2024-08-15T19:42:41Z","abstract_excerpt":"We study the problem of no-regret learning algorithms for general monotone and smooth games and their last-iterate convergence properties. Specifically, we investigate the problem under bandit feedback and strongly uncoupled dynamics, which allows modular development of the multi-player system that applies to a wide range of real applications. We propose a mirror-descent-based algorithm, which converges in $O(T^{-1/4})$ and is also no-regret. The result is achieved by a dedicated use of two regularizations and the analysis of the fixed point thereof. The convergence rate is further improved to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08395","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.08395/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DRK2dTg3cJnNfAgGZuNPBoc3C8Srr+Y7m4a0jQb+iC4pDc3L9cziPWLrs+XKwozyE+fGpbYgqtNrNDF0/3gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:57:02.863529Z"},"content_sha256":"5668f5084b496b4b02ed92c9b1027c36664e6555a6bb89c83c0d3c588491ae8e","schema_version":"1.0","event_id":"sha256:5668f5084b496b4b02ed92c9b1027c36664e6555a6bb89c83c0d3c588491ae8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/bundle.json","state_url":"https://pith.science/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/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-08-05T14:57:02Z","links":{"resolver":"https://pith.science/pith/FNQWPOHYJBQKOQG2VOFF3QPG65","bundle":"https://pith.science/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/bundle.json","state":"https://pith.science/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNQWPOHYJBQKOQG2VOFF3QPG65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FNQWPOHYJBQKOQG2VOFF3QPG65","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":"66851f913014b4fc3f784e2aeac00b818b8693d1bfbcb2d49fe6d48542aa01ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-15T19:42:41Z","title_canon_sha256":"9714044e27b65e2864a11f1911e1a5064d2f66fe062d1f69194a36ae51dab57e"},"schema_version":"1.0","source":{"id":"2408.08395","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08395","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08395v1","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08395","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"FNQWPOHYJBQK","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_16","alias_value":"FNQWPOHYJBQKOQG2","created_at":"2026-07-05T08:55:53Z"},{"alias_kind":"pith_short_8","alias_value":"FNQWPOHY","created_at":"2026-07-05T08:55:53Z"}],"graph_snapshots":[{"event_id":"sha256:5668f5084b496b4b02ed92c9b1027c36664e6555a6bb89c83c0d3c588491ae8e","target":"graph","created_at":"2026-07-05T08:55:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.08395/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of no-regret learning algorithms for general monotone and smooth games and their last-iterate convergence properties. Specifically, we investigate the problem under bandit feedback and strongly uncoupled dynamics, which allows modular development of the multi-player system that applies to a wide range of real applications. We propose a mirror-descent-based algorithm, which converges in $O(T^{-1/4})$ and is also no-regret. The result is achieved by a dedicated use of two regularizations and the analysis of the fixed point thereof. The convergence rate is further improved to","authors_text":"Baoxiang Wang, Jing Dong, Yaoliang Yu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-15T19:42:41Z","title":"Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08395","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:6db049e1b667f51181995a2d34de7200c01730a61b2ede7943026995ae9018a6","target":"record","created_at":"2026-07-05T08:55:53Z","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":"66851f913014b4fc3f784e2aeac00b818b8693d1bfbcb2d49fe6d48542aa01ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-08-15T19:42:41Z","title_canon_sha256":"9714044e27b65e2864a11f1911e1a5064d2f66fe062d1f69194a36ae51dab57e"},"schema_version":"1.0","source":{"id":"2408.08395","kind":"arxiv","version":1}},"canonical_sha256":"2b6167b8f84860a740daab8a5dc1e6f7794b51fefcaed1f5065ad057fed72b3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b6167b8f84860a740daab8a5dc1e6f7794b51fefcaed1f5065ad057fed72b3e","first_computed_at":"2026-07-05T08:55:53.846663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:55:53.846663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gl9SVsgGpagS15IxP4a3/vmGiCsBzFK7W+P7g8/ZEn0yhhrKPoTdy3+KuTC1ULJmHO9S6gi/NP6V8CRRQ0bnCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:55:53.847039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08395","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6db049e1b667f51181995a2d34de7200c01730a61b2ede7943026995ae9018a6","sha256:5668f5084b496b4b02ed92c9b1027c36664e6555a6bb89c83c0d3c588491ae8e"],"state_sha256":"cefcc19acfea6b59b004f57ed52c076de10381b5d9d04d249fc00b0b61f94614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ucCqvOwe7dBWpY+RNMdaafvzvQvt08593MM7oy5RiZV95hl+PKzs9HAkUk64X0cDavEb4YbSu2RIBuXEmxYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:57:02.867156Z","bundle_sha256":"5366dcbb752c42d5dde1be75ce044e3713ade2029c54a9ea7f8682bc98242ff5"}}