{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XVWZDOG6V6PMQVMFA7MR7W4DQU","short_pith_number":"pith:XVWZDOG6","canonical_record":{"source":{"id":"2412.14002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T16:17:25Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fa4fdf25124ac7365e9a4785ea3b9821d540ec6ef75f0c4f9ac38c83adf01479","abstract_canon_sha256":"9035a6bb8ae1606e67c1e5a5bf50fdd9471d5803f236c3785f2cb067ff3774a2"},"schema_version":"1.0"},"canonical_sha256":"bd6d91b8deaf9ec8558507d91fdb83850360a9e54b3633677273063a07fe9f83","source":{"kind":"arxiv","id":"2412.14002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14002","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14002v1","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14002","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_12","alias_value":"XVWZDOG6V6PM","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_16","alias_value":"XVWZDOG6V6PMQVMF","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_8","alias_value":"XVWZDOG6","created_at":"2026-07-05T09:51:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XVWZDOG6V6PMQVMFA7MR7W4DQU","target":"record","payload":{"canonical_record":{"source":{"id":"2412.14002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T16:17:25Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fa4fdf25124ac7365e9a4785ea3b9821d540ec6ef75f0c4f9ac38c83adf01479","abstract_canon_sha256":"9035a6bb8ae1606e67c1e5a5bf50fdd9471d5803f236c3785f2cb067ff3774a2"},"schema_version":"1.0"},"canonical_sha256":"bd6d91b8deaf9ec8558507d91fdb83850360a9e54b3633677273063a07fe9f83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:12.056879Z","signature_b64":"/ygRx0o2Wkr6LhN4123In2wEMId+VUneVPCgURqbhZpEOaS3guDGg1SKgro8QBqWP7/ZZsmAEwaYojxP80jqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd6d91b8deaf9ec8558507d91fdb83850360a9e54b3633677273063a07fe9f83","last_reissued_at":"2026-07-05T09:51:12.056331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:12.056331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.14002","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-05T09:51:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1BQXn3cQUfsSNHvhIm6VhblZRmdzqo13kuvmndP2cP48RPaQWZKWcnU55APlruA/Kfr0u5aI9Wv5ZAiT4CoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:07:09.532525Z"},"content_sha256":"07a9580efa2129a78b09ae600e4901125b64ac298b42508d67aedbfdf0615352","schema_version":"1.0","event_id":"sha256:07a9580efa2129a78b09ae600e4901125b64ac298b42508d67aedbfdf0615352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XVWZDOG6V6PMQVMFA7MR7W4DQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Operator Splitting for Convex Constrained Markov Decision Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Anastasios Tsiamis, John Lygeros, Panagiotis D. Grontas","submitted_at":"2024-12-18T16:17:25Z","abstract_excerpt":"We consider finite Markov decision processes (MDPs) with convex constraints and known dynamics. In principle, this problem is amenable to off-the-shelf convex optimization solvers, but typically this approach suffers from poor scalability. In this work, we develop a first-order algorithm, based on the Douglas-Rachford splitting, that allows us to decompose the dynamics and constraints. Thanks to this decoupling, we can incorporate a wide variety of convex constraints. Our scheme consists of simple and easy-to-implement updates that alternate between solving a regularized MDP and a projection. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14002","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/2412.14002/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-05T09:51:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vu3y0+8hiVwjVzBcGiMb2q+9EWg2qTfCSto+F+Nkl1oLIo04sO0Qxps5n119DlmFYCkc7uzp7wBFknje/8iSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:07:09.533550Z"},"content_sha256":"d6b2b5119b55b9b068a877e305261a7bd99adf1e62c76673b9cece002741a464","schema_version":"1.0","event_id":"sha256:d6b2b5119b55b9b068a877e305261a7bd99adf1e62c76673b9cece002741a464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/bundle.json","state_url":"https://pith.science/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/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-15T05:07:09Z","links":{"resolver":"https://pith.science/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU","bundle":"https://pith.science/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/bundle.json","state":"https://pith.science/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVWZDOG6V6PMQVMFA7MR7W4DQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XVWZDOG6V6PMQVMFA7MR7W4DQU","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":"9035a6bb8ae1606e67c1e5a5bf50fdd9471d5803f236c3785f2cb067ff3774a2","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T16:17:25Z","title_canon_sha256":"fa4fdf25124ac7365e9a4785ea3b9821d540ec6ef75f0c4f9ac38c83adf01479"},"schema_version":"1.0","source":{"id":"2412.14002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14002","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14002v1","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14002","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_12","alias_value":"XVWZDOG6V6PM","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_16","alias_value":"XVWZDOG6V6PMQVMF","created_at":"2026-07-05T09:51:12Z"},{"alias_kind":"pith_short_8","alias_value":"XVWZDOG6","created_at":"2026-07-05T09:51:12Z"}],"graph_snapshots":[{"event_id":"sha256:d6b2b5119b55b9b068a877e305261a7bd99adf1e62c76673b9cece002741a464","target":"graph","created_at":"2026-07-05T09:51:12Z","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/2412.14002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider finite Markov decision processes (MDPs) with convex constraints and known dynamics. In principle, this problem is amenable to off-the-shelf convex optimization solvers, but typically this approach suffers from poor scalability. In this work, we develop a first-order algorithm, based on the Douglas-Rachford splitting, that allows us to decompose the dynamics and constraints. Thanks to this decoupling, we can incorporate a wide variety of convex constraints. Our scheme consists of simple and easy-to-implement updates that alternate between solving a regularized MDP and a projection. ","authors_text":"Anastasios Tsiamis, John Lygeros, Panagiotis D. Grontas","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T16:17:25Z","title":"Operator Splitting for Convex Constrained Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14002","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:07a9580efa2129a78b09ae600e4901125b64ac298b42508d67aedbfdf0615352","target":"record","created_at":"2026-07-05T09:51:12Z","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":"9035a6bb8ae1606e67c1e5a5bf50fdd9471d5803f236c3785f2cb067ff3774a2","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-18T16:17:25Z","title_canon_sha256":"fa4fdf25124ac7365e9a4785ea3b9821d540ec6ef75f0c4f9ac38c83adf01479"},"schema_version":"1.0","source":{"id":"2412.14002","kind":"arxiv","version":1}},"canonical_sha256":"bd6d91b8deaf9ec8558507d91fdb83850360a9e54b3633677273063a07fe9f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd6d91b8deaf9ec8558507d91fdb83850360a9e54b3633677273063a07fe9f83","first_computed_at":"2026-07-05T09:51:12.056331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:51:12.056331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ygRx0o2Wkr6LhN4123In2wEMId+VUneVPCgURqbhZpEOaS3guDGg1SKgro8QBqWP7/ZZsmAEwaYojxP80jqAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:51:12.056879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.14002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07a9580efa2129a78b09ae600e4901125b64ac298b42508d67aedbfdf0615352","sha256:d6b2b5119b55b9b068a877e305261a7bd99adf1e62c76673b9cece002741a464"],"state_sha256":"2e4c07945e32f0e8785c2339a94310a9fb43638fb3dd0ce436701f4dba715fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJU2xMN9FK2hGBmWG/4gvPPk827bH+valARF45vOnpcP0MHgBduYNZJgHyqMLqOJvn3Ia9FRDJeCh01bvs3GDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:07:09.540319Z","bundle_sha256":"bad7f66ccbcfbf43aa9be61e7e4fe226896b794b6451fb6783703056b38442a9"}}