{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:INBLT3R6LGEU5DA3HBZ42ZGOWZ","short_pith_number":"pith:INBLT3R6","schema_version":"1.0","canonical_sha256":"4342b9ee3e59894e8c1b3873cd64ceb6567e1fa677f5c76520b9b5e155f8c74c","source":{"kind":"arxiv","id":"1310.3363","version":1},"attestation_state":"computed","paper":{"title":"Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nicole El Karoui, Xiaolu Tan","submitted_at":"2013-10-12T12:02:45Z","abstract_excerpt":"We give a brief presentation of the capacity theory and show how it derives naturally a measurable selection theorem following the approach of Dellacherie (1972). Then we present the classical method to prove the dynamic programming of discrete time stochastic control problem, using measurable selection arguments. At last, we propose a continuous time extension, that is an abstract framework for the continuous time dynamic programming principle (DPP)."},"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":"1310.3363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-12T12:02:45Z","cross_cats_sorted":[],"title_canon_sha256":"b919a34ccda76689fcb6908108098800120ece2c4481cb80f3badb8f879f99ec","abstract_canon_sha256":"cf737b7706aaf2fe3d6a906590576c7bc118051d7aa0f8541037029d8f13ff89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.989331Z","signature_b64":"P9Rz11eOLM4PEkZmvvlZEfcohvmCHXjk7I1vmJYI0uq/l0SzcFc7zERba3X+ulpP+cVGVb5f9Qb7zj+Ruy5WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4342b9ee3e59894e8c1b3873cd64ceb6567e1fa677f5c76520b9b5e155f8c74c","last_reissued_at":"2026-05-18T03:10:35.988824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.988824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacities, Measurable Selection and Dynamic Programming Part I: Abstract Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nicole El Karoui, Xiaolu Tan","submitted_at":"2013-10-12T12:02:45Z","abstract_excerpt":"We give a brief presentation of the capacity theory and show how it derives naturally a measurable selection theorem following the approach of Dellacherie (1972). Then we present the classical method to prove the dynamic programming of discrete time stochastic control problem, using measurable selection arguments. At last, we propose a continuous time extension, that is an abstract framework for the continuous time dynamic programming principle (DPP)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3363","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":"1310.3363","created_at":"2026-05-18T03:10:35.988895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3363v1","created_at":"2026-05-18T03:10:35.988895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3363","created_at":"2026-05-18T03:10:35.988895+00:00"},{"alias_kind":"pith_short_12","alias_value":"INBLT3R6LGEU","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"INBLT3R6LGEU5DA3","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"INBLT3R6","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02640","citing_title":"On the optimality of coin-betting for mean estimation","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ","json":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ.json","graph_json":"https://pith.science/api/pith-number/INBLT3R6LGEU5DA3HBZ42ZGOWZ/graph.json","events_json":"https://pith.science/api/pith-number/INBLT3R6LGEU5DA3HBZ42ZGOWZ/events.json","paper":"https://pith.science/paper/INBLT3R6"},"agent_actions":{"view_html":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ","download_json":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ.json","view_paper":"https://pith.science/paper/INBLT3R6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3363&json=true","fetch_graph":"https://pith.science/api/pith-number/INBLT3R6LGEU5DA3HBZ42ZGOWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/INBLT3R6LGEU5DA3HBZ42ZGOWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ/action/storage_attestation","attest_author":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ/action/author_attestation","sign_citation":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ/action/citation_signature","submit_replication":"https://pith.science/pith/INBLT3R6LGEU5DA3HBZ42ZGOWZ/action/replication_record"}},"created_at":"2026-05-18T03:10:35.988895+00:00","updated_at":"2026-05-18T03:10:35.988895+00:00"}