{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FZBBM2G6FCCMCRPAFEQ54UQ2AK","short_pith_number":"pith:FZBBM2G6","canonical_record":{"source":{"id":"1206.4568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-20T18:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"37b55488f84f5073f1f08808ff4ef5c030a5cb4599331079bbea31fadf0e45b1","abstract_canon_sha256":"c97dcefdfa4884df269d4b5fd2482d67ac15c027b433b4b9b9782975b0a3c478"},"schema_version":"1.0"},"canonical_sha256":"2e421668de2884c145e02921de521a02abcac1d2820a24a58369fe21f1e9f8b5","source":{"kind":"arxiv","id":"1206.4568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4568","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4568v1","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4568","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"FZBBM2G6FCCM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FZBBM2G6FCCMCRPA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FZBBM2G6","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FZBBM2G6FCCMCRPAFEQ54UQ2AK","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-20T18:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"37b55488f84f5073f1f08808ff4ef5c030a5cb4599331079bbea31fadf0e45b1","abstract_canon_sha256":"c97dcefdfa4884df269d4b5fd2482d67ac15c027b433b4b9b9782975b0a3c478"},"schema_version":"1.0"},"canonical_sha256":"2e421668de2884c145e02921de521a02abcac1d2820a24a58369fe21f1e9f8b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:05.364197Z","signature_b64":"MTSj27Zv9PkP3GXqufv5vftb+n9dS1M1RfU9tDcos2SNbcZaDhPq26gyMhta8yv6u0SfBZtEOVdKiYfotjYXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e421668de2884c145e02921de521a02abcac1d2820a24a58369fe21f1e9f8b5","last_reissued_at":"2026-05-18T03:53:05.363509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:05.363509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4568","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:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upNMnmazHPPlJnWUhxeby2lF7YsalidqAL4XWPkgN/6BPEV5JvBj3EfwbOyccTEHE4blkGvwvUEAm4Ti8wX4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:23:09.019758Z"},"content_sha256":"d027372392cf92af2164b7a654d037c4f1848f19316839f3550a77a46cc55700","schema_version":"1.0","event_id":"sha256:d027372392cf92af2164b7a654d037c4f1848f19316839f3550a77a46cc55700"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FZBBM2G6FCCMCRPAFEQ54UQ2AK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic dominance-constrained Markov decision processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rahul Jain, William B. Haskell","submitted_at":"2012-06-20T18:10:01Z","abstract_excerpt":"We are interested in risk constraints for infinite horizon discrete time Markov decision processes (MDPs). Starting with average reward MDPs, we show that increasing concave stochastic dominance constraints on the empirical distribution of reward lead to linear constraints on occupation measures. The optimal policy for the resulting class of dominance-constrained MDPs is obtained by solving a linear program. We compute the dual of this linear program to obtain average dynamic programming optimality equations that reflect the dominance constraint. In particular, a new pricing term appears in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4568","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-18T03:53:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXTG0OFoDsZ8Dd9qFDl07McgBXBTV/J4IuC7DSJESIF2/xz0l5wB3yplfxCLumCpkokzw76S2BHeZbCT204tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:23:09.020411Z"},"content_sha256":"0eec553581f7134450f18e221a6c5f3f4629bb045e3a85a1ec05526715e6cc65","schema_version":"1.0","event_id":"sha256:0eec553581f7134450f18e221a6c5f3f4629bb045e3a85a1ec05526715e6cc65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/bundle.json","state_url":"https://pith.science/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/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-05-28T00:23:09Z","links":{"resolver":"https://pith.science/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK","bundle":"https://pith.science/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/bundle.json","state":"https://pith.science/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZBBM2G6FCCMCRPAFEQ54UQ2AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FZBBM2G6FCCMCRPAFEQ54UQ2AK","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":"c97dcefdfa4884df269d4b5fd2482d67ac15c027b433b4b9b9782975b0a3c478","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-20T18:10:01Z","title_canon_sha256":"37b55488f84f5073f1f08808ff4ef5c030a5cb4599331079bbea31fadf0e45b1"},"schema_version":"1.0","source":{"id":"1206.4568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4568","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4568v1","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4568","created_at":"2026-05-18T03:53:05Z"},{"alias_kind":"pith_short_12","alias_value":"FZBBM2G6FCCM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FZBBM2G6FCCMCRPA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FZBBM2G6","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:0eec553581f7134450f18e221a6c5f3f4629bb045e3a85a1ec05526715e6cc65","target":"graph","created_at":"2026-05-18T03:53:05Z","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":"We are interested in risk constraints for infinite horizon discrete time Markov decision processes (MDPs). Starting with average reward MDPs, we show that increasing concave stochastic dominance constraints on the empirical distribution of reward lead to linear constraints on occupation measures. The optimal policy for the resulting class of dominance-constrained MDPs is obtained by solving a linear program. We compute the dual of this linear program to obtain average dynamic programming optimality equations that reflect the dominance constraint. In particular, a new pricing term appears in th","authors_text":"Rahul Jain, William B. Haskell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-20T18:10:01Z","title":"Stochastic dominance-constrained Markov decision processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4568","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:d027372392cf92af2164b7a654d037c4f1848f19316839f3550a77a46cc55700","target":"record","created_at":"2026-05-18T03:53:05Z","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":"c97dcefdfa4884df269d4b5fd2482d67ac15c027b433b4b9b9782975b0a3c478","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-20T18:10:01Z","title_canon_sha256":"37b55488f84f5073f1f08808ff4ef5c030a5cb4599331079bbea31fadf0e45b1"},"schema_version":"1.0","source":{"id":"1206.4568","kind":"arxiv","version":1}},"canonical_sha256":"2e421668de2884c145e02921de521a02abcac1d2820a24a58369fe21f1e9f8b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e421668de2884c145e02921de521a02abcac1d2820a24a58369fe21f1e9f8b5","first_computed_at":"2026-05-18T03:53:05.363509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:05.363509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MTSj27Zv9PkP3GXqufv5vftb+n9dS1M1RfU9tDcos2SNbcZaDhPq26gyMhta8yv6u0SfBZtEOVdKiYfotjYXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:05.364197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d027372392cf92af2164b7a654d037c4f1848f19316839f3550a77a46cc55700","sha256:0eec553581f7134450f18e221a6c5f3f4629bb045e3a85a1ec05526715e6cc65"],"state_sha256":"6de77f2b201c22352ef31e2386d6f1aa5e9f20ec0c6be39a6eb0f6d2d0379372"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMKhz74aP8jr3SXKGhLF69QgNUmRSu/xrL3/j4rqSSY5uTnrUvmP64WiQKrGYm8Xele0OtA4zjoNC7CFnXLxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:23:09.023379Z","bundle_sha256":"3c3cd5592ceffaab3d5fd34d9d645e0ddf9c647b49cbb0a697f3f3885c5e6a6b"}}