{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ELKQGJYO2SS64EYNCT4KLWCBPC","short_pith_number":"pith:ELKQGJYO","schema_version":"1.0","canonical_sha256":"22d503270ed4a5ee130d14f8a5d84178ad2784b6919bd70771147f2c49b93e7e","source":{"kind":"arxiv","id":"1409.3302","version":3},"attestation_state":"computed","paper":{"title":"Imperfect-Recall Abstractions with Bounds in Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Tuomas Sandholm","submitted_at":"2014-09-11T02:47:29Z","abstract_excerpt":"Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees on solution quality are known. In this paper, we show the first general, algorithm-agnostic, solution quality guarantees for Nash equilibria and approximate self-trembling equilibria computed in imperfect-recall abstractions, when implemented in the original (perfect-recall) game. Our results are for a class of games that generalizes the only p"},"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":"1409.3302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-11T02:47:29Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"2097edb3883ed16469782907c096b4b29bd475f926bb5346d25f767e92d6d7e4","abstract_canon_sha256":"66638c44240c3d1b57e36b569ed37d855073d2e74d7133a776810115fb051792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:58.744079Z","signature_b64":"AAxFS7GFwfBYLu98yXwyek4x6Th/YDiFdlv5j+orIerTt8p9i70w/bW3XAhyyPZS7zviuxIr9FMdqVRvY/SrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d503270ed4a5ee130d14f8a5d84178ad2784b6919bd70771147f2c49b93e7e","last_reissued_at":"2026-05-18T01:12:58.743719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:58.743719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Imperfect-Recall Abstractions with Bounds in Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Tuomas Sandholm","submitted_at":"2014-09-11T02:47:29Z","abstract_excerpt":"Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees on solution quality are known. In this paper, we show the first general, algorithm-agnostic, solution quality guarantees for Nash equilibria and approximate self-trembling equilibria computed in imperfect-recall abstractions, when implemented in the original (perfect-recall) game. Our results are for a class of games that generalizes the only p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3302","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":"1409.3302","created_at":"2026-05-18T01:12:58.743785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3302v3","created_at":"2026-05-18T01:12:58.743785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3302","created_at":"2026-05-18T01:12:58.743785+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELKQGJYO2SS6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELKQGJYO2SS64EYN","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELKQGJYO","created_at":"2026-05-18T12:28:28.263976+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/ELKQGJYO2SS64EYNCT4KLWCBPC","json":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC.json","graph_json":"https://pith.science/api/pith-number/ELKQGJYO2SS64EYNCT4KLWCBPC/graph.json","events_json":"https://pith.science/api/pith-number/ELKQGJYO2SS64EYNCT4KLWCBPC/events.json","paper":"https://pith.science/paper/ELKQGJYO"},"agent_actions":{"view_html":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC","download_json":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC.json","view_paper":"https://pith.science/paper/ELKQGJYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3302&json=true","fetch_graph":"https://pith.science/api/pith-number/ELKQGJYO2SS64EYNCT4KLWCBPC/graph.json","fetch_events":"https://pith.science/api/pith-number/ELKQGJYO2SS64EYNCT4KLWCBPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC/action/storage_attestation","attest_author":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC/action/author_attestation","sign_citation":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC/action/citation_signature","submit_replication":"https://pith.science/pith/ELKQGJYO2SS64EYNCT4KLWCBPC/action/replication_record"}},"created_at":"2026-05-18T01:12:58.743785+00:00","updated_at":"2026-05-18T01:12:58.743785+00:00"}