{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A2OFYWXEVD4QQJOCZGUJTAQN5T","short_pith_number":"pith:A2OFYWXE","canonical_record":{"source":{"id":"1403.5554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-21T19:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"b3b564b86466e2d0ccf10dc05e539d7a9a2af13524bad033d8bf562e6f9a9bde","abstract_canon_sha256":"4fe8c604da87af5b37fc75618275f6a981d22c0773a045ee1903e2869a4deaae"},"schema_version":"1.0"},"canonical_sha256":"069c5c5ae4a8f90825c2c9a899820dece2f7904fa7005b2ceb66860c93e2eff3","source":{"kind":"arxiv","id":"1403.5554","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5554","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5554v2","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5554","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"A2OFYWXEVD4Q","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2OFYWXEVD4QQJOC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2OFYWXE","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A2OFYWXEVD4QQJOCZGUJTAQN5T","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-21T19:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"b3b564b86466e2d0ccf10dc05e539d7a9a2af13524bad033d8bf562e6f9a9bde","abstract_canon_sha256":"4fe8c604da87af5b37fc75618275f6a981d22c0773a045ee1903e2869a4deaae"},"schema_version":"1.0"},"canonical_sha256":"069c5c5ae4a8f90825c2c9a899820dece2f7904fa7005b2ceb66860c93e2eff3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:20.209168Z","signature_b64":"YjakCECit3I5FWl9Bqn8NWvFkGNOjRct1yDUFvRpr75WBmfLLN+l8wOvgw6FkbHgIC8nbuOSgCPAI04uETOQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069c5c5ae4a8f90825c2c9a899820dece2f7904fa7005b2ceb66860c93e2eff3","last_reissued_at":"2026-05-18T02:55:20.208782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:20.208782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5554","source_version":2,"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-18T02:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMMD6S80fVgZSe02231VQnIu7GEqEBPGyUBx2gj+tQhjCAySW8J9BS9p1+vmPECAmheFlJZYZs2n8LaEJH/2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:43:55.351966Z"},"content_sha256":"36e4ed11354bf514e94f7d75b2858457b3ecb8e5023be425a1be0a17d7b2662f","schema_version":"1.0","event_id":"sha256:36e4ed11354bf514e94f7d75b2858457b3ecb8e5023be425a1be0a17d7b2662f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A2OFYWXEVD4QQJOCZGUJTAQN5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guaranteed Bounds for General Approximate Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Pezeshki, Bill Moran, Edwin K. P. Chong, Yajing Liu","submitted_at":"2014-03-21T19:50:51Z","abstract_excerpt":"In this paper, we will develop a systematic approach to deriving guaranteed bounds for approximate dynamic programming (ADP) schemes in optimal control problems. Our approach is inspired by our recent results on bounding the performance of greedy strategies in optimization of string-submodular functions over a finite horizon. The approach is to derive a string-submodular optimization problem, for which the optimal strategy is the optimal control solution and the greedy strategy is the ADP solution. Using this approach, we show that any ADP solution achieves a performance that is at least a fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5554","kind":"arxiv","version":2},"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-18T02:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYkyPghMFn6QsHartjvVU4007gO4HemwpdbrByrEhI6fDN+KYNuwZBhpWhOyosSLvUBz9C41CFDquGtIU8XqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:43:55.352393Z"},"content_sha256":"98ff2909bdcd94168bbaa0f532ec29d161bd4b6bf2a69b06b5fbdadf9a846f66","schema_version":"1.0","event_id":"sha256:98ff2909bdcd94168bbaa0f532ec29d161bd4b6bf2a69b06b5fbdadf9a846f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/bundle.json","state_url":"https://pith.science/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/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-26T04:43:55Z","links":{"resolver":"https://pith.science/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T","bundle":"https://pith.science/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/bundle.json","state":"https://pith.science/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2OFYWXEVD4QQJOCZGUJTAQN5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A2OFYWXEVD4QQJOCZGUJTAQN5T","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":"4fe8c604da87af5b37fc75618275f6a981d22c0773a045ee1903e2869a4deaae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-21T19:50:51Z","title_canon_sha256":"b3b564b86466e2d0ccf10dc05e539d7a9a2af13524bad033d8bf562e6f9a9bde"},"schema_version":"1.0","source":{"id":"1403.5554","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5554","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5554v2","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5554","created_at":"2026-05-18T02:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"A2OFYWXEVD4Q","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A2OFYWXEVD4QQJOC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A2OFYWXE","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:98ff2909bdcd94168bbaa0f532ec29d161bd4b6bf2a69b06b5fbdadf9a846f66","target":"graph","created_at":"2026-05-18T02:55:20Z","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":"In this paper, we will develop a systematic approach to deriving guaranteed bounds for approximate dynamic programming (ADP) schemes in optimal control problems. Our approach is inspired by our recent results on bounding the performance of greedy strategies in optimization of string-submodular functions over a finite horizon. The approach is to derive a string-submodular optimization problem, for which the optimal strategy is the optimal control solution and the greedy strategy is the ADP solution. Using this approach, we show that any ADP solution achieves a performance that is at least a fac","authors_text":"Ali Pezeshki, Bill Moran, Edwin K. P. Chong, Yajing Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-21T19:50:51Z","title":"Guaranteed Bounds for General Approximate Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5554","kind":"arxiv","version":2},"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:36e4ed11354bf514e94f7d75b2858457b3ecb8e5023be425a1be0a17d7b2662f","target":"record","created_at":"2026-05-18T02:55:20Z","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":"4fe8c604da87af5b37fc75618275f6a981d22c0773a045ee1903e2869a4deaae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-21T19:50:51Z","title_canon_sha256":"b3b564b86466e2d0ccf10dc05e539d7a9a2af13524bad033d8bf562e6f9a9bde"},"schema_version":"1.0","source":{"id":"1403.5554","kind":"arxiv","version":2}},"canonical_sha256":"069c5c5ae4a8f90825c2c9a899820dece2f7904fa7005b2ceb66860c93e2eff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"069c5c5ae4a8f90825c2c9a899820dece2f7904fa7005b2ceb66860c93e2eff3","first_computed_at":"2026-05-18T02:55:20.208782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:20.208782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YjakCECit3I5FWl9Bqn8NWvFkGNOjRct1yDUFvRpr75WBmfLLN+l8wOvgw6FkbHgIC8nbuOSgCPAI04uETOQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:20.209168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5554","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e4ed11354bf514e94f7d75b2858457b3ecb8e5023be425a1be0a17d7b2662f","sha256:98ff2909bdcd94168bbaa0f532ec29d161bd4b6bf2a69b06b5fbdadf9a846f66"],"state_sha256":"86502f8309ff22af2fe9ab9e6da79d52f2e34bca06a4b0df98003e92166a57cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDceB4E0Ws73tVpMPdDrSZz2DgtdIza/lEdBQUqOJ2xH6daaANEikoeI5wfiGhsVyR48rQaTBWUM/BNfpj8dAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:43:55.354995Z","bundle_sha256":"d37a541d373462cdcc23ec27979f86d6e2ce5a38e88fb7812ec207109476ef08"}}