{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SNAGZLLEPKNTHRHMTZXSKMQPEP","short_pith_number":"pith:SNAGZLLE","schema_version":"1.0","canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","source":{"kind":"arxiv","id":"1401.1590","version":6},"attestation_state":"computed","paper":{"title":"An Approximate Dynamic Programming Algorithm for Monotone Value Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel R. Jiang, Warren B. Powell","submitted_at":"2014-01-08T07:48:08Z","abstract_excerpt":"Many sequential decision problems can be formulated as Markov Decision Processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some or all of its dimensions. When the state space becomes large, traditional techniques, such as the backward dynamic programming algorithm (i.e., backward induction or value iteration), may no longer be effective in finding a solution within a reasonable time frame, and thus we are forced to consider other approaches, such as approximate dynamic programming (ADP). We propose a provably convergent ADP"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.1590","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T07:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"37c0c2b6235b6a390dd8320120fa8e960034c91e2be75b96f8d1c7618bce7e46","abstract_canon_sha256":"b23997a26da729461c12f0ef558acb4c2bad42efccd149125b82d3083c0e837d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.638406Z","signature_b64":"A7/gBB/xUImefZYPARROfJfV9L3dXsE5MYyupP1AGX2NhdbeNDBYzbO+YPmS2OfmJPtyAMvim0JqF63CgEp8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","last_reissued_at":"2026-05-18T01:34:13.637469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.637469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximate Dynamic Programming Algorithm for Monotone Value Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel R. Jiang, Warren B. Powell","submitted_at":"2014-01-08T07:48:08Z","abstract_excerpt":"Many sequential decision problems can be formulated as Markov Decision Processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some or all of its dimensions. When the state space becomes large, traditional techniques, such as the backward dynamic programming algorithm (i.e., backward induction or value iteration), may no longer be effective in finding a solution within a reasonable time frame, and thus we are forced to consider other approaches, such as approximate dynamic programming (ADP). We propose a provably convergent ADP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1590","kind":"arxiv","version":6},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.1590","created_at":"2026-05-18T01:34:13.637639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1590v6","created_at":"2026-05-18T01:34:13.637639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1590","created_at":"2026-05-18T01:34:13.637639+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNAGZLLEPKNT","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNAGZLLEPKNTHRHM","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNAGZLLE","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP","json":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP.json","graph_json":"https://pith.science/api/pith-number/SNAGZLLEPKNTHRHMTZXSKMQPEP/graph.json","events_json":"https://pith.science/api/pith-number/SNAGZLLEPKNTHRHMTZXSKMQPEP/events.json","paper":"https://pith.science/paper/SNAGZLLE"},"agent_actions":{"view_html":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP","download_json":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP.json","view_paper":"https://pith.science/paper/SNAGZLLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1590&json=true","fetch_graph":"https://pith.science/api/pith-number/SNAGZLLEPKNTHRHMTZXSKMQPEP/graph.json","fetch_events":"https://pith.science/api/pith-number/SNAGZLLEPKNTHRHMTZXSKMQPEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/action/storage_attestation","attest_author":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/action/author_attestation","sign_citation":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/action/citation_signature","submit_replication":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/action/replication_record"}},"created_at":"2026-05-18T01:34:13.637639+00:00","updated_at":"2026-05-18T01:34:13.637639+00:00"}