{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SGXAPI6E7UMADXTXUBS24WXASD","short_pith_number":"pith:SGXAPI6E","schema_version":"1.0","canonical_sha256":"91ae07a3c4fd1801de77a065ae5ae090e52db8a67cc6a0fc74c26601c0fef93f","source":{"kind":"arxiv","id":"1608.01500","version":3},"attestation_state":"computed","paper":{"title":"Solution Concepts in A-Loss Recall Games: Existence and Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Jiri Cermak, Michal Pechoucek","submitted_at":"2016-08-04T11:36:17Z","abstract_excerpt":"Imperfect recall games represent dynamic interactions where players forget previously known information, such as a history of played actions. The importance of imperfect recall games stems from allowing a concise representation of strategies compared to perfect recall games where players remember all information. However, most of the algorithmic results are negative for imperfect recall games -- a Nash equilibrium~(NE) does not have to exist and computing a best response or a maxmin strategy is NP-hard. We focus on a subclass of imperfect recall games, called A-loss recall games, where a best "},"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":"1608.01500","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-04T11:36:17Z","cross_cats_sorted":[],"title_canon_sha256":"dd8ee3cdfaf4e5133ba3ec43481956ff902970be23bd40a1cddc077b5e549552","abstract_canon_sha256":"058f36583d0f53a010deabeeb119ec8ffa2bc517180224cd3736d7fe1d38e3c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.367967Z","signature_b64":"kmVTbHwf8jTQRXMBgN7k3psuN4zQ+A8DU+kKE2Kl2O07RUSNi4aTl8Kwk0cQXxEV9qmWKL9pMq5FJt3XSB90CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ae07a3c4fd1801de77a065ae5ae090e52db8a67cc6a0fc74c26601c0fef93f","last_reissued_at":"2026-05-18T00:43:45.367348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.367348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution Concepts in A-Loss Recall Games: Existence and Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Branislav Bosansky, Jiri Cermak, Michal Pechoucek","submitted_at":"2016-08-04T11:36:17Z","abstract_excerpt":"Imperfect recall games represent dynamic interactions where players forget previously known information, such as a history of played actions. The importance of imperfect recall games stems from allowing a concise representation of strategies compared to perfect recall games where players remember all information. However, most of the algorithmic results are negative for imperfect recall games -- a Nash equilibrium~(NE) does not have to exist and computing a best response or a maxmin strategy is NP-hard. We focus on a subclass of imperfect recall games, called A-loss recall games, where a best "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01500","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":"1608.01500","created_at":"2026-05-18T00:43:45.367450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01500v3","created_at":"2026-05-18T00:43:45.367450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01500","created_at":"2026-05-18T00:43:45.367450+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGXAPI6E7UMA","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGXAPI6E7UMADXTX","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGXAPI6E","created_at":"2026-05-18T12:30:44.179134+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/SGXAPI6E7UMADXTXUBS24WXASD","json":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD.json","graph_json":"https://pith.science/api/pith-number/SGXAPI6E7UMADXTXUBS24WXASD/graph.json","events_json":"https://pith.science/api/pith-number/SGXAPI6E7UMADXTXUBS24WXASD/events.json","paper":"https://pith.science/paper/SGXAPI6E"},"agent_actions":{"view_html":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD","download_json":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD.json","view_paper":"https://pith.science/paper/SGXAPI6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01500&json=true","fetch_graph":"https://pith.science/api/pith-number/SGXAPI6E7UMADXTXUBS24WXASD/graph.json","fetch_events":"https://pith.science/api/pith-number/SGXAPI6E7UMADXTXUBS24WXASD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD/action/storage_attestation","attest_author":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD/action/author_attestation","sign_citation":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD/action/citation_signature","submit_replication":"https://pith.science/pith/SGXAPI6E7UMADXTXUBS24WXASD/action/replication_record"}},"created_at":"2026-05-18T00:43:45.367450+00:00","updated_at":"2026-05-18T00:43:45.367450+00:00"}