{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WBBBTCWXGR4WT52G7YJAOTADTA","short_pith_number":"pith:WBBBTCWX","schema_version":"1.0","canonical_sha256":"b042198ad7347969f746fe12074c03980ff46a49f2a1a6312e6668f9d921eeef","source":{"kind":"arxiv","id":"2305.13969","version":3},"attestation_state":"computed","paper":{"title":"CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Matej Novosad, Robert Penicka, Vojtech Vonasek","submitted_at":"2023-05-23T11:53:04Z","abstract_excerpt":"In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different side, is useful in many applications. Among others, using multiple distinct paths is necessary for optimization-based trajectory planners where found trajectories are restricted to only a single homotopy class of a given path. Distinct paths can also be used to guide sampling-based motion planning and thus increase the effectiveness of planning in environmen"},"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":"2305.13969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-05-23T11:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"bd5e25d82883723471dd5cf757c90cda72131ee96d84ffd9b4084774b8210415","abstract_canon_sha256":"ab8adbcb00e72498b0843a782e3c61aade94395d09f106d4cc9f7bed80ee9452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:03.733747Z","signature_b64":"mVhUBK+l23+4DmdAYLPoWHLIn4gEmUAEPDJ8aE8arTitKoLMwqV/cxeEg7r8Q7BBFaifDNQeRjoojlMN56uOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b042198ad7347969f746fe12074c03980ff46a49f2a1a6312e6668f9d921eeef","last_reissued_at":"2026-07-05T06:55:03.733200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:03.733200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Matej Novosad, Robert Penicka, Vojtech Vonasek","submitted_at":"2023-05-23T11:53:04Z","abstract_excerpt":"In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different side, is useful in many applications. Among others, using multiple distinct paths is necessary for optimization-based trajectory planners where found trajectories are restricted to only a single homotopy class of a given path. Distinct paths can also be used to guide sampling-based motion planning and thus increase the effectiveness of planning in environmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13969","kind":"arxiv","version":3},"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/2305.13969/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":"2305.13969","created_at":"2026-07-05T06:55:03.733273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.13969v3","created_at":"2026-07-05T06:55:03.733273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13969","created_at":"2026-07-05T06:55:03.733273+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBBBTCWXGR4W","created_at":"2026-07-05T06:55:03.733273+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBBBTCWXGR4WT52G","created_at":"2026-07-05T06:55:03.733273+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBBBTCWX","created_at":"2026-07-05T06:55:03.733273+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/WBBBTCWXGR4WT52G7YJAOTADTA","json":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA.json","graph_json":"https://pith.science/api/pith-number/WBBBTCWXGR4WT52G7YJAOTADTA/graph.json","events_json":"https://pith.science/api/pith-number/WBBBTCWXGR4WT52G7YJAOTADTA/events.json","paper":"https://pith.science/paper/WBBBTCWX"},"agent_actions":{"view_html":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA","download_json":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA.json","view_paper":"https://pith.science/paper/WBBBTCWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.13969&json=true","fetch_graph":"https://pith.science/api/pith-number/WBBBTCWXGR4WT52G7YJAOTADTA/graph.json","fetch_events":"https://pith.science/api/pith-number/WBBBTCWXGR4WT52G7YJAOTADTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA/action/storage_attestation","attest_author":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA/action/author_attestation","sign_citation":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA/action/citation_signature","submit_replication":"https://pith.science/pith/WBBBTCWXGR4WT52G7YJAOTADTA/action/replication_record"}},"created_at":"2026-07-05T06:55:03.733273+00:00","updated_at":"2026-07-05T06:55:03.733273+00:00"}