{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZSGSZ5KFGJOREYECO24K5EYSE2","short_pith_number":"pith:ZSGSZ5KF","canonical_record":{"source":{"id":"1509.00535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T00:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"7927f7d0a7717607a3ba090cf64c97912c72f1edd99c982c2b5f08a88109f177","abstract_canon_sha256":"709b06c90f28c2b710fd680ffc1727d6a96d5a9482943cc589d10065349e506a"},"schema_version":"1.0"},"canonical_sha256":"cc8d2cf545325d12608276b8ae9312269c245777abc6e29f4686a1347af8eacb","source":{"kind":"arxiv","id":"1509.00535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00535","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00535v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00535","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZSGSZ5KFGJOR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSGSZ5KFGJOREYEC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSGSZ5KF","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZSGSZ5KFGJOREYECO24K5EYSE2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T00:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"7927f7d0a7717607a3ba090cf64c97912c72f1edd99c982c2b5f08a88109f177","abstract_canon_sha256":"709b06c90f28c2b710fd680ffc1727d6a96d5a9482943cc589d10065349e506a"},"schema_version":"1.0"},"canonical_sha256":"cc8d2cf545325d12608276b8ae9312269c245777abc6e29f4686a1347af8eacb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.621270Z","signature_b64":"mX+qu/3nJ536f/vttHFpk1kEurv3PO+XgzQWpBYHiLKZSi8mz7TMJQIsAwbpGutN7/2ZCweyU69k96bapxzKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc8d2cf545325d12608276b8ae9312269c245777abc6e29f4686a1347af8eacb","last_reissued_at":"2026-05-18T00:17:24.620619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.620619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00535","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-05-18T00:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of0VIUcPUcdTspx4NIB7PgoUi8LpCPw2rFRNs6VEdASxv0TUYGhUV9IJqBA7VMTh6szXKhE/UMnp2bh4GtLzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:27:47.860489Z"},"content_sha256":"e6a87ada1d4761c60b876d0eb74b3d922adcbea4fc8416daa5c1740e3f8f015c","schema_version":"1.0","event_id":"sha256:e6a87ada1d4761c60b876d0eb74b3d922adcbea4fc8416daa5c1740e3f8f015c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZSGSZ5KFGJOREYECO24K5EYSE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Markov Process for Iterated Games with Markov Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Shohei Hidaka","submitted_at":"2015-09-02T00:59:02Z","abstract_excerpt":"The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions probabilistically. This class is formulated as a $k^{\\text{th}}$ order Markov process, in which the probability of choice is a function of $k$ past states. With a reasonably large $k$ or with the limit $k \\to \\infty$, numerical analysis of this random process is unfeasible. This study developed a technique which gives the marginal probability of the stationary distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00535","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":""},"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZzdsoCwhw/Gv2X1RI0oasBXunPyQ/VvF6oZjdgyOgGrTzZaBEzV7kUfxz5iNsyJtGhFh/beMrU69P4HixpxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:27:47.860859Z"},"content_sha256":"6bcaab92041ed9723026b795c66ca79bda90d84a6b7c9ef4df940e71dc054d42","schema_version":"1.0","event_id":"sha256:6bcaab92041ed9723026b795c66ca79bda90d84a6b7c9ef4df940e71dc054d42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/bundle.json","state_url":"https://pith.science/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/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-04T21:27:47Z","links":{"resolver":"https://pith.science/pith/ZSGSZ5KFGJOREYECO24K5EYSE2","bundle":"https://pith.science/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/bundle.json","state":"https://pith.science/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSGSZ5KFGJOREYECO24K5EYSE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZSGSZ5KFGJOREYECO24K5EYSE2","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":"709b06c90f28c2b710fd680ffc1727d6a96d5a9482943cc589d10065349e506a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T00:59:02Z","title_canon_sha256":"7927f7d0a7717607a3ba090cf64c97912c72f1edd99c982c2b5f08a88109f177"},"schema_version":"1.0","source":{"id":"1509.00535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00535","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00535v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00535","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZSGSZ5KFGJOR","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSGSZ5KFGJOREYEC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSGSZ5KF","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:6bcaab92041ed9723026b795c66ca79bda90d84a6b7c9ef4df940e71dc054d42","target":"graph","created_at":"2026-05-18T00:17:24Z","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":"The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions probabilistically. This class is formulated as a $k^{\\text{th}}$ order Markov process, in which the probability of choice is a function of $k$ past states. With a reasonably large $k$ or with the limit $k \\to \\infty$, numerical analysis of this random process is unfeasible. This study developed a technique which gives the marginal probability of the stationary distribut","authors_text":"Shohei Hidaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T00:59:02Z","title":"Recursive Markov Process for Iterated Games with Markov Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00535","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:e6a87ada1d4761c60b876d0eb74b3d922adcbea4fc8416daa5c1740e3f8f015c","target":"record","created_at":"2026-05-18T00:17:24Z","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":"709b06c90f28c2b710fd680ffc1727d6a96d5a9482943cc589d10065349e506a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-02T00:59:02Z","title_canon_sha256":"7927f7d0a7717607a3ba090cf64c97912c72f1edd99c982c2b5f08a88109f177"},"schema_version":"1.0","source":{"id":"1509.00535","kind":"arxiv","version":2}},"canonical_sha256":"cc8d2cf545325d12608276b8ae9312269c245777abc6e29f4686a1347af8eacb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8d2cf545325d12608276b8ae9312269c245777abc6e29f4686a1347af8eacb","first_computed_at":"2026-05-18T00:17:24.620619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:24.620619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mX+qu/3nJ536f/vttHFpk1kEurv3PO+XgzQWpBYHiLKZSi8mz7TMJQIsAwbpGutN7/2ZCweyU69k96bapxzKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:24.621270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6a87ada1d4761c60b876d0eb74b3d922adcbea4fc8416daa5c1740e3f8f015c","sha256:6bcaab92041ed9723026b795c66ca79bda90d84a6b7c9ef4df940e71dc054d42"],"state_sha256":"00449227c9bd88db49460b9ec79aea83ebab521e01d774e71cf8e4dae2a28ad7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xacUe1Y0EBm0Tm9VR2TPUuumviqLiKGTgH/G2tcsSmXpzRWyqS65pyNHLvg5B/h2mY38QMk4RfEx3n0JISV6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:27:47.862881Z","bundle_sha256":"9a7d831e996ee348e8cdd1543b3bfd2a9013a77b431252561b1d5aad02287c50"}}