{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CQRNUB4A6B6X6HR3NKMV27SUZ7","short_pith_number":"pith:CQRNUB4A","schema_version":"1.0","canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","source":{"kind":"arxiv","id":"1703.01952","version":2},"attestation_state":"computed","paper":{"title":"Efficient Strategy Computation in Zero-Sum Asymmetric Repeated Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jeff S. Shamma, Lichun Li","submitted_at":"2017-03-06T16:23:50Z","abstract_excerpt":"Zero-sum asymmetric games model decision making scenarios involving two competing players who have different information about the game being played. A particular case is that of nested information, where one (informed) player has superior information over the other (uninformed) player. This paper considers the case of nested information in repeated zero-sum games and studies the computation of strategies for both the informed and uninformed players for finite-horizon and discounted infinite-horizon nested information games. For finite-horizon settings, we exploit that for both players, the se"},"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":"1703.01952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-06T16:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"a657fe59b7784f242eb0881a791e916fa8d4216514b70dfbdabdc153e4dd7947","abstract_canon_sha256":"3d0b45b2b74a141185a825c4b447ef0566c9c7dc77c093947c3822f635d00bf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:13.256101Z","signature_b64":"nq1zoGnRwDS5xsyntp4ELk4ymynBZyBlb1s0AigPFCzFb2QvgreEu87lMXoUSzKgbyoVSh3rqlGMbtWtLR1xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","last_reissued_at":"2026-05-18T00:31:13.255293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:13.255293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Strategy Computation in Zero-Sum Asymmetric Repeated Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jeff S. Shamma, Lichun Li","submitted_at":"2017-03-06T16:23:50Z","abstract_excerpt":"Zero-sum asymmetric games model decision making scenarios involving two competing players who have different information about the game being played. A particular case is that of nested information, where one (informed) player has superior information over the other (uninformed) player. This paper considers the case of nested information in repeated zero-sum games and studies the computation of strategies for both the informed and uninformed players for finite-horizon and discounted infinite-horizon nested information games. For finite-horizon settings, we exploit that for both players, the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01952","kind":"arxiv","version":2},"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":"1703.01952","created_at":"2026-05-18T00:31:13.255422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01952v2","created_at":"2026-05-18T00:31:13.255422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01952","created_at":"2026-05-18T00:31:13.255422+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQRNUB4A6B6X","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQRNUB4A6B6X6HR3","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQRNUB4A","created_at":"2026-05-18T12:31:10.602751+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/CQRNUB4A6B6X6HR3NKMV27SUZ7","json":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7.json","graph_json":"https://pith.science/api/pith-number/CQRNUB4A6B6X6HR3NKMV27SUZ7/graph.json","events_json":"https://pith.science/api/pith-number/CQRNUB4A6B6X6HR3NKMV27SUZ7/events.json","paper":"https://pith.science/paper/CQRNUB4A"},"agent_actions":{"view_html":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7","download_json":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7.json","view_paper":"https://pith.science/paper/CQRNUB4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01952&json=true","fetch_graph":"https://pith.science/api/pith-number/CQRNUB4A6B6X6HR3NKMV27SUZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/CQRNUB4A6B6X6HR3NKMV27SUZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/action/storage_attestation","attest_author":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/action/author_attestation","sign_citation":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/action/citation_signature","submit_replication":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/action/replication_record"}},"created_at":"2026-05-18T00:31:13.255422+00:00","updated_at":"2026-05-18T00:31:13.255422+00:00"}