{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SNAGZLLEPKNTHRHMTZXSKMQPEP","short_pith_number":"pith:SNAGZLLE","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"},"canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","source":{"kind":"arxiv","id":"1401.1590","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1590","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1590v6","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1590","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"SNAGZLLEPKNT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNAGZLLEPKNTHRHM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNAGZLLE","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SNAGZLLEPKNTHRHMTZXSKMQPEP","target":"record","payload":{"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"},"canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","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"},"source_kind":"arxiv","source_id":"1401.1590","source_version":6,"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnBRweuyVugY79sUjpkP4WaUYXSwMG7AeS49sgJ5FOTY3E+qz9Dvk/ET5tMiH9gWSfN0iLn7C35BWpGfKA4vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:34:42.376376Z"},"content_sha256":"83f2295e9936a83a974bbd40404a6415b6488c548f956bf4b261a429660937d7","schema_version":"1.0","event_id":"sha256:83f2295e9936a83a974bbd40404a6415b6488c548f956bf4b261a429660937d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SNAGZLLEPKNTHRHMTZXSKMQPEP","target":"graph","payload":{"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"},"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTr02HF7SvmGoz1VZU2JKJXzt9k1DF7M+l6zISC844zTpCcfk3NkYHraht0JTb2UbniG0+qBi+Rh74RaTnCiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:34:42.376725Z"},"content_sha256":"0a466f7d5537db56489f64fc4e9212bf8d0aff7a1cc0fb2fb29e085c415d59d3","schema_version":"1.0","event_id":"sha256:0a466f7d5537db56489f64fc4e9212bf8d0aff7a1cc0fb2fb29e085c415d59d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/bundle.json","state_url":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/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-06-27T03:34:42Z","links":{"resolver":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP","bundle":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/bundle.json","state":"https://pith.science/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNAGZLLEPKNTHRHMTZXSKMQPEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SNAGZLLEPKNTHRHMTZXSKMQPEP","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":"b23997a26da729461c12f0ef558acb4c2bad42efccd149125b82d3083c0e837d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T07:48:08Z","title_canon_sha256":"37c0c2b6235b6a390dd8320120fa8e960034c91e2be75b96f8d1c7618bce7e46"},"schema_version":"1.0","source":{"id":"1401.1590","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1590","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1590v6","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1590","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"SNAGZLLEPKNT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNAGZLLEPKNTHRHM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNAGZLLE","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:0a466f7d5537db56489f64fc4e9212bf8d0aff7a1cc0fb2fb29e085c415d59d3","target":"graph","created_at":"2026-05-18T01:34:13Z","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":"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","authors_text":"Daniel R. Jiang, Warren B. Powell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T07:48:08Z","title":"An Approximate Dynamic Programming Algorithm for Monotone Value Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1590","kind":"arxiv","version":6},"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:83f2295e9936a83a974bbd40404a6415b6488c548f956bf4b261a429660937d7","target":"record","created_at":"2026-05-18T01:34:13Z","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":"b23997a26da729461c12f0ef558acb4c2bad42efccd149125b82d3083c0e837d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-08T07:48:08Z","title_canon_sha256":"37c0c2b6235b6a390dd8320120fa8e960034c91e2be75b96f8d1c7618bce7e46"},"schema_version":"1.0","source":{"id":"1401.1590","kind":"arxiv","version":6}},"canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93406cad647a9b33c4ec9e6f25320f23ddc407534492095c5c33e48b7d48331a","first_computed_at":"2026-05-18T01:34:13.637469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:13.637469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7/gBB/xUImefZYPARROfJfV9L3dXsE5MYyupP1AGX2NhdbeNDBYzbO+YPmS2OfmJPtyAMvim0JqF63CgEp8Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:13.638406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1590","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83f2295e9936a83a974bbd40404a6415b6488c548f956bf4b261a429660937d7","sha256:0a466f7d5537db56489f64fc4e9212bf8d0aff7a1cc0fb2fb29e085c415d59d3"],"state_sha256":"57bacf96986d93d6851347b11a55b7e2599221d25d43b1075dc6dafa5cc08ec9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gw8GWGl0rfa/KQaUoJdemP2fW0d8/z5JG00LCsDUnpPlYAQHh3P+OCXLPaVyA77bglEk/EGy6zKgqdT5qisZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:34:42.378627Z","bundle_sha256":"355e25393b6522030f2cc9418601482f72b87f440c6b42ea086225701c8675e1"}}