{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JJHYZNC6RAF6LX2BWL7RQGX6ZF","short_pith_number":"pith:JJHYZNC6","canonical_record":{"source":{"id":"2605.13025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:29:21Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"31ccf2c18535570efedd80e4861165db14fa6cc09d3eb01ea736f9dadd7c9200","abstract_canon_sha256":"ecfd39cae026a9e4c7bb51fef9e217012c37bdeff03a8b713516910fa56ded8d"},"schema_version":"1.0"},"canonical_sha256":"4a4f8cb45e880be5df41b2ff181afec943f0405a9efa3da7e2810aaf254b0ae1","source":{"kind":"arxiv","id":"2605.13025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13025","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13025v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13025","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"JJHYZNC6RAF6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JJHYZNC6RAF6LX2B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JJHYZNC6","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JJHYZNC6RAF6LX2BWL7RQGX6ZF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:29:21Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"31ccf2c18535570efedd80e4861165db14fa6cc09d3eb01ea736f9dadd7c9200","abstract_canon_sha256":"ecfd39cae026a9e4c7bb51fef9e217012c37bdeff03a8b713516910fa56ded8d"},"schema_version":"1.0"},"canonical_sha256":"4a4f8cb45e880be5df41b2ff181afec943f0405a9efa3da7e2810aaf254b0ae1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:59.938601Z","signature_b64":"v1+ruFevmtkriWhyuOKZNRzV7YLM1OpVu681QNUBJN68omfWkpEh/VYDxwolel237ZrXqr8ncQ1Ul+tWLyI5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a4f8cb45e880be5df41b2ff181afec943f0405a9efa3da7e2810aaf254b0ae1","last_reissued_at":"2026-05-18T03:08:59.938023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:59.938023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13025","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-18T03:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJ8xsO03IRhDNqu+APwq1Au30t9NvjGVdgz+5q//dRK7b8a8UyQTk4A+h380YB/8Kl8PbyZirOkrPvSAD/SwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:56:34.317889Z"},"content_sha256":"8f61279b0728a25b334c53bcd313e813106e52efe15dd9ed83933e2986839896","schema_version":"1.0","event_id":"sha256:8f61279b0728a25b334c53bcd313e813106e52efe15dd9ed83933e2986839896"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JJHYZNC6RAF6LX2BWL7RQGX6ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Offline Two-Player Zero-Sum Markov Games with KL Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability.","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Claire Chen, Nan Jiang, Shuze Daniel Liu, Xinyu Liu, Yuheng Zhang, Zixuan Xie","submitted_at":"2026-05-13T05:29:21Z","abstract_excerpt":"We study the problem of learning Nash equilibria in offline two-player zero-sum Markov games. While existing approaches often rely on explicit pessimism to address distribution shift, we show that KL regularization alone suffices to stabilize learning and guarantee convergence. We first introduce Regularized Offline Sequential Equilibrium (ROSE), a theoretical framework that achieves a fast $\\widetilde{\\mathcal{O}}(1/n)$ convergence rate under \\textit{unilateral concentrability}, improving over the standard $\\widetilde{\\mathcal{O}}(1/\\sqrt{n})$ rates in unregularized settings. We then propose "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"KL regularization alone suffices to stabilize learning and guarantee convergence. ROSE achieves a fast Õ(1/n) convergence rate under unilateral concentrability, and the last iterate of SOS-MD attains the same statistical rate up to Õ(1/sqrt(T)) optimization error.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Unilateral concentrability of the offline data distribution with respect to the learned policies; if this fails the fast 1/n rate no longer holds.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"KL regularization enables Õ(1/n) convergence for offline Nash equilibria in zero-sum Markov games under unilateral concentrability via the ROSE framework and SOS-MD algorithm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3dd9340df90f31b6721f3ada21f2d5e55eb0f7184495a997a3f8a204fc830ad3"},"source":{"id":"2605.13025","kind":"arxiv","version":1},"verdict":{"id":"7119f40f-dc70-48ef-af21-42cebad66088","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:20:58.057786Z","strongest_claim":"KL regularization alone suffices to stabilize learning and guarantee convergence. ROSE achieves a fast Õ(1/n) convergence rate under unilateral concentrability, and the last iterate of SOS-MD attains the same statistical rate up to Õ(1/sqrt(T)) optimization error.","one_line_summary":"KL regularization enables Õ(1/n) convergence for offline Nash equilibria in zero-sum Markov games under unilateral concentrability via the ROSE framework and SOS-MD algorithm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Unilateral concentrability of the offline data distribution with respect to the learned policies; if this fails the fast 1/n rate no longer holds.","pith_extraction_headline":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability."},"references":{"count":300,"sample":[{"doi":"","year":null,"title":"Proceedings of the International Conference on Learning Representations , volume=","work_id":"2b021be2-6bc1-4c70-93f4-81a7a9b39af8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"0dce7624-0cad-4d35-802f-8156de372de6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Beyond Pessimism: Offline Learning in KL-regularized Games","work_id":"a0a81c96-7e45-4eba-b34c-372d960030ef","ref_index":3,"cited_arxiv_id":"2604.06738","is_internal_anchor":true},{"doi":"","year":null,"title":"Pessimism-Free Offline Learning in General-Sum Games via KL Regularization","work_id":"dfc426d3-6808-454f-844e-46f3e7fb525f","ref_index":4,"cited_arxiv_id":"2605.00264","is_internal_anchor":true},{"doi":"","year":null,"title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","work_id":"e3183b92-3b36-4e46-9294-31987dac9139","ref_index":5,"cited_arxiv_id":"2605.00268","is_internal_anchor":true}],"resolved_work":300,"snapshot_sha256":"1ec84f9418219bd20ce065a810068a1d82b616c667100ba5340b7ca6a8399659","internal_anchors":3},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f00af169e7304ad62b6f603a3d517019131929094e5ad90578bb0b86252660b9"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7119f40f-dc70-48ef-af21-42cebad66088"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzKgJwkgd66FFozXbG5apsw7dcV01GiCQwMxFO+ePICirOn0ofiH/nvQNBb8zThJUnVQE1hX+VALH+fFJJT9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:56:34.318915Z"},"content_sha256":"3cfa143d0cb496a2c6839bced1b135823314f47576b99f265eebe5e35d46be3b","schema_version":"1.0","event_id":"sha256:3cfa143d0cb496a2c6839bced1b135823314f47576b99f265eebe5e35d46be3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/bundle.json","state_url":"https://pith.science/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/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-06T22:56:34Z","links":{"resolver":"https://pith.science/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF","bundle":"https://pith.science/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/bundle.json","state":"https://pith.science/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJHYZNC6RAF6LX2BWL7RQGX6ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JJHYZNC6RAF6LX2BWL7RQGX6ZF","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":"ecfd39cae026a9e4c7bb51fef9e217012c37bdeff03a8b713516910fa56ded8d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:29:21Z","title_canon_sha256":"31ccf2c18535570efedd80e4861165db14fa6cc09d3eb01ea736f9dadd7c9200"},"schema_version":"1.0","source":{"id":"2605.13025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13025","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13025v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13025","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"JJHYZNC6RAF6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JJHYZNC6RAF6LX2B","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JJHYZNC6","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3cfa143d0cb496a2c6839bced1b135823314f47576b99f265eebe5e35d46be3b","target":"graph","created_at":"2026-05-18T03:08:59Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"KL regularization alone suffices to stabilize learning and guarantee convergence. ROSE achieves a fast Õ(1/n) convergence rate under unilateral concentrability, and the last iterate of SOS-MD attains the same statistical rate up to Õ(1/sqrt(T)) optimization error."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Unilateral concentrability of the offline data distribution with respect to the learned policies; if this fails the fast 1/n rate no longer holds."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"KL regularization enables Õ(1/n) convergence for offline Nash equilibria in zero-sum Markov games under unilateral concentrability via the ROSE framework and SOS-MD algorithm."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability."}],"snapshot_sha256":"3dd9340df90f31b6721f3ada21f2d5e55eb0f7184495a997a3f8a204fc830ad3"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f00af169e7304ad62b6f603a3d517019131929094e5ad90578bb0b86252660b9"},"paper":{"abstract_excerpt":"We study the problem of learning Nash equilibria in offline two-player zero-sum Markov games. While existing approaches often rely on explicit pessimism to address distribution shift, we show that KL regularization alone suffices to stabilize learning and guarantee convergence. We first introduce Regularized Offline Sequential Equilibrium (ROSE), a theoretical framework that achieves a fast $\\widetilde{\\mathcal{O}}(1/n)$ convergence rate under \\textit{unilateral concentrability}, improving over the standard $\\widetilde{\\mathcal{O}}(1/\\sqrt{n})$ rates in unregularized settings. We then propose ","authors_text":"Claire Chen, Nan Jiang, Shuze Daniel Liu, Xinyu Liu, Yuheng Zhang, Zixuan Xie","cross_cats":["cs.GT"],"headline":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:29:21Z","title":"Offline Two-Player Zero-Sum Markov Games with KL Regularization"},"references":{"count":300,"internal_anchors":3,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of the International Conference on Learning Representations , volume=","work_id":"2b021be2-6bc1-4c70-93f4-81a7a9b39af8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","work_id":"0dce7624-0cad-4d35-802f-8156de372de6","year":null},{"cited_arxiv_id":"2604.06738","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Beyond Pessimism: Offline Learning in KL-regularized Games","work_id":"a0a81c96-7e45-4eba-b34c-372d960030ef","year":null},{"cited_arxiv_id":"2605.00264","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Pessimism-Free Offline Learning in General-Sum Games via KL Regularization","work_id":"dfc426d3-6808-454f-844e-46f3e7fb525f","year":null},{"cited_arxiv_id":"2605.00268","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","work_id":"e3183b92-3b36-4e46-9294-31987dac9139","year":null}],"snapshot_sha256":"1ec84f9418219bd20ce065a810068a1d82b616c667100ba5340b7ca6a8399659"},"source":{"id":"2605.13025","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:20:58.057786Z","id":"7119f40f-dc70-48ef-af21-42cebad66088","model_set":{"reader":"grok-4.3"},"one_line_summary":"KL regularization enables Õ(1/n) convergence for offline Nash equilibria in zero-sum Markov games under unilateral concentrability via the ROSE framework and SOS-MD algorithm.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"KL regularization by itself stabilizes learning of Nash equilibria in offline zero-sum Markov games and delivers fast Õ(1/n) convergence under unilateral concentrability.","strongest_claim":"KL regularization alone suffices to stabilize learning and guarantee convergence. ROSE achieves a fast Õ(1/n) convergence rate under unilateral concentrability, and the last iterate of SOS-MD attains the same statistical rate up to Õ(1/sqrt(T)) optimization error.","weakest_assumption":"Unilateral concentrability of the offline data distribution with respect to the learned policies; if this fails the fast 1/n rate no longer holds."}},"verdict_id":"7119f40f-dc70-48ef-af21-42cebad66088"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8f61279b0728a25b334c53bcd313e813106e52efe15dd9ed83933e2986839896","target":"record","created_at":"2026-05-18T03:08:59Z","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":"ecfd39cae026a9e4c7bb51fef9e217012c37bdeff03a8b713516910fa56ded8d","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T05:29:21Z","title_canon_sha256":"31ccf2c18535570efedd80e4861165db14fa6cc09d3eb01ea736f9dadd7c9200"},"schema_version":"1.0","source":{"id":"2605.13025","kind":"arxiv","version":1}},"canonical_sha256":"4a4f8cb45e880be5df41b2ff181afec943f0405a9efa3da7e2810aaf254b0ae1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a4f8cb45e880be5df41b2ff181afec943f0405a9efa3da7e2810aaf254b0ae1","first_computed_at":"2026-05-18T03:08:59.938023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:59.938023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v1+ruFevmtkriWhyuOKZNRzV7YLM1OpVu681QNUBJN68omfWkpEh/VYDxwolel237ZrXqr8ncQ1Ul+tWLyI5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:59.938601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f61279b0728a25b334c53bcd313e813106e52efe15dd9ed83933e2986839896","sha256:3cfa143d0cb496a2c6839bced1b135823314f47576b99f265eebe5e35d46be3b"],"state_sha256":"9757b76630811e8b9fd0ccf1132dad3163457e609edf0cb8d3daa4876b382b1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbS5a8xyg0Ra5sqgNSNqnGkhN/tR7kQZv5w7DauuIl9T45roiPZOH2pVOg4HFJR8Os19GXSrorx/hO8gN1AcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:56:34.323242Z","bundle_sha256":"568da0cf77e18ae550f4a7ebd9a53fd638f34b13c4aaed9e56b1e3e1d807af9e"}}