{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RZK42JWMGIJYAVWOIGHXFFJKIB","short_pith_number":"pith:RZK42JWM","canonical_record":{"source":{"id":"1206.1751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-08T12:54:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e49c3b2326ca15dd44a6cc9f63b898f7d30f9629eb95f77cbab37a011bf742a6","abstract_canon_sha256":"ae9eb62cb15ba5a8a7b49cdf3e509a75a273b4cf047f5a661ebfbf18609d56f0"},"schema_version":"1.0"},"canonical_sha256":"8e55cd26cc32138056ce418f72952a40473b1d68c75b49703b61bee9d2eefafd","source":{"kind":"arxiv","id":"1206.1751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1751","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1751v1","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1751","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"RZK42JWMGIJY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RZK42JWMGIJYAVWO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RZK42JWM","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RZK42JWMGIJYAVWOIGHXFFJKIB","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-08T12:54:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e49c3b2326ca15dd44a6cc9f63b898f7d30f9629eb95f77cbab37a011bf742a6","abstract_canon_sha256":"ae9eb62cb15ba5a8a7b49cdf3e509a75a273b4cf047f5a661ebfbf18609d56f0"},"schema_version":"1.0"},"canonical_sha256":"8e55cd26cc32138056ce418f72952a40473b1d68c75b49703b61bee9d2eefafd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:53.969003Z","signature_b64":"lSmHE3VUIhe983kQ/sLbGuOzQoTkcteMMeEJouuLAnjhlReIjfXBcYt+MN/8tfhz9wCcqpy0wA28bGuQAKGwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e55cd26cc32138056ce418f72952a40473b1d68c75b49703b61bee9d2eefafd","last_reissued_at":"2026-05-18T03:53:53.968391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:53.968391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1751","source_version":1,"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6HS14aulqYpWJDWuJccvxpim7bsNKRtTum7lfLomf2LoZkGx7Rq1n1kj5V0UdCJekq7+J+v43wAtzUkIOxsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:48:34.322187Z"},"content_sha256":"44e474bd6342d9defed9f14a4d048d25dd4f42f3b30c20d3765190e7b450cd21","schema_version":"1.0","event_id":"sha256:44e474bd6342d9defed9f14a4d048d25dd4f42f3b30c20d3765190e7b450cd21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RZK42JWMGIJYAVWOIGHXFFJKIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Patience of Matrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DM","authors_text":"Elias Tsigaridas, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii","submitted_at":"2012-06-08T12:54:06Z","abstract_excerpt":"For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for nxn win-lose-draw games (i.e. (-1,0,1) matrix games) nonzero probabilities smaller than n^{-O(n)} are never needed. We also construct an explicit nxn win-lose game such that the unique optimal strategy uses a nonzero probability as small as n^{-Omega(n)}. This is done by constructing an explicit (-1,1) nonsingular nxn matrix, for which the inverse has only nonnegative entries and where some of the entries are of value n^{Omega(n)}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1751","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":""},"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:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFZLLl94RQwCuCAZx0QmlL9ELeDw0UXvnWkD1xG2qy2mkHoI55R7l4Dvd4SW3gXojzMP5KZk+HhPzo3oiLOdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:48:34.322584Z"},"content_sha256":"b177bb2ef876db60bbbf46316b4607e2ee562e9e114b5d8df150d5983b317f68","schema_version":"1.0","event_id":"sha256:b177bb2ef876db60bbbf46316b4607e2ee562e9e114b5d8df150d5983b317f68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/bundle.json","state_url":"https://pith.science/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/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-05-28T16:48:34Z","links":{"resolver":"https://pith.science/pith/RZK42JWMGIJYAVWOIGHXFFJKIB","bundle":"https://pith.science/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/bundle.json","state":"https://pith.science/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZK42JWMGIJYAVWOIGHXFFJKIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RZK42JWMGIJYAVWOIGHXFFJKIB","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":"ae9eb62cb15ba5a8a7b49cdf3e509a75a273b4cf047f5a661ebfbf18609d56f0","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-08T12:54:06Z","title_canon_sha256":"e49c3b2326ca15dd44a6cc9f63b898f7d30f9629eb95f77cbab37a011bf742a6"},"schema_version":"1.0","source":{"id":"1206.1751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1751","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1751v1","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1751","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"RZK42JWMGIJY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RZK42JWMGIJYAVWO","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RZK42JWM","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:b177bb2ef876db60bbbf46316b4607e2ee562e9e114b5d8df150d5983b317f68","target":"graph","created_at":"2026-05-18T03:53:53Z","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":"For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for nxn win-lose-draw games (i.e. (-1,0,1) matrix games) nonzero probabilities smaller than n^{-O(n)} are never needed. We also construct an explicit nxn win-lose game such that the unique optimal strategy uses a nonzero probability as small as n^{-Omega(n)}. This is done by constructing an explicit (-1,1) nonsingular nxn matrix, for which the inverse has only nonnegative entries and where some of the entries are of value n^{Omega(n)}.","authors_text":"Elias Tsigaridas, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-08T12:54:06Z","title":"Patience of Matrix Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1751","kind":"arxiv","version":1},"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:44e474bd6342d9defed9f14a4d048d25dd4f42f3b30c20d3765190e7b450cd21","target":"record","created_at":"2026-05-18T03:53:53Z","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":"ae9eb62cb15ba5a8a7b49cdf3e509a75a273b4cf047f5a661ebfbf18609d56f0","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-08T12:54:06Z","title_canon_sha256":"e49c3b2326ca15dd44a6cc9f63b898f7d30f9629eb95f77cbab37a011bf742a6"},"schema_version":"1.0","source":{"id":"1206.1751","kind":"arxiv","version":1}},"canonical_sha256":"8e55cd26cc32138056ce418f72952a40473b1d68c75b49703b61bee9d2eefafd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e55cd26cc32138056ce418f72952a40473b1d68c75b49703b61bee9d2eefafd","first_computed_at":"2026-05-18T03:53:53.968391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:53.968391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lSmHE3VUIhe983kQ/sLbGuOzQoTkcteMMeEJouuLAnjhlReIjfXBcYt+MN/8tfhz9wCcqpy0wA28bGuQAKGwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:53.969003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44e474bd6342d9defed9f14a4d048d25dd4f42f3b30c20d3765190e7b450cd21","sha256:b177bb2ef876db60bbbf46316b4607e2ee562e9e114b5d8df150d5983b317f68"],"state_sha256":"4e09e315717f802f64b65107e24c3309fa4ed87de1bfa3aaddc3a8b0cf011c5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcSoBlanf+bFATAD9Fuc/O9hchL1jh4fDd+cInDWunIRHlxOTEz+/mBniUdIGaVX7RJzvS0hytwcW2cg8hIeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:48:34.325054Z","bundle_sha256":"32bbdc9922e9c05c525cc856f62568ce1d1f3aff37d351130c9edebd7a2b5b5d"}}