{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3BB5NVGCN2LEXCIA4QZGVV3SUW","short_pith_number":"pith:3BB5NVGC","schema_version":"1.0","canonical_sha256":"d843d6d4c26e964b8900e4326ad772a59537b8c313b589279646d5d65c35141d","source":{"kind":"arxiv","id":"2303.06200","version":3},"attestation_state":"computed","paper":{"title":"Monte Carlo Grid Dynamic Programming: Almost Sure Convergence and Probability Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ahmad Al-Tawaha, Ahmed Atallah, Ming Jin, Mohamed Shouman, Mohammad S. Ramadan","submitted_at":"2023-03-10T20:34:41Z","abstract_excerpt":"Dynamic Programming (DP) suffers from the well-known ``curse of dimensionality'', further exacerbated by the need to compute expectations over process noise in stochastic models. This paper presents a Monte Carlo-based sampling approach for the state space and an interpolation procedure for the resulting value function, dependent on the process noise density, in a \"self-approximating\" fashion, eliminating the need for ordering or set-membership tests. We provide proof of almost sure convergence for the value iteration (and consequently, policy iteration) procedure. The proposed meshless sampli"},"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":"2303.06200","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-10T20:34:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1fbf77d0f3ab8f108f03a0fcae17973371aab04eacaf590f718240d6864f0c8d","abstract_canon_sha256":"b87b6a9afb14222bfae43924e387f02883b1b3726431ce266055c1b56c399cf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:06.967400Z","signature_b64":"IT8bQ9E76xnTByS6KZkzTlcUWVE5nV40b97cDZUkexEib2yJHskoJYdUV+wTQh+55Tlk/uR11GMe+hK3EnEuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d843d6d4c26e964b8900e4326ad772a59537b8c313b589279646d5d65c35141d","last_reissued_at":"2026-07-05T09:04:06.966979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:06.966979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Grid Dynamic Programming: Almost Sure Convergence and Probability Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Ahmad Al-Tawaha, Ahmed Atallah, Ming Jin, Mohamed Shouman, Mohammad S. Ramadan","submitted_at":"2023-03-10T20:34:41Z","abstract_excerpt":"Dynamic Programming (DP) suffers from the well-known ``curse of dimensionality'', further exacerbated by the need to compute expectations over process noise in stochastic models. This paper presents a Monte Carlo-based sampling approach for the state space and an interpolation procedure for the resulting value function, dependent on the process noise density, in a \"self-approximating\" fashion, eliminating the need for ordering or set-membership tests. We provide proof of almost sure convergence for the value iteration (and consequently, policy iteration) procedure. The proposed meshless sampli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06200","kind":"arxiv","version":3},"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/2303.06200/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.06200","created_at":"2026-07-05T09:04:06.967034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.06200v3","created_at":"2026-07-05T09:04:06.967034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06200","created_at":"2026-07-05T09:04:06.967034+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BB5NVGCN2LE","created_at":"2026-07-05T09:04:06.967034+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BB5NVGCN2LEXCIA","created_at":"2026-07-05T09:04:06.967034+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BB5NVGC","created_at":"2026-07-05T09:04:06.967034+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/3BB5NVGCN2LEXCIA4QZGVV3SUW","json":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW.json","graph_json":"https://pith.science/api/pith-number/3BB5NVGCN2LEXCIA4QZGVV3SUW/graph.json","events_json":"https://pith.science/api/pith-number/3BB5NVGCN2LEXCIA4QZGVV3SUW/events.json","paper":"https://pith.science/paper/3BB5NVGC"},"agent_actions":{"view_html":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW","download_json":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW.json","view_paper":"https://pith.science/paper/3BB5NVGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.06200&json=true","fetch_graph":"https://pith.science/api/pith-number/3BB5NVGCN2LEXCIA4QZGVV3SUW/graph.json","fetch_events":"https://pith.science/api/pith-number/3BB5NVGCN2LEXCIA4QZGVV3SUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW/action/storage_attestation","attest_author":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW/action/author_attestation","sign_citation":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW/action/citation_signature","submit_replication":"https://pith.science/pith/3BB5NVGCN2LEXCIA4QZGVV3SUW/action/replication_record"}},"created_at":"2026-07-05T09:04:06.967034+00:00","updated_at":"2026-07-05T09:04:06.967034+00:00"}