{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CQRNUB4A6B6X6HR3NKMV27SUZ7","short_pith_number":"pith:CQRNUB4A","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"},"canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","source":{"kind":"arxiv","id":"1703.01952","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01952","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01952v2","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01952","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"CQRNUB4A6B6X","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CQRNUB4A6B6X6HR3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CQRNUB4A","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CQRNUB4A6B6X6HR3NKMV27SUZ7","target":"record","payload":{"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"},"canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","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"},"source_kind":"arxiv","source_id":"1703.01952","source_version":2,"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-18T00:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tC98monHgj+r71ZA1ABmKffvoe959RniTVljYT9CBavRx8CGI+VMKeVRt18KNdXb0bfPUXCyZC+Ph59bmPpGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:27:18.336609Z"},"content_sha256":"56706449c3bb991465d5b09f68b031950a0e472625ea967c9a7118d8f2c8bf76","schema_version":"1.0","event_id":"sha256:56706449c3bb991465d5b09f68b031950a0e472625ea967c9a7118d8f2c8bf76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CQRNUB4A6B6X6HR3NKMV27SUZ7","target":"graph","payload":{"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"},"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-18T00:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn2xClJ1z+/L0iDAq67734IFqmchI65ajKb2bEaZDRlqlSLLzjILHxT4oTkW4JPXHxqakeN5kGPvjqnOjgS3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:27:18.337271Z"},"content_sha256":"dfa620c61b0ba2d7635e2381452d27c5d8af9be1366981d50606f73bad00a9d8","schema_version":"1.0","event_id":"sha256:dfa620c61b0ba2d7635e2381452d27c5d8af9be1366981d50606f73bad00a9d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/bundle.json","state_url":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/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-23T19:27:18Z","links":{"resolver":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7","bundle":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/bundle.json","state":"https://pith.science/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQRNUB4A6B6X6HR3NKMV27SUZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CQRNUB4A6B6X6HR3NKMV27SUZ7","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":"3d0b45b2b74a141185a825c4b447ef0566c9c7dc77c093947c3822f635d00bf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-06T16:23:50Z","title_canon_sha256":"a657fe59b7784f242eb0881a791e916fa8d4216514b70dfbdabdc153e4dd7947"},"schema_version":"1.0","source":{"id":"1703.01952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01952","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01952v2","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01952","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"CQRNUB4A6B6X","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CQRNUB4A6B6X6HR3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CQRNUB4A","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:dfa620c61b0ba2d7635e2381452d27c5d8af9be1366981d50606f73bad00a9d8","target":"graph","created_at":"2026-05-18T00:31:13Z","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":"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","authors_text":"Jeff S. Shamma, Lichun Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-06T16:23:50Z","title":"Efficient Strategy Computation in Zero-Sum Asymmetric Repeated Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01952","kind":"arxiv","version":2},"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:56706449c3bb991465d5b09f68b031950a0e472625ea967c9a7118d8f2c8bf76","target":"record","created_at":"2026-05-18T00:31:13Z","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":"3d0b45b2b74a141185a825c4b447ef0566c9c7dc77c093947c3822f635d00bf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-06T16:23:50Z","title_canon_sha256":"a657fe59b7784f242eb0881a791e916fa8d4216514b70dfbdabdc153e4dd7947"},"schema_version":"1.0","source":{"id":"1703.01952","kind":"arxiv","version":2}},"canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1422da0780f07d7f1e3b6a995d7e54cfd033e284f9ac9bec9118eba596ed64c5","first_computed_at":"2026-05-18T00:31:13.255293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:13.255293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nq1zoGnRwDS5xsyntp4ELk4ymynBZyBlb1s0AigPFCzFb2QvgreEu87lMXoUSzKgbyoVSh3rqlGMbtWtLR1xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:13.256101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56706449c3bb991465d5b09f68b031950a0e472625ea967c9a7118d8f2c8bf76","sha256:dfa620c61b0ba2d7635e2381452d27c5d8af9be1366981d50606f73bad00a9d8"],"state_sha256":"3124f4c02ce5afee78c1073db95e033fb68c34f011d9719d45930066bae565aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPlTCQMj1V7rHkfvXsPAwOmxz4ikw4RH7XA+MGzZbd8g47n/sxA3Cf8qCehm8YSlvP9n0OHQ1hocfW/clYCEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:27:18.340293Z","bundle_sha256":"29420caca7b3295431ed22903760b5d7097814d10d27107f84ddb4f2e697bf26"}}