{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JB2JRSH5Q43QBIICA2S573JRIG","short_pith_number":"pith:JB2JRSH5","canonical_record":{"source":{"id":"1105.1186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"20c8b63b54573dd67f46511f6fdefbbd705862b33f8c24bbc9cc70f7a8ebe7f2","abstract_canon_sha256":"a5a4cf657004ac998ff0c99fda6f41053fa7769cb3b9eeabd4c8412e02e05156"},"schema_version":"1.0"},"canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","source":{"kind":"arxiv","id":"1105.1186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1186","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1186v1","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1186","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"JB2JRSH5Q43Q","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JB2JRSH5Q43QBIIC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JB2JRSH5","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JB2JRSH5Q43QBIICA2S573JRIG","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"20c8b63b54573dd67f46511f6fdefbbd705862b33f8c24bbc9cc70f7a8ebe7f2","abstract_canon_sha256":"a5a4cf657004ac998ff0c99fda6f41053fa7769cb3b9eeabd4c8412e02e05156"},"schema_version":"1.0"},"canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:40.920189Z","signature_b64":"+hgnnGZ/gNbMaPeYG9E9dtbmfxZwJpXlZSwxyx68AAaKGP9Sj+w0ij2zH9OJG2dBEbEsKIzAwLxwnVwhaDJiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","last_reissued_at":"2026-05-18T04:22:40.919764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:40.919764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1186","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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3py32hR8x2SiT6LDMXAGjF+IqTcTHN6ICQFlTU1LumCtmVCY4lqZwvj1inutFWgDH1q9vN+HzAxKlBfXxnJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:21:15.072001Z"},"content_sha256":"c150081cd42070d04df297dbea89271629037d7e224b0bf02e647a11bab8baac","schema_version":"1.0","event_id":"sha256:c150081cd42070d04df297dbea89271629037d7e224b0bf02e647a11bab8baac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JB2JRSH5Q43QBIICA2S573JRIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling-based Algorithms for Optimal Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Emilio Frazzoli, Sertac Karaman","submitted_at":"2011-05-05T22:25:22Z","abstract_excerpt":"During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1186","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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FMHCMsRBVp9QFugCwkyrZNWYD+9K21U0abfqrC3CMQIZSp2WOGzSBI1J6A9QMeAgOtNJR66aIgaP+lA+AF5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:21:15.072348Z"},"content_sha256":"a1b3723a3b5c204ab6cc7504dc05a1ebda34fc19e08429a070b5021e9b91876c","schema_version":"1.0","event_id":"sha256:a1b3723a3b5c204ab6cc7504dc05a1ebda34fc19e08429a070b5021e9b91876c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/bundle.json","state_url":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JB2JRSH5Q43QBIICA2S573JRIG/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-07-07T08:21:15Z","links":{"resolver":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG","bundle":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/bundle.json","state":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JB2JRSH5Q43QBIICA2S573JRIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JB2JRSH5Q43QBIICA2S573JRIG","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":"a5a4cf657004ac998ff0c99fda6f41053fa7769cb3b9eeabd4c8412e02e05156","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","title_canon_sha256":"20c8b63b54573dd67f46511f6fdefbbd705862b33f8c24bbc9cc70f7a8ebe7f2"},"schema_version":"1.0","source":{"id":"1105.1186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1186","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1186v1","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1186","created_at":"2026-05-18T04:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"JB2JRSH5Q43Q","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JB2JRSH5Q43QBIIC","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JB2JRSH5","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:a1b3723a3b5c204ab6cc7504dc05a1ebda34fc19e08429a070b5021e9b91876c","target":"graph","created_at":"2026-05-18T04:22:40Z","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":"During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as ","authors_text":"Emilio Frazzoli, Sertac Karaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","title":"Sampling-based Algorithms for Optimal Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1186","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:c150081cd42070d04df297dbea89271629037d7e224b0bf02e647a11bab8baac","target":"record","created_at":"2026-05-18T04:22:40Z","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":"a5a4cf657004ac998ff0c99fda6f41053fa7769cb3b9eeabd4c8412e02e05156","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","title_canon_sha256":"20c8b63b54573dd67f46511f6fdefbbd705862b33f8c24bbc9cc70f7a8ebe7f2"},"schema_version":"1.0","source":{"id":"1105.1186","kind":"arxiv","version":1}},"canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","first_computed_at":"2026-05-18T04:22:40.919764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:40.919764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hgnnGZ/gNbMaPeYG9E9dtbmfxZwJpXlZSwxyx68AAaKGP9Sj+w0ij2zH9OJG2dBEbEsKIzAwLxwnVwhaDJiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:40.920189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c150081cd42070d04df297dbea89271629037d7e224b0bf02e647a11bab8baac","sha256:a1b3723a3b5c204ab6cc7504dc05a1ebda34fc19e08429a070b5021e9b91876c"],"state_sha256":"f55cf63d42a1eb111e36201627a5825cb8b9bc305fa5460f570988a6f7c0b197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3sUEzLCGA+vC0sBgmq9eNENUdw+URKG+g+Kb1m377gOHlGp9SbVyOPdqiojovmGMigdCuCoucrdqRcugCDzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:21:15.074165Z","bundle_sha256":"2f8cdff3afea743f10433f16ad6208277bf01ca94deaddda95278e4ded744384"}}