{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AXWROAY3KL3NBXVT5VLMKBHUW5","short_pith_number":"pith:AXWROAY3","schema_version":"1.0","canonical_sha256":"05ed17031b52f6d0deb3ed56c504f4b74af99c2850414442538b27b9ce30af82","source":{"kind":"arxiv","id":"2104.05037","version":1},"attestation_state":"computed","paper":{"title":"Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aditya Mandalika, Brian Hou, Rosario Scalise, Sanjiban Choudhury, Siddhartha S. Srinivasa","submitted_at":"2021-04-11T15:46:56Z","abstract_excerpt":"Sampling-based motion planners rely on incremental densification to discover progressively shorter paths. After computing feasible path $\\xi$ between start $x_s$ and goal $x_t$, the Informed Set (IS) prunes the configuration space $\\mathcal{C}$ by conservatively eliminating points that cannot yield shorter paths. Densification via sampling from this Informed Set retains asymptotic optimality of sampling from the entire configuration space. For path length $c(\\xi)$ and Euclidean heuristic $h$, $IS = \\{ x | x \\in \\mathcal{C}, h(x_s, x) + h(x, x_t) \\leq c(\\xi) \\}$.\n  Relying on the heuristic can "},"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":"2104.05037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-04-11T15:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f0b0294ad96b19c0a94de95c14edccc9ec05a6e38e8e174cdf42c4aec2d19","abstract_canon_sha256":"8d08730d2a6fafb19ae7588f6d408bec33cca683cdb885686fe0a0a00cdb4a65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:07.603557Z","signature_b64":"2prYJKilNap+ErOwv/Dlegrlol/o3F0Ab9iqjvSFS7w4OCb7J9kZAVfdMwJcetQkL6KoPrURbwcvTZ7bvV5sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05ed17031b52f6d0deb3ed56c504f4b74af99c2850414442538b27b9ce30af82","last_reissued_at":"2026-07-05T02:31:07.603101Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:07.603101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aditya Mandalika, Brian Hou, Rosario Scalise, Sanjiban Choudhury, Siddhartha S. Srinivasa","submitted_at":"2021-04-11T15:46:56Z","abstract_excerpt":"Sampling-based motion planners rely on incremental densification to discover progressively shorter paths. After computing feasible path $\\xi$ between start $x_s$ and goal $x_t$, the Informed Set (IS) prunes the configuration space $\\mathcal{C}$ by conservatively eliminating points that cannot yield shorter paths. Densification via sampling from this Informed Set retains asymptotic optimality of sampling from the entire configuration space. For path length $c(\\xi)$ and Euclidean heuristic $h$, $IS = \\{ x | x \\in \\mathcal{C}, h(x_s, x) + h(x, x_t) \\leq c(\\xi) \\}$.\n  Relying on the heuristic can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05037","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.05037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.05037","created_at":"2026-07-05T02:31:07.603162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.05037v1","created_at":"2026-07-05T02:31:07.603162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05037","created_at":"2026-07-05T02:31:07.603162+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXWROAY3KL3N","created_at":"2026-07-05T02:31:07.603162+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXWROAY3KL3NBXVT","created_at":"2026-07-05T02:31:07.603162+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXWROAY3","created_at":"2026-07-05T02:31:07.603162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09340","citing_title":"Unified Linear Parametric Map Modeling and Perception-aware Trajectory Planning for Mobile Robotics","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5","json":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5.json","graph_json":"https://pith.science/api/pith-number/AXWROAY3KL3NBXVT5VLMKBHUW5/graph.json","events_json":"https://pith.science/api/pith-number/AXWROAY3KL3NBXVT5VLMKBHUW5/events.json","paper":"https://pith.science/paper/AXWROAY3"},"agent_actions":{"view_html":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5","download_json":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5.json","view_paper":"https://pith.science/paper/AXWROAY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.05037&json=true","fetch_graph":"https://pith.science/api/pith-number/AXWROAY3KL3NBXVT5VLMKBHUW5/graph.json","fetch_events":"https://pith.science/api/pith-number/AXWROAY3KL3NBXVT5VLMKBHUW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5/action/storage_attestation","attest_author":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5/action/author_attestation","sign_citation":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5/action/citation_signature","submit_replication":"https://pith.science/pith/AXWROAY3KL3NBXVT5VLMKBHUW5/action/replication_record"}},"created_at":"2026-07-05T02:31:07.603162+00:00","updated_at":"2026-07-05T02:31:07.603162+00:00"}