{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BYX44A75ENAEZAMMTTICERFVQ7","short_pith_number":"pith:BYX44A75","canonical_record":{"source":{"id":"1205.0444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-05-02T14:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"0f10a3ff9e7436f9c16e4cade14228433a48821a8dba6545057b2e93c5aa3324","abstract_canon_sha256":"eec590b121a56eb3f82419f056c767d19771cf421cb7a69c0ae281f1569817c0"},"schema_version":"1.0"},"canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","source":{"kind":"arxiv","id":"1205.0444","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0444","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0444v3","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0444","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"BYX44A75ENAE","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYX44A75ENAEZAMM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYX44A75","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BYX44A75ENAEZAMMTTICERFVQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-05-02T14:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"0f10a3ff9e7436f9c16e4cade14228433a48821a8dba6545057b2e93c5aa3324","abstract_canon_sha256":"eec590b121a56eb3f82419f056c767d19771cf421cb7a69c0ae281f1569817c0"},"schema_version":"1.0"},"canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.863306Z","signature_b64":"fa7iqKa2Jnc9QAhDawc2EQd8rbCO7E13vIb90edw9CPkL6bYRCJI6y0AwRRcgvuD6MdgmUcLkrS2sm+43RZ0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","last_reissued_at":"2026-05-18T03:27:42.862758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.862758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0444","source_version":3,"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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juXQSYl1fuzf9q/GG1C9W82IMWDlew4lOynGWwu4uVQBDIixuAyeVhl83WbhHLbeYjI/6ystuDDYGBtWN+eJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:34:29.752289Z"},"content_sha256":"6b0c02b98b51abd5a1cee7ee397be78d8d5b6f6f416da8bf18ffc1357b2efdf4","schema_version":"1.0","event_id":"sha256:6b0c02b98b51abd5a1cee7ee397be78d8d5b6f6f416da8bf18ffc1357b2efdf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BYX44A75ENAEZAMMTTICERFVQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forcing Iterated Admissibility in Strategic Belief Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fernando Tohm\\`e, Gianluca Caterina, Rocco Gangle","submitted_at":"2012-05-02T14:37:21Z","abstract_excerpt":"Iterated admissibility (IA) can be seen as exhibiting a minimal criterion of rationality in games. In order to make this intuition more precise, the epistemic characterization of this game-theoretic solution has been actively investigated in recent times: it has been shown that strategies surviving m+1 rounds of iterated admissibility may be identified as those that are obtained under a condition called rationality and m assumption of rationality (RmAR) in complete lexicographic type structures. On the other hand, it has been shown that its limit condition, $R\\infty AR$, might not be satisfied"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0444","kind":"arxiv","version":3},"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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwxHD2GsyKGZRthDTFeRsQJap7rJaeJoNETv6iecZaDJvJFEGj1SJaU8Neo8JDmjp2SAhB2qGEvZicr94lNHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:34:29.752633Z"},"content_sha256":"38780cd53222f74e1fe70b737cb6fe6f80deb4ffb6f7c8cf3c36bde56595d14c","schema_version":"1.0","event_id":"sha256:38780cd53222f74e1fe70b737cb6fe6f80deb4ffb6f7c8cf3c36bde56595d14c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/bundle.json","state_url":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYX44A75ENAEZAMMTTICERFVQ7/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-28T23:34:29Z","links":{"resolver":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7","bundle":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/bundle.json","state":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYX44A75ENAEZAMMTTICERFVQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BYX44A75ENAEZAMMTTICERFVQ7","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":"eec590b121a56eb3f82419f056c767d19771cf421cb7a69c0ae281f1569817c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-05-02T14:37:21Z","title_canon_sha256":"0f10a3ff9e7436f9c16e4cade14228433a48821a8dba6545057b2e93c5aa3324"},"schema_version":"1.0","source":{"id":"1205.0444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0444","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0444v3","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0444","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"BYX44A75ENAE","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYX44A75ENAEZAMM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYX44A75","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:38780cd53222f74e1fe70b737cb6fe6f80deb4ffb6f7c8cf3c36bde56595d14c","target":"graph","created_at":"2026-05-18T03:27:42Z","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":"Iterated admissibility (IA) can be seen as exhibiting a minimal criterion of rationality in games. In order to make this intuition more precise, the epistemic characterization of this game-theoretic solution has been actively investigated in recent times: it has been shown that strategies surviving m+1 rounds of iterated admissibility may be identified as those that are obtained under a condition called rationality and m assumption of rationality (RmAR) in complete lexicographic type structures. On the other hand, it has been shown that its limit condition, $R\\infty AR$, might not be satisfied","authors_text":"Fernando Tohm\\`e, Gianluca Caterina, Rocco Gangle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-05-02T14:37:21Z","title":"Forcing Iterated Admissibility in Strategic Belief Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0444","kind":"arxiv","version":3},"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:6b0c02b98b51abd5a1cee7ee397be78d8d5b6f6f416da8bf18ffc1357b2efdf4","target":"record","created_at":"2026-05-18T03:27:42Z","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":"eec590b121a56eb3f82419f056c767d19771cf421cb7a69c0ae281f1569817c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-05-02T14:37:21Z","title_canon_sha256":"0f10a3ff9e7436f9c16e4cade14228433a48821a8dba6545057b2e93c5aa3324"},"schema_version":"1.0","source":{"id":"1205.0444","kind":"arxiv","version":3}},"canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","first_computed_at":"2026-05-18T03:27:42.862758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:42.862758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fa7iqKa2Jnc9QAhDawc2EQd8rbCO7E13vIb90edw9CPkL6bYRCJI6y0AwRRcgvuD6MdgmUcLkrS2sm+43RZ0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:42.863306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b0c02b98b51abd5a1cee7ee397be78d8d5b6f6f416da8bf18ffc1357b2efdf4","sha256:38780cd53222f74e1fe70b737cb6fe6f80deb4ffb6f7c8cf3c36bde56595d14c"],"state_sha256":"6f43f5bb3fba1924394e193f0351ea40b18699f716fd3afc863828650a97a5fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"907MLve4m4BfBX40h9ReEbP4V6seB59DDbDU33ljD/Lvii7rsH8NYdUfG0+tgRGh6mbU8Jp8RlFd56qVr1r4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T23:34:29.754432Z","bundle_sha256":"d67212e8f03af5e9d1d1ea9e9356c3e7f2df98b5d355d219e69538d9bbe0b61c"}}