{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YYGRCAR6AWKLJEPWGPYDH3UFFF","short_pith_number":"pith:YYGRCAR6","canonical_record":{"source":{"id":"1308.0189","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"fd628973dcea85aaefe79de80d0f716e9e4fcc482511be506462012c3e40e7fb","abstract_canon_sha256":"5b61237bc709428fd0528d13f27c772e010381173e50ce8bef224af4e2ae5d28"},"schema_version":"1.0"},"canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","source":{"kind":"arxiv","id":"1308.0189","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0189","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0189v4","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0189","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"YYGRCAR6AWKL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYGRCAR6AWKLJEPW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYGRCAR6","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YYGRCAR6AWKLJEPWGPYDH3UFFF","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0189","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"fd628973dcea85aaefe79de80d0f716e9e4fcc482511be506462012c3e40e7fb","abstract_canon_sha256":"5b61237bc709428fd0528d13f27c772e010381173e50ce8bef224af4e2ae5d28"},"schema_version":"1.0"},"canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.551622Z","signature_b64":"yOmAX3wu/RinXER2yPXddfX+Cbl27dXpWPo6dAJf3sEhapV8vilXfQ3Q5Yb8z3j45hR29S/hEFPGEV08pJXICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","last_reissued_at":"2026-05-18T02:25:40.550563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.550563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0189","source_version":4,"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:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/aQeedIV3tSe4BbKiGdJERVqSr2m5uhecMM2+FIyROFGW77gEl3efWM00720FBtB/yrnlQbBKsXURPT2ED4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:36.689979Z"},"content_sha256":"0f3780facd23daf4496fba4f97a07227481e29b41772ab7da25de4c8240f9a4c","schema_version":"1.0","event_id":"sha256:0f3780facd23daf4496fba4f97a07227481e29b41772ab7da25de4c8240f9a4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YYGRCAR6AWKLJEPWGPYDH3UFFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically near-optimal RRT for fast, high-quality, motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Oren Salzman","submitted_at":"2013-08-01T13:25:21Z","abstract_excerpt":"We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1+epsilon of the optimal solution. Our algorithm allows for a continuous interpolation between the fast RRT algorithm and the asymptotically optimal RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no approximation is allowed), LBT-RRT behaves like RRG. When the approximation factor is unbounded, LBT-RRT behaves like RRT. In between, LBT-RRT is shown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0189","kind":"arxiv","version":4},"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:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tgh4a1RQY38vqhsBWlDDwJ6pbh/5OSvnz8lCkyEgCKMLHaYQvfAZ6LYM0JnogrRgGnudPxwJkCNr6aoR/7myAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:36.690344Z"},"content_sha256":"74e4c2711b12f3ef66713966d7d35991c1d2f65c4dfde5b1c5ccf839f3df1f37","schema_version":"1.0","event_id":"sha256:74e4c2711b12f3ef66713966d7d35991c1d2f65c4dfde5b1c5ccf839f3df1f37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/bundle.json","state_url":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/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:07:36Z","links":{"resolver":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF","bundle":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/bundle.json","state":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YYGRCAR6AWKLJEPWGPYDH3UFFF","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":"5b61237bc709428fd0528d13f27c772e010381173e50ce8bef224af4e2ae5d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","title_canon_sha256":"fd628973dcea85aaefe79de80d0f716e9e4fcc482511be506462012c3e40e7fb"},"schema_version":"1.0","source":{"id":"1308.0189","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0189","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0189v4","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0189","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"YYGRCAR6AWKL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYGRCAR6AWKLJEPW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYGRCAR6","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:74e4c2711b12f3ef66713966d7d35991c1d2f65c4dfde5b1c5ccf839f3df1f37","target":"graph","created_at":"2026-05-18T02:25: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":"We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1+epsilon of the optimal solution. Our algorithm allows for a continuous interpolation between the fast RRT algorithm and the asymptotically optimal RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no approximation is allowed), LBT-RRT behaves like RRG. When the approximation factor is unbounded, LBT-RRT behaves like RRT. In between, LBT-RRT is shown","authors_text":"Dan Halperin, Oren Salzman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","title":"Asymptotically near-optimal RRT for fast, high-quality, motion planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0189","kind":"arxiv","version":4},"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:0f3780facd23daf4496fba4f97a07227481e29b41772ab7da25de4c8240f9a4c","target":"record","created_at":"2026-05-18T02:25: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":"5b61237bc709428fd0528d13f27c772e010381173e50ce8bef224af4e2ae5d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","title_canon_sha256":"fd628973dcea85aaefe79de80d0f716e9e4fcc482511be506462012c3e40e7fb"},"schema_version":"1.0","source":{"id":"1308.0189","kind":"arxiv","version":4}},"canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","first_computed_at":"2026-05-18T02:25:40.550563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:40.550563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOmAX3wu/RinXER2yPXddfX+Cbl27dXpWPo6dAJf3sEhapV8vilXfQ3Q5Yb8z3j45hR29S/hEFPGEV08pJXICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:40.551622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0189","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f3780facd23daf4496fba4f97a07227481e29b41772ab7da25de4c8240f9a4c","sha256:74e4c2711b12f3ef66713966d7d35991c1d2f65c4dfde5b1c5ccf839f3df1f37"],"state_sha256":"ccc0d7edb75c9b8a9a6769e6270f54ed23a1345496bdcd6defa0061bccbb32f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJZorvexGsZGfDdGb+XSg1lATfcGhICg+zj8DS0e21AaTC7TDv1ID5fBprVZhz7qCZppMThyGKZvZshk5GiDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:07:36.692285Z","bundle_sha256":"04faf13055443f280307186de9321e3addcd731d4faef5ead77fe9731fc94a39"}}