{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UDSWAGLM6ETKXENLSH7NLI2LQY","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":"9d2bf12a77225a7711e77203d7ed22e4b588a2c8a0e4b13ed19e4f4244be882c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-28T21:25:45Z","title_canon_sha256":"22dec8031fc5d945e8d73fb8032ec2ce258b9e5ccac51e006ee6f8defb97ad28"},"schema_version":"1.0","source":{"id":"1905.12095","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12095","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12095v3","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12095","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"UDSWAGLM6ETK","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"UDSWAGLM6ETKXENL","created_at":"2026-06-02T01:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"UDSWAGLM","created_at":"2026-06-02T01:03:27Z"}],"graph_snapshots":[{"event_id":"sha256:507c319fc956357d6e9d384f0876d49e420b95c7ad72048ec9396032350cd544","target":"graph","created_at":"2026-06-02T01:03:27Z","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/1905.12095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the linear programming approach for constrained and unconstrained Markov decision processes (MDPs) under the long-run average cost criterion, where the class of MDPs in our study have Borel state spaces and discrete countable action spaces. Under a strict unboundedness condition on the one-stage costs and a recently introduced majorization condition on the state transition stochastic kernel, we study infinite-dimensional linear programs for the average-cost MDPs and prove the absence of a duality gap and other optimality results. Our results do not require a lower-semicontinuous MD","authors_text":"Huizhen Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-28T21:25:45Z","title":"On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12095","kind":"arxiv","version":3},"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:1f0a89b2ce0cac95e718a94d5caf04a3c5ffd88c6c4659f210a47a5e83bd75d2","target":"record","created_at":"2026-06-02T01:03:27Z","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":"9d2bf12a77225a7711e77203d7ed22e4b588a2c8a0e4b13ed19e4f4244be882c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-28T21:25:45Z","title_canon_sha256":"22dec8031fc5d945e8d73fb8032ec2ce258b9e5ccac51e006ee6f8defb97ad28"},"schema_version":"1.0","source":{"id":"1905.12095","kind":"arxiv","version":3}},"canonical_sha256":"a0e560196cf126ab91ab91fed5a34b860efd2583285238a1e5ff0f0bc8b7f7e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e560196cf126ab91ab91fed5a34b860efd2583285238a1e5ff0f0bc8b7f7e9","first_computed_at":"2026-06-02T01:03:27.406594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:27.406594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpzUP7an0GVyy9XZVs0J+yydauut9Qf0waMbU8OakOhbqwoGETnKFutuat9oorZHTSuWi1xbTl3GiLQ2NOi4Bw==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:27.406957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12095","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f0a89b2ce0cac95e718a94d5caf04a3c5ffd88c6c4659f210a47a5e83bd75d2","sha256:507c319fc956357d6e9d384f0876d49e420b95c7ad72048ec9396032350cd544"],"state_sha256":"ac2db1252b6ffe9e9de8b11105a0be51d72140f577956bcd2ce694ad21b52366"}