{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JIMR4WOIZLMO27HDKMB34QZ763","short_pith_number":"pith:JIMR4WOI","canonical_record":{"source":{"id":"2406.00274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-01T02:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"f097c7afaa1a2bfa3e3b80a2bd4d661d60965d00687d82c00c58bb5c9ed9b7e6","abstract_canon_sha256":"984b5e4433a48591d57063dcde735baf8f9a2cedb2d1dba694f80bdf09f35c6a"},"schema_version":"1.0"},"canonical_sha256":"4a191e59c8cad8ed7ce35303be433ff6e7d656223fe112f1ce320cca8f5cecf4","source":{"kind":"arxiv","id":"2406.00274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.00274","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"arxiv_version","alias_value":"2406.00274v1","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00274","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_12","alias_value":"JIMR4WOIZLMO","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"JIMR4WOIZLMO27HD","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"JIMR4WOI","created_at":"2026-07-05T08:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JIMR4WOIZLMO27HDKMB34QZ763","target":"record","payload":{"canonical_record":{"source":{"id":"2406.00274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-01T02:40:29Z","cross_cats_sorted":[],"title_canon_sha256":"f097c7afaa1a2bfa3e3b80a2bd4d661d60965d00687d82c00c58bb5c9ed9b7e6","abstract_canon_sha256":"984b5e4433a48591d57063dcde735baf8f9a2cedb2d1dba694f80bdf09f35c6a"},"schema_version":"1.0"},"canonical_sha256":"4a191e59c8cad8ed7ce35303be433ff6e7d656223fe112f1ce320cca8f5cecf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:59.429124Z","signature_b64":"6NchhTXXl15G4ODTPmDrRau+NmUMgIBqttJ7LsHf8st8QLOjCJdmFktJQ6wIZJZ8t6aYC5AsTAMEiws97X11Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a191e59c8cad8ed7ce35303be433ff6e7d656223fe112f1ce320cca8f5cecf4","last_reissued_at":"2026-07-05T08:25:59.428582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:59.428582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.00274","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-05T08:25:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/WIgc8KsNheBjaNzuhr5TQs7A5RRzTrbEwZ2mMrXVEFiC03sgHczF7mlYwzy0bIiVLOwdDQZHfEbHbhp6+1BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:11:12.810091Z"},"content_sha256":"67d69e1de87ab966dc3feaf64725726d84058222191667aea4a14e85434d3ff7","schema_version":"1.0","event_id":"sha256:67d69e1de87ab966dc3feaf64725726d84058222191667aea4a14e85434d3ff7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JIMR4WOIZLMO27HDKMB34QZ763","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenyu Xue, Qi Deng, Yinyu Ye, Zhenwei Lin","submitted_at":"2024-06-01T02:40:29Z","abstract_excerpt":"Robust Markov Decision Processes (RMDPs) have recently been recognized as a valuable and promising approach to discovering a policy with creditable performance, particularly in the presence of a dynamic environment and estimation errors in the transition matrix due to limited data. Despite extensive exploration of dynamic programming algorithms for solving RMDPs, there has been a notable upswing in interest in developing efficient algorithms using the policy gradient method. In this paper, we propose the first single-loop robust policy gradient (SRPG) method with the global optimality guarante"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00274","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/2406.00274/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-05T08:25:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XaSH1+dqgZUN1a4sMVICCUKgBl7tb0BZVekTnskR25e58GTThT+tuOHCwIgE1Y5wfmQcl9p1zal5RXxlzhxZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:11:12.810688Z"},"content_sha256":"964a9302b7b641720838c6cf21781086862cb04b1974c8b6a6ab1e3fb473e551","schema_version":"1.0","event_id":"sha256:964a9302b7b641720838c6cf21781086862cb04b1974c8b6a6ab1e3fb473e551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIMR4WOIZLMO27HDKMB34QZ763/bundle.json","state_url":"https://pith.science/pith/JIMR4WOIZLMO27HDKMB34QZ763/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIMR4WOIZLMO27HDKMB34QZ763/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-06T09:11:12Z","links":{"resolver":"https://pith.science/pith/JIMR4WOIZLMO27HDKMB34QZ763","bundle":"https://pith.science/pith/JIMR4WOIZLMO27HDKMB34QZ763/bundle.json","state":"https://pith.science/pith/JIMR4WOIZLMO27HDKMB34QZ763/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIMR4WOIZLMO27HDKMB34QZ763/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JIMR4WOIZLMO27HDKMB34QZ763","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":"984b5e4433a48591d57063dcde735baf8f9a2cedb2d1dba694f80bdf09f35c6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-01T02:40:29Z","title_canon_sha256":"f097c7afaa1a2bfa3e3b80a2bd4d661d60965d00687d82c00c58bb5c9ed9b7e6"},"schema_version":"1.0","source":{"id":"2406.00274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.00274","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"arxiv_version","alias_value":"2406.00274v1","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00274","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_12","alias_value":"JIMR4WOIZLMO","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"JIMR4WOIZLMO27HD","created_at":"2026-07-05T08:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"JIMR4WOI","created_at":"2026-07-05T08:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:964a9302b7b641720838c6cf21781086862cb04b1974c8b6a6ab1e3fb473e551","target":"graph","created_at":"2026-07-05T08:25: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.00274/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust Markov Decision Processes (RMDPs) have recently been recognized as a valuable and promising approach to discovering a policy with creditable performance, particularly in the presence of a dynamic environment and estimation errors in the transition matrix due to limited data. Despite extensive exploration of dynamic programming algorithms for solving RMDPs, there has been a notable upswing in interest in developing efficient algorithms using the policy gradient method. In this paper, we propose the first single-loop robust policy gradient (SRPG) method with the global optimality guarante","authors_text":"Chenyu Xue, Qi Deng, Yinyu Ye, Zhenwei Lin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-01T02:40:29Z","title":"A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00274","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:67d69e1de87ab966dc3feaf64725726d84058222191667aea4a14e85434d3ff7","target":"record","created_at":"2026-07-05T08:25: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":"984b5e4433a48591d57063dcde735baf8f9a2cedb2d1dba694f80bdf09f35c6a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-01T02:40:29Z","title_canon_sha256":"f097c7afaa1a2bfa3e3b80a2bd4d661d60965d00687d82c00c58bb5c9ed9b7e6"},"schema_version":"1.0","source":{"id":"2406.00274","kind":"arxiv","version":1}},"canonical_sha256":"4a191e59c8cad8ed7ce35303be433ff6e7d656223fe112f1ce320cca8f5cecf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a191e59c8cad8ed7ce35303be433ff6e7d656223fe112f1ce320cca8f5cecf4","first_computed_at":"2026-07-05T08:25:59.428582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:25:59.428582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NchhTXXl15G4ODTPmDrRau+NmUMgIBqttJ7LsHf8st8QLOjCJdmFktJQ6wIZJZ8t6aYC5AsTAMEiws97X11Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:25:59.429124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.00274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67d69e1de87ab966dc3feaf64725726d84058222191667aea4a14e85434d3ff7","sha256:964a9302b7b641720838c6cf21781086862cb04b1974c8b6a6ab1e3fb473e551"],"state_sha256":"6391a85d105b52cc44c9613f476955645dc45cc620551aff16608044e039ad59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6x8DG6a376hZJnksbnjdlrBsxvqZT5ijVXACwzyL3WbLy521K52F8luXC4qIV85RCf97vH7XGHGLz0AQG+QAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:11:12.814294Z","bundle_sha256":"7e78f7b2e36281cfef9061961216edeefe8dad790899e4d1b611a55f268e999a"}}