{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:42UQUT765UG36QD4LT5F744VHM","short_pith_number":"pith:42UQUT76","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"},"canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","source":{"kind":"arxiv","id":"1910.01706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.01706","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"arxiv_version","alias_value":"1910.01706v2","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01706","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_12","alias_value":"42UQUT765UG3","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_16","alias_value":"42UQUT765UG36QD4","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_8","alias_value":"42UQUT76","created_at":"2026-07-05T00:22:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:42UQUT765UG36QD4LT5F744VHM","target":"record","payload":{"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"},"canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","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"},"source_kind":"arxiv","source_id":"1910.01706","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gp0oTi81flHbK56yqxTj1DrH4PSHyQiONVFFBGYRmIVMmpW9jnrGHejyJQ/v2qtTOwtase/jZOHoKRxXSLuNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T15:06:31.290985Z"},"content_sha256":"8687148912b83ee234c1533b4944dffc66a2e81a8ded9a0165302368ab8babc8","schema_version":"1.0","event_id":"sha256:8687148912b83ee234c1533b4944dffc66a2e81a8ded9a0165302368ab8babc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:42UQUT765UG36QD4LT5F744VHM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68LLroRAYULb991/RvlwcEBW0ySqolX2q7haIyhgBYtrcQwRE7iva7nvyXNWEUhM/OXjxY3M+mXmf0PvNer2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T15:06:31.291359Z"},"content_sha256":"c0f4c7041b80511f46d3c65fdb462b367ca697b46091303fc5104b6a71ea11a3","schema_version":"1.0","event_id":"sha256:c0f4c7041b80511f46d3c65fdb462b367ca697b46091303fc5104b6a71ea11a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/bundle.json","state_url":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42UQUT765UG36QD4LT5F744VHM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-13T15:06:31Z","links":{"resolver":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM","bundle":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/bundle.json","state":"https://pith.science/pith/42UQUT765UG36QD4LT5F744VHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42UQUT765UG36QD4LT5F744VHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:42UQUT765UG36QD4LT5F744VHM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1a6a8eb7f0e83697fb8cc6ff51023432e7efed4b6a6f76d5730bc39cab9ea1fd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-03T19:58:28Z","title_canon_sha256":"4740fa85e32e99abacc490b3b608848e0b0bb2cc1933d7c6a5ae3e3cb673d92c"},"schema_version":"1.0","source":{"id":"1910.01706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.01706","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"arxiv_version","alias_value":"1910.01706v2","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01706","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_12","alias_value":"42UQUT765UG3","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_16","alias_value":"42UQUT765UG36QD4","created_at":"2026-07-05T00:22:42Z"},{"alias_kind":"pith_short_8","alias_value":"42UQUT76","created_at":"2026-07-05T00:22:42Z"}],"graph_snapshots":[{"event_id":"sha256:c0f4c7041b80511f46d3c65fdb462b367ca697b46091303fc5104b6a71ea11a3","target":"graph","created_at":"2026-07-05T00:22:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.01706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dustin Morrill, James R. Wright, Ryan D'Orazio","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-03T19:58:28Z","title":"Bounds for Approximate Regret-Matching Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01706","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8687148912b83ee234c1533b4944dffc66a2e81a8ded9a0165302368ab8babc8","target":"record","created_at":"2026-07-05T00:22:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1a6a8eb7f0e83697fb8cc6ff51023432e7efed4b6a6f76d5730bc39cab9ea1fd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-03T19:58:28Z","title_canon_sha256":"4740fa85e32e99abacc490b3b608848e0b0bb2cc1933d7c6a5ae3e3cb673d92c"},"schema_version":"1.0","source":{"id":"1910.01706","kind":"arxiv","version":2}},"canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6a90a4ffeed0dbf407c5cfa5ff3953b2dc112bb7a38a9bc491f0e5c50991740","first_computed_at":"2026-07-05T00:22:42.205368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:22:42.205368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izFDFz19LMqHx2zY6i1pSa0ea2W1I2/g3hlive9shtATepRuNM5OPqsV/h6YSXZ9anzj9yQ3gPYyNEDrzfl7BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:22:42.205925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.01706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8687148912b83ee234c1533b4944dffc66a2e81a8ded9a0165302368ab8babc8","sha256:c0f4c7041b80511f46d3c65fdb462b367ca697b46091303fc5104b6a71ea11a3"],"state_sha256":"4f15d0d961bba0120c0c3f263ea57e2820218b9571a887c3212c458cf7ae7644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ne1hbJhnl61KcLHGDwyLd0skBgPMErdbeSr+xOO5TAYf4E/edS8zMcSnSNqmVhCdovYJM68jkFxKc8E3pKEFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T15:06:31.293898Z","bundle_sha256":"ba57ed5110236656221ebd8d897c5554e423dde52d19d1e164ec460a9c25e13a"}}