{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ARZHHJ6NA73WJCLLX4KWVN2TBV","short_pith_number":"pith:ARZHHJ6N","schema_version":"1.0","canonical_sha256":"047273a7cd07f764896bbf156ab7530d7fc8a9a03d1e4048168e8bd867894c80","source":{"kind":"arxiv","id":"1611.00111","version":2},"attestation_state":"computed","paper":{"title":"Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Oren Salzman, Sanjiban Choudhury, Shushman Choudhury, Siddhartha S. Srinivasa","submitted_at":"2016-11-01T02:43:59Z","abstract_excerpt":"We consider the problem of computing shortest paths in a dense motion-planning roadmap $\\mathcal{G}$. We assume that~$n$, the number of vertices of $\\mathcal{G}$, is very large. Thus, using any path-planning algorithm that directly searches $\\mathcal{G}$, running in $O(V\\textrm{log}V + E) \\approx O(n^2)$ time, becomes unacceptably expensive. We are therefore interested in anytime search to obtain successively shorter feasible paths and converge to the shortest path in $\\mathcal{G}$. Our key insight is to provide existing path-planning algorithms with a sequence of increasingly dense subgraphs "},"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":"1611.00111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-01T02:43:59Z","cross_cats_sorted":[],"title_canon_sha256":"6946119807af2110512ebf6b18e74f2e983f1e5ef8ea36de41eb98bac13acefa","abstract_canon_sha256":"c417b68a424ce5f9b1920450da7dc735bd1425fa8620628185b73f28c8044635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:31.891163Z","signature_b64":"TiEpvNDykb0XOBbffaZQuSl30Le1DuGSP2gHSNzOMUtu2Z1ZMTFe6SPk082fDsx2SV8ZfXW0plDA3dfI9VK6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047273a7cd07f764896bbf156ab7530d7fc8a9a03d1e4048168e8bd867894c80","last_reissued_at":"2026-05-18T00:49:31.890602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:31.890602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Oren Salzman, Sanjiban Choudhury, Shushman Choudhury, Siddhartha S. Srinivasa","submitted_at":"2016-11-01T02:43:59Z","abstract_excerpt":"We consider the problem of computing shortest paths in a dense motion-planning roadmap $\\mathcal{G}$. We assume that~$n$, the number of vertices of $\\mathcal{G}$, is very large. Thus, using any path-planning algorithm that directly searches $\\mathcal{G}$, running in $O(V\\textrm{log}V + E) \\approx O(n^2)$ time, becomes unacceptably expensive. We are therefore interested in anytime search to obtain successively shorter feasible paths and converge to the shortest path in $\\mathcal{G}$. Our key insight is to provide existing path-planning algorithms with a sequence of increasingly dense subgraphs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00111","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":"1611.00111","created_at":"2026-05-18T00:49:31.890700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00111v2","created_at":"2026-05-18T00:49:31.890700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00111","created_at":"2026-05-18T00:49:31.890700+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARZHHJ6NA73W","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARZHHJ6NA73WJCLL","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARZHHJ6N","created_at":"2026-05-18T12:30:07.202191+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/ARZHHJ6NA73WJCLLX4KWVN2TBV","json":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV.json","graph_json":"https://pith.science/api/pith-number/ARZHHJ6NA73WJCLLX4KWVN2TBV/graph.json","events_json":"https://pith.science/api/pith-number/ARZHHJ6NA73WJCLLX4KWVN2TBV/events.json","paper":"https://pith.science/paper/ARZHHJ6N"},"agent_actions":{"view_html":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV","download_json":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV.json","view_paper":"https://pith.science/paper/ARZHHJ6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00111&json=true","fetch_graph":"https://pith.science/api/pith-number/ARZHHJ6NA73WJCLLX4KWVN2TBV/graph.json","fetch_events":"https://pith.science/api/pith-number/ARZHHJ6NA73WJCLLX4KWVN2TBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV/action/storage_attestation","attest_author":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV/action/author_attestation","sign_citation":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV/action/citation_signature","submit_replication":"https://pith.science/pith/ARZHHJ6NA73WJCLLX4KWVN2TBV/action/replication_record"}},"created_at":"2026-05-18T00:49:31.890700+00:00","updated_at":"2026-05-18T00:49:31.890700+00:00"}