{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PAKX7XQR4YXZWADHXO5TZBLAZI","short_pith_number":"pith:PAKX7XQR","canonical_record":{"source":{"id":"1809.05797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T02:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"feee29249fb03f246a7b2d0470fddd71d527cf9fdefdcba8796832d60b36c4e8","abstract_canon_sha256":"080b6c4460f04eebe3bd8035c2bac5214b4e9c7231068f17ccfe55343e4541d9"},"schema_version":"1.0"},"canonical_sha256":"78157fde11e62f9b0067bbbb3c8560ca389adf5b43991cd2b611fd684d5ed031","source":{"kind":"arxiv","id":"1809.05797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05797","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05797v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05797","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"PAKX7XQR4YXZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PAKX7XQR4YXZWADH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PAKX7XQR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PAKX7XQR4YXZWADHXO5TZBLAZI","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T02:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"feee29249fb03f246a7b2d0470fddd71d527cf9fdefdcba8796832d60b36c4e8","abstract_canon_sha256":"080b6c4460f04eebe3bd8035c2bac5214b4e9c7231068f17ccfe55343e4541d9"},"schema_version":"1.0"},"canonical_sha256":"78157fde11e62f9b0067bbbb3c8560ca389adf5b43991cd2b611fd684d5ed031","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.475755Z","signature_b64":"x4a8B9T7DfsUsw8YVP61oPhlmKrdTTr2jsry+gB8u549JDsuqPE558xP5a+moC3jhcMTLHXkJ3QCAvPsiQINCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78157fde11e62f9b0067bbbb3c8560ca389adf5b43991cd2b611fd684d5ed031","last_reissued_at":"2026-05-18T00:05:36.475312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.475312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05797","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-05-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoqZQrzKkD9b9bs93hTGUYmGjltvbpJ/Mn2y6CgMj/cL/Q43lUgJBLMx5GO9BPc2YEU7GwClWeQuCjTD2pzhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:34:32.064043Z"},"content_sha256":"a18ee26b286a4dd53ee622c7fbabdc2b64b89dee8368f2821d468e5b012b2c02","schema_version":"1.0","event_id":"sha256:a18ee26b286a4dd53ee622c7fbabdc2b64b89dee8368f2821d468e5b012b2c02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PAKX7XQR4YXZWADHXO5TZBLAZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Strategic Learning Algorithm for State-based Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changxi Li, Daizhan Cheng, Fenghua He, Yu Xing","submitted_at":"2018-09-16T02:34:36Z","abstract_excerpt":"Learning algorithm design for state-based games is investigated. A heuristic uncoupled learning algorithm, which is a two memory better reply with inertia dynamics, is proposed. Under certain reasonable conditions it is proved that for any initial state, if all agents in the state-based game follow the proposed learning algorithm, the action state pair converges almost surely to an action invariant set of recurrent state equilibria. The design relies on global and local searches with finite memory, inertia, and randomness. Finally, existence of time-efficient universal learning algorithm is st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05797","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"},"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-05-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2P1aKdLxIM6EySj7vYuTCAzBiXS57IXx4r/48odvCsP1iOJhb9vbQHEqcq0hIc9d8OjcxkfMrnSfLzv80g3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:34:32.064401Z"},"content_sha256":"ad928aab71a3402205092d1d8099c62e4321f24f127c2c6fe3b1beda645a6641","schema_version":"1.0","event_id":"sha256:ad928aab71a3402205092d1d8099c62e4321f24f127c2c6fe3b1beda645a6641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/bundle.json","state_url":"https://pith.science/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/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-06-02T11:34:32Z","links":{"resolver":"https://pith.science/pith/PAKX7XQR4YXZWADHXO5TZBLAZI","bundle":"https://pith.science/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/bundle.json","state":"https://pith.science/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAKX7XQR4YXZWADHXO5TZBLAZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PAKX7XQR4YXZWADHXO5TZBLAZI","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":"080b6c4460f04eebe3bd8035c2bac5214b4e9c7231068f17ccfe55343e4541d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T02:34:36Z","title_canon_sha256":"feee29249fb03f246a7b2d0470fddd71d527cf9fdefdcba8796832d60b36c4e8"},"schema_version":"1.0","source":{"id":"1809.05797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05797","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05797v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05797","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"PAKX7XQR4YXZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PAKX7XQR4YXZWADH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PAKX7XQR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ad928aab71a3402205092d1d8099c62e4321f24f127c2c6fe3b1beda645a6641","target":"graph","created_at":"2026-05-18T00:05:36Z","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"},"paper":{"abstract_excerpt":"Learning algorithm design for state-based games is investigated. A heuristic uncoupled learning algorithm, which is a two memory better reply with inertia dynamics, is proposed. Under certain reasonable conditions it is proved that for any initial state, if all agents in the state-based game follow the proposed learning algorithm, the action state pair converges almost surely to an action invariant set of recurrent state equilibria. The design relies on global and local searches with finite memory, inertia, and randomness. Finally, existence of time-efficient universal learning algorithm is st","authors_text":"Changxi Li, Daizhan Cheng, Fenghua He, Yu Xing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T02:34:36Z","title":"A Strategic Learning Algorithm for State-based Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05797","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:a18ee26b286a4dd53ee622c7fbabdc2b64b89dee8368f2821d468e5b012b2c02","target":"record","created_at":"2026-05-18T00:05:36Z","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":"080b6c4460f04eebe3bd8035c2bac5214b4e9c7231068f17ccfe55343e4541d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T02:34:36Z","title_canon_sha256":"feee29249fb03f246a7b2d0470fddd71d527cf9fdefdcba8796832d60b36c4e8"},"schema_version":"1.0","source":{"id":"1809.05797","kind":"arxiv","version":1}},"canonical_sha256":"78157fde11e62f9b0067bbbb3c8560ca389adf5b43991cd2b611fd684d5ed031","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78157fde11e62f9b0067bbbb3c8560ca389adf5b43991cd2b611fd684d5ed031","first_computed_at":"2026-05-18T00:05:36.475312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.475312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x4a8B9T7DfsUsw8YVP61oPhlmKrdTTr2jsry+gB8u549JDsuqPE558xP5a+moC3jhcMTLHXkJ3QCAvPsiQINCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.475755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a18ee26b286a4dd53ee622c7fbabdc2b64b89dee8368f2821d468e5b012b2c02","sha256:ad928aab71a3402205092d1d8099c62e4321f24f127c2c6fe3b1beda645a6641"],"state_sha256":"5a74b55f3eb8ad32a7fae0ab6da12b46a43522f34ca390cfdde1a4e30616bbdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd4NYnoK3m7fuC5Kj/5OssICkNooBbS9aZa7Fpi+WxAZd9FLv6aS+CpPEQg48qnoBVkQKRceuI55G5fYEojXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:34:32.066404Z","bundle_sha256":"4cb159672789105b912c0494e07f584966216355058e1c2ee55557f16ab39531"}}