{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YKIQ5UYY5UBOLSFLEFWRNAU7SZ","short_pith_number":"pith:YKIQ5UYY","canonical_record":{"source":{"id":"1202.5544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-24T20:48:49Z","cross_cats_sorted":["cs.SY","math.DS","math.OC","math.PR"],"title_canon_sha256":"a82940022a0606275e924d11bb1f72ce575bcd782bbdbfe472789f9a026e4596","abstract_canon_sha256":"6a44ba26f3eda3344a093184a576ec6bbe494ea5b63bf34148f28af4ab945a0c"},"schema_version":"1.0"},"canonical_sha256":"c2910ed318ed02e5c8ab216d16829f9677c9260b90cebf57d109770c5a3510de","source":{"kind":"arxiv","id":"1202.5544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5544","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5544v1","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5544","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"YKIQ5UYY5UBO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YKIQ5UYY5UBOLSFL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YKIQ5UYY","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YKIQ5UYY5UBOLSFLEFWRNAU7SZ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-24T20:48:49Z","cross_cats_sorted":["cs.SY","math.DS","math.OC","math.PR"],"title_canon_sha256":"a82940022a0606275e924d11bb1f72ce575bcd782bbdbfe472789f9a026e4596","abstract_canon_sha256":"6a44ba26f3eda3344a093184a576ec6bbe494ea5b63bf34148f28af4ab945a0c"},"schema_version":"1.0"},"canonical_sha256":"c2910ed318ed02e5c8ab216d16829f9677c9260b90cebf57d109770c5a3510de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:36.659595Z","signature_b64":"MMjHxiADxStoqJyUCPkHozsC0r9WiG+6vrNw+TB4BaV0WWUGc8/coxwcr+/xammDG6AzWPJ/EaoJCtVoWkzjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2910ed318ed02e5c8ab216d16829f9677c9260b90cebf57d109770c5a3510de","last_reissued_at":"2026-05-18T04:01:36.658830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:36.658830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5544","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-05-18T04:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyUVKnJonieOGlZdZ7VZ9ZUuWCexLQVxzgYdWn+2F1DevaCgTRcxUWmsHHplk6TLc8hNu6jNL927jt0+FPFvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:39:21.819299Z"},"content_sha256":"05d4f92d3710d95dcb98b47667e87c34c17e355b7e98625a2c410f1a2e38a8a9","schema_version":"1.0","event_id":"sha256:05d4f92d3710d95dcb98b47667e87c34c17e355b7e98625a2c410f1a2e38a8a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YKIQ5UYY5UBOLSFLEFWRNAU7SZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Incremental Sampling-based Algorithm for Stochastic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS","math.OC","math.PR"],"primary_cat":"cs.RO","authors_text":"Emilio Frazzoli, Sertac Karaman, Vu Anh Huynh","submitted_at":"2012-02-24T20:48:49Z","abstract_excerpt":"In this paper, we consider a class of continuous-time, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation methods and sampling-based algorithms for deterministic path planning, we propose a novel algorithm called the incremental Markov Decision Process (iMDP) to compute incrementally control policies that approximate arbitrarily well an optimal policy in terms of the expected cost. The main idea behind the algorithm is to generate a sequence of finite discretizations of the original problem through random sampling of the state spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5544","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"},"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-05-18T04:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyrnGtm7DObqMDIDhHL+4rHyNk8e1mcx2X17LAmGcPImOKVTl6yI9D4n/RZP3dSmw7X+ZmLmEOKcgaqwoJ+vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:39:21.820060Z"},"content_sha256":"a820963f8a4df78420ea505ef7c9c18a547c333fa69957d3d8870cd2dfe027cd","schema_version":"1.0","event_id":"sha256:a820963f8a4df78420ea505ef7c9c18a547c333fa69957d3d8870cd2dfe027cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/bundle.json","state_url":"https://pith.science/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/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-06-11T22:39:21Z","links":{"resolver":"https://pith.science/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ","bundle":"https://pith.science/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/bundle.json","state":"https://pith.science/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKIQ5UYY5UBOLSFLEFWRNAU7SZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YKIQ5UYY5UBOLSFLEFWRNAU7SZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a44ba26f3eda3344a093184a576ec6bbe494ea5b63bf34148f28af4ab945a0c","cross_cats_sorted":["cs.SY","math.DS","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-24T20:48:49Z","title_canon_sha256":"a82940022a0606275e924d11bb1f72ce575bcd782bbdbfe472789f9a026e4596"},"schema_version":"1.0","source":{"id":"1202.5544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5544","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5544v1","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5544","created_at":"2026-05-18T04:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"YKIQ5UYY5UBO","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YKIQ5UYY5UBOLSFL","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YKIQ5UYY","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:a820963f8a4df78420ea505ef7c9c18a547c333fa69957d3d8870cd2dfe027cd","target":"graph","created_at":"2026-05-18T04:01:36Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider a class of continuous-time, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation methods and sampling-based algorithms for deterministic path planning, we propose a novel algorithm called the incremental Markov Decision Process (iMDP) to compute incrementally control policies that approximate arbitrarily well an optimal policy in terms of the expected cost. The main idea behind the algorithm is to generate a sequence of finite discretizations of the original problem through random sampling of the state spac","authors_text":"Emilio Frazzoli, Sertac Karaman, Vu Anh Huynh","cross_cats":["cs.SY","math.DS","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-24T20:48:49Z","title":"An Incremental Sampling-based Algorithm for Stochastic Optimal Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5544","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:05d4f92d3710d95dcb98b47667e87c34c17e355b7e98625a2c410f1a2e38a8a9","target":"record","created_at":"2026-05-18T04:01:36Z","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":"6a44ba26f3eda3344a093184a576ec6bbe494ea5b63bf34148f28af4ab945a0c","cross_cats_sorted":["cs.SY","math.DS","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-02-24T20:48:49Z","title_canon_sha256":"a82940022a0606275e924d11bb1f72ce575bcd782bbdbfe472789f9a026e4596"},"schema_version":"1.0","source":{"id":"1202.5544","kind":"arxiv","version":1}},"canonical_sha256":"c2910ed318ed02e5c8ab216d16829f9677c9260b90cebf57d109770c5a3510de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2910ed318ed02e5c8ab216d16829f9677c9260b90cebf57d109770c5a3510de","first_computed_at":"2026-05-18T04:01:36.658830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:36.658830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMjHxiADxStoqJyUCPkHozsC0r9WiG+6vrNw+TB4BaV0WWUGc8/coxwcr+/xammDG6AzWPJ/EaoJCtVoWkzjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:36.659595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05d4f92d3710d95dcb98b47667e87c34c17e355b7e98625a2c410f1a2e38a8a9","sha256:a820963f8a4df78420ea505ef7c9c18a547c333fa69957d3d8870cd2dfe027cd"],"state_sha256":"517a1c2d4dc05d4f350328a77d0e0190ca169010e94ae2eba50dd2ef4fe27a97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbmKdjHdAWfvk8vzFnLuW3tb4Ouu0u+mqFrrJ16ioMA+7e5SstQrwx9FMH2TlICcrZqRq1PoIeSRdcOX27VNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:39:21.824124Z","bundle_sha256":"0a1301b18461b4ff3f23d628dfd16dc618ea4455247f966175f0ff3705d0339a"}}