{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y3IH7IK4Y5TM7JNGCWEGVI57GY","short_pith_number":"pith:Y3IH7IK4","canonical_record":{"source":{"id":"1412.6673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-12-20T17:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"3abe0465cbde0327d8e5af040671d53c9ec911cb1b2ad81a364e4f9ba2ba82cc","abstract_canon_sha256":"0dca026df3876f1f9c278ae96aaccc3d0f7e1873fdf42c83bd3d14251af06f6a"},"schema_version":"1.0"},"canonical_sha256":"c6d07fa15cc766cfa5a615886aa3bf36090decc8b339a1a6f87867d7c697d3a8","source":{"kind":"arxiv","id":"1412.6673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6673","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6673v1","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6673","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y3IH7IK4Y5TM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y3IH7IK4Y5TM7JNG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y3IH7IK4","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y3IH7IK4Y5TM7JNGCWEGVI57GY","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-12-20T17:35:45Z","cross_cats_sorted":[],"title_canon_sha256":"3abe0465cbde0327d8e5af040671d53c9ec911cb1b2ad81a364e4f9ba2ba82cc","abstract_canon_sha256":"0dca026df3876f1f9c278ae96aaccc3d0f7e1873fdf42c83bd3d14251af06f6a"},"schema_version":"1.0"},"canonical_sha256":"c6d07fa15cc766cfa5a615886aa3bf36090decc8b339a1a6f87867d7c697d3a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:35.104027Z","signature_b64":"/oEPCaXDxWMWZLwoA5M9V2fmyMgGpvbUSX92nSjiYyY9uGtH8dus1b6SUGpI0M5sYEVQZYKc2BHEIVEqitcmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d07fa15cc766cfa5a615886aa3bf36090decc8b339a1a6f87867d7c697d3a8","last_reissued_at":"2026-05-18T01:35:35.103354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:35.103354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6673","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-18T01:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLe2Ilv+nCpDQ7aEl8F5PCL/6CQm2kI2QBxfKbzPUStbsKpFldLL3gK/HzRfRmnN24AH5j/Yl1QuM6WZcGnuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:11:39.821686Z"},"content_sha256":"3f258dfb4f0658d6739fcad22c218ce6da3838f27cd66fba2271904c4674e712","schema_version":"1.0","event_id":"sha256:3f258dfb4f0658d6739fcad22c218ce6da3838f27cd66fba2271904c4674e712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y3IH7IK4Y5TM7JNGCWEGVI57GY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Extensible Benchmarking Infrastructure for Motion Planning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ioan A. Sucan, Lydia E. Kavraki, Mark Moll","submitted_at":"2014-12-20T17:35:45Z","abstract_excerpt":"Sampling-based planning algorithms are the most common probabilistically complete algorithms and are widely used on many robot platforms. Within this class of algorithms, many variants have been proposed over the last 20 years, yet there is still no characterization of which algorithms are well-suited for which classes of problems. This has motivated us to develop a benchmarking infrastructure for motion planning algorithms. It consists of three main components. First, we have created an extensive benchmarking software framework that is included with the Open Motion Planning Library (OMPL), a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6673","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-18T01:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8INmc090qXpMBWd4TSjklM8LnHF/ML7L58woZe/Pm31u5Aeh3dPuo57PUd6WtuYfg+DVq/n9lBd3kcI52CTyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:11:39.822031Z"},"content_sha256":"8f36486476c3b70f691df3cabe9b2e4ee257db33449a7a836052abc198f80c74","schema_version":"1.0","event_id":"sha256:8f36486476c3b70f691df3cabe9b2e4ee257db33449a7a836052abc198f80c74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/bundle.json","state_url":"https://pith.science/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/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-03T13:11:39Z","links":{"resolver":"https://pith.science/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY","bundle":"https://pith.science/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/bundle.json","state":"https://pith.science/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3IH7IK4Y5TM7JNGCWEGVI57GY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y3IH7IK4Y5TM7JNGCWEGVI57GY","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":"0dca026df3876f1f9c278ae96aaccc3d0f7e1873fdf42c83bd3d14251af06f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-12-20T17:35:45Z","title_canon_sha256":"3abe0465cbde0327d8e5af040671d53c9ec911cb1b2ad81a364e4f9ba2ba82cc"},"schema_version":"1.0","source":{"id":"1412.6673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6673","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6673v1","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6673","created_at":"2026-05-18T01:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y3IH7IK4Y5TM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y3IH7IK4Y5TM7JNG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y3IH7IK4","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:8f36486476c3b70f691df3cabe9b2e4ee257db33449a7a836052abc198f80c74","target":"graph","created_at":"2026-05-18T01:35:35Z","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":"Sampling-based planning algorithms are the most common probabilistically complete algorithms and are widely used on many robot platforms. Within this class of algorithms, many variants have been proposed over the last 20 years, yet there is still no characterization of which algorithms are well-suited for which classes of problems. This has motivated us to develop a benchmarking infrastructure for motion planning algorithms. It consists of three main components. First, we have created an extensive benchmarking software framework that is included with the Open Motion Planning Library (OMPL), a ","authors_text":"Ioan A. Sucan, Lydia E. Kavraki, Mark Moll","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-12-20T17:35:45Z","title":"An Extensible Benchmarking Infrastructure for Motion Planning Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6673","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:3f258dfb4f0658d6739fcad22c218ce6da3838f27cd66fba2271904c4674e712","target":"record","created_at":"2026-05-18T01:35:35Z","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":"0dca026df3876f1f9c278ae96aaccc3d0f7e1873fdf42c83bd3d14251af06f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-12-20T17:35:45Z","title_canon_sha256":"3abe0465cbde0327d8e5af040671d53c9ec911cb1b2ad81a364e4f9ba2ba82cc"},"schema_version":"1.0","source":{"id":"1412.6673","kind":"arxiv","version":1}},"canonical_sha256":"c6d07fa15cc766cfa5a615886aa3bf36090decc8b339a1a6f87867d7c697d3a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6d07fa15cc766cfa5a615886aa3bf36090decc8b339a1a6f87867d7c697d3a8","first_computed_at":"2026-05-18T01:35:35.103354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:35.103354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oEPCaXDxWMWZLwoA5M9V2fmyMgGpvbUSX92nSjiYyY9uGtH8dus1b6SUGpI0M5sYEVQZYKc2BHEIVEqitcmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:35.104027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f258dfb4f0658d6739fcad22c218ce6da3838f27cd66fba2271904c4674e712","sha256:8f36486476c3b70f691df3cabe9b2e4ee257db33449a7a836052abc198f80c74"],"state_sha256":"e266c4fca5a6b27c1e432f1feda473070024d8cdc9f49e31484f0a88ed96462c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUM6ds/oeFxn77V+jBTMrZSPcWcI3fdk8pk0/yrhASE4v0gUi7cjmypHYHuISiSdxVSp2bHTbjxbPCxpK5ycAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:11:39.824004Z","bundle_sha256":"8067a73d8724964d47065eef78eca416f3b134500a620be3a0ef992db855c270"}}