{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5KXCJZX5PTF4EXUQUXVORVCP5I","short_pith_number":"pith:5KXCJZX5","canonical_record":{"source":{"id":"1206.6855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-27T16:25:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a0349ce4fa525a34f7e14f97b5eff40853bb9b60318b0608d6126c32a1299b3","abstract_canon_sha256":"5640f0095003ec9450319e41f750fa91d6c23c06e53a42c314b7d24c3d6615ae"},"schema_version":"1.0"},"canonical_sha256":"eaae24e6fd7ccbc25e90a5eae8d44fea380bef9e6f5808f74dba6059007dc006","source":{"kind":"arxiv","id":"1206.6855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6855","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6855v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6855","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"5KXCJZX5PTF4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5KXCJZX5PTF4EXUQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5KXCJZX5","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5KXCJZX5PTF4EXUQUXVORVCP5I","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-27T16:25:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a0349ce4fa525a34f7e14f97b5eff40853bb9b60318b0608d6126c32a1299b3","abstract_canon_sha256":"5640f0095003ec9450319e41f750fa91d6c23c06e53a42c314b7d24c3d6615ae"},"schema_version":"1.0"},"canonical_sha256":"eaae24e6fd7ccbc25e90a5eae8d44fea380bef9e6f5808f74dba6059007dc006","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.506015Z","signature_b64":"ZA6YQwsMWa5fx12l2XW2ILReKqCxzzZrU8iQxAT2TmezFC/I/IeLXhw+L6owCcR6dBvuyrcqgsrotl2yblXfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaae24e6fd7ccbc25e90a5eae8d44fea380bef9e6f5808f74dba6059007dc006","last_reissued_at":"2026-05-18T03:52:15.505179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.505179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6855","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTTNuon+JI+p4PerNclxDZV906QPvfd7OiQJ5oxV7AeZDf39MickNfrm/YqLYVLhXW5bdhmw06SpRWZkTAkrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:55:37.556138Z"},"content_sha256":"5d2b92bf50cb655cf0aa9789c5af603b354c473df8649f084219621aeed92de0","schema_version":"1.0","event_id":"sha256:5d2b92bf50cb655cf0aa9789c5af603b354c473df8649f084219621aeed92de0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5KXCJZX5PTF4EXUQUXVORVCP5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arjun Talwar, Martin Zinkevich, Michael L. Littman, Nishkam Ravi","submitted_at":"2012-06-27T16:25:57Z","abstract_excerpt":"Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games admit a simple bottom-up algorithm for finding subgame perfect Nash equilibria efficiently. However, such an algorithm can fail to identify optimal equilibria, such as those that maximize social welfare. The reason is that, counterintuitively, probabilistic action choices are sometimes needed to achieve maximum payoffs. We provide a novel polynomial-time algorithm for this problem that explicitly reasons about stoch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6855","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yufy0EJoYBzXg+3GShkkMV3N8t0zbiufSuqMrbvnI04ulShD45FXgWxcUyvKcpbmM7eXBGUeuSqCgBxwTGBgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:55:37.556502Z"},"content_sha256":"9ee18ba22a3c7942c3f19c71aed44fb32349f3f71f0d11bc3ca3db92755f1b11","schema_version":"1.0","event_id":"sha256:9ee18ba22a3c7942c3f19c71aed44fb32349f3f71f0d11bc3ca3db92755f1b11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/bundle.json","state_url":"https://pith.science/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/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-03T17:55:37Z","links":{"resolver":"https://pith.science/pith/5KXCJZX5PTF4EXUQUXVORVCP5I","bundle":"https://pith.science/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/bundle.json","state":"https://pith.science/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KXCJZX5PTF4EXUQUXVORVCP5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5KXCJZX5PTF4EXUQUXVORVCP5I","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":"5640f0095003ec9450319e41f750fa91d6c23c06e53a42c314b7d24c3d6615ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-27T16:25:57Z","title_canon_sha256":"3a0349ce4fa525a34f7e14f97b5eff40853bb9b60318b0608d6126c32a1299b3"},"schema_version":"1.0","source":{"id":"1206.6855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6855","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6855v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6855","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"5KXCJZX5PTF4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5KXCJZX5PTF4EXUQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5KXCJZX5","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:9ee18ba22a3c7942c3f19c71aed44fb32349f3f71f0d11bc3ca3db92755f1b11","target":"graph","created_at":"2026-05-18T03:52:15Z","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":"Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games admit a simple bottom-up algorithm for finding subgame perfect Nash equilibria efficiently. However, such an algorithm can fail to identify optimal equilibria, such as those that maximize social welfare. The reason is that, counterintuitively, probabilistic action choices are sometimes needed to achieve maximum payoffs. We provide a novel polynomial-time algorithm for this problem that explicitly reasons about stoch","authors_text":"Arjun Talwar, Martin Zinkevich, Michael L. Littman, Nishkam Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-27T16:25:57Z","title":"An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6855","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:5d2b92bf50cb655cf0aa9789c5af603b354c473df8649f084219621aeed92de0","target":"record","created_at":"2026-05-18T03:52:15Z","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":"5640f0095003ec9450319e41f750fa91d6c23c06e53a42c314b7d24c3d6615ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-27T16:25:57Z","title_canon_sha256":"3a0349ce4fa525a34f7e14f97b5eff40853bb9b60318b0608d6126c32a1299b3"},"schema_version":"1.0","source":{"id":"1206.6855","kind":"arxiv","version":1}},"canonical_sha256":"eaae24e6fd7ccbc25e90a5eae8d44fea380bef9e6f5808f74dba6059007dc006","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaae24e6fd7ccbc25e90a5eae8d44fea380bef9e6f5808f74dba6059007dc006","first_computed_at":"2026-05-18T03:52:15.505179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.505179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZA6YQwsMWa5fx12l2XW2ILReKqCxzzZrU8iQxAT2TmezFC/I/IeLXhw+L6owCcR6dBvuyrcqgsrotl2yblXfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.506015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d2b92bf50cb655cf0aa9789c5af603b354c473df8649f084219621aeed92de0","sha256:9ee18ba22a3c7942c3f19c71aed44fb32349f3f71f0d11bc3ca3db92755f1b11"],"state_sha256":"88c1376a0828b171d21af59b56532b9785cb8f95471cd774798b0fcd0b4eb19d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjUS6XjJrC8CWsDIKbZGUhpF0NxEOGoxCulPNzORhg/4+kf0DMlwegTATQw22e+AmRwQOhowwXRS/3MhH2eMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:55:37.558430Z","bundle_sha256":"0c8a016b9d10410fbac10965892d2815e3481c6016b7bdc87826ec8b7b098d93"}}