{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XQU4PCU7PRMMQCRY2YYQVPFWQH","short_pith_number":"pith:XQU4PCU7","schema_version":"1.0","canonical_sha256":"bc29c78a9f7c58c80a38d6310abcb681dbcbdcb6f9de6285baf9d02cf27a5875","source":{"kind":"arxiv","id":"2007.05271","version":1},"attestation_state":"computed","paper":{"title":"Learning to Play Sequential Games versus Unknown Opponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Ilija Bogunovic, Maryam Kamgarpour, Pier Giuseppe Sessa","submitted_at":"2020-07-10T09:33:05Z","abstract_excerpt":"We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous approaches consider known opponent models, we focus on the setting in which the opponent's model is unknown. To this end, we use kernel-based regularity assumptions to capture and exploit the structure in the opponent's response. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. The algorithm combines ideas fr"},"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":"2007.05271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-10T09:33:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"e09904ff131a58d993dd223f781d5dd8e82c2a3c3bd4ffa44b8e84bba87e8dd6","abstract_canon_sha256":"beb87b8aaee6472ce19d668edd5a7424cfe4859fe7b765134aa4f197dbf8dfae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:45.250967Z","signature_b64":"78bvZdRhPPUQ3JMEZwSje+8qKEa6J0xrYiMJa4zd22OxKNkbWGg6PswzirQ4+hi4FxbbznG80tlR5MFLM0rnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc29c78a9f7c58c80a38d6310abcb681dbcbdcb6f9de6285baf9d02cf27a5875","last_reissued_at":"2026-07-05T01:17:45.250427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:45.250427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Play Sequential Games versus Unknown Opponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Ilija Bogunovic, Maryam Kamgarpour, Pier Giuseppe Sessa","submitted_at":"2020-07-10T09:33:05Z","abstract_excerpt":"We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous approaches consider known opponent models, we focus on the setting in which the opponent's model is unknown. To this end, we use kernel-based regularity assumptions to capture and exploit the structure in the opponent's response. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. The algorithm combines ideas fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05271","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/2007.05271/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":"2007.05271","created_at":"2026-07-05T01:17:45.250517+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.05271v1","created_at":"2026-07-05T01:17:45.250517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05271","created_at":"2026-07-05T01:17:45.250517+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQU4PCU7PRMM","created_at":"2026-07-05T01:17:45.250517+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQU4PCU7PRMMQCRY","created_at":"2026-07-05T01:17:45.250517+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQU4PCU7","created_at":"2026-07-05T01:17:45.250517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17379","citing_title":"Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH","json":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH.json","graph_json":"https://pith.science/api/pith-number/XQU4PCU7PRMMQCRY2YYQVPFWQH/graph.json","events_json":"https://pith.science/api/pith-number/XQU4PCU7PRMMQCRY2YYQVPFWQH/events.json","paper":"https://pith.science/paper/XQU4PCU7"},"agent_actions":{"view_html":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH","download_json":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH.json","view_paper":"https://pith.science/paper/XQU4PCU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.05271&json=true","fetch_graph":"https://pith.science/api/pith-number/XQU4PCU7PRMMQCRY2YYQVPFWQH/graph.json","fetch_events":"https://pith.science/api/pith-number/XQU4PCU7PRMMQCRY2YYQVPFWQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH/action/storage_attestation","attest_author":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH/action/author_attestation","sign_citation":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH/action/citation_signature","submit_replication":"https://pith.science/pith/XQU4PCU7PRMMQCRY2YYQVPFWQH/action/replication_record"}},"created_at":"2026-07-05T01:17:45.250517+00:00","updated_at":"2026-07-05T01:17:45.250517+00:00"}