{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ENREMX5SOFIAZ5O27KSBNG7LYP","short_pith_number":"pith:ENREMX5S","schema_version":"1.0","canonical_sha256":"2362465fb271500cf5dafaa4169bebc3fbd0a91375a09a09ed7e05642765020c","source":{"kind":"arxiv","id":"1411.3320","version":1},"attestation_state":"computed","paper":{"title":"On Sparse Discretization for Graphical Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Luis E. Ortiz","submitted_at":"2014-11-12T20:59:07Z","abstract_excerpt":"This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixed strategies, a uniform discretization size linear on the inverse of the approximation quality and natural game-representation parameters suffices. For graphical games, under natural conditions, the disc"},"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":"1411.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-12T20:59:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"c937c1a7d56c50c7d7e64492cdd4e0a4a854a80d44c9ab5837c99b16b65cb25a","abstract_canon_sha256":"0fb882b35b8ee8004bee6397e31d7d8ec5901cf22922341cc5d23f52828c0389"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:45.223125Z","signature_b64":"E3VUKIGywjTYJzmXKDS7ZqhMdR+dxo3dhSeccoSOu8dijTUUw8SeIG/Ur6QkklZS2jrMSMqYtH1O+KrOqqOmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2362465fb271500cf5dafaa4169bebc3fbd0a91375a09a09ed7e05642765020c","last_reissued_at":"2026-05-18T02:37:45.222627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:45.222627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sparse Discretization for Graphical Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Luis E. Ortiz","submitted_at":"2014-11-12T20:59:07Z","abstract_excerpt":"This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixed strategies, a uniform discretization size linear on the inverse of the approximation quality and natural game-representation parameters suffices. For graphical games, under natural conditions, the disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3320","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.3320","created_at":"2026-05-18T02:37:45.222694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3320v1","created_at":"2026-05-18T02:37:45.222694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3320","created_at":"2026-05-18T02:37:45.222694+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENREMX5SOFIA","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENREMX5SOFIAZ5O2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENREMX5S","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/ENREMX5SOFIAZ5O27KSBNG7LYP","json":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP.json","graph_json":"https://pith.science/api/pith-number/ENREMX5SOFIAZ5O27KSBNG7LYP/graph.json","events_json":"https://pith.science/api/pith-number/ENREMX5SOFIAZ5O27KSBNG7LYP/events.json","paper":"https://pith.science/paper/ENREMX5S"},"agent_actions":{"view_html":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP","download_json":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP.json","view_paper":"https://pith.science/paper/ENREMX5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3320&json=true","fetch_graph":"https://pith.science/api/pith-number/ENREMX5SOFIAZ5O27KSBNG7LYP/graph.json","fetch_events":"https://pith.science/api/pith-number/ENREMX5SOFIAZ5O27KSBNG7LYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP/action/storage_attestation","attest_author":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP/action/author_attestation","sign_citation":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP/action/citation_signature","submit_replication":"https://pith.science/pith/ENREMX5SOFIAZ5O27KSBNG7LYP/action/replication_record"}},"created_at":"2026-05-18T02:37:45.222694+00:00","updated_at":"2026-05-18T02:37:45.222694+00:00"}