{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FKC2A2X2LUCXM7B5CW2VXBSANQ","short_pith_number":"pith:FKC2A2X2","canonical_record":{"source":{"id":"1811.01933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2018-11-04T14:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"f5f4a32971c98c20f76f714106c8c4198ce3446828c7ee5cd42506c27b81c21b","abstract_canon_sha256":"8e1b599cb7998ecdf847d3bcd193e49de82be06bcb68f43291718338248936e6"},"schema_version":"1.0"},"canonical_sha256":"2a85a06afa5d05767c3d15b55b86406c11ae60530db92ade139abf14deb94971","source":{"kind":"arxiv","id":"1811.01933","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01933","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01933v1","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01933","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"FKC2A2X2LUCX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FKC2A2X2LUCXM7B5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FKC2A2X2","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FKC2A2X2LUCXM7B5CW2VXBSANQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2018-11-04T14:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"f5f4a32971c98c20f76f714106c8c4198ce3446828c7ee5cd42506c27b81c21b","abstract_canon_sha256":"8e1b599cb7998ecdf847d3bcd193e49de82be06bcb68f43291718338248936e6"},"schema_version":"1.0"},"canonical_sha256":"2a85a06afa5d05767c3d15b55b86406c11ae60530db92ade139abf14deb94971","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:32.675001Z","signature_b64":"Vy0cwOqASp6cL2U0LE14w/KfRd5w7paRYBzGt50fIhPwwMeAM8/VdFs+TVzDY4g4iJidstLiTYCv4Gi907ggCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a85a06afa5d05767c3d15b55b86406c11ae60530db92ade139abf14deb94971","last_reissued_at":"2026-05-18T00:01:32.674586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:32.674586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01933","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:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bp5PUXNN9qlBT64GjpCyYZEEpB2bLQyUsM47Ex06vICDnuhTnHP1HK3jtIcyrhueF1Txp7pOwPR703btiwLODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:11:32.521809Z"},"content_sha256":"e0b534cca150804a30715b61b87bc3aa16f3beea1f7adcdf2175467bbb176813","schema_version":"1.0","event_id":"sha256:e0b534cca150804a30715b61b87bc3aa16f3beea1f7adcdf2175467bbb176813"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FKC2A2X2LUCXM7B5CW2VXBSANQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing Permissibility, Proper Rationalizability, and Iterated Admissibility by Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Shuige Liu","submitted_at":"2018-11-04T14:10:48Z","abstract_excerpt":"We characterize three interrelated concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model for a game with incomplete information. Based on it, we give two groups of characterizations. The first group characterizes permissibility and proper rationalizability. The second group characterizes permissibility in an alternative way and iterated admissibility. In each group, the conditions for the latter are stronger than those for the former, which corresponds to the fact that proper rationalizability and it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01933","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:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vPn/2JhyvacmwsH+//4RK8AapJ3HVUTWBFkXpkyIhE2ndXe8kWGrm/cQnQNKzaa++2VAPUGA613bZzTThrsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:11:32.522576Z"},"content_sha256":"f383e9dc61cb35534ac7c0fddaf28d788c0923e219c31e2e5670404220ea6a5b","schema_version":"1.0","event_id":"sha256:f383e9dc61cb35534ac7c0fddaf28d788c0923e219c31e2e5670404220ea6a5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/bundle.json","state_url":"https://pith.science/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/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-09T17:11:32Z","links":{"resolver":"https://pith.science/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ","bundle":"https://pith.science/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/bundle.json","state":"https://pith.science/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKC2A2X2LUCXM7B5CW2VXBSANQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FKC2A2X2LUCXM7B5CW2VXBSANQ","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":"8e1b599cb7998ecdf847d3bcd193e49de82be06bcb68f43291718338248936e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2018-11-04T14:10:48Z","title_canon_sha256":"f5f4a32971c98c20f76f714106c8c4198ce3446828c7ee5cd42506c27b81c21b"},"schema_version":"1.0","source":{"id":"1811.01933","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01933","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01933v1","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01933","created_at":"2026-05-18T00:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"FKC2A2X2LUCX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FKC2A2X2LUCXM7B5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FKC2A2X2","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f383e9dc61cb35534ac7c0fddaf28d788c0923e219c31e2e5670404220ea6a5b","target":"graph","created_at":"2026-05-18T00:01:32Z","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 characterize three interrelated concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model for a game with incomplete information. Based on it, we give two groups of characterizations. The first group characterizes permissibility and proper rationalizability. The second group characterizes permissibility in an alternative way and iterated admissibility. In each group, the conditions for the latter are stronger than those for the former, which corresponds to the fact that proper rationalizability and it","authors_text":"Shuige Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2018-11-04T14:10:48Z","title":"Characterizing Permissibility, Proper Rationalizability, and Iterated Admissibility by Incomplete Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01933","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:e0b534cca150804a30715b61b87bc3aa16f3beea1f7adcdf2175467bbb176813","target":"record","created_at":"2026-05-18T00:01:32Z","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":"8e1b599cb7998ecdf847d3bcd193e49de82be06bcb68f43291718338248936e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2018-11-04T14:10:48Z","title_canon_sha256":"f5f4a32971c98c20f76f714106c8c4198ce3446828c7ee5cd42506c27b81c21b"},"schema_version":"1.0","source":{"id":"1811.01933","kind":"arxiv","version":1}},"canonical_sha256":"2a85a06afa5d05767c3d15b55b86406c11ae60530db92ade139abf14deb94971","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a85a06afa5d05767c3d15b55b86406c11ae60530db92ade139abf14deb94971","first_computed_at":"2026-05-18T00:01:32.674586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:32.674586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vy0cwOqASp6cL2U0LE14w/KfRd5w7paRYBzGt50fIhPwwMeAM8/VdFs+TVzDY4g4iJidstLiTYCv4Gi907ggCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:32.675001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01933","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0b534cca150804a30715b61b87bc3aa16f3beea1f7adcdf2175467bbb176813","sha256:f383e9dc61cb35534ac7c0fddaf28d788c0923e219c31e2e5670404220ea6a5b"],"state_sha256":"7f057cac5f041fb2b79763d5d903a3c2b9c476c22d3883fb6168e583b09a4729"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OsBeicYekybe70+Ma08bGqw4YoPqPLcXeVdKFejPB/GhfT4kqaITHD6WTsgYwZA9fPcW/VB1n9vuaLUMnKFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:11:32.526686Z","bundle_sha256":"bb919c36d6a91cd4eb0c909b99b62140ba8d216ec8aa3f6137e1a7ffb737c7e1"}}