{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","short_pith_number":"pith:ZPWMZWSA","canonical_record":{"source":{"id":"2607.21520","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-23T17:03:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b1f11f38bad99804da4435a8e2afc6138233726fb2922ed6bd8b8fbce1e14904","abstract_canon_sha256":"579cace7796cde2aa6d3b20ae7b4eb5687141a3c16b6a6cfbdc2351e68ff0025"},"schema_version":"1.0"},"canonical_sha256":"cbecccda40a29cd5dd9717343dbe5e1b3f4ddea48023b4d8bb7824d50a06c4f0","source":{"kind":"arxiv","id":"2607.21520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21520","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21520v1","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21520","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZPWMZWSAUKON","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZPWMZWSAUKONLXMX","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZPWMZWSA","created_at":"2026-07-24T01:24:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"record","payload":{"canonical_record":{"source":{"id":"2607.21520","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-23T17:03:46Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b1f11f38bad99804da4435a8e2afc6138233726fb2922ed6bd8b8fbce1e14904","abstract_canon_sha256":"579cace7796cde2aa6d3b20ae7b4eb5687141a3c16b6a6cfbdc2351e68ff0025"},"schema_version":"1.0"},"canonical_sha256":"cbecccda40a29cd5dd9717343dbe5e1b3f4ddea48023b4d8bb7824d50a06c4f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:37.561055Z","signature_b64":"h7Ixg5GbG5DuJ+c7nQUN3jxYmZYu2AqPlzpvf6RavqBTsD6PhTNhsYscJkWLTkrbraXwF8iCBbdbBgzSRvtODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbecccda40a29cd5dd9717343dbe5e1b3f4ddea48023b4d8bb7824d50a06c4f0","last_reissued_at":"2026-07-24T01:24:37.560172Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:37.560172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.21520","source_version":1,"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-07-24T01:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJoiwOxNJrxHGFSJQO84TzpJIsSxC0AbESbShzKL+50ALvaPaTxV0eZtWztyLvfRr6GK3JpM7r9QgDJTNLUIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.478278Z"},"content_sha256":"76a287eccfcc324141445f69b6e47c807aac5f2654e99aaf59cc4772aa30c76c","schema_version":"1.0","event_id":"sha256:76a287eccfcc324141445f69b6e47c807aac5f2654e99aaf59cc4772aa30c76c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Analysis of Empirical Dynamic Programming in Infinite-Horizon Stochastic Optimal Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Elif Sena Isik, Johannes Milz, Xin Chen","submitted_at":"2026-07-23T17:03:46Z","abstract_excerpt":"We derive statistical limit theorems for sample-based approximations of infinite-horizon discounted stochastic optimal control problems in discrete time. Our first result is a functional central limit theorem for the sample-based value function under a uniqueness-type condition on population optimal policies. The limiting law is a mean-zero Gaussian process characterized by a linear fixed point equation that resembles a dynamic programming principle. We compare these asymptotics with those obtained from sample-based policy optimization and illustrate that their limiting variances can be differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21520","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.21520/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-24T01:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"popidX7DfQaHBXgczM1VNBcZ8Zvrqamd//wWoZkHA0HOxL2rEasocb+suewlUzAwMjGkzvlDLFYWQ6ASbsLuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.478789Z"},"content_sha256":"6a540a7cecfdf300751e50f321d06a97293f09c9e9a499ad6b0cea1ae04a3769","schema_version":"1.0","event_id":"sha256:6a540a7cecfdf300751e50f321d06a97293f09c9e9a499ad6b0cea1ae04a3769"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/opre.2023.2436 resolves to 'Uncertainty Quantification and Exploration for Reinforcement Learning'. A reader following the printed text alone cannot reach it.","snippet":"Y. Zhu, J. Dong, and H. Lam. Uncertainty quantification and exploration for rein- forcement learning.Oper. Res., 72(4):1689–1709, 2024.doi:10.1287/opre.2023. 2436","arxiv_id":"2607.21520","detector":"doi_compliance","evidence":{"ref_index":34,"verdict_class":"incontrovertible","resolved_title":"Uncertainty Quantification and Exploration for Reinforcement Learning","printed_excerpt":"10.1287/opre.2023","reconstructed_doi":"10.1287/opre.2023.2436"},"severity":"advisory","ref_index":34,"audited_at":"2026-08-01T07:28:31.029981Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/opre.2023.2436","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"54cce7221899a241a041586652a214610c9d72ffd61ab3d13aa9110fb87c3445","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Uncertainty Quantification and Exploration for Reinforcement Learning","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15387,"payload_sha256":"0c57abde6e57be189bdd75a7d9fb87e8171f1c30a3ba87a5181dbec291166eb2","signature_b64":"TGUCJ8jV0xZSSyLvO/IQ+v6yuVYtm4jCFiOwcTGwrkwmQj6d/XKvGCxvWqLj2sieJAk+2+QWv+g6+/EuhRmlCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziL4zYGnaVJ/I2Dk1bXJvWPRYhAJbN/Aoh6QS3eM42z+yFGDDsR9EA3uZDNdPcE6IFxawZQPG6qecx3GzdoUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.481665Z"},"content_sha256":"0d4238cec5656772131ea4afd76c0d678af80e8790bccbcad6be96ae127b2a96","schema_version":"1.0","event_id":"sha256:0d4238cec5656772131ea4afd76c0d678af80e8790bccbcad6be96ae127b2a96"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.orl.2021.06.019 resolves to 'Central limit theorem and sample complexity of stationary stochastic programs'. A reader following the printed text alone cannot reach it.","snippet":"A. Shapiro and Y. Cheng. Central limit theorem and sample complexity of station- ary stochastic programs.Oper. Res. Lett., 49(5):676–681, 2021.doi:10.1016/j.orl. 2021.06.019","arxiv_id":"2607.21520","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":"Central limit theorem and sample complexity of stationary stochastic programs","printed_excerpt":"10.1016/j.orl","reconstructed_doi":"10.1016/j.orl.2021.06.019"},"severity":"advisory","ref_index":25,"audited_at":"2026-08-01T07:28:31.029981Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.orl.2021.06.019","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8aa0de8b53bc4cdd7e9cc4f6f39c0322a1aebe79d6798e73df89b759c5fd2015","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Central limit theorem and sample complexity of stationary stochastic programs","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15386,"payload_sha256":"fa67daf982b86fcca9714329a01361c52e4f1705bcae33ca778089ef84432ad4","signature_b64":"yqN+WDZbk4LgmlHTPR/Z/VMCt/PkRqF44VPBltumNlFS6lOHKjHNWrXagXbTohXf34B5EVbJUcKb8lbaEX7SBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MI69rGljDLaWSFX4V1Uw0T6XHD8PiO+2vhK9WKrLzarZHxYJXgRobN+l94OKFT4Bi+bmbxJDcPwWnxU5sjnxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.482052Z"},"content_sha256":"edcd115bef51de1b1d6284c157bc95f60d3592e0f6b8699324f00e092c3c8486","schema_version":"1.0","event_id":"sha256:edcd115bef51de1b1d6284c157bc95f60d3592e0f6b8699324f00e092c3c8486"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-1-4612-0729-0) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"O. Hern ´andez-Lerma and J. B. Lasserre.Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer, New York, 1996.doi:10.1007/978-1-4612- 0729-0","arxiv_id":"2607.21520","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-1-4612-","reconstructed_doi":"10.1007/978-1-4612-0729-0"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-01T07:28:31.029981Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-1-4612-0729-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"330380d746067a4cf95f4bf67d463b94854ffee1686b4eb1263bf912b570bbfe","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15385,"payload_sha256":"bba1d3404973a98e8e7a6302ac641d602ffb516ccfe72c55d3b5b12dd90025c1","signature_b64":"nfKIBK82SZii7fqKKYnfSrm6deMJkcrPiQRIUvRjrBHW0qHoq8j8liHlxluXlSZtMxY6zdjdDFod4qF2hxuxAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzczf3DmHZ9bcGWSPaFP8KkB/+hkO+BWdVgZSEYd0NZ5Vc70xC+71L329wKGOJoWetVJQxXUY8RfgQTg4fysBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.482412Z"},"content_sha256":"6de9d6b9db75cf7e13aa0b9523d7e22d7995f9f3f98d20770095e3d8e0706504","schema_version":"1.0","event_id":"sha256:6de9d6b9db75cf7e13aa0b9523d7e22d7995f9f3f98d20770095e3d8e0706504"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/opre.49.2.226.13528 resolves to 'Optimal Policies for Multiechelon Inventory Problems with Markov-Modulated Demand'. A reader following the printed text alone cannot reach it.","snippet":"F. Chen and J.-S. Song. Optimal policies for multiechelon inventory problems with Markov-modulated demand.Oper. Res., 49(2):226–234, 2001.doi:10.1287/opre. 49.2.226.13528","arxiv_id":"2607.21520","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":"Optimal Policies for Multiechelon Inventory Problems with Markov-Modulated Demand","printed_excerpt":"10.1287/opre","reconstructed_doi":"10.1287/opre.49.2.226.13528"},"severity":"advisory","ref_index":5,"audited_at":"2026-08-01T07:28:31.029981Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/opre.49.2.226.13528","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"800fd4ff64604802c5b9a14ee4b73f07a2d41130c1a98438bb14576f8c48a89b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Optimal Policies for Multiechelon Inventory Problems with Markov-Modulated Demand","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15384,"payload_sha256":"65714db61f591922844a6e1e8af0c5a38cf0b7930b1a45cda198ec6d542a9eef","signature_b64":"VL5vLRmz3lFI2lpDxwG5b6jtybfx90Qr+R0VFFPQEhyRerdHYLQklHrd3K0QxqaSJm48P58KGhJ0b2duan5hBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T07:28:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nD5rS/Z1U3nPujo5orvi2fpFX8EOBatD/68XvloypRm8/QsXJXRwatxU7mV3nK+DRwm50o7P44jDDrkMPj1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:39:22.482775Z"},"content_sha256":"f2bb25aab81db53a2ad23bc84676937c504e6df4bf79516b6ecd39d67445e134","schema_version":"1.0","event_id":"sha256:f2bb25aab81db53a2ad23bc84676937c504e6df4bf79516b6ecd39d67445e134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/bundle.json","state_url":"https://pith.science/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/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-08-04T04:39:22Z","links":{"resolver":"https://pith.science/pith/ZPWMZWSAUKONLXMXC42D3PS6DM","bundle":"https://pith.science/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/bundle.json","state":"https://pith.science/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPWMZWSAUKONLXMXC42D3PS6DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZPWMZWSAUKONLXMXC42D3PS6DM","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"579cace7796cde2aa6d3b20ae7b4eb5687141a3c16b6a6cfbdc2351e68ff0025","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-23T17:03:46Z","title_canon_sha256":"b1f11f38bad99804da4435a8e2afc6138233726fb2922ed6bd8b8fbce1e14904"},"schema_version":"1.0","source":{"id":"2607.21520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.21520","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.21520v1","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21520","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZPWMZWSAUKON","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZPWMZWSAUKONLXMX","created_at":"2026-07-24T01:24:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZPWMZWSA","created_at":"2026-07-24T01:24:37Z"}],"graph_snapshots":[{"event_id":"sha256:6a540a7cecfdf300751e50f321d06a97293f09c9e9a499ad6b0cea1ae04a3769","target":"graph","created_at":"2026-07-24T01:24:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.21520/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We derive statistical limit theorems for sample-based approximations of infinite-horizon discounted stochastic optimal control problems in discrete time. Our first result is a functional central limit theorem for the sample-based value function under a uniqueness-type condition on population optimal policies. The limiting law is a mean-zero Gaussian process characterized by a linear fixed point equation that resembles a dynamic programming principle. We compare these asymptotics with those obtained from sample-based policy optimization and illustrate that their limiting variances can be differ","authors_text":"Elif Sena Isik, Johannes Milz, Xin Chen","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-23T17:03:46Z","title":"Asymptotic Analysis of Empirical Dynamic Programming in Infinite-Horizon Stochastic Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21520","kind":"arxiv","version":1},"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:76a287eccfcc324141445f69b6e47c807aac5f2654e99aaf59cc4772aa30c76c","target":"record","created_at":"2026-07-24T01:24:37Z","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":"579cace7796cde2aa6d3b20ae7b4eb5687141a3c16b6a6cfbdc2351e68ff0025","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-23T17:03:46Z","title_canon_sha256":"b1f11f38bad99804da4435a8e2afc6138233726fb2922ed6bd8b8fbce1e14904"},"schema_version":"1.0","source":{"id":"2607.21520","kind":"arxiv","version":1}},"canonical_sha256":"cbecccda40a29cd5dd9717343dbe5e1b3f4ddea48023b4d8bb7824d50a06c4f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbecccda40a29cd5dd9717343dbe5e1b3f4ddea48023b4d8bb7824d50a06c4f0","first_computed_at":"2026-07-24T01:24:37.560172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T01:24:37.560172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7Ixg5GbG5DuJ+c7nQUN3jxYmZYu2AqPlzpvf6RavqBTsD6PhTNhsYscJkWLTkrbraXwF8iCBbdbBgzSRvtODA==","signature_status":"signed_v1","signed_at":"2026-07-24T01:24:37.561055Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.21520","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:0d4238cec5656772131ea4afd76c0d678af80e8790bccbcad6be96ae127b2a96","sha256:6de9d6b9db75cf7e13aa0b9523d7e22d7995f9f3f98d20770095e3d8e0706504","sha256:edcd115bef51de1b1d6284c157bc95f60d3592e0f6b8699324f00e092c3c8486","sha256:f2bb25aab81db53a2ad23bc84676937c504e6df4bf79516b6ecd39d67445e134"]}],"invalid_events":[],"applied_event_ids":["sha256:76a287eccfcc324141445f69b6e47c807aac5f2654e99aaf59cc4772aa30c76c","sha256:6a540a7cecfdf300751e50f321d06a97293f09c9e9a499ad6b0cea1ae04a3769"],"state_sha256":"8ae51c080b16e8e0b6105d288bff8a8a19be025bc21d8c48bb1e776a695b4e96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk4YzAHKLwjyn1322Rf5tAYlydcq4czP9CjYFRQ8VuskmZ3BFGO+Ef/ZGu838fand/7uSGc+Q1auVQ0gmlKFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:39:22.485953Z","bundle_sha256":"14718dbf484aa6ce73ab309564c18a1bfc66d8a6fc9579ccd1160492c56fdd23"}}