{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DUDPSQZZHYZBZC5QJYWCXZAWD4","short_pith_number":"pith:DUDPSQZZ","canonical_record":{"source":{"id":"1608.00261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-31T20:39:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f942f04cc9da7b6d4ba76ace87f44e6f8353d427056a8ca266109b62f2f3f274","abstract_canon_sha256":"942a2582657d9f92328189897b7fc4b4a5f12c20549d7c65d9f0bc72f9e14c94"},"schema_version":"1.0"},"canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","source":{"kind":"arxiv","id":"1608.00261","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00261","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00261v2","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00261","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"DUDPSQZZHYZB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUDPSQZZHYZBZC5Q","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUDPSQZZ","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DUDPSQZZHYZBZC5QJYWCXZAWD4","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-31T20:39:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f942f04cc9da7b6d4ba76ace87f44e6f8353d427056a8ca266109b62f2f3f274","abstract_canon_sha256":"942a2582657d9f92328189897b7fc4b4a5f12c20549d7c65d9f0bc72f9e14c94"},"schema_version":"1.0"},"canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:48.752447Z","signature_b64":"vqyBERqsak32cTT7moVPolE/h776j1x0sFJrkElcUK+AU/Nrbt1BErh9X+dAxnCdcjhSQcOd7VIoDK7vDRXAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","last_reissued_at":"2026-05-18T01:03:48.751923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:48.751923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00261","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-18T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwgY/WuGxh/jj7xmqYRDF02gOdk/Atd/vW5noAPl83fIwtO+HcnpbfHWkfN5KhAz/S9uRrzhOWuuJ/8Bffv6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:38:18.126866Z"},"content_sha256":"001939260da192e9c62999499294f704aa645046c6abc6c245986fc0aff99254","schema_version":"1.0","event_id":"sha256:001939260da192e9c62999499294f704aa645046c6abc6c245986fc0aff99254"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DUDPSQZZHYZBZC5QJYWCXZAWD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient sampling-based bottleneck pathfinding over cost maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Kiril Solovey","submitted_at":"2016-07-31T20:39:55Z","abstract_excerpt":"We introduce a simple yet effective sampling-based planner that is tailored for bottleneck pathfinding: Given an implicitly-defined cost map $\\mathcal{M}:\\mathbb{R}^d\\rightarrow \\mathbb{R}$, which assigns to every point in space a real value, we wish to find a path connecting two given points, that minimizes the maximal value with respect to~$\\mathcal{M}$. We demonstrate the capabilities of our algorithm, which we call bottleneck tree (BTT), on several challenging instances of the problem involving multiple agents, where it outperforms the state-of-the-art cost-map planning technique T-RRT*. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00261","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-18T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDMmsyTF2EFJtKcYb2CCTFXD8SdM9DhWJbcXfR/hNbQzY+i+f9WyzJ5QJDevC7i8BL3023P4gPw8YwkkDAYmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:38:18.127233Z"},"content_sha256":"f782d40e7e378f70942434d0bd4e559fe8d364024f0eef9ed5c4fa68e24221d6","schema_version":"1.0","event_id":"sha256:f782d40e7e378f70942434d0bd4e559fe8d364024f0eef9ed5c4fa68e24221d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/bundle.json","state_url":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/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-03T15:38:18Z","links":{"resolver":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4","bundle":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/bundle.json","state":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DUDPSQZZHYZBZC5QJYWCXZAWD4","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":"942a2582657d9f92328189897b7fc4b4a5f12c20549d7c65d9f0bc72f9e14c94","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-31T20:39:55Z","title_canon_sha256":"f942f04cc9da7b6d4ba76ace87f44e6f8353d427056a8ca266109b62f2f3f274"},"schema_version":"1.0","source":{"id":"1608.00261","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00261","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00261v2","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00261","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"DUDPSQZZHYZB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DUDPSQZZHYZBZC5Q","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DUDPSQZZ","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:f782d40e7e378f70942434d0bd4e559fe8d364024f0eef9ed5c4fa68e24221d6","target":"graph","created_at":"2026-05-18T01:03:48Z","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 introduce a simple yet effective sampling-based planner that is tailored for bottleneck pathfinding: Given an implicitly-defined cost map $\\mathcal{M}:\\mathbb{R}^d\\rightarrow \\mathbb{R}$, which assigns to every point in space a real value, we wish to find a path connecting two given points, that minimizes the maximal value with respect to~$\\mathcal{M}$. We demonstrate the capabilities of our algorithm, which we call bottleneck tree (BTT), on several challenging instances of the problem involving multiple agents, where it outperforms the state-of-the-art cost-map planning technique T-RRT*. O","authors_text":"Dan Halperin, Kiril Solovey","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-31T20:39:55Z","title":"Efficient sampling-based bottleneck pathfinding over cost maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00261","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:001939260da192e9c62999499294f704aa645046c6abc6c245986fc0aff99254","target":"record","created_at":"2026-05-18T01:03:48Z","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":"942a2582657d9f92328189897b7fc4b4a5f12c20549d7c65d9f0bc72f9e14c94","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-07-31T20:39:55Z","title_canon_sha256":"f942f04cc9da7b6d4ba76ace87f44e6f8353d427056a8ca266109b62f2f3f274"},"schema_version":"1.0","source":{"id":"1608.00261","kind":"arxiv","version":2}},"canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","first_computed_at":"2026-05-18T01:03:48.751923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:48.751923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqyBERqsak32cTT7moVPolE/h776j1x0sFJrkElcUK+AU/Nrbt1BErh9X+dAxnCdcjhSQcOd7VIoDK7vDRXAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:48.752447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00261","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:001939260da192e9c62999499294f704aa645046c6abc6c245986fc0aff99254","sha256:f782d40e7e378f70942434d0bd4e559fe8d364024f0eef9ed5c4fa68e24221d6"],"state_sha256":"d56cc987eac75530974eed994ca3eba96a6d38e263ddb1ee61596c9dc02220bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euo8uvwNbTiTcD50ZDIfhCLjR1vznvR9G/MGOGW4KmpLmNvLyeNP0Ow8jbm/AN595nh7cHA46Qj5CTHtIEnMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:38:18.130444Z","bundle_sha256":"9145acfece8f4eb5380952d69fa781db72c8a5111a624b690ef56dbb436c1428"}}