{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S6RMIFB7YPFRATJ7C7NWMKO6V6","short_pith_number":"pith:S6RMIFB7","canonical_record":{"source":{"id":"2502.09332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T13:49:52Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"506eb06c7f5128e97f0b314f716176eaf86fa5c22797ec6f76a9c9c312e5f466","abstract_canon_sha256":"1682277e506f5e8a774b29dc48bd2e44afe9c736a542f5bd6cab0ae30975067d"},"schema_version":"1.0"},"canonical_sha256":"97a2c4143fc3cb104d3f17db6629deafa90f5a46555d53847771550e3daeeebf","source":{"kind":"arxiv","id":"2502.09332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09332","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09332v1","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09332","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"S6RMIFB7YPFR","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_16","alias_value":"S6RMIFB7YPFRATJ7","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_8","alias_value":"S6RMIFB7","created_at":"2026-07-05T10:13:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S6RMIFB7YPFRATJ7C7NWMKO6V6","target":"record","payload":{"canonical_record":{"source":{"id":"2502.09332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T13:49:52Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"506eb06c7f5128e97f0b314f716176eaf86fa5c22797ec6f76a9c9c312e5f466","abstract_canon_sha256":"1682277e506f5e8a774b29dc48bd2e44afe9c736a542f5bd6cab0ae30975067d"},"schema_version":"1.0"},"canonical_sha256":"97a2c4143fc3cb104d3f17db6629deafa90f5a46555d53847771550e3daeeebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:55.783730Z","signature_b64":"dZJQFVVrLS79O+4RDiX2mLtOgy0QiolDnZDhLE8+nHTICt1nM9NyIjiWMwvp+Q85BMTxiPHnmaMeZjm60z+XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a2c4143fc3cb104d3f17db6629deafa90f5a46555d53847771550e3daeeebf","last_reissued_at":"2026-07-05T10:13:55.783242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:55.783242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.09332","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-05T10:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPkKm06c7/jIOXYJYrBOGVC79jy8Jhg06mtKuzl6sh5XrXhDWiFv5owuX6OXXpysPu/VTBfn/t+21XEjV+QpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:33:49.561334Z"},"content_sha256":"067348272fadfb90d6b8bc9b13d3eac7b5f6538e5f4891b6c41b406fb8a3a484","schema_version":"1.0","event_id":"sha256:067348272fadfb90d6b8bc9b13d3eac7b5f6538e5f4891b6c41b406fb8a3a484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S6RMIFB7YPFRATJ7C7NWMKO6V6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Full Swap Regret and Discretized Calibration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Jon Schneider, Maxwell Fishelson, Princewill Okoroafor, Renato Paes Leme, Robert Kleinberg, Yifeng Teng","submitted_at":"2025-02-13T13:49:52Z","abstract_excerpt":"We study the problem of minimizing swap regret in structured normal-form games. Players have a very large (potentially infinite) number of pure actions, but each action has an embedding into $d$-dimensional space and payoffs are given by bilinear functions of these embeddings. We provide an efficient learning algorithm for this setting that incurs at most $\\tilde{O}(T^{(d+1)/(d+3)})$ swap regret after $T$ rounds.\n  To achieve this, we introduce a new online learning problem we call \\emph{full swap regret minimization}. In this problem, a learner repeatedly takes a (randomized) action in a boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09332","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/2502.09332/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-05T10:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bS3S2YEZHl3b8Jco21xj3PoHfqMu1x7jJMuWQouCQfYhjMkDwCfxBe/Ho8snw1c6H/aXeKEaAuKLho2blNUTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:33:49.561992Z"},"content_sha256":"63d79d10ee06c71f40afaa3957770cb491053f0da6db49e20602979b58dcd716","schema_version":"1.0","event_id":"sha256:63d79d10ee06c71f40afaa3957770cb491053f0da6db49e20602979b58dcd716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/bundle.json","state_url":"https://pith.science/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/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-08T09:33:49Z","links":{"resolver":"https://pith.science/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6","bundle":"https://pith.science/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/bundle.json","state":"https://pith.science/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6RMIFB7YPFRATJ7C7NWMKO6V6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S6RMIFB7YPFRATJ7C7NWMKO6V6","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":"1682277e506f5e8a774b29dc48bd2e44afe9c736a542f5bd6cab0ae30975067d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T13:49:52Z","title_canon_sha256":"506eb06c7f5128e97f0b314f716176eaf86fa5c22797ec6f76a9c9c312e5f466"},"schema_version":"1.0","source":{"id":"2502.09332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09332","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09332v1","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09332","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"S6RMIFB7YPFR","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_16","alias_value":"S6RMIFB7YPFRATJ7","created_at":"2026-07-05T10:13:55Z"},{"alias_kind":"pith_short_8","alias_value":"S6RMIFB7","created_at":"2026-07-05T10:13:55Z"}],"graph_snapshots":[{"event_id":"sha256:63d79d10ee06c71f40afaa3957770cb491053f0da6db49e20602979b58dcd716","target":"graph","created_at":"2026-07-05T10:13:55Z","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/2502.09332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of minimizing swap regret in structured normal-form games. Players have a very large (potentially infinite) number of pure actions, but each action has an embedding into $d$-dimensional space and payoffs are given by bilinear functions of these embeddings. We provide an efficient learning algorithm for this setting that incurs at most $\\tilde{O}(T^{(d+1)/(d+3)})$ swap regret after $T$ rounds.\n  To achieve this, we introduce a new online learning problem we call \\emph{full swap regret minimization}. In this problem, a learner repeatedly takes a (randomized) action in a boun","authors_text":"Jon Schneider, Maxwell Fishelson, Princewill Okoroafor, Renato Paes Leme, Robert Kleinberg, Yifeng Teng","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T13:49:52Z","title":"Full Swap Regret and Discretized Calibration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09332","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:067348272fadfb90d6b8bc9b13d3eac7b5f6538e5f4891b6c41b406fb8a3a484","target":"record","created_at":"2026-07-05T10:13:55Z","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":"1682277e506f5e8a774b29dc48bd2e44afe9c736a542f5bd6cab0ae30975067d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-13T13:49:52Z","title_canon_sha256":"506eb06c7f5128e97f0b314f716176eaf86fa5c22797ec6f76a9c9c312e5f466"},"schema_version":"1.0","source":{"id":"2502.09332","kind":"arxiv","version":1}},"canonical_sha256":"97a2c4143fc3cb104d3f17db6629deafa90f5a46555d53847771550e3daeeebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97a2c4143fc3cb104d3f17db6629deafa90f5a46555d53847771550e3daeeebf","first_computed_at":"2026-07-05T10:13:55.783242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:55.783242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZJQFVVrLS79O+4RDiX2mLtOgy0QiolDnZDhLE8+nHTICt1nM9NyIjiWMwvp+Q85BMTxiPHnmaMeZjm60z+XBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:55.783730Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.09332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:067348272fadfb90d6b8bc9b13d3eac7b5f6538e5f4891b6c41b406fb8a3a484","sha256:63d79d10ee06c71f40afaa3957770cb491053f0da6db49e20602979b58dcd716"],"state_sha256":"862d0f17853da21b3e80a2169caecf471a5cd4c35e9d5bf3a50fa3c5f79ae298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFBYwpaBveTe5ZHtV+EnY1F4kJ/wMdhl0aEETrLb97klUH7Sy5JyJmZZ/MxuCVwoMf1sh08ZFMoB2UbE4MlhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:33:49.567151Z","bundle_sha256":"71a9ccc91097dabeb1d5f9bbaac5613745c0b8a0949ba35aefd2d99f8dafa72f"}}