{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DUDPSQZZHYZBZC5QJYWCXZAWD4","short_pith_number":"pith:DUDPSQZZ","schema_version":"1.0","canonical_sha256":"1d06f943393e321c8bb04e2c2be4161f269e1dd9db53bc48ea6cbce064bf003f","source":{"kind":"arxiv","id":"1608.00261","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.00261","created_at":"2026-05-18T01:03:48.752001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00261v2","created_at":"2026-05-18T01:03:48.752001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00261","created_at":"2026-05-18T01:03:48.752001+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUDPSQZZHYZB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUDPSQZZHYZBZC5Q","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUDPSQZZ","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4","json":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4.json","graph_json":"https://pith.science/api/pith-number/DUDPSQZZHYZBZC5QJYWCXZAWD4/graph.json","events_json":"https://pith.science/api/pith-number/DUDPSQZZHYZBZC5QJYWCXZAWD4/events.json","paper":"https://pith.science/paper/DUDPSQZZ"},"agent_actions":{"view_html":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4","download_json":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4.json","view_paper":"https://pith.science/paper/DUDPSQZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00261&json=true","fetch_graph":"https://pith.science/api/pith-number/DUDPSQZZHYZBZC5QJYWCXZAWD4/graph.json","fetch_events":"https://pith.science/api/pith-number/DUDPSQZZHYZBZC5QJYWCXZAWD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/action/storage_attestation","attest_author":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/action/author_attestation","sign_citation":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/action/citation_signature","submit_replication":"https://pith.science/pith/DUDPSQZZHYZBZC5QJYWCXZAWD4/action/replication_record"}},"created_at":"2026-05-18T01:03:48.752001+00:00","updated_at":"2026-05-18T01:03:48.752001+00:00"}