{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5ZXVUC65BAA7ATDPVCAB76SYBI","short_pith_number":"pith:5ZXVUC65","canonical_record":{"source":{"id":"1205.6791","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-30T19:56:51Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR"],"title_canon_sha256":"17ca3f445e98c00cf6f0e5e170d940006bec9d4445acb036d8d5fb372bcd339b","abstract_canon_sha256":"41ec2d891e5d7c4da992594116f90e9c99d27ca4e01f094657eb8ca715cb4c29"},"schema_version":"1.0"},"canonical_sha256":"ee6f5a0bdd0801f04c6fa8801ffa580a0d7f4bb33213ea620fc94068ceafbf18","source":{"kind":"arxiv","id":"1205.6791","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6791","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6791v4","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6791","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"5ZXVUC65BAA7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5ZXVUC65BAA7ATDP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5ZXVUC65","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5ZXVUC65BAA7ATDPVCAB76SYBI","target":"record","payload":{"canonical_record":{"source":{"id":"1205.6791","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-30T19:56:51Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR"],"title_canon_sha256":"17ca3f445e98c00cf6f0e5e170d940006bec9d4445acb036d8d5fb372bcd339b","abstract_canon_sha256":"41ec2d891e5d7c4da992594116f90e9c99d27ca4e01f094657eb8ca715cb4c29"},"schema_version":"1.0"},"canonical_sha256":"ee6f5a0bdd0801f04c6fa8801ffa580a0d7f4bb33213ea620fc94068ceafbf18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:55.229377Z","signature_b64":"BBP6pm1QphF+1mpTjW3H8ot4OdyBoepuUADIEmOPYMLrFDHphR1unGdWBxgTTOmRAV3L5sF1t3D7rlK2ZbFbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee6f5a0bdd0801f04c6fa8801ffa580a0d7f4bb33213ea620fc94068ceafbf18","last_reissued_at":"2026-05-18T03:03:55.228691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:55.228691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.6791","source_version":4,"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-18T03:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3WfRSN7F+MR0zFbFDTc0wuhc+yKA+OPm39yVIfoktYi/FwZgpfeUqwCBYS7eqONC3d35J+EgCL8dBwWK5PFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:21:55.254363Z"},"content_sha256":"e8bddd190224132f71705f7a495ef4ca06e89811f1a63974c94cf10a46a53bfc","schema_version":"1.0","event_id":"sha256:e8bddd190224132f71705f7a495ef4ca06e89811f1a63974c94cf10a46a53bfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5ZXVUC65BAA7ATDPVCAB76SYBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repeated games of incomplete information with large sets of states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","math.PR"],"primary_cat":"cs.GT","authors_text":"Fedor Sandomirskiy","submitted_at":"2012-05-30T19:56:51Z","abstract_excerpt":"The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided by square root of N if the set of states K is finite. The paper deals with the case of infinite K. It turns out that for countably-supported prior distribution p with heavy tails the error term can decrease arbitrarily slowly. The slowest possible speed of the decreasing for a given p is determined in terms of entropy-like family of functionals. Our approach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6791","kind":"arxiv","version":4},"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-18T03:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjXfuD4T97ZKgFqj3dstbcwbaYiwZchXUG7Xn41vLLrgudsI7bSuK02c+cEqC8WF5R4JXNngn3hvgtScnk1bAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:21:55.254730Z"},"content_sha256":"ce041462fe8c779b31e69b5e41fe411befadf8b11cbabdc1e1c244908433ec80","schema_version":"1.0","event_id":"sha256:ce041462fe8c779b31e69b5e41fe411befadf8b11cbabdc1e1c244908433ec80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/bundle.json","state_url":"https://pith.science/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/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-03T07:21:55Z","links":{"resolver":"https://pith.science/pith/5ZXVUC65BAA7ATDPVCAB76SYBI","bundle":"https://pith.science/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/bundle.json","state":"https://pith.science/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZXVUC65BAA7ATDPVCAB76SYBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5ZXVUC65BAA7ATDPVCAB76SYBI","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":"41ec2d891e5d7c4da992594116f90e9c99d27ca4e01f094657eb8ca715cb4c29","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-30T19:56:51Z","title_canon_sha256":"17ca3f445e98c00cf6f0e5e170d940006bec9d4445acb036d8d5fb372bcd339b"},"schema_version":"1.0","source":{"id":"1205.6791","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6791","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6791v4","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6791","created_at":"2026-05-18T03:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"5ZXVUC65BAA7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5ZXVUC65BAA7ATDP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5ZXVUC65","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ce041462fe8c779b31e69b5e41fe411befadf8b11cbabdc1e1c244908433ec80","target":"graph","created_at":"2026-05-18T03:03:55Z","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":"The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided by square root of N if the set of states K is finite. The paper deals with the case of infinite K. It turns out that for countably-supported prior distribution p with heavy tails the error term can decrease arbitrarily slowly. The slowest possible speed of the decreasing for a given p is determined in terms of entropy-like family of functionals. Our approach ","authors_text":"Fedor Sandomirskiy","cross_cats":["cs.IT","math.IT","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-30T19:56:51Z","title":"Repeated games of incomplete information with large sets of states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6791","kind":"arxiv","version":4},"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:e8bddd190224132f71705f7a495ef4ca06e89811f1a63974c94cf10a46a53bfc","target":"record","created_at":"2026-05-18T03:03:55Z","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":"41ec2d891e5d7c4da992594116f90e9c99d27ca4e01f094657eb8ca715cb4c29","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-30T19:56:51Z","title_canon_sha256":"17ca3f445e98c00cf6f0e5e170d940006bec9d4445acb036d8d5fb372bcd339b"},"schema_version":"1.0","source":{"id":"1205.6791","kind":"arxiv","version":4}},"canonical_sha256":"ee6f5a0bdd0801f04c6fa8801ffa580a0d7f4bb33213ea620fc94068ceafbf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee6f5a0bdd0801f04c6fa8801ffa580a0d7f4bb33213ea620fc94068ceafbf18","first_computed_at":"2026-05-18T03:03:55.228691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:55.228691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBP6pm1QphF+1mpTjW3H8ot4OdyBoepuUADIEmOPYMLrFDHphR1unGdWBxgTTOmRAV3L5sF1t3D7rlK2ZbFbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:55.229377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6791","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8bddd190224132f71705f7a495ef4ca06e89811f1a63974c94cf10a46a53bfc","sha256:ce041462fe8c779b31e69b5e41fe411befadf8b11cbabdc1e1c244908433ec80"],"state_sha256":"79729fafb83e02a5e56051d353f90cd8b47aafb2247dbe4bff5fb8eec1fe8520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzsaIRsoRqteaA2ujfXKKHvHnyDN+Qg7yMD7N4h5GtNWfSdHbbyZo9RpRzp2jKdeKVZT1Xf38JXYzWe2bVVVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:21:55.256678Z","bundle_sha256":"25e45b0f8cb08706f96298237158d62c2bff642550be330d0eddf32ddc8fd2c0"}}