{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:42UQUT765UG36QD4LT5F744VHM","short_pith_number":"pith:42UQUT76","schema_version":"1.0","canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","source":{"kind":"arxiv","id":"1910.01706","version":2},"attestation_state":"computed","paper":{"title":"Bounds for Approximate Regret-Matching Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Dustin Morrill, James R. Wright, Ryan D'Orazio","submitted_at":"2019-10-03T19:58:28Z","abstract_excerpt":"A dominant approach to solving large imperfect-information games is Counterfactural Regret Minimization (CFR). In CFR, many regret minimization problems are combined to solve the game. For very large games, abstraction is typically needed to render CFR tractable. Abstractions are often manually tuned, possibly removing important strategic differences in the full game and harming performance. Function approximation provides a natural solution to finding good abstractions to approximate the full game. A common approach to incorporating function approximation is to learn the inputs needed for a r"},"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":"1910.01706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-03T19:58:28Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"4740fa85e32e99abacc490b3b608848e0b0bb2cc1933d7c6a5ae3e3cb673d92c","abstract_canon_sha256":"1a6a8eb7f0e83697fb8cc6ff51023432e7efed4b6a6f76d5730bc39cab9ea1fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:42.205925Z","signature_b64":"izFDFz19LMqHx2zY6i1pSa0ea2W1I2/g3hlive9shtATepRuNM5OPqsV/h6YSXZ9anzj9yQ3gPYyNEDrzfl7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","last_reissued_at":"2026-07-05T00:22:42.205368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:42.205368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for Approximate Regret-Matching Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Dustin Morrill, James R. Wright, Ryan D'Orazio","submitted_at":"2019-10-03T19:58:28Z","abstract_excerpt":"A dominant approach to solving large imperfect-information games is Counterfactural Regret Minimization (CFR). In CFR, many regret minimization problems are combined to solve the game. For very large games, abstraction is typically needed to render CFR tractable. Abstractions are often manually tuned, possibly removing important strategic differences in the full game and harming performance. Function approximation provides a natural solution to finding good abstractions to approximate the full game. A common approach to incorporating function approximation is to learn the inputs needed for a r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01706","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.01706/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.01706","created_at":"2026-07-05T00:22:42.205433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.01706v2","created_at":"2026-07-05T00:22:42.205433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01706","created_at":"2026-07-05T00:22:42.205433+00:00"},{"alias_kind":"pith_short_12","alias_value":"42UQUT765UG3","created_at":"2026-07-05T00:22:42.205433+00:00"},{"alias_kind":"pith_short_16","alias_value":"42UQUT765UG36QD4","created_at":"2026-07-05T00:22:42.205433+00:00"},{"alias_kind":"pith_short_8","alias_value":"42UQUT76","created_at":"2026-07-05T00:22:42.205433+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/42UQUT765UG36QD4LT5F744VHM","json":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM.json","graph_json":"https://pith.science/api/pith-number/42UQUT765UG36QD4LT5F744VHM/graph.json","events_json":"https://pith.science/api/pith-number/42UQUT765UG36QD4LT5F744VHM/events.json","paper":"https://pith.science/paper/42UQUT76"},"agent_actions":{"view_html":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM","download_json":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM.json","view_paper":"https://pith.science/paper/42UQUT76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.01706&json=true","fetch_graph":"https://pith.science/api/pith-number/42UQUT765UG36QD4LT5F744VHM/graph.json","fetch_events":"https://pith.science/api/pith-number/42UQUT765UG36QD4LT5F744VHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/action/storage_attestation","attest_author":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/action/author_attestation","sign_citation":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/action/citation_signature","submit_replication":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/action/replication_record"}},"created_at":"2026-07-05T00:22:42.205433+00:00","updated_at":"2026-07-05T00:22:42.205433+00:00"}