{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CU2OZ22YZH5XQDWYYCPP6LPOKT","short_pith_number":"pith:CU2OZ22Y","schema_version":"1.0","canonical_sha256":"1534eceb58c9fb780ed8c09eff2dee54c7dbde3aff40979ef2cea6a5a1493033","source":{"kind":"arxiv","id":"1012.5149","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Properties of Optimal Trajectories in Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C&O), Guillaume Vigeral (CEREMADE), Sylvain Sorin (EC), Xavier Venel (SAF","submitted_at":"2010-12-23T05:59:48Z","abstract_excerpt":"We prove in a dynamic programming framework that uniform convergence of the finite horizon values implies that asymptotically the average accumulated payoff is constant on optimal trajectories. We analyze and discuss several possible extensions to two-person games."},"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":"1012.5149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-12-23T05:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"3f6a3a554a7f9f1e82aa50f86ece7d5992ff874aba6390758fbbaa564092f2d7","abstract_canon_sha256":"85045020ad799f38e862117bb25bdddf1ba86cb14761f3374a6b4421e52b03b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:35.699303Z","signature_b64":"u+K3mg41h7vMhdl9+tIwOov/NtepTnwUMdrYG7OvBacS/8+hikQ+AJ3Nf+v0LNJAgbn8IG7ccNG2nINoICEKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1534eceb58c9fb780ed8c09eff2dee54c7dbde3aff40979ef2cea6a5a1493033","last_reissued_at":"2026-05-18T04:32:35.698902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:35.698902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Properties of Optimal Trajectories in Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C&O), Guillaume Vigeral (CEREMADE), Sylvain Sorin (EC), Xavier Venel (SAF","submitted_at":"2010-12-23T05:59:48Z","abstract_excerpt":"We prove in a dynamic programming framework that uniform convergence of the finite horizon values implies that asymptotically the average accumulated payoff is constant on optimal trajectories. We analyze and discuss several possible extensions to two-person games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5149","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":"1012.5149","created_at":"2026-05-18T04:32:35.698958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5149v1","created_at":"2026-05-18T04:32:35.698958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5149","created_at":"2026-05-18T04:32:35.698958+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU2OZ22YZH5X","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU2OZ22YZH5XQDWY","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU2OZ22Y","created_at":"2026-05-18T12:26:06.534383+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/CU2OZ22YZH5XQDWYYCPP6LPOKT","json":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT.json","graph_json":"https://pith.science/api/pith-number/CU2OZ22YZH5XQDWYYCPP6LPOKT/graph.json","events_json":"https://pith.science/api/pith-number/CU2OZ22YZH5XQDWYYCPP6LPOKT/events.json","paper":"https://pith.science/paper/CU2OZ22Y"},"agent_actions":{"view_html":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT","download_json":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT.json","view_paper":"https://pith.science/paper/CU2OZ22Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5149&json=true","fetch_graph":"https://pith.science/api/pith-number/CU2OZ22YZH5XQDWYYCPP6LPOKT/graph.json","fetch_events":"https://pith.science/api/pith-number/CU2OZ22YZH5XQDWYYCPP6LPOKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT/action/storage_attestation","attest_author":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT/action/author_attestation","sign_citation":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT/action/citation_signature","submit_replication":"https://pith.science/pith/CU2OZ22YZH5XQDWYYCPP6LPOKT/action/replication_record"}},"created_at":"2026-05-18T04:32:35.698958+00:00","updated_at":"2026-05-18T04:32:35.698958+00:00"}