{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:H6LDSZRT74JX7JWXRZ2HLD6253","short_pith_number":"pith:H6LDSZRT","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"},"canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","source":{"kind":"arxiv","id":"2310.19647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19647","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19647v2","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19647","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"H6LDSZRT74JX","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"H6LDSZRT74JX7JWX","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"H6LDSZRT","created_at":"2026-07-05T07:12:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:H6LDSZRT74JX7JWXRZ2HLD6253","target":"record","payload":{"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"},"canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","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"},"source_kind":"arxiv","source_id":"2310.19647","source_version":2,"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-05T07:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3zoQXWkvSk9Wv+yzzvxeVDJ3RxTSbGJfWwSGC+xdMqE6nefkcycRAu/33jWzMwIsvYt1lQw21cjFcn/IJZcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:04:00.134239Z"},"content_sha256":"3b691d54e35d4c5f78ae17dcffbb1f8522d17036ecfd4d2f889885bb34069aa7","schema_version":"1.0","event_id":"sha256:3b691d54e35d4c5f78ae17dcffbb1f8522d17036ecfd4d2f889885bb34069aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:H6LDSZRT74JX7JWXRZ2HLD6253","target":"graph","payload":{"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"},"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-05T07:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvp4QkoF/0q4oIGqLq3XAMSQTcirMCwVO9M9bDSaY9NQ+3vaf56ubh/8Q2z9TgK8SpbmxrLf8GMqKBHq2fDiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:04:00.134797Z"},"content_sha256":"120519ee2aa97462fb9afb67ade49e454847647889d4d79555d244abf506d9ad","schema_version":"1.0","event_id":"sha256:120519ee2aa97462fb9afb67ade49e454847647889d4d79555d244abf506d9ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/bundle.json","state_url":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6LDSZRT74JX7JWXRZ2HLD6253/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-08T19:04:00Z","links":{"resolver":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253","bundle":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/bundle.json","state":"https://pith.science/pith/H6LDSZRT74JX7JWXRZ2HLD6253/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6LDSZRT74JX7JWXRZ2HLD6253/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:H6LDSZRT74JX7JWXRZ2HLD6253","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":"3d1e9101e97f9016dfaf8d12e536cbe40a95a6a78f54177338731c6ceb6cf15f","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-30T15:35:24Z","title_canon_sha256":"2851101ac1acf57d962ebb707bfef60bdd8f4125532b88e03d5bd2fbf7731fd2"},"schema_version":"1.0","source":{"id":"2310.19647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19647","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19647v2","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19647","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"H6LDSZRT74JX","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"H6LDSZRT74JX7JWX","created_at":"2026-07-05T07:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"H6LDSZRT","created_at":"2026-07-05T07:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:120519ee2aa97462fb9afb67ade49e454847647889d4d79555d244abf506d9ad","target":"graph","created_at":"2026-07-05T07:12:38Z","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/2310.19647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Aviad Rubinstein, Binghui Peng","cross_cats":["cs.AI","cs.DS","cs.LG","cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-30T15:35:24Z","title":"Fast swap regret minimization and applications to approximate correlated equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19647","kind":"arxiv","version":2},"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:3b691d54e35d4c5f78ae17dcffbb1f8522d17036ecfd4d2f889885bb34069aa7","target":"record","created_at":"2026-07-05T07:12:38Z","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":"3d1e9101e97f9016dfaf8d12e536cbe40a95a6a78f54177338731c6ceb6cf15f","cross_cats_sorted":["cs.AI","cs.DS","cs.LG","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-30T15:35:24Z","title_canon_sha256":"2851101ac1acf57d962ebb707bfef60bdd8f4125532b88e03d5bd2fbf7731fd2"},"schema_version":"1.0","source":{"id":"2310.19647","kind":"arxiv","version":2}},"canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f96396633ff137fa6d78e74758fdaeee251ebbd572d4a5b480c1293733c95c3","first_computed_at":"2026-07-05T07:12:38.153016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:38.153016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EtjBphYWVgYVa+frUjDyTv67y+ghrkgPsTdQ+ogvrlPy61I3F8IygQFJGN+BTRaW3GfEz0sU6/ME57jJy1v8Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:38.153431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.19647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b691d54e35d4c5f78ae17dcffbb1f8522d17036ecfd4d2f889885bb34069aa7","sha256:120519ee2aa97462fb9afb67ade49e454847647889d4d79555d244abf506d9ad"],"state_sha256":"3d3ede728eb584d337632ff408adcb2866d3588fad3882fa4e2bbd99f78bc42c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jln1NHQJblgcZ3PG+65nAHz9dcdUkQHIaDvNxqWdO5A4O0IVsxMobBSfMII90pGcrhNofOMF9tbF36cjq1a/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:04:00.138593Z","bundle_sha256":"b1a714fa8560b0f2fa2f7c84ae3680ba34f2b0333ca771467f2aa2da54653745"}}