{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CUMUAQ7K4MCKB3W2EFRC7SLHSM","short_pith_number":"pith:CUMUAQ7K","schema_version":"1.0","canonical_sha256":"15194043eae304a0eeda21622fc9679323f1284bae4ef6e3f67174fd548a9db6","source":{"kind":"arxiv","id":"1301.0451","version":1},"attestation_state":"computed","paper":{"title":"General limit value in Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J\\'er\\^ome Renault (GREMAQ)","submitted_at":"2013-01-03T13:24:04Z","abstract_excerpt":"We consider a dynamic programming problem with arbitrary state space and bounded rewards. Is it possible to define in an unique way a limit value for the problem, where the \"patience\" of the decision-maker tends to infinity ? We consider, for each evaluation $\\theta$ (a probability distribution over positive integers) the value function $v_{\\theta}$ of the problem where the weight of any stage $t$ is given by $\\theta_t$, and we investigate the uniform convergence of a sequence $(v_{\\theta^k})_k$ when the \"impatience\" of the evaluations vanishes, in the sense that $\\sum_{t} |\\theta^k_{t}-\\theta"},"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":"1301.0451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-01-03T13:24:04Z","cross_cats_sorted":[],"title_canon_sha256":"bb9fa243ff692a60012ebeb872faf891b43008b5b5a4557b3745d76b387f65cd","abstract_canon_sha256":"fa1fabc430c9a47d0a0c52ec7f088265da998112a567476104fcaaf7531986f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:19.603057Z","signature_b64":"aTMmi2zCWY07WhXxq6A2doaJOD4529sH0Et6NA+XKIm6m0KZs8PRQmFyYHPxK+MkBVmw/SJVhbXLYeg9CZ4sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15194043eae304a0eeda21622fc9679323f1284bae4ef6e3f67174fd548a9db6","last_reissued_at":"2026-05-18T03:37:19.602372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:19.602372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General limit value in Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J\\'er\\^ome Renault (GREMAQ)","submitted_at":"2013-01-03T13:24:04Z","abstract_excerpt":"We consider a dynamic programming problem with arbitrary state space and bounded rewards. Is it possible to define in an unique way a limit value for the problem, where the \"patience\" of the decision-maker tends to infinity ? We consider, for each evaluation $\\theta$ (a probability distribution over positive integers) the value function $v_{\\theta}$ of the problem where the weight of any stage $t$ is given by $\\theta_t$, and we investigate the uniform convergence of a sequence $(v_{\\theta^k})_k$ when the \"impatience\" of the evaluations vanishes, in the sense that $\\sum_{t} |\\theta^k_{t}-\\theta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0451","kind":"arxiv","version":1},"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":"1301.0451","created_at":"2026-05-18T03:37:19.602474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0451v1","created_at":"2026-05-18T03:37:19.602474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0451","created_at":"2026-05-18T03:37:19.602474+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUMUAQ7K4MCK","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUMUAQ7K4MCKB3W2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUMUAQ7K","created_at":"2026-05-18T12:27:40.988391+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/CUMUAQ7K4MCKB3W2EFRC7SLHSM","json":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM.json","graph_json":"https://pith.science/api/pith-number/CUMUAQ7K4MCKB3W2EFRC7SLHSM/graph.json","events_json":"https://pith.science/api/pith-number/CUMUAQ7K4MCKB3W2EFRC7SLHSM/events.json","paper":"https://pith.science/paper/CUMUAQ7K"},"agent_actions":{"view_html":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM","download_json":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM.json","view_paper":"https://pith.science/paper/CUMUAQ7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0451&json=true","fetch_graph":"https://pith.science/api/pith-number/CUMUAQ7K4MCKB3W2EFRC7SLHSM/graph.json","fetch_events":"https://pith.science/api/pith-number/CUMUAQ7K4MCKB3W2EFRC7SLHSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM/action/storage_attestation","attest_author":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM/action/author_attestation","sign_citation":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM/action/citation_signature","submit_replication":"https://pith.science/pith/CUMUAQ7K4MCKB3W2EFRC7SLHSM/action/replication_record"}},"created_at":"2026-05-18T03:37:19.602474+00:00","updated_at":"2026-05-18T03:37:19.602474+00:00"}