{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5UMHIG4MJWBPTZFLIJXKD7SRFK","short_pith_number":"pith:5UMHIG4M","canonical_record":{"source":{"id":"1412.6361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T14:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"cdd1accfe818964f15bcdcef24b99637b992a62674aa00495641c846b69ad7d9","abstract_canon_sha256":"2fbb163d10e278c46c46076eedfa4517af72ce9981ec5ad182e8a6c42ccaf8f8"},"schema_version":"1.0"},"canonical_sha256":"ed18741b8c4d82f9e4ab426ea1fe512abe6c8e5ef8e8d984fbcfd2d001c3489f","source":{"kind":"arxiv","id":"1412.6361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6361","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6361v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6361","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"5UMHIG4MJWBP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5UMHIG4MJWBPTZFL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5UMHIG4M","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5UMHIG4MJWBPTZFLIJXKD7SRFK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T14:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"cdd1accfe818964f15bcdcef24b99637b992a62674aa00495641c846b69ad7d9","abstract_canon_sha256":"2fbb163d10e278c46c46076eedfa4517af72ce9981ec5ad182e8a6c42ccaf8f8"},"schema_version":"1.0"},"canonical_sha256":"ed18741b8c4d82f9e4ab426ea1fe512abe6c8e5ef8e8d984fbcfd2d001c3489f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.702194Z","signature_b64":"p3j6wBzTirR8Fr4B44DXovBuEgQrd5u4K8bTsKMIAFPOn73Z0ZcjUmqK1YWX8RAxx28yIWDTTu1nXDQVwm1MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed18741b8c4d82f9e4ab426ea1fe512abe6c8e5ef8e8d984fbcfd2d001c3489f","last_reissued_at":"2026-05-18T02:30:53.701568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.701568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6361","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-18T02:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noaVNUS426GP0B3aE5d+rlrROU4lCIMJ6yXIyMw7BMii/myUbwrjXwOgdcrJm18V2NNSUaMuGnvhIZhTFXyJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:57:34.666540Z"},"content_sha256":"6b28e7119ba57071660ac842d8bbea63ec79550140a317b9f32def2f4dd351a8","schema_version":"1.0","event_id":"sha256:6b28e7119ba57071660ac842d8bbea63ec79550140a317b9f32def2f4dd351a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5UMHIG4MJWBPTZFLIJXKD7SRFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Equilibrium in Computational Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern, Rafael Pass","submitted_at":"2014-12-19T14:53:21Z","abstract_excerpt":"We examine sequential equilibrium in the context of computational games, where agents are charged for computation. In such games, an agent can rationally choose to forget, so issues of imperfect recall arise. In this setting, we consider two notions of sequential equilibrium. One is an ex ante notion, where a player chooses his strategy before the game starts and is committed to it, but chooses it in such a way that it remains optimal even off the equilibrium path. The second is an interim notion, where a player can reconsider at each information set whether he is doing the \"right\" thing, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6361","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-18T02:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1IEahG/ZV1T3mGDmqZCJ5VlOwI/NTyDJaqzE9py4XoqC5II1gvNJPUrf0skEdLap7PGNAOelARGGzrIrYE4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:57:34.667240Z"},"content_sha256":"8a0e0a7b4941d7011acdfc8fab190777f8fca59a8a2d454ba1010fb8e7ae4168","schema_version":"1.0","event_id":"sha256:8a0e0a7b4941d7011acdfc8fab190777f8fca59a8a2d454ba1010fb8e7ae4168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/bundle.json","state_url":"https://pith.science/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/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-11T07:57:34Z","links":{"resolver":"https://pith.science/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK","bundle":"https://pith.science/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/bundle.json","state":"https://pith.science/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UMHIG4MJWBPTZFLIJXKD7SRFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5UMHIG4MJWBPTZFLIJXKD7SRFK","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":"2fbb163d10e278c46c46076eedfa4517af72ce9981ec5ad182e8a6c42ccaf8f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T14:53:21Z","title_canon_sha256":"cdd1accfe818964f15bcdcef24b99637b992a62674aa00495641c846b69ad7d9"},"schema_version":"1.0","source":{"id":"1412.6361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6361","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6361v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6361","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"5UMHIG4MJWBP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5UMHIG4MJWBPTZFL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5UMHIG4M","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:8a0e0a7b4941d7011acdfc8fab190777f8fca59a8a2d454ba1010fb8e7ae4168","target":"graph","created_at":"2026-05-18T02:30: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":"We examine sequential equilibrium in the context of computational games, where agents are charged for computation. In such games, an agent can rationally choose to forget, so issues of imperfect recall arise. In this setting, we consider two notions of sequential equilibrium. One is an ex ante notion, where a player chooses his strategy before the game starts and is committed to it, but chooses it in such a way that it remains optimal even off the equilibrium path. The second is an interim notion, where a player can reconsider at each information set whether he is doing the \"right\" thing, and ","authors_text":"Joseph Y. Halpern, Rafael Pass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T14:53:21Z","title":"Sequential Equilibrium in Computational Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6361","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:6b28e7119ba57071660ac842d8bbea63ec79550140a317b9f32def2f4dd351a8","target":"record","created_at":"2026-05-18T02:30: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":"2fbb163d10e278c46c46076eedfa4517af72ce9981ec5ad182e8a6c42ccaf8f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-19T14:53:21Z","title_canon_sha256":"cdd1accfe818964f15bcdcef24b99637b992a62674aa00495641c846b69ad7d9"},"schema_version":"1.0","source":{"id":"1412.6361","kind":"arxiv","version":1}},"canonical_sha256":"ed18741b8c4d82f9e4ab426ea1fe512abe6c8e5ef8e8d984fbcfd2d001c3489f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed18741b8c4d82f9e4ab426ea1fe512abe6c8e5ef8e8d984fbcfd2d001c3489f","first_computed_at":"2026-05-18T02:30:53.701568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:53.701568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3j6wBzTirR8Fr4B44DXovBuEgQrd5u4K8bTsKMIAFPOn73Z0ZcjUmqK1YWX8RAxx28yIWDTTu1nXDQVwm1MDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:53.702194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b28e7119ba57071660ac842d8bbea63ec79550140a317b9f32def2f4dd351a8","sha256:8a0e0a7b4941d7011acdfc8fab190777f8fca59a8a2d454ba1010fb8e7ae4168"],"state_sha256":"edd1c7502a7c36f6324d493e453fdde73fb2233a8566c00c89eea9f5f49ff1c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Br9J3SMiFm+YbDxawi8Mo9FBQG74KXboIcMlAKeVFhbEFW3W3PtZ/vuLPPJe54tB/1Qkyrtr8u9KP8kDSnbGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:57:34.672309Z","bundle_sha256":"b39ecbe0ba76670c807c66c0e5111c3c0fe2bd8adc8ddd3ad4f36d485a425206"}}