{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4JRCLMNKCCFWI6HPE536EDCDYK","short_pith_number":"pith:4JRCLMNK","schema_version":"1.0","canonical_sha256":"e26225b1aa108b6478ef2777e20c43c2887bbc8695b93b72977fbd2bc075b589","source":{"kind":"arxiv","id":"2107.06327","version":1},"attestation_state":"computed","paper":{"title":"Contextual Games: Multi-Agent Learning with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Andreas Krause, Ilija Bogunovic, Maryam Kamgarpour, Pier Giuseppe Sessa","submitted_at":"2021-07-13T18:37:37Z","abstract_excerpt":"We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game outcomes and propose a novel online (meta) algorithm that exploits such correlations to minimize the contextual regret of individual players. We define game-theoretic notions of contextual Coarse Correlated Equilibria (c-CCE) and optimal contextual welfare for this new class of games and show that c-CCEs and optimal welfare can be approached whenever players' conte"},"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":"2107.06327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-07-13T18:37:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"544656c56b10ccbdda4c5f8b1bd0f0381c408ed9038c451ea655f096d7fedbc2","abstract_canon_sha256":"7605b9c83fde095efa2c95e93a95edcef0757b9946f17596a87d9abe17fed45c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:56.871652Z","signature_b64":"gAKZeobW3MbbI/LTI3+RXosUluusswF3VmGiGasZNTKBAB4dcYPUvIzKGyyWZpCnQQba7cNhqG5HfxwFWCdnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e26225b1aa108b6478ef2777e20c43c2887bbc8695b93b72977fbd2bc075b589","last_reissued_at":"2026-07-05T02:57:56.871293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:56.871293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contextual Games: Multi-Agent Learning with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Andreas Krause, Ilija Bogunovic, Maryam Kamgarpour, Pier Giuseppe Sessa","submitted_at":"2021-07-13T18:37:37Z","abstract_excerpt":"We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game outcomes and propose a novel online (meta) algorithm that exploits such correlations to minimize the contextual regret of individual players. We define game-theoretic notions of contextual Coarse Correlated Equilibria (c-CCE) and optimal contextual welfare for this new class of games and show that c-CCEs and optimal welfare can be approached whenever players' conte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06327","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/2107.06327/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":"2107.06327","created_at":"2026-07-05T02:57:56.871373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.06327v1","created_at":"2026-07-05T02:57:56.871373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06327","created_at":"2026-07-05T02:57:56.871373+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JRCLMNKCCFW","created_at":"2026-07-05T02:57:56.871373+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JRCLMNKCCFWI6HP","created_at":"2026-07-05T02:57:56.871373+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JRCLMNK","created_at":"2026-07-05T02:57:56.871373+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19144","citing_title":"Prediction-Aware Learning in Multi-Agent Systems","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK","json":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK.json","graph_json":"https://pith.science/api/pith-number/4JRCLMNKCCFWI6HPE536EDCDYK/graph.json","events_json":"https://pith.science/api/pith-number/4JRCLMNKCCFWI6HPE536EDCDYK/events.json","paper":"https://pith.science/paper/4JRCLMNK"},"agent_actions":{"view_html":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK","download_json":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK.json","view_paper":"https://pith.science/paper/4JRCLMNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.06327&json=true","fetch_graph":"https://pith.science/api/pith-number/4JRCLMNKCCFWI6HPE536EDCDYK/graph.json","fetch_events":"https://pith.science/api/pith-number/4JRCLMNKCCFWI6HPE536EDCDYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK/action/storage_attestation","attest_author":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK/action/author_attestation","sign_citation":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK/action/citation_signature","submit_replication":"https://pith.science/pith/4JRCLMNKCCFWI6HPE536EDCDYK/action/replication_record"}},"created_at":"2026-07-05T02:57:56.871373+00:00","updated_at":"2026-07-05T02:57:56.871373+00:00"}