{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V2DUL3HQOQ7LGPJIL3MTFYPQCY","short_pith_number":"pith:V2DUL3HQ","canonical_record":{"source":{"id":"1504.08053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"a60e8c4f9791167e43ef49250a505886f0a2e30154fe353e4d90015cfa85e03a","abstract_canon_sha256":"140ad05bc046c7c80f11fa4e3d35f186fad7d19678d498272c2758cac4c19ba1"},"schema_version":"1.0"},"canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","source":{"kind":"arxiv","id":"1504.08053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08053","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08053v2","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08053","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"V2DUL3HQOQ7L","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2DUL3HQOQ7LGPJI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2DUL3HQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V2DUL3HQOQ7LGPJIL3MTFYPQCY","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"a60e8c4f9791167e43ef49250a505886f0a2e30154fe353e4d90015cfa85e03a","abstract_canon_sha256":"140ad05bc046c7c80f11fa4e3d35f186fad7d19678d498272c2758cac4c19ba1"},"schema_version":"1.0"},"canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:01.951332Z","signature_b64":"u9Y79WxFs/mtOaN/nc6fi6jnwddxsrn73HA0/JbVT1fulZFx1mExYzVKOSG5tv9KjHTT3DaiP+Z72FwmsBjYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","last_reissued_at":"2026-05-18T02:00:01.950889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:01.950889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08053","source_version":2,"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-18T02:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYA5TcwcbGjm3qkVUB7jqnGDLVt2SkU71OykZ9+yuN6QFlLbwjaFi4/MJ2pkyxyCUnrE6JKleah3r4edXAIFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:12:48.201958Z"},"content_sha256":"9bae6c0165ed8b9e4faaa29089ebd1f6d8cade930bc3f5180182646ca9f737ec","schema_version":"1.0","event_id":"sha256:9bae6c0165ed8b9e4faaa29089ebd1f6d8cade930bc3f5180182646ca9f737ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V2DUL3HQOQ7LGPJIL3MTFYPQCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Edward Schmerling, Lucas Janson, Marco Pavone","submitted_at":"2015-04-30T01:02:49Z","abstract_excerpt":"This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this paper we consider LQG). The key algorithmic contribution of this paper is the design of statistical variance-reduction techniques, namely control variates and importance sampling, to make such a sampling pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08053","kind":"arxiv","version":2},"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-18T02:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vfan1N3ZjuUNVKBIcwZPZCYAjXq0MQpXlzdPquNgFhpVGqHMWVNp0ZRKo8KUnRjHtF9e56mqnvCpnHo3koceBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:12:48.202291Z"},"content_sha256":"8756a77b8cc1620be835b311f69345773849834fd4cd2467e3f4bc90066d4bed","schema_version":"1.0","event_id":"sha256:8756a77b8cc1620be835b311f69345773849834fd4cd2467e3f4bc90066d4bed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/bundle.json","state_url":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/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-08T22:12:48Z","links":{"resolver":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY","bundle":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/bundle.json","state":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V2DUL3HQOQ7LGPJIL3MTFYPQCY","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":"140ad05bc046c7c80f11fa4e3d35f186fad7d19678d498272c2758cac4c19ba1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","title_canon_sha256":"a60e8c4f9791167e43ef49250a505886f0a2e30154fe353e4d90015cfa85e03a"},"schema_version":"1.0","source":{"id":"1504.08053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08053","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08053v2","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08053","created_at":"2026-05-18T02:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"V2DUL3HQOQ7L","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2DUL3HQOQ7LGPJI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2DUL3HQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:8756a77b8cc1620be835b311f69345773849834fd4cd2467e3f4bc90066d4bed","target":"graph","created_at":"2026-05-18T02:00:01Z","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":"This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this paper we consider LQG). The key algorithmic contribution of this paper is the design of statistical variance-reduction techniques, namely control variates and importance sampling, to make such a sampling pr","authors_text":"Edward Schmerling, Lucas Janson, Marco Pavone","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","title":"Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08053","kind":"arxiv","version":2},"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:9bae6c0165ed8b9e4faaa29089ebd1f6d8cade930bc3f5180182646ca9f737ec","target":"record","created_at":"2026-05-18T02:00:01Z","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":"140ad05bc046c7c80f11fa4e3d35f186fad7d19678d498272c2758cac4c19ba1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","title_canon_sha256":"a60e8c4f9791167e43ef49250a505886f0a2e30154fe353e4d90015cfa85e03a"},"schema_version":"1.0","source":{"id":"1504.08053","kind":"arxiv","version":2}},"canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","first_computed_at":"2026-05-18T02:00:01.950889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:01.950889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u9Y79WxFs/mtOaN/nc6fi6jnwddxsrn73HA0/JbVT1fulZFx1mExYzVKOSG5tv9KjHTT3DaiP+Z72FwmsBjYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:01.951332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bae6c0165ed8b9e4faaa29089ebd1f6d8cade930bc3f5180182646ca9f737ec","sha256:8756a77b8cc1620be835b311f69345773849834fd4cd2467e3f4bc90066d4bed"],"state_sha256":"2de613d1793e63f50c682b2baa299979dd9b2e5414e6cfbf932c245b3537f1d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwXJ+6e/1si0QfVyShOsA0cjeyNG3vpXkuZbgikB2XrkOEPL9MtvSDVGM5i6HbF168x9Rr2k6O41ERD5MnRZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:12:48.204103Z","bundle_sha256":"3c91c0e7e74e05033b38379e6c7df33e7d8cfc808b3a7af3d0de2872789b9ec9"}}