{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IU4ZKMQEV5DAWKK4DJHRRULPXL","short_pith_number":"pith:IU4ZKMQE","canonical_record":{"source":{"id":"1403.7714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-03-30T08:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"f5ba5a826c80cbfd7fbcc9f0cee5b039bd10b3ee9b623cd658478bf18144861b","abstract_canon_sha256":"40528425db4e1a568c6a1b326e2bbef24c2dc855a606b267a780ea09b438e039"},"schema_version":"1.0"},"canonical_sha256":"4539953204af460b295c1a4f18d16fbad805c271e98e9a7ff20d8b34b56bdbde","source":{"kind":"arxiv","id":"1403.7714","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7714","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7714v2","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7714","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"IU4ZKMQEV5DA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IU4ZKMQEV5DAWKK4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IU4ZKMQE","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IU4ZKMQEV5DAWKK4DJHRRULPXL","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-03-30T08:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"f5ba5a826c80cbfd7fbcc9f0cee5b039bd10b3ee9b623cd658478bf18144861b","abstract_canon_sha256":"40528425db4e1a568c6a1b326e2bbef24c2dc855a606b267a780ea09b438e039"},"schema_version":"1.0"},"canonical_sha256":"4539953204af460b295c1a4f18d16fbad805c271e98e9a7ff20d8b34b56bdbde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:26.019083Z","signature_b64":"rD7KCXodRtkuaC1mx58y0pWnvFj9BEo9F6t3r5Wvzp6M1QDJFR+9uy0OqFDfaLXt5XmaUWMh7oJKMJfkXcueCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4539953204af460b295c1a4f18d16fbad805c271e98e9a7ff20d8b34b56bdbde","last_reissued_at":"2026-05-18T02:41:26.018600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:26.018600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7714","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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPbXHTyqPJ15ojxlvmwoRj18iydHO/bcyPkxbJc8TxghTIwPsxBEcXr+jWQS5s4yHX9cgA5HHc9XLiS6x3XhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:55:56.265735Z"},"content_sha256":"89051e8df1612758f5436b82f7b4d78c6a6a9115fc705ad98c04de5ed3f68c94","schema_version":"1.0","event_id":"sha256:89051e8df1612758f5436b82f7b4d78c6a6a9115fc705ad98c04de5ed3f68c94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IU4ZKMQEV5DAWKK4DJHRRULPXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically-Optimal Motion Planning using Lower Bounds on Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Oren Salzman","submitted_at":"2014-03-30T08:22:51Z","abstract_excerpt":"Many path-finding algorithms on graphs such as A* are sped up by using a heuristic function that gives lower bounds on the cost to reach the goal. Aiming to apply similar techniques to speed up sampling-based motion-planning algorithms, we use effective lower bounds on the cost between configurations to tightly estimate the cost-to-go. We then use these estimates in an anytime asymptotically-optimal algorithm which we call Motion Planning using Lower Bounds (MPLB). MPLB is based on the Fast Marching Trees (FMT*) algorithm recently presented by Janson and Pavone. An advantage of our approach is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7714","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:41:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbAgKiIFQTi7cISHs4eWFxSJemLkNQVCVlvVvyGNFQChHtYzs0qm6dGXc2yySNpAlZCfv2LDphApkLjb11/WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:55:56.266078Z"},"content_sha256":"c19c5744863ca6cad1c57592f4a4beaa6fe1fba2982bd4308f17d132435c545c","schema_version":"1.0","event_id":"sha256:c19c5744863ca6cad1c57592f4a4beaa6fe1fba2982bd4308f17d132435c545c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/bundle.json","state_url":"https://pith.science/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/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-03T16:55:56Z","links":{"resolver":"https://pith.science/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL","bundle":"https://pith.science/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/bundle.json","state":"https://pith.science/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU4ZKMQEV5DAWKK4DJHRRULPXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IU4ZKMQEV5DAWKK4DJHRRULPXL","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":"40528425db4e1a568c6a1b326e2bbef24c2dc855a606b267a780ea09b438e039","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-03-30T08:22:51Z","title_canon_sha256":"f5ba5a826c80cbfd7fbcc9f0cee5b039bd10b3ee9b623cd658478bf18144861b"},"schema_version":"1.0","source":{"id":"1403.7714","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7714","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7714v2","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7714","created_at":"2026-05-18T02:41:26Z"},{"alias_kind":"pith_short_12","alias_value":"IU4ZKMQEV5DA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IU4ZKMQEV5DAWKK4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IU4ZKMQE","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c19c5744863ca6cad1c57592f4a4beaa6fe1fba2982bd4308f17d132435c545c","target":"graph","created_at":"2026-05-18T02:41:26Z","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":"Many path-finding algorithms on graphs such as A* are sped up by using a heuristic function that gives lower bounds on the cost to reach the goal. Aiming to apply similar techniques to speed up sampling-based motion-planning algorithms, we use effective lower bounds on the cost between configurations to tightly estimate the cost-to-go. We then use these estimates in an anytime asymptotically-optimal algorithm which we call Motion Planning using Lower Bounds (MPLB). MPLB is based on the Fast Marching Trees (FMT*) algorithm recently presented by Janson and Pavone. An advantage of our approach is","authors_text":"Dan Halperin, Oren Salzman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-03-30T08:22:51Z","title":"Asymptotically-Optimal Motion Planning using Lower Bounds on Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7714","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:89051e8df1612758f5436b82f7b4d78c6a6a9115fc705ad98c04de5ed3f68c94","target":"record","created_at":"2026-05-18T02:41:26Z","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":"40528425db4e1a568c6a1b326e2bbef24c2dc855a606b267a780ea09b438e039","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-03-30T08:22:51Z","title_canon_sha256":"f5ba5a826c80cbfd7fbcc9f0cee5b039bd10b3ee9b623cd658478bf18144861b"},"schema_version":"1.0","source":{"id":"1403.7714","kind":"arxiv","version":2}},"canonical_sha256":"4539953204af460b295c1a4f18d16fbad805c271e98e9a7ff20d8b34b56bdbde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4539953204af460b295c1a4f18d16fbad805c271e98e9a7ff20d8b34b56bdbde","first_computed_at":"2026-05-18T02:41:26.018600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:26.018600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rD7KCXodRtkuaC1mx58y0pWnvFj9BEo9F6t3r5Wvzp6M1QDJFR+9uy0OqFDfaLXt5XmaUWMh7oJKMJfkXcueCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:26.019083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7714","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89051e8df1612758f5436b82f7b4d78c6a6a9115fc705ad98c04de5ed3f68c94","sha256:c19c5744863ca6cad1c57592f4a4beaa6fe1fba2982bd4308f17d132435c545c"],"state_sha256":"3d86224a72429e8577a91978d8ba34f948bb81c113079a4785754a5b02b20891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvyKB/Ls/9fU6GD+FxZIjeodqaRlS5nXaLr5c+cR1Tw/M3h3PURb4/NMOoMf9w5XqRF0gAbEvVciEPmt2Rs+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:55:56.267947Z","bundle_sha256":"2a19ff349cbbb2ffe157a06e9b4f72184ce2efe8309509ca165655e58c0d7aef"}}