{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:53AFVJWZT332RN6XOOH63NKABV","short_pith_number":"pith:53AFVJWZ","canonical_record":{"source":{"id":"1706.00849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-02T20:45:27Z","cross_cats_sorted":["cs.GT","q-fin.EC"],"title_canon_sha256":"4396c05e74c4702c43f078a2cd5e08232c61ab4ef976fd7b4a26f7db4c71efd6","abstract_canon_sha256":"aece50cc2e5473d8c0779e43be8f996f06f57cfa726024274ab295a698f85b20"},"schema_version":"1.0"},"canonical_sha256":"eec05aa6d99ef7a8b7d7738fedb5400d74e52216c639c51f49380d12a308b12d","source":{"kind":"arxiv","id":"1706.00849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00849","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00849v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00849","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"53AFVJWZT332","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"53AFVJWZT332RN6X","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"53AFVJWZ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:53AFVJWZT332RN6XOOH63NKABV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-02T20:45:27Z","cross_cats_sorted":["cs.GT","q-fin.EC"],"title_canon_sha256":"4396c05e74c4702c43f078a2cd5e08232c61ab4ef976fd7b4a26f7db4c71efd6","abstract_canon_sha256":"aece50cc2e5473d8c0779e43be8f996f06f57cfa726024274ab295a698f85b20"},"schema_version":"1.0"},"canonical_sha256":"eec05aa6d99ef7a8b7d7738fedb5400d74e52216c639c51f49380d12a308b12d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.735409Z","signature_b64":"7fv6PEoLv7I6Smk6qsKqa8ZrnW/dW2N0AXcJIHNE7g7cloraekBMS/rGiI1pg8FK6wjYMg/LHGmIEefHKJXBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eec05aa6d99ef7a8b7d7738fedb5400d74e52216c639c51f49380d12a308b12d","last_reissued_at":"2026-05-18T00:02:45.735006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.735006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00849","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GebBgQ1XpP+ebHsZ+LtGMVzjWD0ku144S7QadzGkvJJ9mm6ZX7j0YbmGpcX5sAoLhACBfUF0qwGH7HMvfcGGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:29:39.360805Z"},"content_sha256":"900a0f1724ca151a2c709ca8eca2ec93fbadbad4a6d860dda3ce68657ea5f42b","schema_version":"1.0","event_id":"sha256:900a0f1724ca151a2c709ca8eca2ec93fbadbad4a6d860dda3ce68657ea5f42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:53AFVJWZT332RN6XOOH63NKABV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Game of Nontransitive Dice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","q-fin.EC"],"primary_cat":"math.PR","authors_text":"Artem Hulko, Mark Whitmeyer","submitted_at":"2017-06-02T20:45:27Z","abstract_excerpt":"We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard $n$-sided die, where each side has a different number. Our proof of uniqueness is constructive. We introduce an algorithm with which, for any nonstandard die, we may generate another die that beats it."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00849","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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI3ZHaUMNPTY6ZZDcwrDt9vRFNthw1TxIs2qst+buV82r7zSHcjr1Vxyq+9cltvwKqGe5bjK5oQ9V0OPcFzACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:29:39.361163Z"},"content_sha256":"ab77dc2dcd7ec60a81d0bfd5b494aa1051f5313a491cba1046318e0021cc0cc9","schema_version":"1.0","event_id":"sha256:ab77dc2dcd7ec60a81d0bfd5b494aa1051f5313a491cba1046318e0021cc0cc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53AFVJWZT332RN6XOOH63NKABV/bundle.json","state_url":"https://pith.science/pith/53AFVJWZT332RN6XOOH63NKABV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53AFVJWZT332RN6XOOH63NKABV/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-07-03T13:29:39Z","links":{"resolver":"https://pith.science/pith/53AFVJWZT332RN6XOOH63NKABV","bundle":"https://pith.science/pith/53AFVJWZT332RN6XOOH63NKABV/bundle.json","state":"https://pith.science/pith/53AFVJWZT332RN6XOOH63NKABV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53AFVJWZT332RN6XOOH63NKABV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:53AFVJWZT332RN6XOOH63NKABV","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":"aece50cc2e5473d8c0779e43be8f996f06f57cfa726024274ab295a698f85b20","cross_cats_sorted":["cs.GT","q-fin.EC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-02T20:45:27Z","title_canon_sha256":"4396c05e74c4702c43f078a2cd5e08232c61ab4ef976fd7b4a26f7db4c71efd6"},"schema_version":"1.0","source":{"id":"1706.00849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00849","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00849v2","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00849","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"53AFVJWZT332","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"53AFVJWZT332RN6X","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"53AFVJWZ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:ab77dc2dcd7ec60a81d0bfd5b494aa1051f5313a491cba1046318e0021cc0cc9","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard $n$-sided die, where each side has a different number. Our proof of uniqueness is constructive. We introduce an algorithm with which, for any nonstandard die, we may generate another die that beats it.","authors_text":"Artem Hulko, Mark Whitmeyer","cross_cats":["cs.GT","q-fin.EC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-02T20:45:27Z","title":"A Game of Nontransitive Dice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00849","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:900a0f1724ca151a2c709ca8eca2ec93fbadbad4a6d860dda3ce68657ea5f42b","target":"record","created_at":"2026-05-18T00:02:45Z","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":"aece50cc2e5473d8c0779e43be8f996f06f57cfa726024274ab295a698f85b20","cross_cats_sorted":["cs.GT","q-fin.EC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-06-02T20:45:27Z","title_canon_sha256":"4396c05e74c4702c43f078a2cd5e08232c61ab4ef976fd7b4a26f7db4c71efd6"},"schema_version":"1.0","source":{"id":"1706.00849","kind":"arxiv","version":2}},"canonical_sha256":"eec05aa6d99ef7a8b7d7738fedb5400d74e52216c639c51f49380d12a308b12d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eec05aa6d99ef7a8b7d7738fedb5400d74e52216c639c51f49380d12a308b12d","first_computed_at":"2026-05-18T00:02:45.735006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.735006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7fv6PEoLv7I6Smk6qsKqa8ZrnW/dW2N0AXcJIHNE7g7cloraekBMS/rGiI1pg8FK6wjYMg/LHGmIEefHKJXBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.735409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:900a0f1724ca151a2c709ca8eca2ec93fbadbad4a6d860dda3ce68657ea5f42b","sha256:ab77dc2dcd7ec60a81d0bfd5b494aa1051f5313a491cba1046318e0021cc0cc9"],"state_sha256":"740ff3fefbbcc6f50678caa92ccc61c8f6573bc0bacc8467ac58ade4dec81bf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7gNv0w8kHOvIirgAlJWJZsM30klUVa/ls2peniT8MXr83bRYwCwbkTvgY2UL5ozoZhbe3V3rB7FFuf5yqVtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:29:39.363145Z","bundle_sha256":"d892dc601622a262271349cd23cfbfe403e51bb8d834c4d7d960051d6b8e1d16"}}