{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BYX44A75ENAEZAMMTTICERFVQ7","short_pith_number":"pith:BYX44A75","schema_version":"1.0","canonical_sha256":"0e2fce03fd23404c818c9cd02244b587e8265076b1222aafe5b45b8401e0d479","source":{"kind":"arxiv","id":"1205.0444","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.0444","created_at":"2026-05-18T03:27:42.862833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0444v3","created_at":"2026-05-18T03:27:42.862833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0444","created_at":"2026-05-18T03:27:42.862833+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYX44A75ENAE","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYX44A75ENAEZAMM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYX44A75","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7","json":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7.json","graph_json":"https://pith.science/api/pith-number/BYX44A75ENAEZAMMTTICERFVQ7/graph.json","events_json":"https://pith.science/api/pith-number/BYX44A75ENAEZAMMTTICERFVQ7/events.json","paper":"https://pith.science/paper/BYX44A75"},"agent_actions":{"view_html":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7","download_json":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7.json","view_paper":"https://pith.science/paper/BYX44A75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0444&json=true","fetch_graph":"https://pith.science/api/pith-number/BYX44A75ENAEZAMMTTICERFVQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/BYX44A75ENAEZAMMTTICERFVQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/action/storage_attestation","attest_author":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/action/author_attestation","sign_citation":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/action/citation_signature","submit_replication":"https://pith.science/pith/BYX44A75ENAEZAMMTTICERFVQ7/action/replication_record"}},"created_at":"2026-05-18T03:27:42.862833+00:00","updated_at":"2026-05-18T03:27:42.862833+00:00"}