{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SXNOAKJLXLCG4PFYB5SUD7QHQQ","short_pith_number":"pith:SXNOAKJL","canonical_record":{"source":{"id":"1903.00950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-03T17:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"561dc6165c123198004aaa6669ee9617123b1f4ed2723cef06c5a1c13d8395a0","abstract_canon_sha256":"5e9fc35345ebb31c6ee427d16ab4c48dbb72b07c6b458e17d02fc628c632fcd4"},"schema_version":"1.0"},"canonical_sha256":"95dae0292bbac46e3cb80f6541fe07841fcce237046629be87ea7a3cab9954c0","source":{"kind":"arxiv","id":"1903.00950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00950","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00950v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00950","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"SXNOAKJLXLCG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXNOAKJLXLCG4PFY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXNOAKJL","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SXNOAKJLXLCG4PFYB5SUD7QHQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-03T17:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"561dc6165c123198004aaa6669ee9617123b1f4ed2723cef06c5a1c13d8395a0","abstract_canon_sha256":"5e9fc35345ebb31c6ee427d16ab4c48dbb72b07c6b458e17d02fc628c632fcd4"},"schema_version":"1.0"},"canonical_sha256":"95dae0292bbac46e3cb80f6541fe07841fcce237046629be87ea7a3cab9954c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:12.710080Z","signature_b64":"7xhgsFvOJh3d2plPq0Duo7y6UHb/3JucnwlSTfliU+LjfzlgK5RXAAKJ5n7GHQZ4tBwjXOmqlpKHH3Je/0nBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95dae0292bbac46e3cb80f6541fe07841fcce237046629be87ea7a3cab9954c0","last_reissued_at":"2026-05-17T23:52:12.709447Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:12.709447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00950","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-05-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dh3sGkUXehuioyply1WHQSzCs/T5td5ruuMXk6bddhrQ3cSEuXBJ0n/sXiJujBwh2Lekdyo5ct/BOWhhl2MSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:06.109710Z"},"content_sha256":"5fb8500fcee28e80575654dc2020c01b2b0a78469c00437af89a58eb4fb2993a","schema_version":"1.0","event_id":"sha256:5fb8500fcee28e80575654dc2020c01b2b0a78469c00437af89a58eb4fb2993a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SXNOAKJLXLCG4PFYB5SUD7QHQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Inefficiency of Equilibria in Continuous Actions Games using Submodularity and Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andreas Krause, Maryam Kamgarpour, Pier Giuseppe Sessa","submitted_at":"2019-03-03T17:46:18Z","abstract_excerpt":"Games with continuous strategy sets arise in several machine learning problems (e.g. adversarial learning). For such games, simple no-regret learning algorithms exist in several cases and ensure convergence to coarse correlated equilibria (CCE). The efficiency of such equilibria with respect to a social function, however, is not well understood. In this paper, we define the class of valid utility games with continuous strategies and provide efficiency bounds for their CCEs. Our bounds rely on the social function being a monotone DR-submodular function. We further refine our bounds based on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00950","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":""},"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-05-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qj28PwYeFPWFMTW/eDos2EoT/154yxKbowtjHcIKjTHdguzoxfMiJMK6UL55xI1akvpdjrYvXZ0Q+DYpTlWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:06.110062Z"},"content_sha256":"90109737dd22b3230ea568655c093547b8d41478bea52bf082368038b0776968","schema_version":"1.0","event_id":"sha256:90109737dd22b3230ea568655c093547b8d41478bea52bf082368038b0776968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/bundle.json","state_url":"https://pith.science/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/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-06-03T05:08:06Z","links":{"resolver":"https://pith.science/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ","bundle":"https://pith.science/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/bundle.json","state":"https://pith.science/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXNOAKJLXLCG4PFYB5SUD7QHQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SXNOAKJLXLCG4PFYB5SUD7QHQQ","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":"5e9fc35345ebb31c6ee427d16ab4c48dbb72b07c6b458e17d02fc628c632fcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-03T17:46:18Z","title_canon_sha256":"561dc6165c123198004aaa6669ee9617123b1f4ed2723cef06c5a1c13d8395a0"},"schema_version":"1.0","source":{"id":"1903.00950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00950","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00950v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00950","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"SXNOAKJLXLCG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXNOAKJLXLCG4PFY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXNOAKJL","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:90109737dd22b3230ea568655c093547b8d41478bea52bf082368038b0776968","target":"graph","created_at":"2026-05-17T23:52:12Z","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"},"paper":{"abstract_excerpt":"Games with continuous strategy sets arise in several machine learning problems (e.g. adversarial learning). For such games, simple no-regret learning algorithms exist in several cases and ensure convergence to coarse correlated equilibria (CCE). The efficiency of such equilibria with respect to a social function, however, is not well understood. In this paper, we define the class of valid utility games with continuous strategies and provide efficiency bounds for their CCEs. Our bounds rely on the social function being a monotone DR-submodular function. We further refine our bounds based on the","authors_text":"Andreas Krause, Maryam Kamgarpour, Pier Giuseppe Sessa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-03T17:46:18Z","title":"Bounding Inefficiency of Equilibria in Continuous Actions Games using Submodularity and Curvature"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00950","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:5fb8500fcee28e80575654dc2020c01b2b0a78469c00437af89a58eb4fb2993a","target":"record","created_at":"2026-05-17T23:52:12Z","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":"5e9fc35345ebb31c6ee427d16ab4c48dbb72b07c6b458e17d02fc628c632fcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-03T17:46:18Z","title_canon_sha256":"561dc6165c123198004aaa6669ee9617123b1f4ed2723cef06c5a1c13d8395a0"},"schema_version":"1.0","source":{"id":"1903.00950","kind":"arxiv","version":1}},"canonical_sha256":"95dae0292bbac46e3cb80f6541fe07841fcce237046629be87ea7a3cab9954c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95dae0292bbac46e3cb80f6541fe07841fcce237046629be87ea7a3cab9954c0","first_computed_at":"2026-05-17T23:52:12.709447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:12.709447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7xhgsFvOJh3d2plPq0Duo7y6UHb/3JucnwlSTfliU+LjfzlgK5RXAAKJ5n7GHQZ4tBwjXOmqlpKHH3Je/0nBAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:12.710080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fb8500fcee28e80575654dc2020c01b2b0a78469c00437af89a58eb4fb2993a","sha256:90109737dd22b3230ea568655c093547b8d41478bea52bf082368038b0776968"],"state_sha256":"8094c306eda636a5c36898ffe9e396c27e083aa6045f3d69b561a352074decb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lHp/XDtKSQlxcdnTF19UohW12mmZ3rG/Ii1zga3SrjaUP9BbrHc58JIRT1X5MZJOIPsceVJEB0VlHk0MgSWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:08:06.112067Z","bundle_sha256":"a9db8a040eed7677d5aa9db9a0138cf90bb3b3149129c6e9e2a69c9481703e2e"}}