{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V5WAMP5VQC3OQIFAGYTZWK2EFW","short_pith_number":"pith:V5WAMP5V","canonical_record":{"source":{"id":"1705.09326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-25T18:53:47Z","cross_cats_sorted":[],"title_canon_sha256":"9acfea13516f9bfc315554f41be39a3a5310118beaf4ecdc1ebe2fb0c581c5f5","abstract_canon_sha256":"7c0a01475d5fec53a3a32a072485cbad59f1d0d8184070a2fa65f0fc665dc049"},"schema_version":"1.0"},"canonical_sha256":"af6c063fb580b6e820a036279b2b442d8cb1c2b8a1857eede9a468a7e21884c8","source":{"kind":"arxiv","id":"1705.09326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09326","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09326v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09326","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"V5WAMP5VQC3O","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5WAMP5VQC3OQIFA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5WAMP5V","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V5WAMP5VQC3OQIFAGYTZWK2EFW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-25T18:53:47Z","cross_cats_sorted":[],"title_canon_sha256":"9acfea13516f9bfc315554f41be39a3a5310118beaf4ecdc1ebe2fb0c581c5f5","abstract_canon_sha256":"7c0a01475d5fec53a3a32a072485cbad59f1d0d8184070a2fa65f0fc665dc049"},"schema_version":"1.0"},"canonical_sha256":"af6c063fb580b6e820a036279b2b442d8cb1c2b8a1857eede9a468a7e21884c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.998898Z","signature_b64":"IaqyS7Qa2RTp9zCDBS32nGauTcpu9ot01LZKd4WYb9zzUtwj9sbU7u0i0NPoVYuYAxVy635I0thgnGk+iBBKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af6c063fb580b6e820a036279b2b442d8cb1c2b8a1857eede9a468a7e21884c8","last_reissued_at":"2026-05-18T00:43:38.998437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.998437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09326","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiE1LyR3Uw8eTY2xvpmgKr0vd+AvyYXGtAyi+18LH9+L7XBhRVqUsTVpNjyF8U2FXNr/jEBp546+mW/caOTdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:18:15.383450Z"},"content_sha256":"f2cf70189c898bd709fbf3a561523f544d5ae119b5357b91e0dc0fc55e057ad0","schema_version":"1.0","event_id":"sha256:f2cf70189c898bd709fbf3a561523f544d5ae119b5357b91e0dc0fc55e057ad0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V5WAMP5VQC3OQIFAGYTZWK2EFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothing Method for Approximate Extensive-Form Perfect Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","submitted_at":"2017-05-25T18:53:47Z","abstract_excerpt":"Nash equilibrium is a popular solution concept for solving imperfect-information games in practice. However, it has a major drawback: it does not preclude suboptimal play in branches of the game tree that are not reached in equilibrium. Equilibrium refinements can mend this issue, but have experienced little practical adoption. This is largely due to a lack of scalable algorithms.\n  Sparse iterative methods, in particular first-order methods, are known to be among the most effective algorithms for computing Nash equilibria in large-scale two-player zero-sum extensive-form games. In this paper,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09326","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEap+ls1HTOlg94U1MPiUwGKRDKtNu5nWMm83Phs6EGAQ6A45B4YqIfLkUvZrq48nDWW9eXeY5cOSXwBmRPNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:18:15.384098Z"},"content_sha256":"edbdbfa4bb7f3fa7d8e65f4859db03e4a8a1704a03fbceec83bd75754696b000","schema_version":"1.0","event_id":"sha256:edbdbfa4bb7f3fa7d8e65f4859db03e4a8a1704a03fbceec83bd75754696b000"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/bundle.json","state_url":"https://pith.science/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/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-28T13:18:15Z","links":{"resolver":"https://pith.science/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW","bundle":"https://pith.science/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/bundle.json","state":"https://pith.science/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5WAMP5VQC3OQIFAGYTZWK2EFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V5WAMP5VQC3OQIFAGYTZWK2EFW","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":"7c0a01475d5fec53a3a32a072485cbad59f1d0d8184070a2fa65f0fc665dc049","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-25T18:53:47Z","title_canon_sha256":"9acfea13516f9bfc315554f41be39a3a5310118beaf4ecdc1ebe2fb0c581c5f5"},"schema_version":"1.0","source":{"id":"1705.09326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09326","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09326v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09326","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"V5WAMP5VQC3O","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5WAMP5VQC3OQIFA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5WAMP5V","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:edbdbfa4bb7f3fa7d8e65f4859db03e4a8a1704a03fbceec83bd75754696b000","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"Nash equilibrium is a popular solution concept for solving imperfect-information games in practice. However, it has a major drawback: it does not preclude suboptimal play in branches of the game tree that are not reached in equilibrium. Equilibrium refinements can mend this issue, but have experienced little practical adoption. This is largely due to a lack of scalable algorithms.\n  Sparse iterative methods, in particular first-order methods, are known to be among the most effective algorithms for computing Nash equilibria in large-scale two-player zero-sum extensive-form games. In this paper,","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-25T18:53:47Z","title":"Smoothing Method for Approximate Extensive-Form Perfect Equilibrium"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09326","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:f2cf70189c898bd709fbf3a561523f544d5ae119b5357b91e0dc0fc55e057ad0","target":"record","created_at":"2026-05-18T00:43:38Z","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":"7c0a01475d5fec53a3a32a072485cbad59f1d0d8184070a2fa65f0fc665dc049","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-25T18:53:47Z","title_canon_sha256":"9acfea13516f9bfc315554f41be39a3a5310118beaf4ecdc1ebe2fb0c581c5f5"},"schema_version":"1.0","source":{"id":"1705.09326","kind":"arxiv","version":1}},"canonical_sha256":"af6c063fb580b6e820a036279b2b442d8cb1c2b8a1857eede9a468a7e21884c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af6c063fb580b6e820a036279b2b442d8cb1c2b8a1857eede9a468a7e21884c8","first_computed_at":"2026-05-18T00:43:38.998437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.998437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IaqyS7Qa2RTp9zCDBS32nGauTcpu9ot01LZKd4WYb9zzUtwj9sbU7u0i0NPoVYuYAxVy635I0thgnGk+iBBKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.998898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2cf70189c898bd709fbf3a561523f544d5ae119b5357b91e0dc0fc55e057ad0","sha256:edbdbfa4bb7f3fa7d8e65f4859db03e4a8a1704a03fbceec83bd75754696b000"],"state_sha256":"5da650f40bee893ce113356ca210ae1bd6c111e460b830a25ae80560d13917a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYN7N5QTLB0HA2CSJPgK5+108dDohlwrVHZ9o23xQlilGyqh2X56XLxl8bvYngs4FZr82Tjp3Xy0IyI7mKxtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:18:15.387259Z","bundle_sha256":"45b552f359626bce29f48355ec8f8d22e31f892568a4f21d43c0ec517b266acc"}}