{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7XONRNLCHUDPPEWD77FYVS2ZIF","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":"3ad53f26ab79e47d572ea9e8807a2cbe0479f8e73377e5bc464584bf9ce54181","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-06T14:45:40Z","title_canon_sha256":"4a91c3b99ef9c0436b8ab7a1e9a7e3f6030058ffaba5904559eec539338ab871"},"schema_version":"1.0","source":{"id":"1704.01869","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01869","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01869v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01869","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"7XONRNLCHUDP","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7XONRNLCHUDPPEWD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7XONRNLC","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:fdb70cbab76257d5fcb8cfca233d6c226b5ce1e345e9abc75c64de6a37a35ac2","target":"graph","created_at":"2026-05-17T23:44:33Z","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 propose a novel randomized linear programming algorithm for approximating the optimal policy of the discounted Markov decision problem. By leveraging the value-policy duality and binary-tree data structures, the algorithm adaptively samples state-action-state transitions and makes exponentiated primal-dual updates. We show that it finds an $\\epsilon$-optimal policy using nearly-linear run time in the worst case. When the Markov decision process is ergodic and specified in some special data formats, the algorithm finds an $\\epsilon$-optimal policy using run time linear in the total number of","authors_text":"Mengdi Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-06T14:45:40Z","title":"Randomized Linear Programming Solves the Discounted Markov Decision Problem In Nearly-Linear (Sometimes Sublinear) Running Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01869","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:e59bd05f05166402f4a63b65892e1ec16520daafb78d9cd014812cb459c90807","target":"record","created_at":"2026-05-17T23:44:33Z","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":"3ad53f26ab79e47d572ea9e8807a2cbe0479f8e73377e5bc464584bf9ce54181","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-06T14:45:40Z","title_canon_sha256":"4a91c3b99ef9c0436b8ab7a1e9a7e3f6030058ffaba5904559eec539338ab871"},"schema_version":"1.0","source":{"id":"1704.01869","kind":"arxiv","version":3}},"canonical_sha256":"fddcd8b5623d06f792c3ffcb8acb59415164c42955212f8d50b1a38acb4afc59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fddcd8b5623d06f792c3ffcb8acb59415164c42955212f8d50b1a38acb4afc59","first_computed_at":"2026-05-17T23:44:33.075840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.075840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OdYQJ0bbvqTfZJagOAVsE0Xx7jDagumUEo96tqsZiuxpRMyC2Y0iAVmY97/OYsmqNFNny3K94rvEUA2NJI2FDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.076395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01869","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e59bd05f05166402f4a63b65892e1ec16520daafb78d9cd014812cb459c90807","sha256:fdb70cbab76257d5fcb8cfca233d6c226b5ce1e345e9abc75c64de6a37a35ac2"],"state_sha256":"51f4330d2f62077dc2dd681e81cbebc0c9a5660a7598cd82857c31cbfd22be8f"}