{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PE6GDVQILL33ULI5PGEWLITCOO","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":"1c3a3ec8dc5c35655afab124138db1d1265568b4f16454d77a9271f13908313d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-02-05T23:43:25Z","title_canon_sha256":"0811e8ff099222e288d749a88e8a962181ae7b67f4bc115174fbf3b4a445933e"},"schema_version":"1.0","source":{"id":"2602.06264","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06264","created_at":"2026-05-22T01:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06264v3","created_at":"2026-05-22T01:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06264","created_at":"2026-05-22T01:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"PE6GDVQILL33","created_at":"2026-05-22T01:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"PE6GDVQILL33ULI5","created_at":"2026-05-22T01:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"PE6GDVQI","created_at":"2026-05-22T01:03:56Z"}],"graph_snapshots":[{"event_id":"sha256:927a040996effe8d244c9151fdd8c2640015a40af13019296b1896db2e696b1a","target":"graph","created_at":"2026-05-22T01:03:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We develop a significantly simpler, computationally efficient algorithm that guarantees O(d^{3/2} √T) linear swap regret for a general convex set and O(d √T) when the set is centrally symmetric."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The response-based approachability framework of Bernstein and Shimkin can be directly applied to linear swap regret minimization over convex sets after John ellipsoid preconditioning, without hidden computational costs or additional assumptions on the loss functions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New response-based approachability algorithm with John ellipsoid preconditioning achieves O(d^{3/2} √T) linear swap regret for general convex sets and O(d √T) for symmetric sets, with matching Ω(d √T) lower bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A simpler algorithm achieves O(d^{3/2} √T) linear swap regret over general convex sets via response-based approachability."}],"snapshot_sha256":"2d36fe8cf477dfbb5a459e5b3ad2a33a6884675ec383815fa9007fe4c736dbe9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.06264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of minimizing different notions of swap regret in online optimization. These forms of regret are tightly connected to correlated equilibrium concepts in games, and have been more recently shown to guarantee non-manipulability against strategic adversaries. The only computationally efficient algorithm for minimizing linear swap regret over a general convex set in $\\mathbb{R}^d$ was developed recently by Daskalakis, Farina, Fishelson, Pipis, and Schneider (STOC '25). However, it incurs a highly suboptimal regret bound of $\\Omega(d^4 \\sqrt{T})$ and also relies on computati","authors_text":"Gabriele Farina, Haipeng Luo, Ioannis Anagnostides, Jon Schneider, Maxwell Fishelson","cross_cats":[],"headline":"A simpler algorithm achieves O(d^{3/2} √T) linear swap regret over general convex sets via response-based approachability.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-02-05T23:43:25Z","title":"Swap Regret Minimization Through Response-Based Approachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06264","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T06:29:20.616992Z","id":"f6b32fe2-8af9-4315-be3e-d5cd307a2121","model_set":{"reader":"grok-4.3"},"one_line_summary":"New response-based approachability algorithm with John ellipsoid preconditioning achieves O(d^{3/2} √T) linear swap regret for general convex sets and O(d √T) for symmetric sets, with matching Ω(d √T) lower bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A simpler algorithm achieves O(d^{3/2} √T) linear swap regret over general convex sets via response-based approachability.","strongest_claim":"We develop a significantly simpler, computationally efficient algorithm that guarantees O(d^{3/2} √T) linear swap regret for a general convex set and O(d √T) when the set is centrally symmetric.","weakest_assumption":"The response-based approachability framework of Bernstein and Shimkin can be directly applied to linear swap regret minimization over convex sets after John ellipsoid preconditioning, without hidden computational costs or additional assumptions on the loss functions."}},"verdict_id":"f6b32fe2-8af9-4315-be3e-d5cd307a2121"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7cea7ed966699e695d539f3bee883bd31a126d3230ab028e284cda2a996cadcc","target":"record","created_at":"2026-05-22T01:03:56Z","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":"1c3a3ec8dc5c35655afab124138db1d1265568b4f16454d77a9271f13908313d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-02-05T23:43:25Z","title_canon_sha256":"0811e8ff099222e288d749a88e8a962181ae7b67f4bc115174fbf3b4a445933e"},"schema_version":"1.0","source":{"id":"2602.06264","kind":"arxiv","version":3}},"canonical_sha256":"793c61d6085af7ba2d1d798965a262739f94348c15342ff39e78da2b79659a5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"793c61d6085af7ba2d1d798965a262739f94348c15342ff39e78da2b79659a5e","first_computed_at":"2026-05-22T01:03:56.640521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:56.640521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sc83fR41+LxLIiAS6X2478DfpPqWEocRwruSGtgCfEIPOsUTCgdZzqleiSEXCv4Z9E6u6R5WcanSExrSYP44Ag==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:56.641245Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.06264","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cea7ed966699e695d539f3bee883bd31a126d3230ab028e284cda2a996cadcc","sha256:927a040996effe8d244c9151fdd8c2640015a40af13019296b1896db2e696b1a"],"state_sha256":"c51e0ba59f1e00d878906d06e014642b79d42fbc711d049d1280cb0d8b42f6e8"}