{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H6LDSZRT74JX7JWXRZ2HLD6253","short_pith_number":"pith:H6LDSZRT","schema_version":"1.0","canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","source":{"kind":"arxiv","id":"2310.19647","version":2},"attestation_state":"computed","paper":{"title":"Fast swap regret minimization and applications to approximate correlated equilibria","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG","cs.MA"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein, Binghui Peng","submitted_at":"2023-10-30T15:35:24Z","abstract_excerpt":"We give a simple and computationally efficient algorithm that, for any constant $\\varepsilon>0$, obtains $\\varepsilon T$-swap regret within only $T = \\mathsf{polylog}(n)$ rounds; this is an exponential improvement compared to the super-linear number of rounds required by the state-of-the-art algorithm, and resolves the main open problem of [Blum and Mansour 2007]. Our algorithm has an exponential dependence on $\\varepsilon$, but we prove a new, matching lower bound.\n  Our algorithm for swap regret implies faster convergence to $\\varepsilon$-Correlated Equilibrium ($\\varepsilon$-CE) in several "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.19647","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-30T15:35:24Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","cs.MA"],"title_canon_sha256":"2851101ac1acf57d962ebb707bfef60bdd8f4125532b88e03d5bd2fbf7731fd2","abstract_canon_sha256":"3d1e9101e97f9016dfaf8d12e536cbe40a95a6a78f54177338731c6ceb6cf15f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:38.153431Z","signature_b64":"EtjBphYWVgYVa+frUjDyTv67y+ghrkgPsTdQ+ogvrlPy61I3F8IygQFJGN+BTRaW3GfEz0sU6/ME57jJy1v8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","last_reissued_at":"2026-07-05T07:12:38.153016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:38.153016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast swap regret minimization and applications to approximate correlated equilibria","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG","cs.MA"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein, Binghui Peng","submitted_at":"2023-10-30T15:35:24Z","abstract_excerpt":"We give a simple and computationally efficient algorithm that, for any constant $\\varepsilon>0$, obtains $\\varepsilon T$-swap regret within only $T = \\mathsf{polylog}(n)$ rounds; this is an exponential improvement compared to the super-linear number of rounds required by the state-of-the-art algorithm, and resolves the main open problem of [Blum and Mansour 2007]. Our algorithm has an exponential dependence on $\\varepsilon$, but we prove a new, matching lower bound.\n  Our algorithm for swap regret implies faster convergence to $\\varepsilon$-Correlated Equilibrium ($\\varepsilon$-CE) in several "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19647","kind":"arxiv","version":2},"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/2310.19647/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.19647","created_at":"2026-07-05T07:12:38.153071+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19647v2","created_at":"2026-07-05T07:12:38.153071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19647","created_at":"2026-07-05T07:12:38.153071+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6LDSZRT74JX","created_at":"2026-07-05T07:12:38.153071+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6LDSZRT74JX7JWX","created_at":"2026-07-05T07:12:38.153071+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6LDSZRT","created_at":"2026-07-05T07:12:38.153071+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09332","citing_title":"Full Swap Regret and Discretized Calibration","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253","json":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253.json","graph_json":"https://pith.science/api/pith-number/H6LDSZRT74JX7JWXRZ2HLD6253/graph.json","events_json":"https://pith.science/api/pith-number/H6LDSZRT74JX7JWXRZ2HLD6253/events.json","paper":"https://pith.science/paper/H6LDSZRT"},"agent_actions":{"view_html":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253","download_json":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253.json","view_paper":"https://pith.science/paper/H6LDSZRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19647&json=true","fetch_graph":"https://pith.science/api/pith-number/H6LDSZRT74JX7JWXRZ2HLD6253/graph.json","fetch_events":"https://pith.science/api/pith-number/H6LDSZRT74JX7JWXRZ2HLD6253/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/action/storage_attestation","attest_author":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/action/author_attestation","sign_citation":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/action/citation_signature","submit_replication":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/action/replication_record"}},"created_at":"2026-07-05T07:12:38.153071+00:00","updated_at":"2026-07-05T07:12:38.153071+00:00"}