{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MUBQOJ5RB3IU53WQSBZTR6LM33","short_pith_number":"pith:MUBQOJ5R","schema_version":"1.0","canonical_sha256":"65030727b10ed14eeed0907338f96cded4e8c0aee850bdacd0a4b859d9cf3d21","source":{"kind":"arxiv","id":"1102.2041","version":3},"attestation_state":"computed","paper":{"title":"Toward a Classification of Finite Partial-Monitoring Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.GT","authors_text":"Andr\\'as Antos, Csaba Szepesv\\'ari, D\\'avid P\\'al, G\\'abor Bart\\'ok","submitted_at":"2011-02-10T06:24:19Z","abstract_excerpt":"Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action and the outcome. The goal of the learner is to minimize his total cumulative loss. We make progress towards the classification of these games based on their minimax expected regret. Namely, we classify almost all games with two outcomes and finite number of actions: We show that t"},"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":"1102.2041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-10T06:24:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"272d79df0196b5a29ecf6636f6094991dbfa6e9dbafad631bb36d663f831e568","abstract_canon_sha256":"9a6176e3e59b6e2f1abc6a6ca714ec871fc9d6e38b061a953beadca2e4e8daec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.443703Z","signature_b64":"KzUHA/ifQfsBYRRknXhheWEf0LgCuLUwrINidn26K5XoXk9MjAI8vNrAlcxHv4vuoXiAsIJJt1NZtRJBVLKhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65030727b10ed14eeed0907338f96cded4e8c0aee850bdacd0a4b859d9cf3d21","last_reissued_at":"2026-05-18T04:11:08.443199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.443199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a Classification of Finite Partial-Monitoring Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.GT","authors_text":"Andr\\'as Antos, Csaba Szepesv\\'ari, D\\'avid P\\'al, G\\'abor Bart\\'ok","submitted_at":"2011-02-10T06:24:19Z","abstract_excerpt":"Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action and the outcome. The goal of the learner is to minimize his total cumulative loss. We make progress towards the classification of these games based on their minimax expected regret. Namely, we classify almost all games with two outcomes and finite number of actions: We show that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2041","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.2041","created_at":"2026-05-18T04:11:08.443267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2041v3","created_at":"2026-05-18T04:11:08.443267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2041","created_at":"2026-05-18T04:11:08.443267+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUBQOJ5RB3IU","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUBQOJ5RB3IU53WQ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUBQOJ5R","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33","json":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33.json","graph_json":"https://pith.science/api/pith-number/MUBQOJ5RB3IU53WQSBZTR6LM33/graph.json","events_json":"https://pith.science/api/pith-number/MUBQOJ5RB3IU53WQSBZTR6LM33/events.json","paper":"https://pith.science/paper/MUBQOJ5R"},"agent_actions":{"view_html":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33","download_json":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33.json","view_paper":"https://pith.science/paper/MUBQOJ5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2041&json=true","fetch_graph":"https://pith.science/api/pith-number/MUBQOJ5RB3IU53WQSBZTR6LM33/graph.json","fetch_events":"https://pith.science/api/pith-number/MUBQOJ5RB3IU53WQSBZTR6LM33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33/action/storage_attestation","attest_author":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33/action/author_attestation","sign_citation":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33/action/citation_signature","submit_replication":"https://pith.science/pith/MUBQOJ5RB3IU53WQSBZTR6LM33/action/replication_record"}},"created_at":"2026-05-18T04:11:08.443267+00:00","updated_at":"2026-05-18T04:11:08.443267+00:00"}