{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QQL2CDJWXPJZPXQLYKZMLYGIVK","short_pith_number":"pith:QQL2CDJW","canonical_record":{"source":{"id":"1407.2676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-10T02:34:15Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","stat.ML"],"title_canon_sha256":"a6ae6a4547b767e2ae4dee6388f81a1b668038afc24c07c97c9300c9401371fc","abstract_canon_sha256":"a48e25287c8158e7ae72ef1c179e0d812e35ab9c6d03c6729846858772c12b91"},"schema_version":"1.0"},"canonical_sha256":"8417a10d36bbd397de0bc2b2c5e0c8aaa070a731bb132fb162ff20c87893156a","source":{"kind":"arxiv","id":"1407.2676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2676","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2676v2","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2676","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"QQL2CDJWXPJZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQL2CDJWXPJZPXQL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQL2CDJW","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QQL2CDJWXPJZPXQLYKZMLYGIVK","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-10T02:34:15Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","stat.ML"],"title_canon_sha256":"a6ae6a4547b767e2ae4dee6388f81a1b668038afc24c07c97c9300c9401371fc","abstract_canon_sha256":"a48e25287c8158e7ae72ef1c179e0d812e35ab9c6d03c6729846858772c12b91"},"schema_version":"1.0"},"canonical_sha256":"8417a10d36bbd397de0bc2b2c5e0c8aaa070a731bb132fb162ff20c87893156a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.506630Z","signature_b64":"SKI+uuojfjyaT9UMYWhDPsDOFEYjOmtaBU75wdPbIVbuZmNzFA4Hf6d62RJeb1jfm0ZEwOj5/dlnlM26koEuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8417a10d36bbd397de0bc2b2c5e0c8aaa070a731bb132fb162ff20c87893156a","last_reissued_at":"2026-05-18T02:47:43.505745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.505745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2676","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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDOVisnoClbrck6JaFh28rBvQ1GwFqvSHbn5YKV8lsTePmZAYTa4Fi72QVfKY7HIE48FoSL6+8sCGF8uyMA2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:00:15.576001Z"},"content_sha256":"445664798b564e5124ab91297400ed5d670d50b07a08edee83644e2263892504","schema_version":"1.0","event_id":"sha256:445664798b564e5124ab91297400ed5d670d50b07a08edee83644e2263892504"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QQL2CDJWXPJZPXQLYKZMLYGIVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Optimal Stepsize For Approximate Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Ilya O. Ryzhov, Peter I. Frazier, Warren B. Powell","submitted_at":"2014-07-10T02:34:15Z","abstract_excerpt":"Approximate dynamic programming (ADP) has proven itself in a wide range of applications spanning large-scale transportation problems, health care, revenue management, and energy systems. The design of effective ADP algorithms has many dimensions, but one crucial factor is the stepsize rule used to update a value function approximation. Many operations research applications are computationally intensive, and it is important to obtain good results quickly. Furthermore, the most popular stepsize formulas use tunable parameters and can produce very poor results if tuned improperly. We derive a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2676","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:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtMBhKboDlQFUy7cEFW/av5XNGTDhiKpF4ihoJ3n3N+NVWskvlyFJi7A+VDg5LEjUTvAh+FKu7ORUFmQNbv5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:00:15.576660Z"},"content_sha256":"263c9bdc89ae134dab0091d3e9cdf3010e6c08593cce87c096f23ff6c45a3a07","schema_version":"1.0","event_id":"sha256:263c9bdc89ae134dab0091d3e9cdf3010e6c08593cce87c096f23ff6c45a3a07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/bundle.json","state_url":"https://pith.science/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/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-25T14:00:15Z","links":{"resolver":"https://pith.science/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK","bundle":"https://pith.science/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/bundle.json","state":"https://pith.science/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQL2CDJWXPJZPXQLYKZMLYGIVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QQL2CDJWXPJZPXQLYKZMLYGIVK","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":"a48e25287c8158e7ae72ef1c179e0d812e35ab9c6d03c6729846858772c12b91","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-10T02:34:15Z","title_canon_sha256":"a6ae6a4547b767e2ae4dee6388f81a1b668038afc24c07c97c9300c9401371fc"},"schema_version":"1.0","source":{"id":"1407.2676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2676","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2676v2","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2676","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"QQL2CDJWXPJZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQL2CDJWXPJZPXQL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQL2CDJW","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:263c9bdc89ae134dab0091d3e9cdf3010e6c08593cce87c096f23ff6c45a3a07","target":"graph","created_at":"2026-05-18T02:47:43Z","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":"Approximate dynamic programming (ADP) has proven itself in a wide range of applications spanning large-scale transportation problems, health care, revenue management, and energy systems. The design of effective ADP algorithms has many dimensions, but one crucial factor is the stepsize rule used to update a value function approximation. Many operations research applications are computationally intensive, and it is important to obtain good results quickly. Furthermore, the most popular stepsize formulas use tunable parameters and can produce very poor results if tuned improperly. We derive a new","authors_text":"Ilya O. Ryzhov, Peter I. Frazier, Warren B. Powell","cross_cats":["cs.AI","cs.LG","cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-10T02:34:15Z","title":"A New Optimal Stepsize For Approximate Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2676","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:445664798b564e5124ab91297400ed5d670d50b07a08edee83644e2263892504","target":"record","created_at":"2026-05-18T02:47:43Z","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":"a48e25287c8158e7ae72ef1c179e0d812e35ab9c6d03c6729846858772c12b91","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-10T02:34:15Z","title_canon_sha256":"a6ae6a4547b767e2ae4dee6388f81a1b668038afc24c07c97c9300c9401371fc"},"schema_version":"1.0","source":{"id":"1407.2676","kind":"arxiv","version":2}},"canonical_sha256":"8417a10d36bbd397de0bc2b2c5e0c8aaa070a731bb132fb162ff20c87893156a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8417a10d36bbd397de0bc2b2c5e0c8aaa070a731bb132fb162ff20c87893156a","first_computed_at":"2026-05-18T02:47:43.505745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.505745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKI+uuojfjyaT9UMYWhDPsDOFEYjOmtaBU75wdPbIVbuZmNzFA4Hf6d62RJeb1jfm0ZEwOj5/dlnlM26koEuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.506630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:445664798b564e5124ab91297400ed5d670d50b07a08edee83644e2263892504","sha256:263c9bdc89ae134dab0091d3e9cdf3010e6c08593cce87c096f23ff6c45a3a07"],"state_sha256":"7a94dc05cb8b455751542e1c637378c97cb3e30c54f2fd667dfff7bfc9349157"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVbjRh9xQR+YP4QkBd2g0TjlQ3wUpte3d+WXp+WxOYcUtx0lgP17umjomMxhvry26UD0iFkHHurqNBq1Dd/pBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:00:15.580231Z","bundle_sha256":"ee33c13ac965aa6fef98e9bd63103d148b8efd28ad0302895df9ed2097d17b69"}}