{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EJMEA6LWWWJXHMV4XYQYALWWJH","short_pith_number":"pith:EJMEA6LW","canonical_record":{"source":{"id":"2504.18917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-26T13:27:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"402aaf53bb67f71b28c91bc6bb18e4a5f5004e74fae42c68b5520c6a3f5f26a6","abstract_canon_sha256":"1fdded91fc0e03e652e865a9bd61f83196b9423e14309da28706a83e985f9ac6"},"schema_version":"1.0"},"canonical_sha256":"2258407976b59373b2bcbe21802ed649ec5ce0f8d7b7cf9d73b615ea64bb6630","source":{"kind":"arxiv","id":"2504.18917","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18917","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18917v1","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18917","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_12","alias_value":"EJMEA6LWWWJX","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_16","alias_value":"EJMEA6LWWWJXHMV4","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_8","alias_value":"EJMEA6LW","created_at":"2026-07-05T10:54:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EJMEA6LWWWJXHMV4XYQYALWWJH","target":"record","payload":{"canonical_record":{"source":{"id":"2504.18917","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-26T13:27:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"402aaf53bb67f71b28c91bc6bb18e4a5f5004e74fae42c68b5520c6a3f5f26a6","abstract_canon_sha256":"1fdded91fc0e03e652e865a9bd61f83196b9423e14309da28706a83e985f9ac6"},"schema_version":"1.0"},"canonical_sha256":"2258407976b59373b2bcbe21802ed649ec5ce0f8d7b7cf9d73b615ea64bb6630","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:23.663528Z","signature_b64":"uwoCjbfoR3nSlo9NekQLSwD/HEsHbl9VsNKzmLCwV1NeVzzCE9Pe/3ksWPzwQkVLglunjyRUpbBjZVAL35ixBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2258407976b59373b2bcbe21802ed649ec5ce0f8d7b7cf9d73b615ea64bb6630","last_reissued_at":"2026-07-05T10:54:23.663028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:23.663028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.18917","source_version":1,"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-05T10:54:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfhwDlFzTo29rT8AGfct8OSkAz0sZ5PnGZFMEVWXeZsrvdRXe5RZErRjYzEO30n/eU9+4gUmJKrEVL+J3sS6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:18:18.751228Z"},"content_sha256":"a6337c04297ba107c84894428d379ed95f2d311348b9c0c78f11768b33b9669f","schema_version":"1.0","event_id":"sha256:a6337c04297ba107c84894428d379ed95f2d311348b9c0c78f11768b33b9669f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EJMEA6LWWWJXHMV4XYQYALWWJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meta-Learning in Self-Play Regret Minimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"David Sychrovsk\\'y, Martin Schmid, Michael Bowling, Michal \\v{S}ustr","submitted_at":"2025-04-26T13:27:24Z","abstract_excerpt":"Regret minimization is a general approach to online optimization which plays a crucial role in many algorithms for approximating Nash equilibria in two-player zero-sum games. The literature mainly focuses on solving individual games in isolation. However, in practice, players often encounter a distribution of similar but distinct games. For example, when trading correlated assets on the stock market, or when refining the strategy in subgames of a much larger game. Recently, offline meta-learning was used to accelerate one-sided equilibrium finding on such distributions. We build upon this, ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18917","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.18917/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-05T10:54:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ves/Sq1SSYUsnyt9FhBrAjiAdV88I689Kq5Xcea710y4i+xxWkz2obSWsBvmTWbkwl78jMsX5iI3a8Eiy2XMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:18:18.751860Z"},"content_sha256":"31b9b3f0b3b362ebe73ccba1d616fd1d3e7a5d3a96fccfc232e32dd1885e3a2c","schema_version":"1.0","event_id":"sha256:31b9b3f0b3b362ebe73ccba1d616fd1d3e7a5d3a96fccfc232e32dd1885e3a2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/bundle.json","state_url":"https://pith.science/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/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-08-04T11:18:18Z","links":{"resolver":"https://pith.science/pith/EJMEA6LWWWJXHMV4XYQYALWWJH","bundle":"https://pith.science/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/bundle.json","state":"https://pith.science/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJMEA6LWWWJXHMV4XYQYALWWJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EJMEA6LWWWJXHMV4XYQYALWWJH","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":"1fdded91fc0e03e652e865a9bd61f83196b9423e14309da28706a83e985f9ac6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-26T13:27:24Z","title_canon_sha256":"402aaf53bb67f71b28c91bc6bb18e4a5f5004e74fae42c68b5520c6a3f5f26a6"},"schema_version":"1.0","source":{"id":"2504.18917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.18917","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.18917v1","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18917","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_12","alias_value":"EJMEA6LWWWJX","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_16","alias_value":"EJMEA6LWWWJXHMV4","created_at":"2026-07-05T10:54:23Z"},{"alias_kind":"pith_short_8","alias_value":"EJMEA6LW","created_at":"2026-07-05T10:54:23Z"}],"graph_snapshots":[{"event_id":"sha256:31b9b3f0b3b362ebe73ccba1d616fd1d3e7a5d3a96fccfc232e32dd1885e3a2c","target":"graph","created_at":"2026-07-05T10:54:23Z","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/2504.18917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Regret minimization is a general approach to online optimization which plays a crucial role in many algorithms for approximating Nash equilibria in two-player zero-sum games. The literature mainly focuses on solving individual games in isolation. However, in practice, players often encounter a distribution of similar but distinct games. For example, when trading correlated assets on the stock market, or when refining the strategy in subgames of a much larger game. Recently, offline meta-learning was used to accelerate one-sided equilibrium finding on such distributions. We build upon this, ext","authors_text":"David Sychrovsk\\'y, Martin Schmid, Michael Bowling, Michal \\v{S}ustr","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-26T13:27:24Z","title":"Meta-Learning in Self-Play Regret Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18917","kind":"arxiv","version":1},"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:a6337c04297ba107c84894428d379ed95f2d311348b9c0c78f11768b33b9669f","target":"record","created_at":"2026-07-05T10:54:23Z","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":"1fdded91fc0e03e652e865a9bd61f83196b9423e14309da28706a83e985f9ac6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-26T13:27:24Z","title_canon_sha256":"402aaf53bb67f71b28c91bc6bb18e4a5f5004e74fae42c68b5520c6a3f5f26a6"},"schema_version":"1.0","source":{"id":"2504.18917","kind":"arxiv","version":1}},"canonical_sha256":"2258407976b59373b2bcbe21802ed649ec5ce0f8d7b7cf9d73b615ea64bb6630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2258407976b59373b2bcbe21802ed649ec5ce0f8d7b7cf9d73b615ea64bb6630","first_computed_at":"2026-07-05T10:54:23.663028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:54:23.663028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uwoCjbfoR3nSlo9NekQLSwD/HEsHbl9VsNKzmLCwV1NeVzzCE9Pe/3ksWPzwQkVLglunjyRUpbBjZVAL35ixBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:54:23.663528Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.18917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6337c04297ba107c84894428d379ed95f2d311348b9c0c78f11768b33b9669f","sha256:31b9b3f0b3b362ebe73ccba1d616fd1d3e7a5d3a96fccfc232e32dd1885e3a2c"],"state_sha256":"762f0ca0768a636e1e8d0452fc7953e58728b8866ec7255ec38bbc11743aead1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBMSp+kBqU+0cjPHJHaQ3CRRl5vT/5MecsE0umu1oBF0isMKCdtQ/kl8VwKrcpOb6hhDGRliM18WMSbWMzwdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:18:18.755647Z","bundle_sha256":"e6ee698483c262ea2378f17999cbca38d948a2efde69cbdce308b46184c81dbb"}}